Operating systems : a concept-based approach

xviii, 789 p. ; 23 cm

Bidirectional Data Flow Analysis : Myths and Reality

Research in bidirectional data flow analysis seems to have come to a halt due to an impression that the case for bidirectional data flow analysis has been considerably weakened by a plethora of investigations based on decomposability of known bidirectional placement algorithms into a sequence of purely unidirectional components. This paper shows that the approach of decomposability is not general enough in that it derives its power from the simplifying graph transformation of edge-splitting and the favourable nature of flows in partial redundancy elimination (PRE). This follows from the fact that in the absence of edge-splitting, PRE cannot be performed using a sequence of cascaded unidirectional flows. Further, edge-splitting inherently converts data flows involved in PRE into unidirectional flows. In our opinion, this obviates the need of an alternative formulation. We also show that edge-splitting cannot convert data flows involved in "truly" bidirectional data flow problem..

Information Processing Letters 85 (2003) 145–152 A compact execution history for dynamic slicing

A slice of a program P with respect to a slicing criterion C ≡ ({var}, c_stmt) is a subset of the program which includes all statements that directly or indirectly affect the value of variable var in c_stmt [1,10–12]