Axiomatizing Software Test Data Adequacy

IEEE Transactions on Software Engineering

Volumn SE-12, Issue 12, 1986, Pages 1128-1138

  Weyuker, Elaine J ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

Software testing; test data adequacy

Indexed keywords

DATA PROCESSING;

GENERAL AXIOMATIC THEORY; PROGRAM-BASED ADEQUACY CRITERIA; TEST DATA ADEQUACY AXIOMATIZATION;

COMPUTER SOFTWARE;

EID: 0022914039     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1986.6313008     Document Type: Article

References (26)

1. T. A. Budd, “Mutation analysis: Ideas, examples, problems and prospects,” in Computer Program Testing, B. Chandrasekaran and S. Radicchi, Eds. New York: North-Holland, 1981, pp. 129–148.
2. T. A. Budd, R. A. DeMillo, R. J. Lipton, and F. G. Sayward, “The-oretical and empirical studies on using program mutation to test the functional correctness of programs,” in Proc. 7th Annu. Symp. Principles of Programming Languages, Las Vegas, NV, 1980, pp. 220–233.
3. N. Chapin, “A measure of software complexity,” in Proc. 1979 Nat. Comput. Conf., New York, pp. 995–1002.
4. M. D. Davis and E. J. Weyuker, “A formal notion of program-based test data adequacy,” Inform. and Contr., vol. 56, no. 1–2, pp. 52–71, Jan./Feb. 1983.
5. ―, Computability, Complexity, and Languages. New York: Academic, 1983.
6. R. A. DeMillo, R. J. Lipton, and F. G. Sayward, “Hints on test data selection: Help for the practicing programmer,” Computer, vol. 11, no. 4, pp. 34–41, Apr. 1978.
7. J. L. Elshoff, “An investigation into the effects of the counting method used on software science measurements,” SIGPLAN Notices, vol. 13, no. 2, pp. 30–45, Feb. 1978.
8. J. L. Elshoff and M. Marcotty, “On the use of the cyclomatic number to measure program complexity,” SIGPLAN Notices, vol. 13, no. 12, pp. 29–40, Dec. 1978.
9. F. G. Frankl and E. J. Weyuker, “A data flow testing tool,” in Proc. Softfair II, San Francisco, CA, Dec. 1985, pp. 46–53.
10. S. L. Gerhart and L. Yelowitz, “Observations of fallibility in appli-cations of modern programming methodologies,” IEEE Trans. Software Eng., vol. SE-2, pp. 195–207, Sept. 1976.
11. T. Gilb, Software Metrics. Cambridge, MA: Winthrop, 1977.
12. J. B. Goodenough and S. L. Gerhart, “Toward a theory of testing: Data selection criteria,” in Current Trends in Programming Methodology, vol. 2, R. T. Yeh, Ed. Englewood Cliffs, NJ: Prentice-Hall, Hall, 1977, pp. 44–79.
13. M. H. Halstead, “Toward a theoretical basis for estimating program-ming effort,” in Proc. ACM 1975, New York, pp. 222–224.
14. M. H. Halstead, Elements of Software Science. New York: Elsevier North-Holland, 1977.
15. R. G. Hamlet, “Testing programs with the aid of a compiler,” IEEE Trans. Software Eng., vol. SE-3, pp. 279–290, July 1977.
16. W. J. Hansen, “Measurement of program complexity by the pair (cy-clomatic clomatic number, operator count),” SIGPLAN Notices, vol. 13, no. 3, pp. 29–33, Mar. 1978.
17. J. C. Huang, “An approach to program testing,” Comput. Surveys, vol. 7, no. 3, pp. 113–128, Sept. 1975.
18. J. W. Laski and B. Korel, “A data flow oriented program testing strategy,” IEEE Trans. Software Eng., vol. SE-9, pp. 347–354, May 1983.
19. T. J. McCabe, “A complexity measure,” IEEE Trans. Software Eng., vol. SE-2, pp. 308–320, Dec. 1976.
20. H. D. Mills, “The complexity of programs,” in Program Test Methods, W. C. Hetzel, Ed., 1973.
21. G. J. Myers, “An extension to the cyclomatic measure of program complexity,” SIGPLAN Notices, vol. 12, no. 10, pp. 61–64, Oct. 1977.
22. ―, The Art of Software Testing. New York: Wiley, 1979.
23. S. Ntafos, “On required element testing,” IEEE Trans. Software Eng., vol. SE-10, pp. 795–803, Nov. 1984.
24. S. Rapps and E. J. Weyuker, “Data flow analysis techniques for test data selection,” in Proc. 6th Int. Conf. Software Eng., Tokyo, Japan, Sept. 1982, pp. 272–278.
25. ―, “Selecting software test data using data flow information,” IEEE Trans. Software Eng., vol. SE-11, pp. 367–375, Apr. 1985.
26. E. J. Weyuker, “The applicability of program schema results to pro-grams,” Int. J. Comput. Inform. Sci., vol. 8, no. 5, pp. 387–403, Oct. 1979.