| A machine-checked model of safe composition |
| Full text |
Pdf
(407 KB)
|
Source
|
Aspect-oriented software development
archive
Proceedings of the 2009 workshop on Foundations of aspect-oriented languages
table of contents
Charlottesville, Virginia, USA
SESSION: Session 3
table of contents
Pages 31-35
Year of Publication: 2009
ISBN:978-1-60558-452-2
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 43, Citation Count: 1
|
|
|
ABSTRACT
Programs of a software product line can be synthesized by composing features which implement some unit of program functionality. In most product lines, only some combination of features are meaningful; feature models express the high-level domain constraints that govern feature compatibility. Product line developers also face the problem of safe composition -- whether every product allowed by a feature model is type-safe when compiled and run. To study the problem of safe composition, we present Lightweight Feature Java (LFJ), an extension of Lightweight Java with support for features. We define a constraint-based type system for LFJ and prove its soundness using a full formalization of LFJ in Coq. In LFJ, soundness means that any composition of features that satisfies the typing constraints will generate a well-formed LJ program. If the constraints of a feature model imply these typing constraints then all programs allowed by the feature model are type-safe.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Davide Ancona , Ferruccio Damiani , Sophia Drossopoulou , Elena Zucca, Polymorphic bytecode: compositional compilation for Java-like languages, Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.26-37, January 12-14, 2005, Long Beach, California, USA
|
| |
2
|
S. Apel and D. Hutchins. An overview of the gDEEP calculus. Technical Report Technical Report MIP-0712, Department of Informatics and Mathematics, University of Passau, November 2007.
|
 |
3
|
|
| |
4
|
|
| |
5
|
D. Batory. Feature models, grammars, and propositional formulas. In Software Product Lines Conference, LNCS 3714, pages 7--20. Springer, 2005.
|
| |
6
|
|
 |
7
|
|
 |
8
|
|
| |
9
|
|
| |
10
|
R. Prieto-Diaz and J. Neighbors. Module interconnection languages: A survey. Technical report, University of California at Irvine, August 1982. ICS Technical Report 189.
|
 |
11
|
Peter Sewell , Francesco Zappa Nardelli , Scott Owens , Gilles Peskine , Thomas Ridge , Susmit Sarkar , Rok Strniša, Ott: effective tool support for the working semanticist, Proceedings of the 12th ACM SIGPLAN international conference on Functional programming, October 01-03, 2007, Freiburg, Germany
|
 |
12
|
|
 |
13
|
|
|