Refinement Semantics and Loop Rules

Authors:
Eric C. R. Hehner;Andrew M. Gravell
Affiliations:
-;-
Venue:
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Year:
1999

Citing 6
Cited 4

A simple fixpoint argument without the restriction to continuity

Acta Informatica
A practical theory of programming

A practical theory of programming
Programming from specifications (2nd ed.)

Programming from specifications (2nd ed.)
Predicative semantics of loops

Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi
An axiomatic basis for computer programming

Communications of the ACM
A Discipline of Programming

A Discipline of Programming

Specified Blocks

Verified Software: Theories, Tools, Experiments
Retrospective and prospective for unifying theories of programming

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

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
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

Quantified Score

Hi-index	0.00

Visualization

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.