Automatic refactoring of delta-oriented SPLs to remove-free form and replace-free form

Damiani, Ferruccio; Lienhardt, Michael; Paolini, Luca

doi:10.1007/s10009-019-00534-2

Cited by 2 publications

(1 citation statement)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, we are planning to devise an algorithm for refactoring IF∆J SPLSs to some normal form that is suitable for performing a slice. A starting point for this investigation could be represented by the algorithms for refactoring IF∆J SPLs presented in [14,15,18]. The Abstract Behavioural Specification (ABS) language [9,31,16] is a delta-oriented modeling language has been successfully used in the context of industrial use cases [32,28,2,11].…”

Section: Discussionmentioning

confidence: 99%

On Slicing Software Product Line Signatures

Damiani

Lienhardt

Paolini

2020

Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles

Self Cite

View full text Add to dashboard Cite

A Software Product Line (SPL) is a family of similar programs (called variants) generated from a common artifact base. Variability in an SPL can be documented in terms of abstract description of functionalities (called features): a feature model (FM) identifies each variant by a set of features (called a product). Delta-orientation is a flexible approach to implement SPLs. An SPL Signature (SPLS) is a variability-aware Application Programming Interface (API), i.e., an SPL where each variant is the API of a program. In this paper we introduce and formalize, by abstracting from SPL implementation approaches, the notion of slice of an SPLS K for a set of features F (i.e., an SPLS obtained from by K by hiding the features that are not in F). Moreover, we formulate the challenge of defining an efficient algorithm that, given a delta-oriented SPLS K and a set of features F, returns a delta-oriented SPLS that is an slice of K for F. Thus paving the way for further research on devising such an algorithm. The proposed notions are formalized for SPLs of programs written in an imperative version of Featherweight Java.

show abstract