Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
From MaRDI portal
Publication:3512480
DOI10.1007/978-3-540-70545-1_7zbMath1155.68368OpenAlexW1554834491MaRDI QIDQ3512480
Publication date: 15 July 2008
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70545-1_7
Related Items (15)
Model Checking Concurrent Programs ⋮ Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis ⋮ Symbolic predictive analysis for concurrent programs ⋮ Reachability of scope-bounded multistack pushdown systems ⋮ Faster Algorithms for Weighted Recursive State Machines ⋮ Budget-bounded model-checking pushdown systems ⋮ Compositionality Entails Sequentializability ⋮ Bounded Context Switching for Valence Systems ⋮ Context-Bounded Analysis of TSO Systems ⋮ Model checking with bounded context switching ⋮ Games on Multi-stack Pushdown Systems ⋮ Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads ⋮ Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations ⋮ Data Multi-Pushdown Automata ⋮ On the Complexity of Bounded Context Switching.
Cites Work
- Unnamed Item
- Summarizing procedures in concurrent programs
- Precise interprocedural analysis through linear algebra
- Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
- Precise interprocedural dataflow analysis with applications to constant propagation
- Lazy abstraction
- Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
