Skip to main content

Aspects of programs with finite modes

  • Conference paper
  • First Online:
Foundations of Computation Theory (FCT 1983)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt, G.D. Plotkin: A Cook's Tour of Countable Nondeterminism. In: S. Even, O. Kariv: Autom. Lang. Progr., 8th Coll., Acre, July 1981. Springer LNCS 115, 479–494 (1981)

    Google Scholar 

  2. J.W. de Bakker, J.W. Klop, J.J.Ch. Meyer: Correctness of Programs with Function Procedures. In: D. Kozen (ed.): Logics of Programs. Springer LNCS 131, 94–112 (1982)

    Google Scholar 

  3. J.R. Büchi: Regular Canonical Systems. Arch. math. Logik Grundlagenforsch. 6, 91–111 (1964)

    Google Scholar 

  4. E.M. Clarke, S.M. German, J.Y. Halpern: Effective Axiomatizations of Hoare Logics. Manuscript (1981); will appear in JACM

    Google Scholar 

  5. S.A. Cook: Soundness and Completeness of an Axiomatic System for Program Verification. SIAM J. Comput. 7, 70–90 (1978)

    Google Scholar 

  6. W. Damm: The IO-and OI-hierarchies. TCS 20, 95–207 (1982)

    Google Scholar 

  7. W. Damm, B. Josko: A Sound and Relatively* Complete Hoare-Logic for a Language with Higher Type Procedures. Schriften Informatik Angew. Math. 77 (1982)

    Google Scholar 

  8. S. Ginsburg, S.A. Greibach, M.A. Harrison: Stack Automata and Compiling. JACM 14, 172–201 (1967)

    Google Scholar 

  9. D. Harel: First-Order Dynamic Logic. Springer LNCS 68 (1979)

    Google Scholar 

  10. Ch. Crasemann: Darstellung und Transformation ALGOL-artiger Programmiersprachen mit endlichen Prozedurarten. Diplomarbeit, Kiel (1981)

    Google Scholar 

  11. H. Langmaack: On Termination Problems for Finitely Interpreted ALGOL-like Programs. Acta Informatica 18, 79–108 (1982)

    Google Scholar 

  12. H. Langmaack, E.R. Olderog: Present-day Hoare-like Systems for Programming Languages with Procedures: Power, Limits and most likely Extensions. In: J.W. de Bakker, J. van Leeuwen: Proceed. Autom. Lang. Progr., 7th Coll., Noordwijkerhout, July 1980. Springer LNCS 85, 363–373 (1980)

    Google Scholar 

  13. R.J. Lipton: A Necessary and Sufficient Condition for the Existence of Hoare Logics. In: 18th Symp. Found. Computer Sci., Ed. IEEE Comp. Soc., IEEE 77 CH 1278-1C, 1–6 (1977)

    Google Scholar 

  14. M. Nivat: Non-Deterministic Programs: An Algebraic overview. In: S. H. Lavington (ed.): Inform. Proc. 80. North-Holland 17–28 (1980)

    Google Scholar 

  15. E.R. Olderog: Sound and Complete Hoare-like Calculi Based on Copy Rules. Acta Informatica 16, 161–197 (1981)

    Article  Google Scholar 

  16. E.R. Olderog: Correctness of Programs with PASCAL-like Procedures without global Variables. Inst. Inform. Prakt. Math. Bericht 8110 (1981); will appear in TCS

    Google Scholar 

  17. A. van Wijngaarden et al. (ed.): Revised Report on the Algorithmic Language ALGOL68. Acta Informatica 5, 1–236 (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Langmaack, H. (1983). Aspects of programs with finite modes. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_108

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_108

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics