A SAT-based procedure for verifying finite state machines in ACL2.
Warren A. Hunt Jr.Erik ReeberPublished in: ACL2 (2006)
Keyphrases
- finite state machines
- model checking
- bounded model checking
- temporal logic
- finite state automata
- formal verification
- answer set programming
- hidden markov models
- digital circuits
- planning domains
- natural language learning
- regular expressions
- logic programs
- database
- mutation testing
- sat encodings
- linear temporal logic
- ai planning
- planning problems
- matching algorithm
- database applications
- database systems