Streett Automata Model Checking of Higher-Order Recursion Schemes.
Ryota SuzukiKoichi FujimaNaoki KobayashiTakeshi TsukadaPublished in: FSCD (2017)
Keyphrases
- model checking
- higher order
- finite state
- timed automata
- finite state machines
- temporal logic
- formal verification
- temporal properties
- partial order reduction
- automated verification
- reachability analysis
- formal specification
- computation tree logic
- epistemic logic
- verification method
- model checker
- bounded model checking
- symbolic model checking
- process algebra
- pspace complete
- transition systems
- asynchronous circuits
- concurrent systems
- formal methods
- tree automata
- linear temporal logic
- finite automata
- reactive systems
- abstract interpretation
- deterministic finite automaton
- modal logic