Publication | Closed Access
Feature Diagrams: A Survey and a Formal Semantics
408
Citations
13
References
2006
Year
Unknown Venue
Feature DiagramsEngineeringSoftware EngineeringSemantic WebSoftware AnalysisFormal VerificationFd LanguagesSystems EngineeringFormal SemanticsFormal SpecificationFormal ModelingComputer EngineeringFeature ModelingComputer ScienceDomain-specific LanguageSoftware DesignSpecification LanguageFree Feature DiagramsDiagrammatic ReasoningAutomated ReasoningProgram AnalysisSoftware TestingFormal MethodsProduct Line EngineeringData Modeling
Feature diagrams are widely used modelling languages for software product lines, introduced in 1990 by Kang as part of FODA, but have lacked a proper formal semantics, leading to ambiguity and limited tool support. This paper surveys existing FD variants and introduces free feature diagrams (FFD) as a generic construction to unify them. The authors define a formal semantics at the FFD level that unambiguously captures all surveyed FD variants in a single framework. The formalisation shows that the original FODA FD definition is unambiguous, and the proposed FFD semantics is formal, concise, generic, and facilitates better definition, comparison, and reliable implementation of FD languages.
Feature diagrams (FD) are a family of popular modelling languages used for engineering requirements in software product lines. FD were first introduced by Kang as part of the FODA (feature oriented domain analysis) method back in 1990, Since then, various extensions of FODA FD were devised to compensate for a purported ambiguity and lack of precision and expressiveness. However, they never received a proper formal semantics, which is the hallmark of precision and unambiguity as well as a prerequisite for efficient and safe tool automation, In this paper, we first survey FD variants. Subsequently, we generalize the various syntaxes through a generic construction called free feature diagrams (FFD). Formal semantics is defined at the FFD level, which provides unambiguous definition for ail the surveyed FD variants in one shot. All formalisation choices found a clear answer in the original FODA FD definition, which proved that although informal and scattered throughout many pages, it suffered no ambiguity problem. Our definition has several additional advantages: it is formal, concise and generic. We thus argue that it contributes to improve the definition, understanding, comparison and reliable implementation of FD languages
| Year | Citations | |
|---|---|---|
Page 1
Page 1