Proceedings of the 11th International Conference on Generative Programming and Component Engineering 2012
DOI: 10.1145/2371401.2371421
|View full text |Cite
|
Sign up to set email alerts
|

A calculus for modeling and implementing variation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 14 publications
(13 citation statements)
references
References 13 publications
0
13
0
Order By: Relevance
“…In this section, we briefly present and differentiate compositional and annotative approaches for the implementation of features [14][15] [16] [27]. To clarify our concepts, throughout this paper we employ a stack product line as a running example, which has been used similarly in related research [14] …”
Section: Current Approaches To Separate Featuresmentioning
confidence: 99%
See 1 more Smart Citation
“…In this section, we briefly present and differentiate compositional and annotative approaches for the implementation of features [14][15] [16] [27]. To clarify our concepts, throughout this paper we employ a stack product line as a running example, which has been used similarly in related research [14] …”
Section: Current Approaches To Separate Featuresmentioning
confidence: 99%
“…There are two common approaches to implement features: compositional and annotative ones [14][15] [16] [27]. While in the former approach features are separated physically using composition units [2], in the latter features are assigned virtually by annotations that are scattered across the program code [15].…”
Section: Introductionmentioning
confidence: 99%
“…The Choice Calculus (CC) [23] offers an interesting and alternative approach to our work. Among the goals of CC are to integrate classical and virtual modularity, but to do so in the context of a formal programming language.…”
Section: Related Workmentioning
confidence: 99%
“…This DSL separates variation representation and transformation into two distinct levels, which limits its scope. Therefore, we have also developed a generalization of the choice calculus that includes computational features [9] that can arbitrarily mix and nest choice annotations and transformations.…”
Section: Status Of Effortmentioning
confidence: 99%
“…The scope of the DSEL is limited by the fact that it separates variation representation and transformation into two levels. To address this limitation, we have also developed a generalization of the choice calculus that includes computational features so that choice annotations and transformations can be arbitrarily mixed and nested [9].…”
Section: Variation Programmingmentioning
confidence: 99%