iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.4204/EPTCS.206.2
[1604.00346] Refactoring Delta-Oriented Product Lines to achieve Monotonicity
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Software Engineering

arXiv:1604.00346 (cs)
[Submitted on 1 Apr 2016]

Title:Refactoring Delta-Oriented Product Lines to achieve Monotonicity

Authors:Ferruccio Damiani (University of Torino, Italy), Michael Lienhardt (University of Torino, Italy)
View PDF
Abstract:Delta-oriented programming (DOP) is a flexible transformational approach to implement software product lines. In delta-oriented product lines, variants are generated by applying operations contained in delta modules to a (possibly empty) 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 algorithms for refactoring a delta-oriented product line into monotonic form, i.e., either to contain add and modify operations only (monotonic increasing) or to contain remove and modify operations only (monotonic decreasing). Because of their simpler structure, monotonic delta-oriented product lines are easier to analyze. The algorithms are formalized by means of a core calculus for DOP of product lines of Java programs and their correctness and complexity are given.
Comments: In Proceedings FMSPLE 2016, arXiv:1603.08577
Subjects: Software Engineering (cs.SE); Logic in Computer Science (cs.LO); Programming Languages (cs.PL)
Cite as: arXiv:1604.00346 [cs.SE]
  (or arXiv:1604.00346v1 [cs.SE] for this version)
  https://doi.org/10.48550/arXiv.1604.00346
Journal reference: EPTCS 206, 2016, pp. 2-16
Related DOI: https://doi.org/10.4204/EPTCS.206.2

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Fri, 1 Apr 2016 18:25:58 UTC (63 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.SE
< prev   |   next >
new | recent | 2016-04
Change to browse by:
cs
cs.LO
cs.PL

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)