CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Simplifying Transformations of OCL Constraints

Martin Giese ; Daniel Larsson (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers))
Proceedings of MoDELS 2005, Lecture Notes in Computer Science Vol. 3713 (2005), p. 309-323.
[Konferensbidrag, refereegranskat]

With the advent of Model Driven Architecture, OCL constraints are no longer necessarily written by humans. They can be parts of models that emerge from a chain of transformations. They might be the result of instantiating templates, of combining prefabricated parts, or of more general computation. Such generated specifications will often contain redundancies that reduce their readability. In this paper, we explore the possibilities of transforming OCL formulae to a simpler form through the repeated application of simple rules. We discuss the different kinds of rules that are needed, and we describe a prototypical implementation of the approach.

Nyckelord: Model Driven Architecture, OCL, UML, Simplification, Design Pattern, Constraint, KeY, Specification

Denna post skapades 2006-08-25. Senast ändrad 2013-08-12.
CPL Pubid: 7187


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)


Information Technology

Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

Formal Specification and Verification of Safety-Critical Software