Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHarman, M-
dc.contributor.authorHierons, RM-
dc.contributor.authorFox, C-
dc.contributor.authorDanicic, S-
dc.contributor.authorHowroyd, J-
dc.identifier.citationIEEE International Conference on Software Maintenance (ICSM'2001), Florence, 138-147, Nov 2001en
dc.description.abstractTh paper shows how analysis of programs in terms of pre- and postconditions can be improved using a generalisation of conditioned program slicing called pre/post conditioned slicing. Such conditions play an important role in program comprehension, reuse, verification and reengineering. Fully automated analysis is impossible because of the inherent undecidability of pre- and post- conditions. The method presented reformulates the problem to circumvent this. The reformulation is constructed so that programs which respect the pre- and post-conditions applied to them have empty slices. For those which do not respect the conditions, the slice contains statements which could potentially break the conditions. This separates the automatable part of the analysis from the human analysis.en
dc.format.extent180074 bytes-
dc.subjectConditioned program slicingen
dc.subjectPre- and post- conditions-
dc.subjectProgram comprehension-
dc.titlePre/post conditioned slicingen
dc.typeConference Paperen
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
Pre post conditioned slicing.pdf175.85 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.