Bounded model checking of software using SMT solvers instead of SAT solvers.
Alessandro ArmandoJacopo MantovaniLorenzo PlataniaPublished in: Int. J. Softw. Tools Technol. Transf. (2009)
Keyphrases
- sat solvers
- bounded model checking
- sat solving
- constraint satisfaction
- sat instances
- orders of magnitude
- search space
- max sat
- formal verification
- sat problem
- boolean satisfiability
- search strategies
- search tree
- model checking
- propositional satisfiability
- clause learning
- linear temporal logic
- clause learning sat solvers
- temporal logic
- answer sets
- sat encodings
- multi agent systems
- symmetry breaking