Temporal Induction by Incremental SAT Solving
Top Cited Papers
Open Access
- 1 January 2003
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 89 (4) , 543-560
- https://doi.org/10.1016/s1571-0661(05)82542-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Property Checking via Structural AnalysisPublished by Springer Nature ,2002
- Pruning Techniques for the SAT-Based Bounded Model Checking ProblemPublished by Springer Nature ,2001
- Benefits of Bounded Model Checking at an Industrial SettingPublished by Springer Nature ,2001
- SATIREPublished by Association for Computing Machinery (ACM) ,2001
- ChaffPublished by Association for Computing Machinery (ACM) ,2001
- Checking Safety Properties Using Induction and a SAT-SolverPublished by Springer Nature ,2000
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- Solving the incremental satisfiability problemThe Journal of Logic Programming, 1993
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- A machine program for theorem-provingCommunications of the ACM, 1962