Trading-Off SAT Search and Variable Quantifications for Effective Unbounded Model Checking.
Gianpiero CabodiPaolo CamuratiLuz GarciaMarco MurcianoSergio NoccoStefano QuerPublished in: FMCAD (2008)
Keyphrases
- model checking
- temporal logic
- search algorithm
- formal verification
- model checker
- formal specification
- search strategies
- finite state
- symbolic model checking
- automated verification
- temporal properties
- search space
- verification method
- partial order reduction
- reachability analysis
- epistemic logic
- satisfiability problem
- process algebra
- timed automata
- reactive systems
- transition systems
- search strategy
- computation tree logic
- linear temporal logic
- bounded model checking