Combinatory synthesis of classes using feature grammars

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Standard

Combinatory synthesis of classes using feature grammars. / Bessai, Jan; Düdder, Boris; Heineman, George T.; Rehof, Jakob.

Formal Aspects of Component Software - 12th International Conference, FACS 2015, Revised Selected Papers. ed. / Christiano Braga; Peter Csaba Ölveczky. Springer Verlag, 2016. p. 123-140 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9539).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Harvard

Bessai, J, Düdder, B, Heineman, GT & Rehof, J 2016, Combinatory synthesis of classes using feature grammars. in C Braga & PC Ölveczky (eds), Formal Aspects of Component Software - 12th International Conference, FACS 2015, Revised Selected Papers. Springer Verlag, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9539, pp. 123-140, 12th International Conference on Formal Aspects of Component Software, FACS 2015, Niteroi, Brazil, 14/10/2015. https://doi.org/10.1007/978-3-319-28934-2_7

APA

Bessai, J., Düdder, B., Heineman, G. T., & Rehof, J. (2016). Combinatory synthesis of classes using feature grammars. In C. Braga, & P. C. Ölveczky (Eds.), Formal Aspects of Component Software - 12th International Conference, FACS 2015, Revised Selected Papers (pp. 123-140). Springer Verlag. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 9539 https://doi.org/10.1007/978-3-319-28934-2_7

Vancouver

Bessai J, Düdder B, Heineman GT, Rehof J. Combinatory synthesis of classes using feature grammars. In Braga C, Ölveczky PC, editors, Formal Aspects of Component Software - 12th International Conference, FACS 2015, Revised Selected Papers. Springer Verlag. 2016. p. 123-140. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9539). https://doi.org/10.1007/978-3-319-28934-2_7

Author

Bessai, Jan ; Düdder, Boris ; Heineman, George T. ; Rehof, Jakob. / Combinatory synthesis of classes using feature grammars. Formal Aspects of Component Software - 12th International Conference, FACS 2015, Revised Selected Papers. editor / Christiano Braga ; Peter Csaba Ölveczky. Springer Verlag, 2016. pp. 123-140 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9539).

Bibtex

@inproceedings{ab019b54c1f34273bd6e5446802529f3,
title = "Combinatory synthesis of classes using feature grammars",
abstract = "We describe a method for automatically transforming feature grammars into type-specifications which are subsequently used to synthesize a code-generator for a product of a given feature selection. Feature models are assumed to be given in the form of feature grammars with constraints, and we present a generic type-theoretic representation of such grammars. Our synthesis method is based on an extension of previous work in combinatory logic synthesis, where semantic types can be superimposed onto native APIs to specify a repository of components as well as synthesis goals. In our case, semantic types correspond to feature selections. We use an encoding of boolean logic in intersection types, which allows us to directly represent logical formulas expressing complex feature selection constraints. The novelty of our approach is the possibility to perform retrieval, selection and composition of products in a unified form, without sacrificing modularity. In contrast to constraint based methods, multiple selections of a single feature can coexist.",
keywords = "Combinatory logic, Feature grammar, Feature models, Program synthesis, Type theory",
author = "Jan Bessai and Boris D{\"u}dder and Heineman, {George T.} and Jakob Rehof",
year = "2016",
month = jan,
day = "1",
doi = "10.1007/978-3-319-28934-2_7",
language = "English",
isbn = "9783319289335",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "123--140",
editor = "Christiano Braga and {\"O}lveczky, {Peter Csaba}",
booktitle = "Formal Aspects of Component Software - 12th International Conference, FACS 2015, Revised Selected Papers",
note = "12th International Conference on Formal Aspects of Component Software, FACS 2015 ; Conference date: 14-10-2015 Through 16-10-2015",

}

RIS

TY - GEN

T1 - Combinatory synthesis of classes using feature grammars

AU - Bessai, Jan

AU - Düdder, Boris

AU - Heineman, George T.

AU - Rehof, Jakob

PY - 2016/1/1

Y1 - 2016/1/1

N2 - We describe a method for automatically transforming feature grammars into type-specifications which are subsequently used to synthesize a code-generator for a product of a given feature selection. Feature models are assumed to be given in the form of feature grammars with constraints, and we present a generic type-theoretic representation of such grammars. Our synthesis method is based on an extension of previous work in combinatory logic synthesis, where semantic types can be superimposed onto native APIs to specify a repository of components as well as synthesis goals. In our case, semantic types correspond to feature selections. We use an encoding of boolean logic in intersection types, which allows us to directly represent logical formulas expressing complex feature selection constraints. The novelty of our approach is the possibility to perform retrieval, selection and composition of products in a unified form, without sacrificing modularity. In contrast to constraint based methods, multiple selections of a single feature can coexist.

AB - We describe a method for automatically transforming feature grammars into type-specifications which are subsequently used to synthesize a code-generator for a product of a given feature selection. Feature models are assumed to be given in the form of feature grammars with constraints, and we present a generic type-theoretic representation of such grammars. Our synthesis method is based on an extension of previous work in combinatory logic synthesis, where semantic types can be superimposed onto native APIs to specify a repository of components as well as synthesis goals. In our case, semantic types correspond to feature selections. We use an encoding of boolean logic in intersection types, which allows us to directly represent logical formulas expressing complex feature selection constraints. The novelty of our approach is the possibility to perform retrieval, selection and composition of products in a unified form, without sacrificing modularity. In contrast to constraint based methods, multiple selections of a single feature can coexist.

KW - Combinatory logic

KW - Feature grammar

KW - Feature models

KW - Program synthesis

KW - Type theory

UR - http://www.scopus.com/inward/record.url?scp=84958074336&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-28934-2_7

DO - 10.1007/978-3-319-28934-2_7

M3 - Article in proceedings

AN - SCOPUS:84958074336

SN - 9783319289335

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 123

EP - 140

BT - Formal Aspects of Component Software - 12th International Conference, FACS 2015, Revised Selected Papers

A2 - Braga, Christiano

A2 - Ölveczky, Peter Csaba

PB - Springer Verlag

T2 - 12th International Conference on Formal Aspects of Component Software, FACS 2015

Y2 - 14 October 2015 through 16 October 2015

ER -

ID: 230702882