Skip to main content
Conference ProceedingsOPEN ACCESS

Refinement semantics and loop rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1709 1497-1510
DOI: 10.1007/3-540-48118-4_29
11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Refinement semantics is an alternative to least fixpoint semantics that is more useful for programming. From it we derive a variety of rules for while-loops, for-loops, and loops with intermediate and deep exits. We illustrate the use of these rules with examples.

Cite

CITATION STYLE

APA

Hehner, E. C. R., & Gravell, A. M. (1999). Refinement semantics and loop rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1709, pp. 1497–1510). Springer Verlag. https://doi.org/10.1007/3-540-48118-4_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free