Abstract
Relative correctness is the property of a program to be more-correct than another with respect to a given specification. Whereas the traditional definition of (absolute) correctness divides candidate program into two classes (correct, and incorrect), relative correctness arranges candidate programs on the richer structure of a partial ordering. In other venues we discuss the impact of relative correctness on program derivation, and on program verification. In this paper, we discuss the impact of relative correctness on program testing; specifically, we argue that when we remove a fault from a program, we ought to test the new program for relative correctness over the old program, rather than for absolute correctness. We present analytical arguments to support our position, as well as an empirical argument in the form of a small program whose faults are removed in a stepwise manner as its relative correctness rises with each fault removal until we obtain a correct program.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1-15 |
| Number of pages | 15 |
| Journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
| Volume | 208 |
| DOIs | |
| State | Published - May 25 2016 |
| Event | 1st Workshop on Pre- and Post-Deployment Verification Techniques, PrePost 2016 - Reykjavik, Iceland Duration: Jun 4 2016 → … |
All Science Journal Classification (ASJC) codes
- Software
Keywords
- Absolute correctness
- Program correctness
- Program repair
- Relative correctness