An Assessment of Techniques for Proving Program Correctness
ACM Computing Surveys (CSUR)
Automated Software Test Data Generation
IEEE Transactions on Software Engineering
Automated test data generation using an iterative relaxation method
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
The causes and effects of infeasible paths in computer programs
ICSE '85 Proceedings of the 8th international conference on Software engineering
An Approach to Program Testing
ACM Computing Surveys (CSUR)
Validation of Scientific Programs
ACM Computing Surveys (CSUR)
Applicability of Software Validation Techniques to Scientific Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Contemporary software development environments
Communications of the ACM
Test data as an aid in proving program correctness
Communications of the ACM
Theoretical and empirical studies of program testing
ICSE '78 Proceedings of the 3rd international conference on Software engineering
An interactive Automated Test Data Generator
ACM '76 Proceedings of the 1976 annual conference
ACM '76 Proceedings of the 1976 annual conference
ATLAS-An Automated Software Testing System
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Test data as an aid in proving program correctness
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
FORTRAN error detection through static analysis
ACM SIGSOFT Software Engineering Notes
Some experience with DAVE: a Fortran program analyzer
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Does automated white-box test generation really help software testers?
Proceedings of the 2013 International Symposium on Software Testing and Analysis
Hi-index | 0.03 |
Software quality enhancement can be achieved in the near term through use of a systematic program testing methodology. The methodology attempts to relate functional software testcases with formal software specifications as a means to achieve correspondence between the software and its specifications. To do this requires generation of appropriate testcase data. Automatic testcase generation is based on a priori knowledge of two forms of internal structure information: a representation of the tree of subschema automatically identified from within each program text, and a representation of the iteration structure of each subschema. This partition of a large program allows for efficient and effective automatic testcase generation using straightforward backtracking techniques. During backtracking a number of simplifying, consolidating, and consistency analyses are applied. The result is either (1) early recognition of the impossibility of a particular program flow, or (2) efficient generation of input variable specifications which cause the testcase to traverse each portion of the required program flow. A number of machine output examples of the backtracking facility are given, and the general effectiveness of the entire process is discussed.