Please use this identifier to cite or link to this item:
Title: Program simplification as a means of approximating undecidable propositions
Authors: Harman, M
Fox, C
Hierons, RM
Binkley, D
Danicic, S
Issue Date: 1999
Publisher: IEEE
Citation: 7th IEEE International Workshop on Program Comprehension (IWPC'99), Pittsburgh, pp. 208-217, May 1999
Abstract: We describe an approach which mixes testing, slicing, transformation and formal verification to investigate speculative hypotheses concerning a program, formulated during program comprehension activity. Our philosophy is that such hypotheses (which are typically undecidable) can, in some sense, be `answered' by a partly automated system which returns neither `true' nor `false' but a program (the `test program') which computes the answer. The motivation for this philosophy is the way in which, as we demonstrate, static analysis and manipulation technology can be applied to ensure that the resulting test program is significantly simpler than the original program, thereby simplifying the process of investigating the original hypothesis
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
Program simplification as a means of approximating undecidable propositions.pdf276.89 kBAdobe PDFView/Open

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