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.
Cite
CITATION STYLE
Schmidt, G. (1979). Investigating programs in terms of partial graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 71 LNCS, pp. 505–519). Springer Verlag. https://doi.org/10.1007/3-540-09510-1_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
