A new foundation for control-dependence and slicing for modern program structures

  • Authors:

  • Venkatesh Prasad Ranganath;Torben Amtoft;Anindya Banerjee;Matthew B. Dwyer;John Hatcliff

  • Affiliations:

  • Department of Computing and Information Sciences, Kansas State University;Department of Computing and Information Sciences, Kansas State University;Department of Computing and Information Sciences, Kansas State University;Department of Computer Science and Engineering, University of Nebraska, Lincoln;Department of Computing and Information Sciences, Kansas State University

  • Venue:
  • ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The notion of control dependence underlies many program analysis and transformation techniques. Despite wide applications, existing definitions and approaches for calculating control dependence are difficult to apply seamlessly to modern program structures. Such program structures make substantial use of exception processing and increasingly support reactive systems designed to run indefinitely. This paper revisits foundational issues surrounding control dependence and slicing. It develops definitions and algorithms for computing control dependence that can be directly applied to modern program structures. A variety of properties show that the new definitions conservatively extend classic definitions. In the context of slicing reactive systems, the paper proposes a notion of slicing correctness based on weak bisimulation and proves that the definition of control dependence generates slices that conform to this notion of correctness. The new definitions and algorithms for control dependence form the basis of a publicly available program slicer that has been implemented for full Java.