@article{damiani2019sttt,
  number = {6},
  volume = {21},
  month = {Dec},
  issn = {1433-2787},
  author = {Damiani, Ferruccio and Lienhardt, Michael and Paolini, Luca},
  url = {https://doi.org/10.1007/s10009-019-00534-2},
  day = {01},
  abstract = {Delta-oriented programming (DOP) is a flexible transformational
              approach to implement software product lines (SPLs). In
              delta-oriented SPLs, variants are generated by applying operations
              contained in delta modules to a base program. These operations can
              add, remove or modify named elements in a program (e.g. classes,
              methods and fields in a Java program). This paper presents two
              notions of normal form for delta-oriented SPLs. Both normal forms
              do not contain the remove operation. Additionally, the second
              normal form enforces a limitation on the use of the method-modify
              operation. For each of the proposed normal forms an algorithm for
              refactoring a delta-oriented SPL into one that satisfies that
              normal form is described. The algorithms are formalized for a core
              calculus for delta-oriented SPLs of Java programs.},
  title = {Automatic refactoring of delta-oriented SPLs to remove-free form and
           replace-free form},
  doi = {10.1007/s10009-019-00534-2},
  pages = {691--707},
  journal = {International Journal on Software Tools for Technology Transfer},
  year = {2019},
}

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)