A Technique for Modular Logic Program Refinement

  • Authors:
  • Robert Colvin;Ian J. Hayes;Paul A. Strooper

  • Affiliations:
  • -;-;-

  • Venue:
  • LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

A refinement calculus provides a method for transforming specifications to executable code, maintaining the correctness of the code with respect to its specification. In this paper we introduce modules into a logic programming refinement calculus. Modules allow data types to be grouped together with sets of procedures that manipulate the data types. By placing restrictions on the way a program uses a module, we develop a technique for refining the module so that it uses a more efficient representation of the data type.