The dependence condition graph: Precise conditions for dependence between program points

Tukra: An Abstract Program Slicing Tool

“…In (Cortesi and Halder, 2010), the authors applied the notion of semantic relevancy of statements, and proposed a slicing refinement for imperative programs by combining with statement relevancy the notions of semantic data dependences (Mastroeni and Zanardini, 2008) and conditional dependences (Sukumaran et al, 2010). The combination of these three notions allows us to refine traditional syntax-based dependence graphs into more precise semantics-based dependence graphs, leading to an abstract program slicing algorithm that produces more accurate abstract slices.…”

“…Sukumaran et al (Sukumaran et al, 2010) presented a refinement of the traditional PDGs into Dependence Condition Graphs (DCGs) based on the notion of conditional dependences. A DCG is built from the PDG by annotating each edge e = e.src → e.tgt in the PDG with information e b = e R , e A that captures the conditions under which the dependence represented by that edge is manifest.…”

“…A further refinement of it can be achieved by applying the notion of conditional dependences by Sukumaran et al (Sukumaran et al, 2010) that allows us to transform PDGs into DCGs and to identify unrealizable dependneces in them under the trace semantics of the programs. The removal of such unrealizable dependences yields to more refined semantics-based (abstract) DCGs.…”

Dependence condition graph for semantics-based abstract program slicing

“…In this paper we combine these two concepts: semantic data dependency [20] and conditional dependency [28], (i) by considering the semantic relevancy of the statements (not only the expressions), and (ii) by adopting conditional dependency. This allows us to transform the semantics-based (abstract) PDG into an semantics-based (abstract) DCG that enables to identify the conditions for dependence between program points.…”

“…In [28], Sukumaran et al introduced Dependence Condition Graph (DCG), a refinement of PDGs based on the notion of conditional dependency. This is obtained by adding the annotations which encode the condition under which a particular dependence actually arises in a program execution.…”