Elimination of Constraints from Feature Trees

P.M. van den Broek, I. Galvao, J.A.R. Noppen

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    28 Downloads (Pure)

    Abstract

    We present an algorithm which eliminates constraints from a feature model whose feature diagram is a tree and whose constraints are "requires" or "excludes" constraints. The algorithm constructs a feature tree which has the same semantics as the original feature model. The computational complexity of the algorithm is exponential in the number of constraints, but linear in the number of features. The algorithm allows to efficiently compute properties of product lines whose feature model consists of a feature tree and a small number of "requires" and "excludes" constraints. An executable specification of the algorithm is given in the functional programming language Miranda.
    Original languageUndefined
    Title of host publicationProceedings of the 12th International Software Product Line Conference
    Place of PublicationLimerick, Ireland
    PublisherLero International Science Centre, University of Limerick, Ireland
    Pages227-232
    Number of pages6
    ISBN (Print)978-1-905952-06-9
    Publication statusPublished - 2008
    Event12th International Software Product Line Conference, SPLC 2008 - Limerick, Ireland
    Duration: 8 Sep 200812 Sep 2008
    Conference number: 12

    Publication series

    Name
    PublisherLero International Science Centre, University of Limerick, Ireland
    NumberSupplement

    Workshop

    Workshop12th International Software Product Line Conference, SPLC 2008
    Abbreviated titleSPLC
    CountryIreland
    CityLimerick
    Period8/09/0812/09/08

    Keywords

    • EWI-13457
    • IR-64986
    • METIS-251190
    • SE-Q: Quality Modelling and Verification

    Cite this