Automatic maintenance of association invariants

Welch, James; Faitelson, David; Davies, Jim

doi:10.1007/s10270-008-0085-0

Cited by 7 publications

(6 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For specific domains or constraints better automation can be achieved, e.g., when maintaining association invariants. [18] Therefore only trading in flexibility for a higher degree of automation will pave the way for adopting rigorous methods in model based engineering.…”

Section: Discussionmentioning

confidence: 99%

Class Diagrams with Equated Association Chains

Feinerer¹,

Salzer²,

Sisel³

2013

2013 International Symposium on Theoretical Aspects of Software Engineering

View full text Add to dashboard Cite

We investigate properties of class diagrams with multiplicity constraints -as they appear e.g. in model-based engineering or database design -augmented by equational constraints on association chains. Constraints are typically used to generate additional code that throws an exception when a constraint is violated during run-time. Our aim is different: We develop methods to check already at modelling time whether all constraints can be satisfied, to provide suitable user feedback, and to compute optimal instances of the model. In this paper we extend our approach by a family of constraints that has proven relevant in practice, namely equations between chains of associations. Such equational constraints are necessary if we want to specify that the objects reachable via one chain of associations should in fact be the same as reachable via another one.

show abstract

Section: Discussionmentioning

confidence: 99%

Class Diagrams with Equated Association Chains

Feinerer¹,

Salzer²,

Sisel³

2013

2013 International Symposium on Theoretical Aspects of Software Engineering

View full text Add to dashboard Cite

show abstract

“…Booster is a data modeling language, described in [46,47] and [162], based on elements of the Abstract Machine Notation (AMN) of the B-method and the Refinement Calculus [114]. The approach aims at automatically generating complete and working object database implementations, sequentially accessed through queries and transactional updates.…”

Section: A Brief Overview Of Boostermentioning

confidence: 99%

“…A Class has a list of attributes, associations and methods. associations in Booster are normally bidirectional [162]: an explicit association in one direction creates an implicit association in the other. methods are defined in terms of preconditions, postconditions, and change-lists.…”

Section: A Brief Overview Of Boostermentioning

confidence: 99%

Model-Driven Data Migration

Aboulsamh

Crichton

Davies

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Information systems often hold data of considerable value. Their continuing development or maintenance will often necessitate evolution of the system and migration of the data from one version to the next: a process that may be expensive, time-consuming, and prone to error. That such a process remains a source of challenges, is recognised by both academia and industry. In current practice, data migration is often considered only in the later stages of development, leaving critical data to be transformed and loaded by hand-written scripts, long after the design process has been completed.The advent of model-driven engineering offers an opportunity to consider the question of information system evolution and data migration earlier in the development process. A precise account of the proposed changes to an existing system model can be used to predict the consequences for existing data, and to generate the necessary data migration implementation.This dissertation shows how automatic data migration can be achieved by extending the definition of a data modeling language to include modellevel operations, each of which corresponds to the addition, modification, or deletion of a model component. Using the Unified Modeling Language (UML) notation as an example, we show how the specification of these operations may be translated into an abstract program in the Abstract Machine Notation (AMN), employed in the B-method, and then formally checked for consistency and applicability prior to translation into a concrete programming notation, such as Structured Query Language (SQL).

show abstract

“…The modelling language employed has the familiar, structural features of object notations such as UML-classes, attributes, and associations-but uses logical predicates to characterise operations. An initial stage of transformation replaces these predicates with guarded commands that are guaranteed to satisfy the specified constraints: see, for example, [24]. The focus here is upon the subsequent generation of executable code, and the means by which we may prove that this generation process is correct.…”

Section: Introductionmentioning

confidence: 99%

Formal Model-Driven Engineering: Generating Data and Behavioural Components

Wang

Davies

2012

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Model-driven engineering is the automatic production of software artefacts from abstract models of structure and functionality. By targeting a specific class of system, it is possible to automate aspects of the development process, using model transformations and code generators that encode domain knowledge and implementation strategies. Using this approach, questions of correctness for a complex, software system may be answered through analysis of abstract models of lower complexity, under the assumption that the transformations and generators employed are themselves correct. This paper shows how formal techniques can be used to establish the correctness of model transformations used in the generation of software components from precise object models. The source language is based upon existing, formal techniques; the target language is the widely-used SQL notation for database programming. Correctness is established by giving comparable, relational semantics to both languages, and checking that the transformations are semantics-preserving

show abstract

Automatic maintenance of association invariants

Cited by 7 publications

References 12 publications

Class Diagrams with Equated Association Chains

Class Diagrams with Equated Association Chains

Model-Driven Data Migration

Formal Model-Driven Engineering: Generating Data and Behavioural Components

Contact Info

Product

Resources

About