Verifying Communicating Multi-pushdown Systems via Split-Width

DOI10.1007/978-3-319-11936-6_1zbMath1448.68283OpenAlexW131795912MaRDI QIDQ3457774

C. Aiswarya, Paul Gastin, K. Narayan Kumar

Publication date: 17 December 2015

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11936-6_1

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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Realizability of concurrent recursive programs, The complexity of model checking multi-stack systems, Unnamed Item, Unnamed Item, Leafy automata for higher-order concurrency, Decidable models of integer-manipulating programs with recursive parallelism, Verification of Parameterized Communicating Automata via Split-Width, Non axiomatisability of positive relation algebras with constants, via graph homomorphisms, Data Multi-Pushdown Automata