Formal Aspects of Computing

, Volume 12, Issue 5, pp 372–391

Interfaces for Refining Recursion and Procedures

  • Mark Staples
Original Paper

DOI: 10.1007/s001650070010

Cite this article as:
Staples, M. Form Aspects Comput (2000) 12: 372. doi:10.1007/s001650070010

Abstract.

This paper presents novel definitions of interfaced recursion blocks, interfaced procedures, and interfaced recursive procedures for the Refinement Calculus. These definitions allow step-wise refinement rules to be formally stated and proved for these constructs. An interface is associated with a (recursive) call by preceding the body of the implementation by an assertion statement which says that the interface refines to the implementation. An interface will typically be a specification statement, but in principle can be any command. The theory and rules presented in this paper have been mechanised in the theorem prover Isabelle/ZF.

Keywords: Interfaces; Procedures; Recursion; Refinement; Refinement Tools 

Copyright information

© BCS 2000

Authors and Affiliations

  • Mark Staples
    • 1
  1. 1.University of Cambridge Computer Laboratory, Cambridge, UKGB