Experience with Path Analysis and Testing of Programs
- 1 May 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-6 (3) , 278-286
- https://doi.org/10.1109/tse.1980.230473
Abstract
There are a number of practical difficulties in performing a path testing strategy for computer programs. One problem is in deciding which paths, out of a possible infinity, to use as test cases. A hierarchy of structural test metrics is suggested to direct the choide and to monitor the coverge of test paths. Another problem is that many of the chosen paths may be infeasible in the sense that no test data can ever execute them. Experience with the use of "allegations" to circumvent this problem and prevent the static generation of many infeasible paths is reported.Keywords
This publication has 10 references indexed in Scilit:
- An evaluation of the effectiveness of symbolic testingSoftware: Practice and Experience, 1978
- Testing Software Design Modeled by Finite-State MachinesIEEE Transactions on Software Engineering, 1978
- Quantifying the test effectiveness of Algol 68 programsPublished by Association for Computing Machinery (ACM) ,1977
- On program analysisInformation Processing Letters, 1976
- Reliability of the Path Analysis Testing StrategyIEEE Transactions on Software Engineering, 1976
- On Two Problems in the Generation of Program Test PathsIEEE Transactions on Software Engineering, 1976
- Developing a Single Numerical Algorithms Library for Different Machine RangesACM Transactions on Mathematical Software, 1976
- Allegations as aids to static program testingPublished by Association for Computing Machinery (ACM) ,1976
- An Approach to Program TestingACM Computing Surveys, 1975
- Methodology for the Generation of Program Test DataIEEE Transactions on Computers, 1975