2009 · 36 citations · 9 references
ComputingComputer ScienceCompilersFormal MethodsProgramming LanguagesDeductive VerificationSoftware ConstructionSoftware DesignSpecification LanguagesType CheckingType SystemsConstraint-based Type CheckingDomain ConstraintsFeature ModelsSoftware Product Line ModelingSoftware Product LinesSoundnessType SafetyType Soundness
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.
9
Safe composition of product lines
Sahil Thaker, Don Batory, David Kitchin et al. · 2007 · 215 citations
Ott: Effective tool support for the working semanticist
Peter Sewell, Francesco Zappa Nardelli, Scott Owens et al. · Journal of Functional Programming · 2010 · 164 citations · Full text
Feature-oriented programming and the AHEAD tool suite
Don Batory · 2004 · 149 citations
Rok Strniša, Peter Sewell, Matthew Parkinson · 2007 · 66 citations
Computing, Computer Science, Natural Language Processing +16