The applicability of program schema results to programs | International Journal of Parallel Programming Skip to main content
Springer Nature Link
Log in

The applicability of program schema results to programs

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

Several classes of programs, which are the analogues of previously investigated classes of program schemas, are defined. Decidability and translatability questions are considered for these classes of programs, as well as the applicability of these results to the theories of optimization and program testing. The usefulness of the schema model is studied by considering the inheritability of schema properties by programs, and conversely, the inheritability of program properties by schemas.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. B. Goodenough and S. L. Gerhart, “Towards a Theory of Testing: Data Selection Criteria,” inCurrent Trends in Programming Methodology, Vol. II, R. T. Yeh, ed. (Prentice Hall, Englewood Cliffs, New Jersey, 1977), pp. 44–79.

    Google Scholar 

  2. J. E. Hopcroft and J. D. Ullman,Formal Languages and Their Relation to Automata (Addison-Wesley, Reading, Massachusetts, 1969).

    Google Scholar 

  3. J. C. Huang, “Error Detection Through Program Testing,” inCurrent Trends in Programming Methodology, Vol, II, R. T. Yeh, ed. (Prentice Hall, Englewood Cliffs, New Jersey, 1977), pp. 16–43.

    Google Scholar 

  4. D. C. Luckham, D. M. Park, and M. S. Paterson, “On formalized computer programs,”J. Comput. Syst. Sci. 4:220–249 (1970).

    Google Scholar 

  5. M. S. Paterson, “Equivalence Problems in a Model of Computation,” Ph.D. thesis, University of Cambridge, Cambridge, England (August 1967).

    Google Scholar 

  6. E. J. Weyuker, “Translatability and decidability questions for restricted classes of program schemas,”SIAM J. Comput. 8 (1979).

  7. E. J. Weyuker, “Program Schemas with Semantic Restrictions,” Ph.D. thesis, Department of Computer Science Technical Report DCS-TR-60, Rutgers University, New Brunswick, New Jersey (June 1977).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, New York

    Elaine J. Weyuker

Authors
  1. Elaine J. Weyuker
    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

Weyuker, E.J. The applicability of program schema results to programs. International Journal of Computer and Information Sciences 8, 387–403 (1979). https://doi.org/10.1007/BF00995175

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation