Model-Checking Bounded Multi-Pushdown Systems

DOI10.1007/978-3-642-38536-0_35zbMath1381.68145OpenAlexW2276682279MaRDI QIDQ4928504

Stéphane P. Demri, Kshitij Bansal

Publication date: 14 June 2013

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_35

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (2)

Realizability of concurrent recursive programs ⋮ Reachability of scope-bounded multistack pushdown systems

This page was built for publication: Model-Checking Bounded Multi-Pushdown Systems