Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs

  • Jerzy Tiuryn
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 233)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BHT82]
    Berman, P., J.Y. Halpern and J. Tiuryn. On the power of nondeterminism in Dynamic Logic. In Proc. 9th ICALP Nielsen,M. and E.M.Schmidt (eds), LNCS 140, Springer-Verlag (1982), pp.48–60.Google Scholar
  2. [BDD80]
    Boehm,H., A.Demers, and J.Donahue. An informal description of Russel. Technical Report TR 80–430, Computer Sci. Dept., Cornell University (1980).Google Scholar
  3. [B84]
    Börger, E. Spectralproblem and completeness of logical decision problems. In Logic and Machines: Decision Problems and Complexity, Proceedings. Börger,E., G.Hasenjaeger and D.Rödding (eds), LNCS 171, Springer-Verlag (1984), pp.333–356.Google Scholar
  4. [BL84]
    Burstall, R. and B. Lampson. A Kernel Language for Abstract Data Types and Modules. In Semantics of Data Types, Proceedings. Kahn,G., D.B.Mac Queen and D.G.Plotkin (eds), LNCS 173, Springer-Verlag (1984), pp.1–50.Google Scholar
  5. [CK73]
    Chang,C.C. and H.J.Keisler. Model Theory. North-Holland Publ. Co., (1973).Google Scholar
  6. [C79]
    Clarke, E.M. Programming Language Constructs for Which It Is Impossible to Obtain Good Hoare Axiom Systems. Journal of ACM 26, 1 (1979), pp.129–147.Google Scholar
  7. [E83]
    Engelfriet,J. Iterated Pushdown Automata and Complexity Classes.Proc. 15th ACM STOC, (1983), pp.365–373.Google Scholar
  8. [HP84]
    Harel, D. and D. Peleg. On Static Logics, Dynamic Logics, and Complexity Classes. Information and Control 60 (1984), pp.86–102.Google Scholar
  9. [H84]
    Hook, J.G. Understanding Russel — a first attempt. In Semantics of Data Types, Proceedings. Kahn,G. D.B.Mac Queen and G.D.Plotkin (eds), LNCS 173, Springer-Verlag (1984), pp.69–85.Google Scholar
  10. [HU79]
    Hopcroft,J.E. and J.D.Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publ. Co. (1979).Google Scholar
  11. [I83]
    Immerman,N. Languages which Capture Complexity Classes. Proc. 15th ACM STOC (1983), pp.347–354.Google Scholar
  12. [KNT86]
    Kowalczyk,W., D.Niwinski, and J.Tiuryn. A generalization of Cook's Auxiliary-Pushdown-Automata Theorem. To appearGoogle Scholar
  13. [M78]
    Milner, R. A theory of type polymorphism. JCSS 17 (1978), pp.348–375.Google Scholar
  14. [N63]
    Naur, P.(ed.) Revised report on the algorithmic language ALGOL 60. Comm. ACM 6, 4 (1963), pp.1–47.Google Scholar
  15. [S52]
    Sholz, H. Ein ungelöstes Problem in der symbolischen Logik. The Journal of Symbolic Logic 17 (1952), p.160.Google Scholar
  16. [ST83]
    Stolboushkin, A.P., and M.A. Taitslin. Deterministic Dynamic Logic is strictly weaker than Dynamic Logic. Information and Control 57 (1983), pp.48–55.Google Scholar
  17. [TU83]
    Tiuryn,J., and P.Urzyczyn. Some relationships between Logics of Programs and Complexity Theory. Proc. 24th IEEE Symp. FOCS (1883), pp.180–184.Google Scholar
  18. [TU84]
    Tiuryn, J., and P. Urzyczyn. Remarks on comparing expressive power of Logics of Programs. In Proc. MFCS 1984. Chytil,M. and V.Koubek (eds), LNCS 176, Springer-Verlag (1984), pp.535–543.Google Scholar
  19. [T84]
    Tiuryn,J. An Introduction to First-Order Programming Logics. Technical Report, CS-84-126, Computer Sci. Dept., Washington State University (1984). To appear in Springer LNCS in 1986.Google Scholar
  20. [T85]
    Tiuryn, J. A simple programming language with data types: Semantics and Verification. In Proc. Logics of Programs Conference 1985. Parikh,R. (ed.), LNCS193, Springer-Verlag (1985), pp.387–405.Google Scholar
  21. [U83]
    Urzyczyn, P. A necessary and sufficient condition in order that a Herbrand Interpretation be expressive relative to recursive programs. Information and Control 56, (1983), pp.212–219.Google Scholar
  22. [USDOD83]
    Reference manual for the Ada programming language. ANSI/MIL-STD 1815A, United States Department of Defense, Washington D.C. (1983).Google Scholar
  23. [vW75]
    van Wijngaarden, A., et.al. Revised report on the algorithmic language ALGOL 68. Acta Informatica 5 (1975), pp.1–236.Google Scholar
  24. [W71]
    Wirth, N. The programming language PASCAL. Acta Informatica 1 (1971), pp.35–63.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Jerzy Tiuryn
    • 1
  1. 1.Institute of MathematicsUniversity of WarsawWarsaw

Personalised recommendations