Benefits of Bounded Model Checking at an Industrial Setting
- 4 July 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 436-453
- https://doi.org/10.1007/3-540-44585-4_43
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Symbolic Reachability Analysis Based on SAT-SolversLecture Notes in Computer Science, 2000
- A Tutorial on Stålmarck’s Proof Procedure for Propositional LogicLecture Notes in Computer Science, 1998
- RuleBase: Model checking at IBMLecture Notes in Computer Science, 1997
- RuleBasePublished by Association for Computing Machinery (ACM) ,1996
- HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 1993
- Symbolic Model CheckingPublished by Springer Nature ,1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- A Structure-preserving Clause Form TranslationJournal of Symbolic Computation, 1986