What if model checking must be truly symbolic.
Hardi HungarOrna GrumbergWerner DammPublished in: CHARME (1995)
Keyphrases
- model checking
- temporal logic
- formal verification
- binary decision diagrams
- finite state
- temporal properties
- formal specification
- finite state machines
- model checker
- symbolic model checking
- partial order reduction
- computation tree logic
- automated verification
- reachability analysis
- symbolic representation
- pspace complete
- bounded model checking
- transition systems
- formal methods
- epistemic logic
- timed automata
- process algebra
- concurrent systems
- verification method
- ctl model update
- modal logic
- asynchronous circuits
- alternating time temporal logic