Showing papers in "Lecture Notes in Computer Science in 1979"
Journal Article•
TL;DR: In this paper, a unified approach to the presentation of semantics, correctness, and termination in terms of TARSKI's and RIGUET's relational algebra is presented.
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
5 citations