Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable

DOI10.4230/LIPIcs.CONCUR.2015.72zbMath1374.68337OpenAlexW2277816930MaRDI QIDQ5357695

Salvatore La Torre, Igor Walukiewicz, Anca Muscholl

Publication date: 12 September 2017

Full work available at URL: https://hal.archives-ouvertes.fr/hal-01394827

zbMATH Keywords

verificationshared memoryparametrized systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Reachability for Dynamic Parametric Processes ⋮ Existential Definability over the Subword Ordering ⋮ Model checking parameterized asynchronous shared-memory systems ⋮ Unnamed Item

This page was built for publication: Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable