Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Requirements Specification for Process-Control Systems
IEEE Transactions on Software Engineering
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Symbolic Model Checking
Model Checking Large Software Specifications
IEEE Transactions on Software Engineering
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Flattening statecharts without explosions
Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
On Succinctness of Hierarchical State Diagrams in Absence of Message Passing
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewrite rules and operational semantics for model checking UML statecharts
UML'00 Proceedings of the 3rd international conference on The unified modeling language: advancing the standard
| Hi-index | 4.10 |
Advances in processor speed, memory capacities, sensors, and peripherals have enabled the inexpensive fabrication of sophisticated products. They range from simple controllers in applications such as mobile phones and hi-fi equipment to highly complex software in cars and airplanes. Unfortunately, the lack of good design methods and tools is a major bottleneck in the development of these products, particularly those with a short life cycle such as consumer electronics and household appliances.Developing embedded software for large, complicated applications requires models that are both intellectually manageable and physically realizable. Choosing a modeling technique is a compromise between conflicting goals. Models must not only be easy to comprehend and construct, but they also must be practicable and provide platforms for analysis.Using a new verification algorithm called the compositional backward technique, the authors demonstrate that they can exhaustively verify even the largest industrial applications-- comprising more than 1,000 components--in a few minutes on a standard PC.