Symbolic Model Checking without BDDs
- 12 March 1999
- book chapter
- Published by Springer Nature
- p. 193-207
- https://doi.org/10.1007/3-540-49059-0_14
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Symbolic model checking: 1020 States and beyondPublished by Elsevier ,2004
- Building decision procedures for modal logics from propositional decision procedures — The case study of modal KPublished by Springer Nature ,1996
- Model checking and abstractionACM Transactions on Programming Languages and Systems, 1994
- Another look at LTL model checkingPublished by Springer Nature ,1994
- Symbolic Model CheckingPublished by Springer Nature ,1993
- Modalities for model checking: branching time logic strikes backScience of Computer Programming, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Checking that finite state concurrent programs satisfy their linear specificationPublished by Association for Computing Machinery (ACM) ,1985
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960