ACM Home Page
Please provide us with feedback. Feedback
A machine-checked model of safe composition
Full text PdfPdf (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
Benjamin Delaware  University of Texas at Austin, Austin, TX, USA
William Cook  University of Texas at Austin, Austin, TX, USA
Don Batory  University of Texas at Austin, Austin, TX, USA
Sponsors
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 43,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1509837.1509846
What is a DOI?

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
 
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
12
13


Collaborative Colleagues:
Benjamin Delaware: colleagues
William Cook: colleagues
Don Batory: colleagues