Skip to main content
SpringerLink
Log in

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

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

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

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. 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. 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. 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. 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. Chang,C.C. and H.J.Keisler. Model Theory. North-Holland Publ. Co., (1973).

    Google Scholar 

  6. 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. Engelfriet,J. Iterated Pushdown Automata and Complexity Classes.Proc. 15th ACM STOC, (1983), pp.365–373.

    Google Scholar 

  8. Harel, D. and D. Peleg. On Static Logics, Dynamic Logics, and Complexity Classes. Information and Control 60 (1984), pp.86–102.

    Google Scholar 

  9. 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. Hopcroft,J.E. and J.D.Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publ. Co. (1979).

    Google Scholar 

  11. Immerman,N. Languages which Capture Complexity Classes. Proc. 15th ACM STOC (1983), pp.347–354.

    Google Scholar 

  12. Kowalczyk,W., D.Niwinski, and J.Tiuryn. A generalization of Cook's Auxiliary-Pushdown-Automata Theorem. To appear

    Google Scholar 

  13. Milner, R. A theory of type polymorphism. JCSS 17 (1978), pp.348–375.

    Google Scholar 

  14. Naur, P.(ed.) Revised report on the algorithmic language ALGOL 60. Comm. ACM 6, 4 (1963), pp.1–47.

    Google Scholar 

  15. Sholz, H. Ein ungelöstes Problem in der symbolischen Logik. The Journal of Symbolic Logic 17 (1952), p.160.

    Google Scholar 

  16. 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. 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. 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. 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. 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. 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. Reference manual for the Ada programming language. ANSI/MIL-STD 1815A, United States Department of Defense, Washington D.C. (1983).

    Google Scholar 

  23. van Wijngaarden, A., et.al. Revised report on the algorithmic language ALGOL 68. Acta Informatica 5 (1975), pp.1–236.

    Google Scholar 

  24. Wirth, N. The programming language PASCAL. Acta Informatica 1 (1971), pp.35–63.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw, PKIN 9p, PL-00-901, Warsaw

    Jerzy Tiuryn

Authors
  1. Jerzy Tiuryn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tiuryn, J. (1986). Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016242

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation