Precise Interprocedural Dependence Analysis of Parallel Programs

It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute atomically. We show that these problems become decidable, if this assumption is abandoned. So, the (unrealistic) idealization from program verification "atomic execution of base statements" introduced in order to simplify matters, actually increases the difficulty of these problems from the point of view of program analysis: amazingly these problems become more tractable if we adopt a less idealized, more realistic model of execution. duce an effective abstract domain of antichains of dependence traces that allows us to perform a precise interprocedural dependence analysis in (nonatomically executing) parallel programs. The main idea is to trace sequences of dependences exhibited successively by program executions. We define operations on antichains of dependence traces and show that they precisely...

• Type: Journal
• Year: 2002
• Where: TRIER
• Authors: Markus Müller-Olm
• Keywords: Faint Code, Modeling And Simulation, Parallel Programs, Program Executions, TRIER 2002