Verification of programs with higher-order arrays

  • Wojciech Kowalczyk
  • Paweł Urzyczyn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A]
    Apt, K., Ten years of Hoare Logic: a survey — Part I, ACM Trans. on Progr. Lang. and Systems, 3, 1981.Google Scholar
  2. [CG]
    Constable, R.L., Gries, D., On classes of program schemata, SIAM J. Comput., 1, 1972.Google Scholar
  3. [CGH]
    Clarke, E.M., German, S.M., Halpern, J.Y., Effective axiomatizations of Hoare Logics, Journal ACM, 30, 1983.Google Scholar
  4. [dB]
    de Bakker, J., Mathematical theory of program correctness, Prentice-Hall, 1980.Google Scholar
  5. [GCH]
    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. [KU]
    Kfoury, A.J., Urzyczyn, P., Finitely typed functional programs, Part II, to appear.Google Scholar
  7. [KTU]
    Kfoury, A.J., Tiuryn, J., Urzyczyn, P., The hierarchy of simply typed functional programs, to appear Proc. LICS'87 Google Scholar
  8. [T]
    Tiuryn, J., Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs, Proc. MFCS'86.Google Scholar
  9. [TU]
    Tiuryn, J., Urzyczyn, P., Some relationships between logics of programs and complexity theory, Proc. FOCS'83.Google Scholar
  10. [U]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Wojciech Kowalczyk
    • 1
  • Paweł Urzyczyn
    • 1
  1. 1.Institute of MathematicsUniversity of WarsawWarszawaPoland

Personalised recommendations