Abstract
Achieving wide acceptance of formal methods in software development requires a smooth integration with requirements analysis, design and implementation. Especially for database application systems there exist well-known approaches to conceptual modeling as well as a sophisticated implementation technology on the basis of database programming languagues. The work described in this paper is based on a scenario, where the B method is coupled with a conceptual modeling language TDL and a database programming language DBPL. Both these languages can be represented in B. We concentrate on the problem of characterizing those B specifications that are sufficiently refined in order to be transformed into equivalent DBPL programs. This gives rise to some kind of implementability proof obligation.
Moreover, we show that the transformation itself can be regarded as a term rewriting task based on a representation by term algebras of the languages involved. For this task we exploit order-sorted algebra by using the OBJ system.
This work has been supported in part by research grants from the E.E.C. Basic Research Action 3070 FIDE: “Formally Integrated Data Environments”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. R. Abrial: A Formal Approach to Large Software Construction, in J.L.A. van de Snepscheut (Ed.): Mathematics of Program Construction, Proc. Int. Conf. Groningen, The Netherlands, June 89, Springer LNCS 375, 1989
A. Borgida, J. Mylopoulos, J. W. Schmidt, I. Wetzel: Support for Data-Intensive Applications: Conceptual Design and Software Development, Proc. of the 2nd Workshop on Database Programming Languages, Salishan Lodge, Oregon, June 1989
E. W. Dijkstra, C. S. Scholten: Predicate Calculus and Program Semantics, Springer-Verlag, 1989
J. A. Goguen, T. Winkler: Introducing OBJ3, SRI International, Technical Report, August 1988
T. Günther: Charakterisierung und Transformation in DBPL implementierbarer Abstrakter Maschinen (in German), Master Thesis, University of Hamburg, August 1992
R. Hull, R. King: Semantic Database Modeling: Survey, Applications and Research Issues, ACM Computing Surveys, vol. 19(3), September 1987
M. Jarke, J. Mylopoulos, J. W. Schmidt. Y. Vassiliou: DAIDA: An Environment for Evolving Information Systems, ACM ToIS, vol. 10 (1), January 1992, pp. 1–50
C. B. Jones: Systematic Software Development using VDM, Prentice-Hall International, London 1986
F. Matthes, J. W. Schmidt: DBPL Rationale and Report, FIDE technical report, 1992
J. Mylopoulos, P. A. Bernstein, H. K. T. Wong: A Language Facility for Designing Interactive Database-Intensive Applications, ACM ToDS, vol. 5 (2), April 1980, pp. 185–207
G. Nelson: A Generalization of Dijkstra's Calculus, ACM TOPLAS, vol. 11 (4), October 1989, pp. 517–561
K.-D. Schewe, J. W. Schmidt, I. Wetzel, N. Bidoit, D. Castelli, C. Meghini: Abstract Machines Revisited, FIDE technical report 1991/11
K.-D. Schewe, J. W. Schmidt, I. Wetzel: Specification and Refinement in an Integrated Database Application Environment, in S. Prehn, H. Toetenel (Eds.): Proc. VDM 91, Noordwijkerhout, October 1991, Springer LNCS
J. M. Spivey: Understanding Z, A Specification language and its Formal Semantics, Cambridge University Press, 1988
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Günther, T., Schewe, KD., Wetzel, I. (1993). On the derivation of executable database programs from formal specifications. In: Woodcock, J.C.P., Larsen, P.G. (eds) FME '93: Industrial-Strength Formal Methods. FME 1993. Lecture Notes in Computer Science, vol 670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024656
Download citation
DOI: https://doi.org/10.1007/BFb0024656
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56662-5
Online ISBN: 978-3-540-47623-8
eBook Packages: Springer Book Archive