On Required Element Testing

IEEE Transactions on Software Engineering

Volumn SE-10, Issue 6, 1984, Pages 795-803

  Ntafos, Simeon C ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Data flow analysis; required element testing; testing strategies

Indexed keywords

COMPUTER SOFTWARE - RELIABILITY;

DATA FLOW ANALYSIS; STRUCTURAL COMPONENT; TEST INPUTS; TESTING STRATEGIES;

COMPUTER PROGRAMMING;

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

References (23)

1. R. A. De Millo, R. J. Lipton, and F. G. Sayward, “Hints for test data selection: Help for the practicing programmer,” IEEE Computer, vol. 11, pp. 34–41, Apr. 1978.
2. J. W. Duran and S. C. Ntafos, “A report on random testing,” in Proc. 5th Int. Conf. Software Eng., Mar. 1981, pp. 179–183.
3. L. D. Fosdich and L. J. Osterweil, “Data flow analysis in software reliability,” ACM Comput. Surveys, vol. 8, no. 3, pp. 305–330, 1976.
4. J. B. Goodenough and S. L. Gerhart, “Towards a theory of test data selection,” IEEE Trans. Software Eng., vol. SE-1, pp. 156–173, June 1975.
5. M. S. Hecht, Flow Analysis of Computer Programs. New York: North-Holland, 1977.
6. P. M. Herman, “A data flow analysis approach to program testing,” Comput. J., vol. 8, pp. 92–96, Nov. 1976.
7. W. E. Howden, “Reliability of the path analysis testing strategy,” IEEE Trans. Software Eng., vol. SE-2, pp. 208–214, Sept. 1976.
8. W. E. Howden, “Symbolic testing-Design techniques, costs and effectiveness,” NTIS PB-268517, May 1977.
9. W. E. Howden, “Functional program testing,” IEEE Trans. Software Eng., vol. SE-6, pp. 160–169, Mar. 1980.
10. J. C. Huang, “An approach to program testing,” ACM Comput. Surveys, vol. 7, pp. 113–128, Sept. 1975.
11. J. C. Huang, “Detection of data flow anomaly through program instrumentation,” IEEE Trans. Software Eng., vol. SE-5, pp. 226–236, May 1979.
12. B. S. Kernighan and P. J. Plauger, The Elements of Programming Style. New York: McGraw-Hill, 1978.
13. J. King, “Symbolic executions and program testing,” Commun. Ass. Comput. Mach., pp. 385–394, July 1976.
14. S. C. Ntafos and S. L. Hakimi, “On path cover problems in digraphs and applications to program testing,” IEEE Trans. Software Eng., vol. SE-5, pp. 520–529, Sept. 1979.
15. S. C. Ntafos and S. L. Hakimi, “On structured digraphs and program testing,” IEEE Trans. Comput., vol. C-30, pp. 67–77, Jan. 1981.
16. S. C. Ntafos, “On testing with required elements,” in Proc. COMPSAC-81, Nov. 1981, pp. 132–139.
17. L. J. Osterweil and L. D. Fosdick, “DAVE-A validation, error detection and documentation system for FORTRAN programs,” Software Practice Exp., vol. 6, pp. 473-486,1976.
18. C. V. Ramamoorthy, S. F. Ho, and W. T. Chen, “On the automated generation of program test data,” IEEE Trans. Software Eng., vol. SE-2, pp. 293–300, Dec. 1976.
19. S. Rapps and E. J. Weyuker, “Data flow analysis techniques for program test data selection,” Dep. Comput. Sci., Courant Inst. Math. Sci., Tech. Rep. 23, Dec. 1981.
20. M. Weiser, “Programmers use slices when debugging,” Commun. Ass. Comput. Mach., vol. 25, 446–452, July 1982.
21. E. J. Weyuker and T. J. Ostrand, “Theories of program testing and the application of revealing subdomains,” IEEE Trans. Software Eng., vol. SE-6, pp. 236–246, May 1980.
22. L. J. White and E. J. Cohen, “A domain strategy for computer program testing,” IEEE Trans. Software Eng., vol. SE-6, pp. 247- 1980.
23. S. J. Zeil and L. J. White, “Sufficient test sets for path analysis testing strategies,” in Proc. 5th Int. Conf. Software Eng., Mar. 1981, pp. 184-194.