Theoretical and empirical studies on using program mutation to test the functional correctness of programs
Timothy A. Budd, Richard A. DeMillo, Richard J. Lipton et al. · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1980
In testing for program correctness, the standard approaches [11,13,21,22,23,24,34] have centered on finding data D, a finite subset of all possible inputs to program P, such that
Cited by 157 works. doi:10.1145/567446.567468 Open-access PDF
Authors
References
- Formal Languages and Their Relation to Automata
- Programming by action clusters
- Hints on Test Data Selection: Help for the Practicing Programmer
- Proof of a program
- Proof of a Program: FIND
- Fault Diagnosis of Digital Systems
- PL360, a Programming Language for the 360 Computers
- SELECT—a formal system for testing and debugging programs by symbolic execution
- Reliability of the Path Analysis Testing Strategy
- Methodology for the Generation of Program Test Data