Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
From MaRDI portal
Recommendations
- Parameterized Verification of Asynchronous Shared-Memory Systems
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
- General decidability results for asynchronous shared-memory programs: higher-order and beyond
- scientific article; zbMATH DE number 3972173
- Safety verification of asynchronous pushdown systems with shaped stacks
- Safe nondeterminism in a deterministic-by-default parallel language
- Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems
Cited in
(10)- General decidability results for asynchronous shared-memory programs: higher-order and beyond
- Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems
- Reachability for dynamic parametric processes
- Parameterized Verification of Asynchronous Shared-Memory Systems
- scientific article; zbMATH DE number 7204383 (Why is no real title available?)
- Existential Definability over the Subword Ordering
- Parameterized verification under TSO with data types
- Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent
- Directed regular and context-free languages
- Priority downward closures
This page was built for publication: Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357695)