Experimental Analysis of Different Techniques for Bounded Model Checking
Authors:
- 28 February 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 34-48
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Efficient Computation of Recurrence Diameters2002
- 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 VLIW2001
- SAT-Based Verification without State Space Traversal2000
- Tuning SAT Checkers for Bounded Model CheckingLecture Notes in Computer Science, 2000
- Symbolic Model Checking without BDDs1999
- Equivalence checking using cuts and heaps1997
- The industrial success of verification tools based on stålmarck's method1997
- SATO: An efficient propositional prover1997
- Software for Analytical Development of Communications ProtocolsAT&T Technical Journal, 1990