Lazy abstraction and SAT-based reachability in hardware model checking.
Yakir VizelOrna GrumbergSharon ShohamPublished in: FMCAD (2012)
Keyphrases
- bounded model checking
- model checking
- temporal logic
- formal verification
- computation tree logic
- linear temporal logic
- automated verification
- temporal properties
- finite state
- model checker
- formal specification
- transition systems
- symbolic model checking
- reactive systems
- epistemic logic
- concurrent systems
- formal methods
- verification method
- timed automata
- finite state machines
- reachability analysis
- process algebra
- np hard
- satisfiability problem
- decision problems
- orders of magnitude
- software engineering