Skip to main content
SpringerLink
Log in

Two notions of correctness and their relation to testing

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We consider two interpretations for what it means for test data to demonstrate correctness. For each interpretation, we examine under what conditions data sufficient to demonstrate correctness exists, and whether it can be automatically detected and/or generated. We establish the relation between these questions and the problem of deciding equivalence of two programs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Angluin, D.: On the complexity of minimum inference of regular sets. Information and Control39(3): 337–350 (1978)

    Google Scholar 

  2. Baldwin, D., Sayward, F.: Heuristics for determining equivalence of program mutations. Technical Report Number 161, Yale University 1979

  3. Barzdin, J.M., Bicevskis, J.J., Kalninsh, A.A.: Construction of complete sample system for correctness testing. In: Lecture Notes in Computer Science, Vol. 32, pp. 1–12. Berlin: Springer-Verlag 1975

    Google Scholar 

  4. Biermann, A.W., Krishnaswamy, R.: Constructing programs from example computations. IEEE Transactions on Software Engineering SE-2(3): 141–153 (1976)

    Google Scholar 

  5. Blum, M.: On effective procedures for speeding up algorithms. Journal of the ACM18(2): 290–305 (1971)

    Google Scholar 

  6. Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Information and Control28(2): 125–155 (1975)

    Google Scholar 

  7. Brooks, M.: Automatic generation of test data for recursive programs having simple errors. PhD Thesis, Stanford University 1980

  8. Budd, T.A., Lipton, R.J., DeMillo, R.A., Sayward, F.G.: Mutation analysis. Technical Report Number 155, Yale University 1979

  9. Budd, T.A.: Mutation analysis of program test data. PhD Thesis, Yale University 1980

  10. Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Transactions on Software Engineering SE-4(3): 178–187 (1978)

    Google Scholar 

  11. Clarke, L.A.: A system to generate test data and symbolically execute programs. IEEE Transactions on Software Engineering SE-2(3): 215–222 (1976)

    Google Scholar 

  12. DeMillo, R.A., Lipton, R.J., Sayward, F.G.: Hints on test data selection: Help for the practicing programmer. Computer11(4): 34–43 (1978)

    Google Scholar 

  13. DeMillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Information Processing Letters7(4): 193–195 (1978)

    Google Scholar 

  14. Foster, K.A.: Error sensitive test cases. IEEE Transactions on Software Engineering SE-6(3): 258–264 (1980)

    Google Scholar 

  15. Geller, M.: Test data as an aid in proving program correctness. Communications of the ACM21(5): 368–375 (1978)

    Google Scholar 

  16. Goodenough, J.B., Gerhart, S.L.: Towards a theory of test data selection. IEEE Transactions on Software Engineering SE-1(2):156–173 (1975)

    Google Scholar 

  17. Goodenough, J.B.: A survey of program testing issues. pp. 316–340. In: Research Directions in Software Technology (P. Wegner, ed.), pp. 316–340. Cambridge, MA: MIT Press, 1979

    Google Scholar 

  18. Hamlet, R.: Testing programs with the aid of a compiler. IEEE Transactions on Software Engineering SE-3(4): 279–290 (1977)

    Google Scholar 

  19. Hamlet, R.: Testing programs with finite sets of data. The Computer Journal20(3): 232–237 (1977)

    Google Scholar 

  20. Hamlet, R.: Test reliability and software maintenance. In: Proceeding of the Compsac conference, pp. 315–320. IEEE 1978

  21. Hamlet, R.: Critique of reliability theory. In: Digest of the Workshop on Software Testing and Test Documentation, pp. 57–69. Fort Lauderdale 1978

  22. Hantler, S.L., King, J.C.: An introduction to proving the correctness of programs. ACM Computer Surveys8(3): 331–353 (1976)

    Google Scholar 

  23. Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. New York: Addison-Wesley 1969

    Google Scholar 

  24. Howden, W.E.: Reliability of the path analysis testing strategy. IEEE Transactions on Software Engineering SE-2(3): 208–214 (1976)

    Google Scholar 

  25. Howden, W.E.: Lindenmayer grammers and symbolic testing. Information Processing L etters7(1): 36–39 (1978)

    Google Scholar 

  26. Howden, W.E.: Algebraic program testing. Acta Informat.10(1): 53–66 (1978)

    Google Scholar 

  27. Howden, W.E.: Functional program testing. IEEE Transactions on Software Engineering SE-6(2): 162–169 (1980)

    Google Scholar 

  28. Kernighan, B.W., Plauger, P.J.: Software tools. New York: Addison-Wesley 1976

    Google Scholar 

  29. Miller, E.F., Melton, R.A.: Automated generation of testcase datasets. In: Proceeding 1975 International Conference on Reliable Software, pp. 51–58. Los Angeles 1975

  30. Ostrand, T.J., Weyuker, E.J.: Remarks on the theory of test data selection. In: Digest of the Workshop on Software Testing and Test Documentation, pp. 1–18. Fort Lauderdale 1978

  31. Rogers, H. Jr.: Theory of recursive functions and effective computability. New York: McGraw-Hill 1967

    Google Scholar 

  32. Rowland, J.H., Davis, P.J.: On the selection of test data for recursive mathematical sub-routines. Siam Journal on Computing10(1): 59–72 (1981)

    Google Scholar 

  33. White, L.J., Cohen, E.I.: A domain strategy for computer program testing. IEEE Transactions on Software Engineering SE-6(3): 247–257 (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Arizona, 85721, Tucson, Arizona, USA

    Timothy A. Budd & Dana Angluin

  2. Department of Computer Science, Yale University, Yale Station, P.O. Box 2158, 06520, New Haven, Ct.

    Dana Angluin

Authors
  1. Timothy A. Budd
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dana Angluin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work of this author was supported in part by the National Science Foundation under grant MCS-8109547

Rights and permissions

Reprints and permissions

About this article

Cite this article

Budd, T.A., Angluin, D. Two notions of correctness and their relation to testing. Acta Informatica 18, 31–45 (1982). https://doi.org/10.1007/BF00625279

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00625279

Keywords

Search

Navigation