On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
From MaRDI portal
Publication:3617724
DOI10.1007/978-3-642-00596-1_9zbMath1234.68252MaRDI QIDQ3617724
Luke Ong, Christopher H. Broadbent
Publication date: 31 March 2009
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_9
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Note on winning positions on pushdown games with \(\omega\)-regular conditions
- The IO- and OI-hierarchies
- On full abstraction for PCF: I, II and III
- Positional Strategies for Higher-Order Pushdown Parity Games
- Bisimulation, modal logic and model checking games
- Computer Aided Verification
- Collapsible Pushdown Automata and Recursion Schemes
- Mathematical Foundations of Computer Science 2005