Aspects of programs with finite modes

  • H. Langmaack
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)


Mode Level Result Mode Proof Tree Finite Mode Springer LNCS 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AP]
    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. [dBCM]
    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. [Bü]
    J.R. Büchi: Regular Canonical Systems. Arch. math. Logik Grundlagenforsch. 6, 91–111 (1964)Google Scholar
  4. [CGH]
    E.M. Clarke, S.M. German, J.Y. Halpern: Effective Axiomatizations of Hoare Logics. Manuscript (1981); will appear in JACMGoogle Scholar
  5. [Co]
    S.A. Cook: Soundness and Completeness of an Axiomatic System for Program Verification. SIAM J. Comput. 7, 70–90 (1978)Google Scholar
  6. [Da]
    W. Damm: The IO-and OI-hierarchies. TCS 20, 95–207 (1982)Google Scholar
  7. [DJ]
    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. [GGH]
    S. Ginsburg, S.A. Greibach, M.A. Harrison: Stack Automata and Compiling. JACM 14, 172–201 (1967)Google Scholar
  9. [Ha]
    D. Harel: First-Order Dynamic Logic. Springer LNCS 68 (1979)Google Scholar
  10. [Cr]
    Ch. Crasemann: Darstellung und Transformation ALGOL-artiger Programmiersprachen mit endlichen Prozedurarten. Diplomarbeit, Kiel (1981)Google Scholar
  11. [La]
    H. Langmaack: On Termination Problems for Finitely Interpreted ALGOL-like Programs. Acta Informatica 18, 79–108 (1982)Google Scholar
  12. [LO]
    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. [Li]
    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. [Ni]
    M. Nivat: Non-Deterministic Programs: An Algebraic overview. In: S. H. Lavington (ed.): Inform. Proc. 80. North-Holland 17–28 (1980)Google Scholar
  15. [Ol1]
    E.R. Olderog: Sound and Complete Hoare-like Calculi Based on Copy Rules. Acta Informatica 16, 161–197 (1981)CrossRefGoogle Scholar
  16. [Ol2]
    E.R. Olderog: Correctness of Programs with PASCAL-like Procedures without global Variables. Inst. Inform. Prakt. Math. Bericht 8110 (1981); will appear in TCSGoogle Scholar
  17. [vW]
    A. van Wijngaarden et al. (ed.): Revised Report on the Algorithmic Language ALGOL68. Acta Informatica 5, 1–236 (1975)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • H. Langmaack
    • 1
  1. 1.Institut für Informatik u. Praktische MathematikChristian-Albrechts-Universität KielKiel

Personalised recommendations