Abstract:
We describe an approach which mixes testing, slicing, transformation and formal verification to investigate speculative hypotheses concerning a program, formulated during...Show MoreMetadata
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.
Date of Conference: 05-07 May 1999
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-7695-0180-x
Print ISSN: 1092-8138