General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
From MaRDI portal
Recommendations
Cites work
- An approach to computing downward closures
- An automata-theoretical characterization of the OI-hierarchy
- Complexity of model checking recursion schemes for fragments of the modal mu-calculus
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
- Effective constructions in well-partially-ordered free monoids
- Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
- Higher-order model checking: an overview
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3495606 (Why is no real title available?)
- scientific article; zbMATH DE number 3628412 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 10087 (Why is no real title available?)
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
- Indexed Grammars—An Extension of Context-Free Grammars
- Interprocedural analysis of asynchronous programs
- Language and automata theory and applications. 9th international conference, LATA 2015, Nice, France, March 2--6, 2015. Proceedings
- Model Checking Multithreaded Programs with Asynchronous Atomic Methods
- On free monoids partially ordered by embedding
- Regular Separability and Intersection Emptiness Are Independent Problems
- Remarks on blind and partially blind one-way multicounter machines
- The Complexity of the Diagonal Problem for Recursion Schemes
- The diagonal problem for higher-order recursion schemes is decidable
- The IO- and OI-hierarchies
- Types and higher-order recursion schemes for verification of higher-order programs
- Unboundedness and downward closures of higher-order pushdown automata
- Undecidable problems in unreliable computations.
- Well-structured languages
Cited in
(6)- General decidability results for asynchronous shared-memory programs: higher-order and beyond
- Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
- Existential Definability over the Subword Ordering
- Directed regular and context-free languages
- Priority downward closures
- Slice closures of indexed languages and word equations with counting constraints
This page was built for publication: General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060187)
