Reachability Analysis of Communicating Pushdown Systems

DOI10.1007/978-3-642-12032-9_19zbMath1284.68399arXiv1209.0359OpenAlexW1823865466MaRDI QIDQ5900852

Jérôme Leroux, Alexander Heußner, Grégoire Sutre, Anca Muscholl

Publication date: 27 April 2010

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.0359

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14)

Related Items (5)

Synchronizability for Verification of Asynchronously Communicating Systems ⋮ On deciding synchronizability for asynchronously communicating systems ⋮ Verifying parallel programs with dynamic communication structures ⋮ Unnamed Item ⋮ Non axiomatisability of positive relation algebras with constants, via graph homomorphisms

This page was built for publication: Reachability Analysis of Communicating Pushdown Systems