Advertisement

Investigating programs in terms of partial graphs

  • Gunther Schmidt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)

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.

Keywords

Relational Algebra Flow Graph Computation Sequence Total Correctness Partial Correctness 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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–196Google Scholar
  2. [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. [3]
    COOPER, D.C.: Programs for mechanical program verification. In: Meltzer, B., Michie, D. (eds.): Machine Intelligence 6, Edinburgh Univ. Press, 1971, p. 43–59Google Scholar
  4. [4]
    DIJKSTRA, E.W.: A simple axiomatic basis for programming language constructs. Indag. math. 36, 1–15 (1974)Google Scholar
  5. [5]
    DIJKSTRA, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Comm. ACM 18, 453–457 (1975)Google Scholar
  6. [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. [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–251Google Scholar
  8. [8]
    SCHMIDT, G.: Programme als partielle Graphen. Inst. für Informatik der Techn. Univ. München, Habilitationsschrift 1977 und Bericht 7813, 1978Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Gunther Schmidt
    • 1
  1. 1.Institut für Informatik der Technischen Universität MünchenGermany

Personalised recommendations