Leafy automata for higher-order concurrency
From MaRDI portal
Publication:2233404
DOI10.1007/978-3-030-71995-1_10OpenAlexW3142760835MaRDI QIDQ2233404FDOQ2233404
Authors: Alex Dixon, Ranko Lazić, Andrzej S. Murawski, Igor Walukiewicz 
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
Cites Work
- Title not available (Why is that?)
- Automata for XML -- a survey
- Two-variable logic on data words
- Ordered navigation on multi-attributed data words
- Title not available (Why is that?)
- On notions of regularity for data languages
- Game-theoretic analysis of call-by-value computation
- Tools and Algorithms for the Construction and Analysis of Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Syntactic control of concurrency
- Shuffle Expressions and Words with Nested Data
- The reachability problem for Petri nets is not elementary
- Verifying communicating multi-pushdown systems via split-width
- Leafy automata for higher-order concurrency
- Fragments of ML decidable by nested data class memory automata
- Game semantic analysis of equivalence in IMJ
- Title not available (Why is that?)
- Abstract machines for game semantics, revisited
- Games for complexity of second-order call-by-name programs
- Saturation of Concurrent Collapsible Pushdown Systems
- Third-order Idealized Algol with iteration is decidable
- Angelic semantics of fine-grained concurrency
- Weak and nested class memory automata
- The geometry of concurrent interaction: handling multiple ports by way of multiple tokens
- Model-checking higher-order programs with recursive types
- On-the-Fly Techniques for Game-Based Software Model Checking
Cited In (2)
This page was built for publication: Leafy automata for higher-order concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233404)
