Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems

DOI10.1007/978-3-319-63390-9_9zbMath1495.68134OpenAlexW2734934908MaRDI QIDQ2164219

Igor Walukiewicz, Marie Fortin, Anca Muscholl

Publication date: 12 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-319-63390-9_9

zbMATH Keywords

pushdown systemscontributor instanceslinear-time propertiesparameterized verification problemuniversal reachability

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) Temporal logic (03B44)

Related Items (2)

Fine-grained complexity of safety verification ⋮ On the Complexity of Bounded Context Switching.

This page was built for publication: Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems