Domains for Higher-Order Games
From MaRDI portal
Publication:5111275
DOI10.4230/LIPIcs.MFCS.2017.59zbMath1441.68125arXiv1705.00355OpenAlexW2963788871MaRDI QIDQ5111275
Roland Meyer, Sebastian Muskalla, Matthew Hague
Publication date: 26 May 2020
Full work available at URL: https://arxiv.org/abs/1705.00355
Applications of game theory (91A80) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strictness analysis for higher-order functions
- The IO- and OI-hierarchies
- Borel determinacy
- Pushdown processes: Games and model-checking
- Safety of abstract interpretations for free, via logical relations and Galois connections
- Proof Spaces for Unbounded Parallelism
- Using models to model-check recursive schemes
- Finitary Semantics of Linear Logic and Higher-Order Model-Checking
- An Infinitary Model of Linear Logic
- Typing Weak MSOL Properties
- Saturation-Based Model Checking of Higher-Order Recursion Schemes.
- Advanced Ramsey-Based Büchi Automata Inclusion Testing
- A Saturation Method for Collapsible Pushdown Systems
- Winning Regions of Pushdown Parity Games: A Saturation Method
- Abstract Interpretation, Logical Relations, and Kan Extensions
- Efficient Büchi Universality Checking
- Recognizability in the Simply Typed Lambda-Calculus
- An automata-theoretical characterization of the OI-hierarchy
- Abstract interpretation from Büchi automata
- Proving Liveness of Parameterized Programs
- Summaries for Context-Free Games
- Domains for Higher-Order Games
- Nested interpolants
- Types and higher-order recursion schemes for verification of higher-order programs
- A model for behavioural properties of higher-order programs
- Relational semantics of linear logic and higher-order model-checking
- Collapsible Pushdown Automata and Recursion Schemes
- Proofs that count
- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Automata, Languages and Programming
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
- Reachability analysis of pushdown automata: Application to model-checking
