SAT-Based Verification without State Space Traversal
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 409-426
- https://doi.org/10.1007/3-540-40922-x_23
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Sequential equivalence checking without state space traversalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Symbolic Reachability Analysis Based on SAT-SolversPublished 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
- Approximate Symbolic Model Checking Using Overlapping ProjectionsPublished by Defense Technical Information Center (DTIC) ,1999
- Verification of Real-Time Systems using Linear Relation AnalysisFormal Methods in System Design, 1997
- STeP: The Stanford Temporal Prover,Published by Defense Technical Information Center (DTIC) ,1994
- The synchronous data flow programming language LUSTREProceedings of the IEEE, 1991
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977