The Complexity of Model Checking for Boolean Formulas.
Henning SchnoorPublished in: Int. J. Found. Comput. Sci. (2010)
Keyphrases
- model checking
- pspace complete
- boolean formula
- temporal logic
- binary decision diagrams
- np complete
- formal verification
- model checker
- computation tree logic
- formal methods
- verification method
- decision problems
- membership queries
- orders of magnitude
- np hard
- alternating time temporal logic
- efficient learning
- linear constraints