Next Article in Journal
ECG Classification Using Wavelet Packet Entropy and Random Forests
Previous Article in Journal
A Novel Image Encryption Scheme Using the Composite Discrete Chaotic System
Open AccessArticle

Traceability Analyses between Features and Assets in Software Product Lines

1
Homi Bhabha National Institute, Anushakti Nagar, Mumbai 400042, India
2
Inria Rennes—Bretagne Atlantique, Campus de Beaulieu, 263 Av. Général Leclerc, Rennes 35042, France
3
Indian Institute of Technology Bombay, Powai, Mumbai 400076, India
4
Department of Computer Languages and Systems, Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, Av. Reina Mercedes s/n, Seville 41012, Spain
5
Inria Sophia Antipolis—Méditerranée, Route des Lucioles, Valbonne 06902, France
6
General Motors Global R&D, Warren, Michigan 49084, USA
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Academic Editors: Raúl Alcaraz Martínez and Kevin H. Knuth
Entropy 2016, 18(8), 269; https://doi.org/10.3390/e18080269
Received: 11 February 2016 / Revised: 22 June 2016 / Accepted: 4 July 2016 / Published: 3 August 2016
(This article belongs to the Section Information Theory, Probability and Statistics)
In a Software Product Line (SPL), the central notion of implementability provides the requisite connection between specifications and their implementations, leading to the definition of products. While it appears to be a simple extension of the traceability relation between components and features, it involves several subtle issues that were overlooked in the existing literature. In this paper, we have introduced a precise and formal definition of implementability over a fairly expressive traceability relation. The consequent definition of products in the given SPL naturally entails a set of useful analysis problems that are either refinements of known problems or are completely novel. We also propose a new approach to solve these analysis problems by encoding them as Quantified Boolean Formulae (QBF) and solving them through Quantified Satisfiability (QSAT) solvers. QBF can represent more complex analysis operations, which cannot be represented by using propositional formulae. The methodology scales much better than the SAT-based solutions hinted in the literature and were demonstrated through a tool called SPLAnE (SPL Analysis Engine) on a large set of SPL models. View Full-Text
Keywords: software product line; feature model; formal methods; QBF; SAT software product line; feature model; formal methods; QBF; SAT
Show Figures

Graphical abstract

MDPI and ACS Style

Narwane, G.K.; Galindo, J.A.; Krishna, S.N.; Benavides, D.; Millo, J.-V.; Ramesh, S. Traceability Analyses between Features and Assets in Software Product Lines. Entropy 2016, 18, 269.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop