Advertisement

Simple Refinement

  • John Derrick
  • Eerke Boiten
Part of the Formal Approaches to Computing and Information Technology book series (FACIT)

Abstract

We use the term simple refinement to describe refinements of operations (and collections of operations) where the state schema does not change. These rules apply to ADTs (as introduced in Chapter 1), and some even apply to “concrete” data types, which we will call repertoires.

Keywords

State Space Binary Relation State Schema League Table Concrete State 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2001

Authors and Affiliations

  • John Derrick
    • 1
  • Eerke Boiten
    • 1
  1. 1.Computing LaboratoryUniversity of Kent at CanterburyCanterbury, KentUK

Personalised recommendations