Automated Verification of Completeness and Consistency of Abstract State Machine Specifications using a SAT Solver.
Martin OuimetKristina LundqvistPublished in: Electron. Notes Theor. Comput. Sci. (2007)
Keyphrases
- sat encodings
- state machine
- automated verification
- state machines
- sat solvers
- model checking
- finite state machines
- automated reasoning
- formal verification
- sat solving
- fault tolerant
- orders of magnitude
- constraint satisfaction
- temporal logic
- sat instances
- search space
- sat problem
- search strategies
- boolean satisfiability
- max sat
- constraint solver
- reactive systems
- evolutionary algorithm
- boolean formula
- heuristic search
- graph theory
- knowledge representation