Model-checking bounded multi-pushdown systems

DOI10.1007/978-3-642-38536-0_35MaRDI QIDQ4928504zbMATH OpenOpenAlexFDO

Authors Kshitij Bansal, Stéphane Demri

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

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

Recommendations

• The Complexity of Model Checking Multi-stack Systems
• The complexity of model checking multi-stack systems
• Global model checking of ordered multi-pushdown systems
• scientific article; zbMATH DE number 1670780
• Model checking concurrent recursive programs using temporal logics

Cited in

(12)

• Realizability of concurrent recursive programs
• Reachability of scope-bounded multistack pushdown systems
• The complexity of model checking multi-stack systems
• Global model checking of ordered multi-pushdown systems
• Model-checking of ordered multi-pushdown automata
• Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
• A perfect model for bounded verification
• Efficient CTL model-checking for pushdown systems
• Linear-time model-checking for multithreaded programs under scope-bounding
• Budget-bounded model-checking pushdown systems
• The Complexity of Model Checking Multi-stack Systems
• Model-Checking HyperLTL for Pushdown Systems

This page was built for publication: Model-checking bounded multi-pushdown systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928504)