Comparing Approaches to Data Reification

We compare the standard Vienna method for establishing the correctness of a data reification with an alternative approach which is looser in its proof obligations. This is done by comparing the effort required to prove rigorously that a reification arising in the development of a unification algorithm is correct. We then generalize from this experience to identify two strategies for constructing reification proofs which are economical and well-structured.

[1]  Hans Toetenel,et al.  VDM'91 Formal Software Development Methods , 1991, Lecture Notes in Computer Science.

[2]  Cliff B. Jones,et al.  Systematic software development using VDM (2. ed.) , 1990, Prentice Hall International Series in Computer Science.

[3]  Cliff B. Jones,et al.  VDM Proof Obligations and their Justification , 1987, VDM Europe.

[4]  M. Broy,et al.  Extensional behaviour of concurrent, nondeterministic, communicating systems , 1986 .

[5]  T. Clement,et al.  The Role of Data Reification in Program Refinement: Origins, Synthesis and Appraisal , 1992, Comput. J..

[6]  Tim Clement.  Combining Transformation and Posit-and Prove in a VDM Development , 1991, VDM Europe.

[7]  Zohar Manna,et al.  Deductive Synthesis of the Unification Algorithm , 1981, Sci. Comput. Program..

[8]  Cliff B. Jones,et al.  Systematic software development using VDM , 1986, Prentice Hall International Series in Computer Science.