Verification of Tree-Processing Programs via Higher-Order Model Checking.
Hiroshi UnnoNaoshi TabuchiNaoki KobayashiPublished in: APLAS (2010)
Keyphrases
- model checking
- higher order
- temporal logic
- formal verification
- automated verification
- model checker
- finite state machines
- verification method
- finite state
- temporal properties
- formal specification
- bounded model checking
- timed automata
- process algebra
- pspace complete
- formal methods
- computation tree logic
- concurrent systems
- transition systems
- symbolic model checking
- partial order reduction
- abstract interpretation
- reactive systems
- reachability analysis
- epistemic logic
- deterministic finite automaton
- tree automata
- fixpoint
- modal logic
- distributed systems