Skip to main content
SpringerLink
Log in

Investigating programs in terms of partial graphs

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1979)

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

Included in the following conference series:

Abstract

A common feature of most theoretical investigations on semantics, correctness, and termination is a strict distinction between one descriptional tool used for the flow of control of the program and another for single program steps. This paper exhibits a unified approach to the presentation of these concepts in terms of TARSKI's and RIGUET's relational algebra. Partial graphs and programs are introduced and formally manipulable relational notions of semantics, correctness, and termination are obtained.

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. DE BAKKER, J.W., DE ROEVER, W.P.: A calculus for recursive program schemes. In: Nivat, M. (ed.): Automata, languages and programming. Proc. of a Symp. organized by IRIA, 3.–7. Juli 1972, Roequencourt, North-Holland, Amsterdam, 1973, p. 167–196

    Google Scholar 

  2. DE BAKKER, J.W., MEERTENS, L.G.L.T.: On the completeness of the inductive assertion method. J. Comput. Syst. Sci. 11, 323–357 (1975)

    Google Scholar 

  3. COOPER, D.C.: Programs for mechanical program verification. In: Meltzer, B., Michie, D. (eds.): Machine Intelligence 6, Edinburgh Univ. Press, 1971, p. 43–59

    Google Scholar 

  4. DIJKSTRA, E.W.: A simple axiomatic basis for programming language constructs. Indag. math. 36, 1–15 (1974)

    Google Scholar 

  5. DIJKSTRA, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Comm. ACM 18, 453–457 (1975)

    Google Scholar 

  6. GOGUEN, J.A.: On homomorphisms, correctness, termination, unfoldments and equivalence of flow diagram programs. J. Comput. Syst. Sci. 8, 333–365 (1974)

    Google Scholar 

  7. HITCHCOCK, P., PARK, D.: Induction rules and termination proofs. In: Nivat, M. (ed.): Automata, languages and programming. Proc. of a Symp. organized by IRIA, 3.–7. Juli 1972, Rocquencourt, North-Holland, Amsterdam, 1973, p. 225–251

    Google Scholar 

  8. SCHMIDT, G.: Programme als partielle Graphen. Inst. für Informatik der Techn. Univ. München, Habilitationsschrift 1977 und Bericht 7813, 1978

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik der Technischen Universität München, Germany

    Gunther Schmidt

Authors
  1. Gunther Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hermann A. Maurer

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmidt, G. (1979). Investigating programs in terms of partial graphs. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-09510-1_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09510-1

  • Online ISBN: 978-3-540-35168-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation