Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking.
Kazuhide YasukataNaoki KobayashiKazutaka MatsudaPublished in: CONCUR (2014)
Keyphrases
- higher order
- reachability analysis
- model checking
- pairwise
- process algebra
- concurrent programs
- temporal logic
- timed automata
- markov decision processes
- formal verification
- model checker
- formal specification
- finite state
- concurrent systems
- formal methods
- asynchronous circuits
- incremental algorithms
- state space
- epistemic logic
- verification method
- computation tree logic
- web applications
- general purpose
- bounded model checking
- real time
- alternating time temporal logic
- modal logic
- reinforcement learning