Linear Time Computation of Variation Degree and Commonalities on Feature Diagrams - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2023

Linear Time Computation of Variation Degree and Commonalities on Feature Diagrams

Abstract

The growth in Software Product Lines (SPLs) created a need for good and fast algorithms to analyze them. Extracting information, such as the number of products, may be crucial to generate a good test suite. However, due to the combinatorial complexity of SPLs, such algorithms may be intractable. Here, we focus on Feature Diagrams, and we use the tree structure to show linear time algorithms to compute the variation degree (number of products) and the commonalities (number of products containing each feature). We use the variation degree to show a uniform sampling procedure of configurations allowed by a feature diagram.
Fichier principal
Vignette du fichier
variation_commonality_feature_diagrams.pdf (730.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : CC BY - Attribution

Dates and versions

hal-03970237 , version 1 (02-02-2023)

Licence

Attribution - CC BY 4.0

Identifiers

  • HAL Id : hal-03970237 , version 1

Cite

Mathieu Vavrille, Erwan Meunier, Charlotte Truchet, Charles Prud'Homme. Linear Time Computation of Variation Degree and Commonalities on Feature Diagrams. RR-2023-01-DAPI, Nantes Université, École Centrale Nantes, IMT Atlantique, CNRS, LS2N, UMR 6004, F-44000 Nantes, France. 2023. ⟨hal-03970237⟩
0 View
3 Download

Share

Gmail Facebook Twitter LinkedIn More