Completeness and Consistency in Hierarchical State-Based Requirements
IEEE Transactions on Software Engineering - Special issue: best papers of the 17th International Conference on Software Engineering (ICSE-17)
Sizing and verification of communication buffers for communicating processes
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
Finding deadlocks in large concurrent java programs using genetic algorithms
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Multi-domain surety modeling and analysis for high assurance systems
ECBS'99 Proceedings of the 1999 IEEE conference on Engineering of computer-based systems
| Hi-index | 0.01 |
The temporal logic model checking algorithm of Clarke, Emerson, and Sistla is modified to represent state graphs using binary decision diagrams (BDDs) and partitioned transition relations. Because this representation captures some of the regularity in the state space of circuits with data path logic, we are able to verify circuits with an extremely large number of states. We demonstrate this new technique on a synchronous pipelined design with approximately 5 x 10^120 states. Our model checking algorithm handles full CTL with fairness constraints. Consequently, we are able to express a number of important liveness and fairness properties, which would otherwise not be expressible in CTL. We give empirical results on the performance of the algorithm applied to both synchronous and asynchronous circuits with data path logic.