Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation

DOI10.1007/978-3-642-18275-4_15MaRDI QIDQ3075482zbMATH OpenOpenAlexFDO

Authors Thomas Martin Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner

Publication date 15 February 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18275-4_15

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Parallel algorithms in computer science (68W10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 7682282
• Context-bounded analysis for concurrent programs with dynamic creation of threads
• Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
• Efficient hybrid reachability analysis for asynchronous concurrent systems
• A generic approach to the static analysis of concurrent programs with procedures
• A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
• Verification of higher-order concurrent programs with dynamic resource creation
• Computational Science - ICCS 2004
• Interprocedural Analysis of Concurrent Programs Under a Context Bound
• Pairwise reachability analysis for higher order concurrent programs by higher-order model checking

Cites work

• CONCUR 2005 – Concurrency Theory
• Computer Aided Verification
• Constraint-based inter-procedural analysis of parallel programs
• Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
• Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
• Language Strength Reduction
• Macro tree transducers
• On optimal slicing of parallel programs
• Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints

Cited in

(9)

• CARET analysis of multithreaded programs
• Verification of asynchronous programs with nested locks
• Model checking dynamic pushdown networks
• Reachability for dynamic parametric processes
• Constrained dynamic tree networks
• Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
• Iterable forward reachability analysis of monitor-DPNs
• Verification of higher-order concurrent programs with dynamic resource creation
• scientific article; zbMATH DE number 7682282 (Why is no real title available?)

This page was built for publication: Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation

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