Program Simplification as a Means of Approximating Undecidable Propositions

Authors:
Mark Harman;Chris Fox;Robert Hierons;David Binkley;Sebastian Danicic
Affiliations:
-;-;-;-;-
Venue:
IWPC '99 Proceedings of the 7th International Workshop on Program Comprehension
Year:
1999

Citing 0
Cited 4

Pre/Post Conditioned Slicing

ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
Amorphous program slicing

Journal of Systems and Software
Source Code Analysis: A Road Map

FOSE '07 2007 Future of Software Engineering
Slicing-based test case generation from UML activity diagrams

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

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.