Synthesizing type-safe compositions in feature oriented software designs using staged composition
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Standard
Synthesizing type-safe compositions in feature oriented software designs using staged composition. / Düdder, Boris; Rehof, Jakob; Heineman, George T.
Proceedings - 19th International Software Product Line Conference, SPLC 2015. Association for Computing Machinery, Inc., 2015. s. 398-401 (ACM International Conference Proceeding Series, Bind 20-24-July-2015).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - Synthesizing type-safe compositions in feature oriented software designs using staged composition
AU - Düdder, Boris
AU - Rehof, Jakob
AU - Heineman, George T.
PY - 2015/7/20
Y1 - 2015/7/20
N2 - The composition of features that interact with each other is challenging. Algebraic formalisms have been proposed by various authors to describe feature compositions and their interactions. The intention of feature compositions is the composition of fragments of documents of any kind to a product that fulfills users' requirements expressed by a feature selection. These modules often include code modules of typed programming languages whereas the proposed algebraic formalism is agnostic to types. This situation can lead to product code which is not type correct. In addition, types can carry semantic information on a program or module. We present a type system and connect it to an algebraic formalism thereby allowing automatic synthesis of feature compositions yielding well-typed programs.
AB - The composition of features that interact with each other is challenging. Algebraic formalisms have been proposed by various authors to describe feature compositions and their interactions. The intention of feature compositions is the composition of fragments of documents of any kind to a product that fulfills users' requirements expressed by a feature selection. These modules often include code modules of typed programming languages whereas the proposed algebraic formalism is agnostic to types. This situation can lead to product code which is not type correct. In addition, types can carry semantic information on a program or module. We present a type system and connect it to an algebraic formalism thereby allowing automatic synthesis of feature compositions yielding well-typed programs.
KW - Automatic program synthesis
KW - Combinatory logic eir
KW - Feature composition
KW - Type theory
UR - http://www.scopus.com/inward/record.url?scp=84982793242&partnerID=8YFLogxK
U2 - 10.1145/2791060.2793677
DO - 10.1145/2791060.2793677
M3 - Article in proceedings
AN - SCOPUS:84982793242
T3 - ACM International Conference Proceeding Series
SP - 398
EP - 401
BT - Proceedings - 19th International Software Product Line Conference, SPLC 2015
PB - Association for Computing Machinery, Inc.
T2 - 19th International Software Product Line Conference, SPLC 2015
Y2 - 20 July 2015 through 24 July 2015
ER -
ID: 230702680