Abstract
This paper defines a congruence relation on Gamma programs. Based on this congruence relation, laws for transforming programs are derived. We define an axiomatic semantics for Gamma based on Brookes' transition assertions. The definition of the congruence is in terms of provable satisfiability of such assertions. We consider the relationship between our congruence and other orderings that have been proposed in the literature.
Cite
CITATION STYLE
Errington, L., Hankin, C., & Jensen, T. (1993). A congruence for gamma programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 724 LNCS, pp. 242–253). Springer Verlag. https://doi.org/10.1007/3-540-57264-3_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
