Sciweavers

IPL
2008

Slicing for modern program structures: a theory for eliminating irrelevant loops

13 years 5 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, the slice program should have the same termination properties as the original program, but to keep the slices manageable, it might be preferable to slice away loops that do not affect the values of relevant variables. This paper provides the first theoretical foundation to reason about nontermination insensitive slicing without assuming the presence of a unique end node. A slice is required to be closed under data dependence and under a recently proposed variant of control dependence, called weak order dependence. This allows a simulation-based correctness proof for a correctness criterion stating that the observational behavior of the original program must be a prefix of the behavior of the slice program. Key words: program slicing, control dependence, observable behavior, simulation techniques
Torben Amtoft
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2008
Where IPL
Authors Torben Amtoft
Comments (0)