SAT-Based Model Checking without Unrolling
Top Cited Papers
- 1 January 2011
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Checking Safety by Inductive Generalization of Counterexamples to InductionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Applying Logic Synthesis for Speeding Up SATPublished by Springer Nature ,2007
- Effective Preprocessing in SAT Through Variable and Clause EliminationPublished by Springer Nature ,2005
- Symbolic model checking: 1020 States and beyondPublished by Elsevier ,2004
- An Extensible SAT-solverPublished by Springer Nature ,2004
- Counterexample-guided abstraction refinement for symbolic model checkingJournal of the ACM, 2003
- Temporal Induction by Incremental SAT SolvingElectronic Notes in Theoretical Computer Science, 2003
- Symbolic Model Checking without BDDsPublished by Springer Nature ,1999
- Construction of abstract state graphs with PVSPublished by Springer Nature ,1997
- An axiomatic basis for computer programmingCommunications of the ACM, 1969