Experimental Analysis of Different Techniques for Bounded Model Checking
- 28 February 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Efficient Computation of Recurrence DiametersPublished by Springer Nature ,2002
- Can BDDs compete with SAT solvers on bounded model checking?Proceedings of the 39th conference on Design automation - DAC '02, 2002
- Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIWPublished by Association for Computing Machinery (ACM) ,2001
- SAT-Based Verification without State Space TraversalPublished by Springer Nature ,2000
- Tuning SAT Checkers for Bounded Model CheckingPublished by Springer Nature ,2000
- Symbolic Model Checking without BDDsPublished by Springer Nature ,1999
- Equivalence checking using cuts and heapsPublished by Association for Computing Machinery (ACM) ,1997
- The industrial success of verification tools based on stålmarck's methodPublished by Springer Nature ,1997
- SATO: An efficient propositional proverLecture Notes in Computer Science, 1997
- Software for Analytical Development of Communications ProtocolsAT&T Technical Journal, 1990