Skip navigation
Skip navigation

Procedures and invariants in the refinement calculus

Vickers, Trevor; Morgan, Carroll

Description

Invariants allow a rigorous treatment of types as sets in the refinement calculus, a method for developing imperative programs. The interaction of procedures and invariants is explored, resulting in a practical formalisation of existing programming practice.

CollectionsANU Research Publications
Date published: 1994
Type: Working/Technical Paper
URI: http://hdl.handle.net/1885/40782
http://digitalcollections.anu.edu.au/handle/1885/40782

Download

File Description SizeFormat Image
TR-CS-94-04.pdf172.86 kBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  27 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator