Learning Feature Interactions With and Without Specifications
Seyedehzahra Khoshmanesh, Tuba Yavuz, Robyn R. Lutz

TL;DR
This paper introduces a program analysis-based method to automatically detect and infer feature interactions in configurable systems, improving developer understanding and testing of potential unwanted feature combinations.
Contribution
It presents a novel approach that uses source code analysis and data-flow dependency to identify feature interactions, even without explicit specifications.
Findings
Effective detection of unwanted feature interactions
Applicable to both specified and unspecified feature constraints
Fast and accurate in benchmark evaluations
Abstract
Features in product lines and highly configurable systems can interact in ways that are contrary to developers' intent. Current methods to identify such unanticipated feature interactions are costly and inadequate. To address this problem we propose a new approach to learn feature interactions, both in those product lines where constraints on feature combinations are specified and in feature-rich configurable systems where such specifications often are not available. The contribution of the paper is to use program analysis to extract feature-relevant learning models from the source code in order to detect unwanted feature interactions. Where specifications of feature constraints are unavailable, our approach infers the constraints using feature-related data-flow dependency information. Evaluation in experiments on three software product line benchmarks and a highly configurable system…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
