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

DOI10.1007/978-3-642-18275-4_15zbMath1317.68031MaRDI QIDQ3075482

Markus Müller-Olm, Thomas Martin Gawlitza, Helmut Seidl, Peter Lammich, 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

68W10: Parallel algorithms in computer science

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

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

Related Items

Model checking dynamic pushdown networks, Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation

Cites Work

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