Skip to main content
SpringerLink
Log in

Semantic decomposition of computer programs: An aid to program testing

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Semantic decomposition results in a hierarchy of partitions which are small enough to be easily understood, and large enough to be meaningful to a program tester. Each partition results in the elimination of at least one local variable from consideration during error analysis, which further simplifies the testing process. Semantic decomposition reduces the complexity of the testing process, enhances the understandability of the program for the tester, and thus abstracts a program to a higher level. The decomposition yields a plan for hierarchical testing which, if followed conscientiously, should result in faster and more thorough testing for large or poorly structured programs. By reorganizing poorly structured programs into the modules indicated by semantic decomposition, an improved source level representation of the programs may be obtained.

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. Allen, F.E.: Control flow analysis. SIGPLAN Notices 5, 1–19 (1970)

    Google Scholar 

  2. Bayer, R.: On program volume and program modularization. Technical Report CSD-TR-105, Purdue University 1973

  3. Boehm, E.W.: Software and its impact: A quantitative assessment. Datamation I9, 48–59 (1973)

    Google Scholar 

  4. Bulut, N., Halstead, M.H.: Impurities found in algorithm implementations. SIGPLAN Notices 9, 9–12 (1974)

    Google Scholar 

  5. Cocke, J., Schwartz, J.T.: Programming languages and their compilers. Courant Institute, New York University 1970

  6. Dahl, O.-J., Dijkstra, E.W., Hoare, C.A.R.: Structured programming. New York/London, Academic Press 1972

    Google Scholar 

  7. Dijkstra, E.W.: The structure of “THE”—Multiprogramming system. Comm. ACM II, 341–346 (1968)

    Google Scholar 

  8. Donaldson, F.W.: Programmer evaluation. 1967, unpublished, reported in M. H. Halstead: Language selection for applications. Proc. AFIPS 1973 NCC 42. Montvale (N. J.): AFIPS-Press 1973, p. 211–214

  9. Florentin, J.J.: Flow analysis for program correctness. Research Report CSRR-2054, University of Waterloo, 1970

  10. Halstead, M.H.: Natural laws · controlling algorithm Structure? SIGPLAN Notices 7: 2 19–26 (1972)

    Google Scholar 

  11. Halstead, M.H., Bayer, R.: Algorithm dynamics. Proc. ACM National Conference 1973, p. 126–135

  12. Hetzel, W.C. (ed.): Program test methods. Englewood Cliffs (N.J.): Prentice-Hall 1973

    Google Scholar 

  13. Lowe, T.C.: Automatic segmentation of cyclic program structures based on connectivity and processor timing. Comm. ACM 13, 3–9 (1970)

    Google Scholar 

  14. Mills, H.D.: Mathematical foundations for structured programming. IBM Federal Systems Division, Report FSC 72-6012, 1972

  15. Ramamoorthy, C.V.: The analytic design of a dynamic look-ahead and program segmenting scheme for multiprogrammed computers. Proc. ACM National Conference 1966, p. 229–239

  16. Rubey, R. J.: A comparative evaluation of PL/I. Datamation I4, 22–25 (1968)

    Google Scholar 

  17. Schaefer, M.: A mathematical theory of global program optimization. Englewood Cliffs (N. J.): Prentice-Hall 1973

    Google Scholar 

  18. Ver Hoef, E.W.: Automatic program segmentation based on Boolean Connectivity. Proc. EFIPS 1971 SJCC 38. Montvale (N. J.): AFIPS-Press 1971, p. 491–495

  19. Zislis, P.M.: Semantic decomposition of computer programs: A program test aid. Ph. D. Thesis, Purdue University, 1974

Download references

Author information

Author notes

  1. Paul M. Zislis

    Present address: Bell Laboratories, 60540, Naperville, Illinois, USA

Authors and Affiliations

  1. Computer Sciences Department, Purdue University, 47907, Lafayette, Indiana, USA

    Paul M. Zislis

Authors
  1. Paul M. Zislis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zislis, P.M. Semantic decomposition of computer programs: An aid to program testing. Acta Informatica 4, 245–269 (1975). https://doi.org/10.1007/BF00288729

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation