Comparing approaches to data reification | SpringerLink
Skip to main content
Springer Nature Link
Log in

Comparing approaches to data reification

  • Papers
  • Conference paper
  • First Online:
FME '94: Industrial Benefit of Formal Methods (FME 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 873))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • Boyer, R. S., & Moore, J. S. The sharing of structure in theorem-proving programs. In Machine Intelligence. 7, pages 101–116. Edinburgh University Press. 1972.

    Google Scholar 

  • Broy, M. Extensional Behaviour of Concurrent, Nondeterministic, Communicating Systems. In Control Flow and Data Flow: Concepts of Distributed Programming, pages 229–276. Springer-Verlag. 1985.

    Google Scholar 

  • Clement, T. Combining transformation and posit-and-prove in a VDM development. In VDM'91: Formal Software Development Methods. Lecture Notes in Computer Science, 551, pages 63–92. Springer Verlag. 1991.

    Google Scholar 

  • Clement, T. The Role of Data Reification in Program Refinement. Computer Journal, 35 (1992): 451–459.

    Google Scholar 

  • Clement, T. Notes on data reification. In FME'93 tutorial material, pages 151–190.

    Google Scholar 

  • Hoare, C. A. R. Preface. In VDM'90 — VDM and Z. Lecture Notes in Computer Science, 428, pages vii-x. Springer Verlag. 1990.

    Google Scholar 

  • Jones, C. B. VDM Proof Obligations and their Justification. In VDM'87 — A Formal Method at Work. Lecture Notes in Computer Science, 252, pages 260–286. Springer-Verlag. 1987.

    Google Scholar 

  • Jones, C. B. Systematic Software Development Using VDM. 2nd edn. Prentice-Hall International. 1990.

    Google Scholar 

  • Manna, Z., & Waldinger, R. Deductive Synthesis of the Unification Algorithm. Science, of Computer Programming, 1 (1981):5–48.

    Google Scholar 

  • Morgan, C. C., & Gardiner, P. H. B. Data Refinement by Calculation. Acta Information, 27 (1990):481–503.

    Google Scholar 

  • Spivey, J. M. Unification: a case study in theory development and verified refinement. Formal Aspects of Computing, to appear 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Manchester, M13 9PL, Manchester

    T. Clement

Authors
  1. T. Clement
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maurice Naftalin Tim Denvir Miquel Bertran

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clement, T. (1994). Comparing approaches to data reification. In: Naftalin, M., Denvir, T., Bertran, M. (eds) FME '94: Industrial Benefit of Formal Methods. FME 1994. Lecture Notes in Computer Science, vol 873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58555-9_92

Download citation

  • DOI: https://doi.org/10.1007/3-540-58555-9_92

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58555-8

  • Online ISBN: 978-3-540-49031-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics