Model-checking bounded multi-pushdown systems

DOI10.1007/978-3-642-38536-0_35zbMATH Open1381.68145OpenAlexW2276682279MaRDI QIDQ4928504FDOQ4928504

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

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

Mathematics Subject Classification ID

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

Cited In (12)

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