Reducing concurrent analysis under a context bound to sequential analysis
From MaRDI portal
Publication:1039852
DOI10.1007/s10703-009-0078-9zbMath1186.68298OpenAlexW2087046173MaRDI QIDQ1039852
Publication date: 23 November 2009
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.6615
Related Items (12)
Stateless model checking under a reads-value-from equivalence ⋮ Delay-bounded scheduling without delay! ⋮ SAT-Based Model Checking ⋮ Faster Algorithms for Weighted Recursive State Machines ⋮ Sequentialization Using Timestamps ⋮ Budget-bounded model-checking pushdown systems ⋮ Analysis of correct synchronization of operating system components ⋮ The decidability of verification under PS 2.0 ⋮ Visibly pushdown modular games ⋮ CCA-Secure Keyed-Fully Homomorphic Encryption ⋮ Scope-Bounded Pushdown Languages ⋮ Automatic analysis of DMA races using model checking and \(k\)-induction
Uses Software
Cites Work
- Unnamed Item
- Precise interprocedural dataflow analysis with applications to constant propagation
- Weighted pushdown systems and their application to interprocedural dataflow analysis
- Summarizing procedures in concurrent programs
- Precise interprocedural analysis through linear algebra
- Abstract Error Projection
- 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
