Theories of program testing and the application of revealing subdomains

IEEE Transactions on Software Engineering

Volumn SE-6, Issue 3, 1980, Pages 236-246

  Weyuker, Elaine J ^a   Ostrand, Thomas J ^b  

^a NEW YORK UNIVERSITY   (United States)

^b Unisys   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

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

References (13)

1. R. M. Burstall, “Program proving as hand simulation with a little induction,” in Proc. IFIP Congr. 74. Stockholm, Sweden: North-Holland, 1974, pp. 308–312.
2. R. A. De Millo, R. J. Lipton, and F. G. Sayward, “Hints on test data selection: Help for the practicing programmer,” Computer, vol. 11, pp. 34–41, Apr. 1978.
3. E. W. Dijkstra, “Notes on structured programming,” in Structured Programming, O.-J. Dahl, E. W. Dijkstra, C. A. R. Hoare, Ed. New York: Academic, 1972, pp. 1–81.
4. M. Geller, “Test data as an aid in proving program correctness,” Commun. Ass. Comput. Mach., vol. 21, pp. 368–375, May 1978.
5. 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, 1977, pp. 44–79.
6. W. E. Howden, “An evaluation of the effectiveness of symbolic testing,” Software-Practice and Experience, vol. 8, pp. 381–397, 1978.
7. W. E. Howden, “Reliability of the path analysis testing strategy,” IEEE Trans. Software Eng., vol. SE-2, pp. 208–215, Sept. 1976.
8. W. E. Howden, “Symbolic testing and the DISSECT symbolic evaluation system,” IEEE Trans. Software Eng., vol. SE-3, pp. 266–278, July 1977.
9. R. E. Keirstead and D. B. Parker, “On the feasability of formal certification,” in Program Test Methods, W. Hetzel, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1973, pp. 291–301.
10. Z. Manna, Mathematical Theory of Computation, New York: McGraw-Hill, 1974.
11. 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.
12. E. J. Weyuker, Program Schemas with Semantic Restrictions, Ph.D. dissertation, Dep. Comput. Sci., Rutgers Univ., New Brunswick, NJ, Tech. Rep. DCS-TR-60, June 1977.
13. E. J. Weyuker, “The applicability of program schema results to programs,” Int. J. Comput. Inform. Sci., vol. 8, pp. 387–403, Oct. 1979.