A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes.
Naoki KobayashiC.-H. Luke OngPublished in: LICS (2009)
Keyphrases
- model checking
- transition systems
- higher order
- temporal logic
- process algebra
- timed automata
- formal verification
- finite state
- concurrent systems
- model checker
- formal specification
- temporal properties
- modal logic
- partial order reduction
- automated verification
- symbolic model checking
- epistemic logic
- verification method
- pspace complete
- formal methods
- reachability analysis
- linear time temporal logic
- bounded model checking
- computation tree logic
- control flow
- reactive systems
- linear temporal logic
- planning domains
- cl pc
- finite state machines
- distributed systems