软件产品线中可追溯性和可衍生性的形式化
Formalizing Traceability and Derivability in Software Product Lines
摘要：
在文献中，在软件产品线（SPL）的产品的定义是基于约束的一致性的概念，施加的可变性和可追溯性关系的SPL的元素。在本文中，我们认为，一致性不正确的问题和解决方案空间之间的可实现性关系的自然语义模型。因此，我们定义了什么时候可以从一组组件{ \em派生}一个特性。使用这个，我们通过<specification，architecture>对定义SPL的产品，其中规范中的所有功能都来自架构中的组件。这个概念的衍生性制定了一个简单而富有表现力的，抽象的模型与可追溯性关系的产品线。然后，我们定义了一组SPL分析问题，并表明这些问题可以编码为量化布尔公式。然后，可以使用QSAT求解器（如QUBE）来解决分析问题。我们说明了一个小片段的一个现实的productline的方法。
英文摘要：
In the literature, the definition of product in a Software Product Line (SPL) is based upon the notion of consistency of the constraints, imposed by variability and traceability relations on the elements of the SPL. In this paper, we contend that consistency does not model the natural semantics of the implementability relation between problem and solution spaces correctly. Therefore, we define when a feature can be {\em derived} from a set of components . Using this, we define a product of the SPL by a <specification, architecture> pair, where all the features in the specification are derived from the components in the architecture. This notion of derivability is formulated in a simple yet expressive, abstract model of a productline with traceability relation. We then define a set of SPL analysis problems and show that these problems can be encoded as Quantified Boolean Formulas. Then, QSAT solvers like QUBE can be used to solve the analysis problems. We illustrate the methodology on a small fragment of a realistic productline.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
