A cartesian-closed category for higher-order model checking.
Martin HofmannJérémy LedentPublished in: LICS (2017)
Keyphrases
- model checking
- higher order
- temporal logic
- model checker
- symbolic model checking
- finite state
- formal verification
- partial order reduction
- temporal properties
- formal specification
- bounded model checking
- automated verification
- finite state machines
- timed automata
- computation tree logic
- pspace complete
- verification method
- reachability analysis
- formal methods
- process algebra
- transition systems
- description language
- reactive systems
- epistemic logic
- linear temporal logic
- coalition logic
- knowledge base