Compositional Verification by Model Checking for Counter-Examples.
Tevfik BultanJeffrey FischerRichard GerberPublished in: ISSTA (1996)
Keyphrases
- np complete
- model checking
- counter examples
- bounded model checking
- formal verification
- temporal logic
- automated verification
- model checker
- computation tree logic
- verification method
- pspace complete
- formal specification
- temporal properties
- satisfiability problem
- finite state
- transition systems
- partial order reduction
- timed automata
- symbolic model checking
- reachability analysis
- linear temporal logic
- formal methods
- asynchronous circuits
- artifact centric
- concurrent systems
- process algebra
- automated reasoning
- artificial intelligence
- deterministic finite automaton
- specification language
- planning domains
- reactive systems