Linear-time model-checking for multithreaded programs under scope-bounding

DOI10.1007/978-3-642-33386-6_13zbMATH Open1375.68076OpenAlexW1602322980MaRDI QIDQ4649294FDOQ4649294

Authors: Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan 

Publication date: 21 November 2012

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-642-33386-6_13

Recommendations

• Reachability of scope-bounded multistack pushdown systems
• Model-checking bounded multi-pushdown systems
• The complexity of model checking multi-stack systems
• The Complexity of Model Checking Multi-stack Systems
• Reachability of multistack pushdown systems with scope-bounded matching relations

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (5)

• Reachability of scope-bounded multistack pushdown systems
• Budget-bounded model-checking pushdown systems
• Emptiness of ordered multi-pushdown automata is 2ETIME-complete
• The complexity of model checking multi-stack systems
• On the path-width of integer linear programming

This page was built for publication: Linear-time model-checking for multithreaded programs under scope-bounding

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