Refactoring Delta-Oriented Product Lines to achieve Monotonicity
| Autor: | Ferruccio Damiani, Michael Lienhardt |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Correctness Refactoring Java Computer science Monotonic function 02 engineering and technology computer.software_genre lcsh:QA75.5-76.95 Computer Science - Software Engineering Software 0202 electrical engineering electronic engineering information engineering Software product line computer.programming_language Computer Science - Programming Languages Programming language business.industry lcsh:Mathematics Software Product Line 020207 software engineering lcsh:QA1-939 Base (topology) Delta-Oriented Programming Logic in Computer Science (cs.LO) Software Engineering (cs.SE) Code refactoring Product (mathematics) Computer Science::Programming Languages 020201 artificial intelligence & image processing lcsh:Electronic computers. Computer science business Software Product Line Delta-Oriented Programming Refactoring Java computer Programming Languages (cs.PL) |
| Zdroj: | FMSPLE Electronic Proceedings in Theoretical Computer Science, Vol 206, Iss Proc. FMSPLE 2016, Pp 2-16 (2016) Electronic Proceedings in Theoretical Computer Science |
| ISSN: | 2075-2180 |
| DOI: | 10.4204/eptcs.206.2 |
| Popis: | 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. Comment: In Proceedings FMSPLE 2016, arXiv:1603.08577 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|