Bounded Model Checking of Software Using SMT Solvers Instead of SAT Solvers.
Alessandro ArmandoJacopo MantovaniLorenzo PlataniaPublished in: SPIN (2006)
Keyphrases
- sat solvers
- bounded model checking
- sat solving
- orders of magnitude
- formal verification
- search space
- sat instances
- search tree
- propositional satisfiability
- sat problem
- constraint satisfaction
- search strategies
- clause learning
- max sat
- model checking
- temporal logic
- boolean satisfiability
- answer sets
- clause learning sat solvers
- sat encodings
- linear temporal logic
- genetic algorithm
- multi agent systems
- optimal solution
- information retrieval