2008
DOI: 10.1145/1745312.1745316
|View full text |Cite
|
Sign up to set email alerts
|

A calculus for uniform feature composition

Abstract: The goal of feature-oriented programming (FOP) is to modularize software systems in terms of features. A feature refines the content of a base program. Both base programs and features may contain various kinds of software artifacts, for example, source code in different languages, models, build scripts, and documentation. We and others have noticed that when composing features, different kinds of software artifacts can be refined in a uniform way, regardless of what they represent. We present gDEEP, a core cal… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
38
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
5
2
2

Relationship

2
7

Authors

Journals

citations
Cited by 36 publications
(38 citation statements)
references
References 69 publications
0
38
0
Order By: Relevance
“…The calculus gDeep is most closely related to FFJ since it provides a type system for feature-oriented languages that is language-independent [5,4]. The idea is that the recursive process of merging software artifacts, when composing hierarchically structured features, is very similar for different host languages (e.g., for Java, C#, and XML).…”
Section: Feature-oriented Programsmentioning
confidence: 99%
“…The calculus gDeep is most closely related to FFJ since it provides a type system for feature-oriented languages that is language-independent [5,4]. The idea is that the recursive process of merging software artifacts, when composing hierarchically structured features, is very similar for different host languages (e.g., for Java, C#, and XML).…”
Section: Feature-oriented Programsmentioning
confidence: 99%
“…Whether these plug-ins can be generated automatically (e.g., from attribute grammars) is an open research question. Regarding inter-language typing, further research is needed to find the right abstractions (e.g., [Apel and Hutchins 2010]) or a suitable polylingual type system (e.g., [Grechanik et al 2004]). From a tool perspective, recent advances in inter-language refactorings in Eclipse can be used as possible starting point [Fuhrer et al 2007].…”
Section: Beyond Featherweight Java (Implementation)mentioning
confidence: 99%
“…In such a feature-product-based verification, features are verified as far as possible in isolation, and all remaining verification tasks are done for each product. A feature-product-based strategy has been proposed for type checking [2], model checking [9], and theorem proving [17].…”
Section: State Of the Artmentioning
confidence: 99%