About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICSE 2010
Workshop paper
SPLGraph: Towards a graph-based formalism for software product lines
Abstract
This paper presents SPLGraph a graph-based model for Software Product Lines, including (1) a formal definition; (2) an algorithm that applies configuration decisions to an SPLGraph thus yielding a product specific graph; (3) a set of patterns for typical SPLGraph structures, such as Boolean operators, reuse of expressions, named configurations, optional and alternative features and staged configuration; and (4) an algorithm that infers product configuration per a variability point. SPLGraph is generic, simple, and self sustaining in the sense that an SPLGraph instance can apply variability to itself. These properties make SPLGraph a basis for a solid and complete formalism for Software Product Lines. © 2010 ACM.