Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths.
Matthias SchmalzHagen VölzerDaniele VaraccaPublished in: FSTTCS (2007)
Keyphrases
- model checking
- verification method
- temporal logic
- deterministic finite automaton
- formal verification
- formal specification
- bounded model checking
- symbolic model checking
- model checker
- temporal properties
- computation tree logic
- automated verification
- reachability analysis
- epistemic logic
- formal methods
- finite state
- finite state machines
- pspace complete
- modal logic
- knowledge based systems
- software engineering