Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding
From MaRDI portal
Publication:4649294
DOI10.1007/978-3-642-33386-6_13zbMath1375.68076OpenAlexW1602322980MaRDI QIDQ4649294
K. Narayan Kumar, Mohamed Faouzi Atig, Prakash Saivasan, Ahmed Bouajjani
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
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (5)
The complexity of model checking multi-stack systems ⋮ Reachability of scope-bounded multistack pushdown systems ⋮ Budget-bounded model-checking pushdown systems ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ On the path-width of integer linear programming
This page was built for publication: Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding