Interprocedural Analysis of Concurrent Programs Under a Context Bound
From MaRDI portal
Recommendations
- Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
- Reducing concurrent analysis under a context bound to sequential analysis
- Context-Bounded Analysis of Concurrent Queue Systems
- Context-bounded analysis for concurrent programs with dynamic creation of threads
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
Cites work
- A generic approach to the static analysis of concurrent programs with procedures
- Abstract Error Projection
- CONCUR 2005 – Concurrency Theory
- Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1232241 (Why is no real title available?)
- scientific article; zbMATH DE number 1324833 (Why is no real title available?)
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- On the analysis of interacting pushdown systems
- On the regular structure of prefix rewriting
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Precise interprocedural analysis through linear algebra
- Precise interprocedural dataflow analysis with applications to constant propagation
- Reachability analysis of pushdown automata: Application to model-checking
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Weighted pushdown systems and their application to interprocedural dataflow analysis
Cited in
(35)- Reducing concurrent analysis under a context bound to sequential analysis
- Realizability of concurrent recursive programs
- A denotational semantics for low-level probabilistic programs with nondeterminism
- Reachability of scope-bounded multistack pushdown systems
- Rely-guarantee termination and cost analyses of loops with concurrent interleavings
- On the sequential nature of interprocedural program-analysis problems
- Constraint-based inter-procedural analysis of parallel programs
- A generic approach to the static analysis of concurrent programs with procedures
- Faster algorithms for weighted recursive state machines
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
- Reachability of multistack pushdown systems with scope-bounded matching relations
- Reasoning about threads with bounded lock chains
- Analyzing Asynchronous Programs with Preemption
- Interprocedural analysis of asynchronous programs
- Context-bounded analysis for concurrent programs with dynamic creation of threads
- Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
- Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors
- The language theory of bounded context-switching
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
- scientific article; zbMATH DE number 1538033 (Why is no real title available?)
- Emptiness of ordered multi-pushdown automata is 2ETIME-complete
- Compositional Bitvector Analysis for Concurrent Programs with Nested Locks
- Interprocedural analyses: a comparison
- Termination and cost analysis of loops with concurrent interleavings
- Context-bounded analysis of TSO systems
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Context-Bounded Analysis of Concurrent Queue Systems
- Program Analysis Using Weighted Pushdown Systems
- A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
- Tools and Algorithms for the Construction and Analysis of Systems
- Static Analysis
- Decidable models of integer-manipulating programs with recursive parallelism
- A consistency analysis of a class of concurrent transient implicit/explicit algorithms
- Summarization for termination: No return!
This page was built for publication: Interprocedural Analysis of Concurrent Programs Under a Context Bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458333)
