Skip to main content
SpringerLink
Log in

Verification of programs with higher-order arrays

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

  • 139 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K., Ten years of Hoare Logic: a survey — Part I, ACM Trans. on Progr. Lang. and Systems, 3, 1981.

    Google Scholar 

  2. Constable, R.L., Gries, D., On classes of program schemata, SIAM J. Comput., 1, 1972.

    Google Scholar 

  3. Clarke, E.M., German, S.M., Halpern, J.Y., Effective axiomatizations of Hoare Logics, Journal ACM, 30, 1983.

    Google Scholar 

  4. de Bakker, J., Mathematical theory of program correctness, Prentice-Hall, 1980.

    Google Scholar 

  5. German, S.M., Clarke, E.M., Halpern, J.Y., True relative completeness of an axiom system for the language L-4, Proc. LICS'86.

    Google Scholar 

  6. Kfoury, A.J., Urzyczyn, P., Finitely typed functional programs, Part II, to appear.

    Google Scholar 

  7. Kfoury, A.J., Tiuryn, J., Urzyczyn, P., The hierarchy of simply typed functional programs, to appear Proc. LICS'87

    Google Scholar 

  8. Tiuryn, J., Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs, Proc. MFCS'86.

    Google Scholar 

  9. Tiuryn, J., Urzyczyn, P., Some relationships between logics of programs and complexity theory, Proc. FOCS'83.

    Google Scholar 

  10. Urzyczyn, P., A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programs, Inf. Control, 56, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw, PKiN, 00-901, Warszawa, Poland

    Wojciech Kowalczyk & Paweł Urzyczyn

Authors
  1. Wojciech Kowalczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paweł Urzyczyn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kowalczyk, W., Urzyczyn, P. (1987). Verification of programs with higher-order arrays. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_53

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_53

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation