Information Technology Reference
In-Depth Information
Furthermore,wecurrentlyexploreconstraintprogramming,
which is a type of declarative programming, to tackle the
problem of relating transformation rules to sets of variants
with particular interactions stated in the form of constraints.
The idea of using constraints to define suitable configurations
can be extended to the design and implementation of a
constraint system specialized in those kind of constraints,
in which all the power of specialized solvers can be used
to validate configurations. Likewise, it could be important
to explore if modeling the transformation of the problem of
scheduling rules using constraints can be a more efficient way
to solve it, instead of using aspect-oriented programming.
We have started a study tending to formalize our approach
using basic set theory. Our aim is to generalize our MD-SPL
approach making it extensible and independent of specific
platform modeling frameworks and/or model transformation
languages. One benefit, maybe the most important of such
activity, is to get a better insight into product lines and model-
driven engineering.
Search WWH ::
Custom Search