Precise interprocedural dependence analysis of parallel programs

DOI10.1016/j.tcs.2003.09.002zbMath1068.68043OpenAlexW2073475094MaRDI QIDQ1884938

Markus Müller-Olm

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.09.002

zbMATH Keywords

ConcurrencyProgram analysisDependenceAtomicity assumption

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (1)

On the computational complexity of dynamic slicing problems for program schemas

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Precise interprocedural dataflow analysis with applications to constant propagation
• Fixed-point calculus
• Euro-Par '98 parallel processing. 4th international Euro-Par conference, Southampton, GB, September 1--4, 1998. Proceedings
• Program Slicing
• Countable nondeterminism and random assignment
• Process Algebra
• On optimal slicing of parallel programs
• Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
• Abstract Interpretation Frameworks
• The complexity of theorem-proving procedures
• The regular viewpoint on PA-processes
• Constrained properties, semilinear systems, and Petri nets

This page was built for publication: Precise interprocedural dependence analysis of parallel programs