Abstract
This paper reports on an exercise to study how a typical fundamental property of a development technique, viz. transitivity of data-reification in VDM, is formally derived as a property of a method formalization in a meta-calculus, viz. DEVA. To this end, an existing DEVA-formalization of the VDM-reification has been generalized such that its axiom set becomes independent from the number of reification steps performed. This generalized formalization allows to prove transitivity of reification. The formalization and the transitivity proof are performed completely inside DEVA.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Literature
N.G. de Bruijn, A Survey of the Project AUTOMATH. In: J.P. Seldin and J.R. Hindley (eds), To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism, p.589–606, Academic Press, 1980.
R. Gabriel (ed.), ESPRIT Project ToolUse, Final Report of the Deva Support Task: Retrospective and Manuals, Arbeitspapiere der GMD, no.425, GMD Karlsruhe, 1990.
Ph. de Groote, Définition et Properiéetés d'un métacalcul de répresentation de théories, Thèse d'Etat, Université Catholique de Louvain, Belgium 1990.
R. Harper, F.A. Honsell, and G. Plotkin. A Framework for Defining Logics. Proceedings of the 2nd Symposium on Logic in Computer Science, p. 194–204, IEEE, 1986.
C. Lafontaine, Formalization of the VDM Reification in the DEVA Meta Calculus. The Human-Leucocyte-Antigen case study. In: M. Broy and C.B. Jones (editors), Programming Concepts and Methods, p.333–368, North-Holland, 1990.
R.P. Nederpelt, An Approach to Theorem Proving on the Basis of a Typed Lambda Calculus, LNCS 87, p.181–190, Springer, 1980.
M. Sintzoff, M. Weber, Ph. de Groote, J. Cazin, Definition 1.1 of the Generic Development Language Deva. ToolUse-project, Research report, Unité d'Informatique, Université Catholique de Louvain, Belgium, 1989.
M. Weber, Formalization of the Bird-Meertens Algorithmic Calculus in the DEVA Meta-Calculus, In: M. Broy and C.B. Jones (editors), Programming Concepts and Methods, p.201–232, North-Holland, 1990.
M. Weber, A Meta-Calculus for Formal System Development, doctoral thesis, Oldenburg press Vol.195, München-Wien 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weber, M. (1991). Deriving transitivity of VDM-reification in DEVA. In: Prehn, S., Toetenel, W.J. (eds) VDM'91 Formal Software Development Methods. VDM 1991. Lecture Notes in Computer Science, vol 551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54834-3_25
Download citation
DOI: https://doi.org/10.1007/3-540-54834-3_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54834-8
Online ISBN: 978-3-540-46449-5
eBook Packages: Springer Book Archive