Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
An Authoring Tool for Informal and Formal Requirements Specifications
FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
The Object Constraint Language: Getting Your Models Ready for MDA
The Object Constraint Language: Getting Your Models Ready for MDA
Simplifying transformation of software architecture constraints
Proceedings of the 2006 ACM symposium on Applied computing
Transformation techniques for OCL constraints
Science of Computer Programming
Transformation techniques for OCL constraints
Science of Computer Programming
The KeY system 1.0 (Deduction Component)
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
KeY: a formal method for object-oriented systems
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Verifying object-oriented programs with KeY: a tutorial
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Information Sciences: an International Journal
Software architecture constraints as customizable, reusable and composable entities
ECSA'10 Proceedings of the 4th European conference on Software architecture
Component-based specification of software architecture constraints
Proceedings of the 14th international ACM Sigsoft symposium on Component based software engineering
Tool supported OCL refactoring catalogue
Proceedings of the 12th Workshop on OCL and Textual Modelling
Hi-index | 0.00 |
With the advent of Model Driven Architecture, OCL constraints are no longer necessarily written by humans. They can be part 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.