Download:
|
by Klaus-dieter Schewe, Ingrid Wetzel, Joachim W. Schmidt
http://fims-www.massey.ac.nz/~kdschewe/pub/articles/FIDErep30.ps
Add To MetaCart
Abstract:
Database application programs may be considered as good candidates for the application of formal specication methods, because much of the database and transaction semantics can be captured in terms of integrity constraints as well as preand postconditions. Furthermore, the use of current transaction models as units of database state transitions favours the use of Dijkstra's substitutions. Traditional DBMS solutions guarantee database integrity by expensive tests at transaction commit time. In the DAIDA project a dierent approach was taken interpreting database constraints as parts of formal specications and by extracting correct database programs from such specications. Database and transaction constraints are captured by an expressive semantic data model in the style of TAXIS, transformed into Abstract Machines and nally rened into AM versions that are equivalent to programs written in the strongly-typed database programming language DBPL. The work reported in this paper evaluates the DAIDA experience and addresses
Citations
|
993
|
The Z notation: a reference manual
– Spivey
- 1992
|
|
402
|
Assigning meanings to programs
– Floyd
- 1967
|
|
207
|
Telos: Representing Knowledge About Information Systems
– Mylopoulos, Borgida, et al.
- 1990
|
|
132
|
Specification Case Studies
– Hayes
- 1987
|
|
21
|
A software process data model for knowledge engineering in information systems
– Jarke, Jeusfeld, et al.
- 1990
|
|
16
|
A Formal Approach to Large Software Construction
– Abrial
- 1989
|
|
15
|
A Discipline of Programming
– W
- 1976
|
|
11
|
An Initial Algebra Approach to the Speci Correctness, and Implementation of Abstract Data Types
– Goguen, Thatcher, et al.
- 1978
|
|
10
|
A transaction-based approach to relational database specification
– Abiteboul, Vianu
- 1989
|
|
9
|
Support for Data-Intensive Applications
– Borgida, Mylopoulos, et al.
- 1989
|
|
7
|
Understanding Z, A Speci language and its Formal Semantics
– Spivey
- 1988
|
|
6
|
On the Re Calculus
– Morgan, Robinson, et al.
- 1992
|
|
6
|
Structured algebraic speci A kernel language
– Wirsing
- 1986
|
|
6
|
Fundamentals of Algebraic Speci I
– Ehrig, Mahr
- 1985
|
|
3
|
Mahr: Fundamentals of Algebraic Speci vol.1
– Ehrig, B
- 1985
|
|
3
|
Wetzel: Speci and Re in an Integrated Database Application Environment
– Schewe, Schmidt, et al.
- 1991
|
|
2
|
Hehner: The Logic of Programming
– R
- 1984
|
|
2
|
Meghini: Abstract machines revisited, FIDE technical report 1991/11
– Schewe, Schmidt, et al.
|
|
2
|
Object{Oriented Subsystem Speci
– Schuman, Pitt
- 1986
|
|
1
|
The Vienna Development Method VDM: The Meta Language
– Bjrner
- 1978
|
|
1
|
Equational Speci of Partial Higher Order Algebras, in F. L. Bauer et al. (Eds.): Logic of Programming and Calculi of Discrete Design
– Broy
- 1986
|
|
1
|
Abstract Machines, basic concepts
– Abrial
|
|
1
|
Abstract Machines, re theory
– Abrial
|
|
1
|
Abstract Machines, re practice
– Abrial
- 1991
|
|
1
|
Guttag: The Speci and Application to Programming of Abstract Data Types
– V
- 1975
|
|
1
|
et al. (Eds.): Logic of Programming and Calculi of Discrete Design
– Hehner, Gupta, et al.
- 1986
|
|
1
|
Object{Oriented Subsystem Speci in L. Meertens (Ed.): Program Speci and Transformation, The IFIP TC2/WG2.1 Working Conference
– Schuman, Pitt
|
|
1
|
Borgida: Speci and Re of Databases and Transactions
– Wetzel, Schewe, et al.
|
|
1
|
Zilles: Algebraic Speci of Abstract Data Types, Computation Structures Group memo 119
– N
- 1974
|
