Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis

DOI10.1007/978-3-540-70545-1_7MaRDI QIDQ3512480zbMATH OpenOpenAlexFDO

Authors Akash Lal, Thomas Reps

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Reducing concurrent analysis under a context bound to sequential analysis
• Interprocedural Analysis of Concurrent Programs Under a Context Bound
• Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
• Context-bounded analysis for concurrent programs with dynamic creation of threads
• Reducing Context-Bounded Concurrent Reachability to Sequential Reachability

Cites work

• Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
• scientific article; zbMATH DE number 1670555 (Why is no real title available?)
• Interprocedural Analysis of Concurrent Programs Under a Context Bound
• Lazy abstraction
• Precise interprocedural analysis through linear algebra
• Precise interprocedural dataflow analysis with applications to constant propagation
• Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
• Summarizing procedures in concurrent programs
• 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

Cited in

(26)

• Reducing concurrent analysis under a context bound to sequential analysis
• May-happen-in-parallel analysis with condition synchronization
• Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free
• Reachability of scope-bounded multistack pushdown systems
• Reducing extension edges of concurrent programs for reachability analysis
• Rely-guarantee termination and cost analyses of loops with concurrent interleavings
• Faster algorithms for weighted recursive state machines
• Compositionality Entails Sequentializability
• Reachability of multistack pushdown systems with scope-bounded matching relations
• Model checking concurrent programs
• Context-bounded analysis for concurrent programs with dynamic creation of threads
• Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
• The language theory of bounded context-switching
• Games on Multi-stack Pushdown Systems
• Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
• Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
• Symbolic predictive analysis for concurrent programs
• Budget-bounded model-checking pushdown systems
• Bounded context switching for valence systems
• Data multi-pushdown automata
• On the Complexity of Bounded Context Switching.
• Context-bounded analysis of TSO systems
• Model checking with bounded context switching
• 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

This page was built for publication: Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis

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