1992 · 353 citations · 14 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureFormal MethodsTheory Of ComputationDeductive VerificationExecutable System ModelsFinite State Machine ModelingModel CheckingTemporal LogicVerificationAbstract Model CheckingAbstract Model ConstructionHardware Model CheckingModel-based VerificationTemporal Logic Verification
We describe a method for using abstraction to reduce the complexity of temporal logic model checking. The basis of this method is a way of constructing an abstract model of a program without ever examining the corresponding unabstracted model. We show how this abstract model can be used to verify properties of the original program. We have implemented a system based on these techniques, and we demonstrate their practicality using a number of examples, including a pipelined ALU circuit with over 101300 states.
14
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
The complexity of propositional linear temporal logics
A. Prasad Sistla, E. M. Clarke · Journal of the ACM · 1985 · 1.1K citations · Full text
E. M. Clarke, David E. Long, Kenneth L. McMillan · 2003 · 471 citations