General decidability results for asynchronous shared-memory programs: higher-order and beyond
DOI10.1007/978-3-030-72016-2_24zbMath1467.68040arXiv2101.08611OpenAlexW3141261334MaRDI QIDQ2044219
Georg Zetzsche, Rupak Majumdar, Ramanathan S. Thinniyam
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/2101.08611
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The IO- and OI-hierarchies
- Effective constructions in well-partially-ordered free monoids
- Remarks on blind and partially blind one-way multicounter machines
- Undecidable problems in unreliable computations.
- General decidability results for asynchronous shared-memory programs: higher-order and beyond
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
- Well-structured languages
- Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity
- Unboundedness and downward closures of higher-order pushdown automata
- Interprocedural analysis of asynchronous programs
- An Approach to Computing Downward Closures
- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
- An automata-theoretical characterization of the OI-hierarchy
- Higher-Order Model Checking: An Overview
- The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
- The Complexity of the Diagonal Problem for Recursion Schemes
- Types and higher-order recursion schemes for verification of higher-order programs
- Collapsible Pushdown Automata and Recursion Schemes
- Indexed Grammars—An Extension of Context-Free Grammars
- On free monoids partially ordered by embedding
- Model Checking Multithreaded Programs with Asynchronous Atomic Methods
- Regular Separability and Intersection Emptiness Are Independent Problems
- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
This page was built for publication: General decidability results for asynchronous shared-memory programs: higher-order and beyond
