Applying SAT Methods in Unbounded Symbolic Model Checking
Top Cited Papers
- 20 September 2002
- book chapter
- Published by Springer Nature
- p. 250-264
- https://doi.org/10.1007/3-540-45657-0_19
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- GRASP-A new search algorithm for satisfiabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Symbolic model checking: 10/sup 20/ states and beyondPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- ChaffPublished by Association for Computing Machinery (ACM) ,2001
- Checking Safety Properties Using Induction and a SAT-SolverPublished by Springer Nature ,2000
- SAT-Based Image Computation with Application in Reachability AnalysisPublished by Springer Nature ,2000
- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model CheckingPublished by Springer Nature ,2000
- Symbolic Model Checking without BDDsPublished by Defense Technical Information Center (DTIC) ,1999
- Equivalence checking using cuts and heapsPublished by Association for Computing Machinery (ACM) ,1997
- Symbolic Model CheckingPublished by Springer Nature ,1993
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986