UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

ConSIT: A conditioned program slicer

Danicic, S; Fox, C; Harman, M; Hierons, R; (2000) ConSIT: A conditioned program slicer. In: INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, PROCEEDINGS. (pp. 216 - 226). IEEE COMPUTER SOC

Full text not available from this repository.

Abstract

Conditioned slicing is a powerful generalisation 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 which is based upon conventional static slicing, symbolic execution mid theorem proving. ConSIT is the first fully automated implementation of conditioned slicing.An implementation of ConSIT is available for experimentation at http:/ /www.mcs.gold.ac.uk/ (similar to)mas01sd/ consit.html.

Type: Proceedings paper
Title: ConSIT: A conditioned program slicer
Event: International Conference on Software Maintenance (ICSM 2000)
Location: SAN JOSE, CA
Dates: 2000-10-11 - 2000-10-14
ISBN: 0-7695-0753-0
UCL classification: UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: http://discovery.ucl.ac.uk/id/eprint/1302116
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item