Non-termination in unifying theories of programming

Authors:
Walter Guttmann
Affiliations:
Abteilung Programmiermethodik und Compilerbau, Universität Ulm, Ulm, Germany
Venue:
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Year:
2005

Citing 7
Cited 3

Countable nondeterminism and random assignment

Journal of the ACM (JACM)
Relational algebraic semantics of deterministic and nondeterministic programs

Theoretical Computer Science
Termination conventions and comparative semantics

Acta Informatica
A generalization of Dijkstra's calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Semantics of Nondeterministic and Noncontinuous Constructs

Program Construction, International Summer Schoo
Modal design algebra

UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Recasting hoare and he's unifying theory of programs in the context of general correctness

IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods

Lazy relations

RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Lazy UTP

UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Modal design algebra

UTP'06 Proceedings of the First international conference on Unifying Theories of Programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

Within the shape Unifying Theories of Programming framework, program initiation and termination has been modelled by introducing a pair of variables in order to satisfy the required algebraic properties. We replace these variables with the improper value ⊥ that is frequently used to denote undefinedness. Both approaches are proved isomorphic using the relation calculus, and the existing operations and laws are carried over. We split the isomorphism by interposing “intuitive” relations.