Proving Theorems about LISP Functions
Journal of the ACM (JACM)
The synthesis of loop predicates
Communications of the ACM
A technique for software module specification with examples
Communications of the ACM
Inductive methods for proving properties of programs
Communications of the ACM
Calculating properties of programs by valuations on specific models
Proceedings of ACM conference on Proving assertions about programs
Automated generation of testcase datasets
Proceedings of the international conference on Reliable software
Finite state modelling in program development
Proceedings of the international conference on Reliable software
A new approach to program testing
Proceedings of the international conference on Reliable software
SELECT—a formal system for testing and debugging programs by symbolic execution
Proceedings of the international conference on Reliable software
Toward a theory of test data selection
Proceedings of the international conference on Reliable software
A view of program verification
Proceedings of the international conference on Reliable software
Structured programming
Theoretical and empirical studies of program testing
ICSE '78 Proceedings of the 3rd international conference on Software engineering
Programs, tests, and oracles: the foundations of testing revisited
Proceedings of the 33rd International Conference on Software Engineering
| Hi-index | 0.00 |
Proofs of program correctness tend to be long and tedious whereas testing, though useful in detecting errors, usually does not guarantee correctness. This paper introduces a technique whereby test data can be used in proving program correctness. In addition to simplifying certification of correctness, this method simplifies the process of providing specifications for a program. The applicability of this technique to procedures, recursive programs, and modular programs is demonstrated.