ConSIT: a conditioned program slicer. Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including reuse, reengineering 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. The paper introduces ConSIT, a conditioned slicing system which is based upon conventional static slicing, symbolic execution and theorem proving. ConSIT is the first fully automated implementation of conditioned slicing. An implementation of ConSIT is available for experimentation at˜mas01sd/consit.html

References in zbMATH (referenced in 7 articles )

Showing results 1 to 7 of 7.
Sorted by year (citations)

  1. Ward, Martin; Zedan, Hussein: Combining dynamic and static slicing for analysing assembler (2010)
  2. Vasudevan, Shobha; Emerson, E. Allen; Abraham, Jacob A.: Improved verification of hardware designs through antecedent conditioned slicing (2007) ioport
  3. Binkley, Dave; Danicic, Sebastian; Gyimóthy, Tibor; Harman, Mark; Kiss, Ákos; Korel, Bogdan: Theoretical foundations of dynamic program slicing (2006)
  4. Binkley, David W.; Danicic, Sebastian; Harman, Mark; Howroyd, John; Ouarbya, Lahcen: A formal relationship between program slicing and partial evaluation (2006)
  5. Rival, Xavier: Understanding the origin of alarms in Astrée (2005)
  6. Rival, Xavier: Abstract dependences for alarm diagnosis (2005)
  7. Fox, Chris; Danicic, Sebastian; Harman, Mark; Hierons, Robert M.: CONSIT: A fully automated conditioned program slicer (2004) ioport