Leafy automata for higher-order concurrency
From MaRDI portal
Publication:2233404
DOI10.1007/978-3-030-71995-1_10OpenAlexW3142760835MaRDI QIDQ2233404
Ranko Lazić, Igor Walukiewicz, Alex Dixon, Andrzej S. Murawski
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2101.08720
game semanticshigher-order concurrencyautomata over infinite alphabetsfinitary idealized concurrent algol
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Syntactic control of concurrency
- On notions of regularity for data languages
- Automata for XML -- a survey
- Game-theoretic analysis of call-by-value computation
- Leafy automata for higher-order concurrency
- Third-order Idealized Algol with iteration is decidable
- Angelic semantics of fine-grained concurrency
- Games for complexity of second-order call-by-name programs
- Weak and Nested Class Memory Automata
- Two-variable logic on data words
- Fragments of ML Decidable by Nested Data Class Memory Automata
- Saturation of Concurrent Collapsible Pushdown Systems
- Ordered Navigation on Multi-attributed Data Words
- Verifying Communicating Multi-pushdown Systems via Split-Width
- Game Semantic Analysis of Equivalence in IMJ
- Shuffle Expressions and Words with Nested Data
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
- The reachability problem for Petri nets is not elementary
- Abstract Machines for Game Semantics, Revisited
- Tools and Algorithms for the Construction and Analysis of Systems
- Model-Checking Higher-Order Programs with Recursive Types
- On-the-Fly Techniques for Game-Based Software Model Checking
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Leafy automata for higher-order concurrency
