Symbolic model checking: 1020 States and beyond
Top Cited Papers
- 29 November 2004
- journal article
- Published by Elsevier
- Vol. 98 (2) , 142-170
- https://doi.org/10.1016/0890-5401(92)90017-a
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplicationIEEE Transactions on Computers, 1991
- Automatic Verification of Sequential Circuits Using Temporal LogicIEEE Transactions on Computers, 1986
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Results on the propositional μ-calculusTheoretical Computer Science, 1983