Efficient path conditions in dependence graphs

Robschink, Torsten; Snelting, Gregor

doi:10.1109/icse.2002.1007992

“…Making path conditions work for full C and realistic programs required years of theoretical and practical work (Robschink and Snelting 2002;Robschink 2005;Snelting et al 2006). Today, path conditions have proven useful in realistic case studies.…”

Section: Andreas Lochbihler • Gregor Sneltingmentioning

confidence: 99%

On Temporal Path Conditions in Dependence Graphs

Muller

¹

,

Shinohara

²

2007

Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2007)

View full text Add to dashboard Cite

Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express more detailed circumstances of a particular flow; they provide precise necessary conditions for information flow along a path or chop in a dependence graph. Ordinary boolean path conditions, however, cannot express temporal properties, e.g. that for a specific flow it is necessary that some condition holds, and later another specific condition holds.In this contribution, we introduce temporal path conditions, which extend ordinary path conditions by temporal operators in order to express temporal dependencies between conditions for a flow. We present motivating examples, generation and simplification rules, application of model checking to generate witnesses for a specific flow, and a case study. We prove the following soundness property: if a temporal path condition for a path is satisfiable, then the ordinary boolean path condition for the path is satisfiable. The converse does not hold, indicating that temporal path conditions are more precise.

show abstract

“…Making path conditions work for full C and realistic programs required years of theoretical and practical work (Robschink and Snelting 2002;Robschink 2005;Snelting et al 2006). Today, path conditions have proven useful in realistic case studies.…”

Section: Andreas Lochbihler • Gregor Sneltingmentioning

confidence: 99%

“…Thus, nodes before and after the cycle are not related. For more details on how to construct boolean path conditions, see (Snelting 1996;Robschink and Snelting 2002;Snelting et al 2006).…”

Section: More Generallymentioning

confidence: 99%

On Temporal Path Conditions in Dependence Graphs

Lochbihler

¹

,

Snelting

²

2007

Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2007)

0

View full text Add to dashboard Cite

Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express more detailed circumstances of a particular flow; they provide precise necessary conditions for information flow along a path or chop in a dependence graph. Ordinary boolean path conditions, however, cannot express temporal properties, e.g. that for a specific flow it is necessary that some condition holds, and later another specific condition holds.In this contribution, we introduce temporal path conditions, which extend ordinary path conditions by temporal operators in order to express temporal dependencies between conditions for a flow. We present motivating examples, generation and simplification rules, application of model checking to generate witnesses for a specific flow, and a case study. We prove the following soundness property: if a temporal path condition for a path is satisfiable, then the ordinary boolean path condition for the path is satisfiable. The converse does not hold, indicating that temporal path conditions are more precise.

show abstract

“…Path conditions give sufficient conditions under which an influence from one statement to another may occur. Other work [RS02,SRK03] has already revealed their usefulness, and the thesis of Robschink [Rob] can be seen as a sequel to this work.…”

Section: Discussionmentioning

confidence: 96%

“…The main problem to compute path conditions is scalability and efficiency. Therefore a divide-and-conquer strategy is applied: Paths and path conditions are decomposed before computation as shown in [Sne96,KS98] and [RS02,SRK03,Rob], which also contain case studies and evaluations.…”

Section: Related Workmentioning

confidence: 99%

Advanced slicing of sequential and concurrent programs

Krinke¹

20th IEEE International Conference on Software Maintenance, 2004. Proceedings.

View full text Add to dashboard Cite

Program slicing is a technique to identify statements that may influence the computations in other statements. Despite the ongoing research of almost 25 years, program slicing still has problems that prevent a widespread use: Sometimes, slices are too big to understand and too expensive and complicated to be computed for real-life programs. This thesis presents solutions to these problems: It contains various approaches which help the user to understand a slice more easily by making it more focused on the user's problem. All of these approaches have been implemented in the VALSOFT system and thorough evaluations of the proposed algorithms are presented. The underlying data structures used for slicing are program dependence graphs. They can also be used for different purposes: A new approach to clone detection based on identifying similar subgraphs in program dependence graphs is presented; it is able to detect modified clones better than other tools. In the theoretical part, this thesis presents a high-precision approach to slice concurrent procedural programs despite that optimal slicing is known to be undecidable. It is the first approach to slice concurrent programs that does not rely on inlining of called procedures.

show abstract

Efficient path conditions in dependence graphs

Cited by 3 publications

References 0 publications

On Temporal Path Conditions in Dependence Graphs

On Temporal Path Conditions in Dependence Graphs

On Temporal Path Conditions in Dependence Graphs

Advanced slicing of sequential and concurrent programs

Contact Info

Product

Resources

About