Refinement Calculus for Logic Programs
Contributors:
Ian Hayes, Paul Strooper, Ray Nickson (Victoria University of Wellington), Robert Colvin, David Hemer, Richard Hagen and Chris Hunter.
Two promising developments in addressing the problem of assuring software
correctness are: refinement calculi, which allow the derivation of a program
by sequence of correctness preserving steps; and logic programming languages,
which lead to a smaller conceptual gap between a problem and its solution
when compared with procedural languages. This project is bringing these
two areas of research together by developing a refinement calculus for
logic programming languages.