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

Rule-Based Simplification of OCL Constraints

Martin Giese (Institutionen för datavetenskap, Formella metoder) ; Reiner Hähnle (Institutionen för datavetenskap, Formella metoder) ; Daniel Larsson (Institutionen för datavetenskap, Formella metoder)
OCL and Model Driven Engineering, UML 2004 workshop, Lisbon p. 84-98. (2004)
[Konferensbidrag, refereegranskat]

To help designers in writing OCL constraints, we have to construct systems that can generate some of these constraints. This might be done by instantiating templates, by combining prefabricated parts, or by more general computation. Such generated specifications will often contain redundancies that reduce their readability. In this paper, we explore the possibilities of simplifying OCL formulae 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: Software Engineering, Formal Methods, UML, OCL

Denna post skapades 2006-09-28. Senast ändrad 2013-08-12.
CPL Pubid: 1882


Institutioner (Chalmers)

Institutionen för datavetenskap, Formella metoder (2002-2004)


Information Technology

Chalmers infrastruktur