Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking.
Roberto GiacobazziElisa QuintarelliPublished in: SAS (2001)
Keyphrases
- model checking
- temporal logic
- formal verification
- model checker
- formal specification
- symbolic model checking
- abstract interpretation
- finite state machines
- finite state
- automated verification
- reachability analysis
- timed automata
- temporal properties
- verification method
- transition systems
- bounded model checking
- computation tree logic
- partial order reduction
- pspace complete
- epistemic logic
- process algebra
- linear temporal logic
- formal methods
- deterministic finite automaton
- satisfiability problem
- incomplete information
- artificial intelligence
- asynchronous circuits
- planning domains