Formal program testing
Robert Cartwright · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1981
This paper proposes a practical alternative to program verification -- called formal program testing -- with similar, but less ambitious goals. Like a program verifier, a formal testing system takes a program annotated with formal specifications as input, generates the corresponding verification conditions, and passes them through a simplifier. After the simplification step, however, a formal testing system simply evaluates the verification conditions on a representative set of test data instead of trying to prove them. Formal testing provides strong evidence that a program is correct, but does not guarantee it. The strength of the evidence depends on the adequacy of the test data.
Cited by 17 works. doi:10.1145/567532.567546 Open-access PDF
Authors
References
- A Basis for a Mathematical Theory of Computation )
- Proof of Correctness of Data Representations
- A computational logic
- Initial Algebra Semantics and Continuous Algebras
- Specification techniques for data abstractions
- Proving Theorems about LISP Functions
- Simplification by Cooperating Decision Procedures
- Prolog - the language and its implementation compared with Lisp
- The algebraic specification of abstract data types
- Automatic program verification I: A logical basis and its implementation