A Logic for Schema-Based Program Development

Abstract.We show how a theory of specification refinement and program development can be constructed as a conservative extension of our existing logic for Z. The resulting system can be set up as a development method for a Z-like specification language, or as a generalisation of a refinement calculus (with a novel semantics). In addition to the technical development we illustrate how the theory can be used in practice.

[1]  Martin C. Henson,et al.  Revising Z: Part I – logic and semantics , 1999, Formal Aspects of Computing.

[2]  Steve King.  Z and the Refinement Calculus , 1990, VDM Europe.

[3]  Jim Woodcock,et al.  ZRC – A Refinement Calculus for Z , 1998, Formal Aspects of Computing.

[4]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[5]  Kai Engelhardt,et al.  Data Refinement: Model-Oriented Proof Methods and their Comparison , 1998 .

[6]  Ana Cavalcanti.  A refinement calculus for Z , 1997 .

[7]  Jim Woodcock,et al.  Using Z - specification, refinement, and proof , 1996, Prentice Hall international series in computer science.

[8]  Martin C. Henson,et al.  Revising Z: Part II – logical development , 1999, Formal Aspects of Computing.

[9]  Carroll Morgan,et al.  Programming from specifications , 1990, Prentice Hall International Series in computer science.

[10]  Per Martin-Löf,et al.  Constructive mathematics and computer programming , 1984 .

[11]  Martin C. Henson,et al.  Investigating Z , 2000, J. Log. Comput..

[12]  Martin C. Henson,et al.  New foundations for Z , 1998 .

[13]  S. M. Brien,et al.  W: A Logic for Z , 1991, Z User Workshop.