Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Max Ellis

dblp:309/7285 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0002-1593-2201ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software maintenance and evolution › software merging
merge conflict resolution
0.712023
Operation-Based Refactoring-Aware Merging: An Empirical Evaluation · IEEE Trans. Software Eng. 2023
Software maintenance and evolution
refactoring
0.712023
Operation-Based Refactoring-Aware Merging: An Empirical Evaluation · IEEE Trans. Software Eng. 2023
Software maintenance and evolution › software merging
refactoring-aware merging
0.712023
Operation-Based Refactoring-Aware Merging: An Empirical Evaluation · IEEE Trans. Software Eng. 2023
Software maintenance and evolution › software configuration management
version control
0.212023
Operation-Based Refactoring-Aware Merging: An Empirical Evaluation · IEEE Trans. Software Eng. 2023

Methods — techniques the papers use, named apart from their topics

operation-based merging · 0.7graph-based merging · 0.7
YearPublicationVenuePosition
2023 Operation-Based Refactoring-Aware Merging: An Empirical Evaluation
abstract
Dealing with merge conflicts in version control systems is a challenging task for software developers. Resolving merge conflicts is a time-consuming and error-prone process, which distracts developers from important tasks. Recent work shows that refactorings are often involved in merge conflicts and that refactoring-related conflicts tend to be larger, making them harder to resolve. In the literature, there are two refactoring-aware merging techniques that claim to automatically resolve refactoring-related conflicts; however, these two techniques have never been empirically compared. In this paper, we presentRefMerge, a rejuvenated Java-based design and implementation of the first technique, which is an operation-based refactoring-aware merging algorithm. We compareRefMergeto Git and the state-of-the-art graph-based refactoring-aware merging tool,IntelliMerge, on 2,001 merge scenarios with refactoring-related conflicts from 20 open-source projects. We find thatRefMergeresolves or reduces conflicts in 497 (25%) merge scenarios while increasing conflicting LOC in only 214 (11%) scenarios. On the other hand, we find thatIntelliMergeresolves or reduces conflicts in 478 (24%) merge scenarios but increases conflicting LOC in 597 (30%) merge scenarios. We additionally conduct a qualitative analysis of the differences between the three merging algorithms and provide insights of the strengths and weaknesses of each tool. We find that whileIntelliMergedoes well with ordering and formatting conflicts, it struggles with class-level refactorings and scenarios with several refactorings. On the other hand,RefMergeis resilient to the number of refactorings in a merge scenario, but we find thatRefMergeintroduces conflicts when inverting move-related refactorings.
Max Ellis, Sarah Nadi, Danny Dig
IEEE Trans. Software Eng.1