ConSIT: A Conditioned Program Slicer

  • Authors:
  • Sebastian Danicic;Chris Fox;Mark Harman;Rob Hierons

  • Affiliations:
  • -;-;-;-

  • Venue:
  • ICSM '00 Proceedings of the International Conference on Software Maintenance (ICSM'00)
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Conditioned slicing is a powerful generalization of static and dynamic slicing, which has applications to many problems in software maintenance and evolution, including re-use, re-engineering and program comprehension. However, there has been relatively little work on the implementation of conditioned slicing. Algorithms for implementing conditioned slicing necessarily involve reasoning about the values of program predicates in certain sets of states derived from the conditioned slicing criterion, making implementation particularly demanding. This paper introduces ConSIT, a conditioned slicing system that is based upon conventional static slicing, symbolic execution and theorem proving. ConSIT is the first fully automated implementation of conditioned slicing.