2020 IEEE 13th International Conference on Software Testing, Validation and Verification (ICST) 2020
DOI: 10.1109/icst46399.2020.00043
|View full text |Cite
|
Sign up to set email alerts
|

Detecting Higher-Order Merge Conflicts in Large Software Projects

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…Wuensche et al [47] classify build and test conflicts. Their approach creates a directed call graph of the code and its modifications to detect a conflict if: i) changes are made on the same call graph node, ii) there is a path from one change to another, or iii) there is a path from an unchanged node to two changed nodes.…”
Section: A Program Analysis Approachesmentioning
confidence: 99%
“…Wuensche et al [47] classify build and test conflicts. Their approach creates a directed call graph of the code and its modifications to detect a conflict if: i) changes are made on the same call graph node, ii) there is a path from one change to another, or iii) there is a path from an unchanged node to two changed nodes.…”
Section: A Program Analysis Approachesmentioning
confidence: 99%
“…We know nothing about the state S 12 after applying c 1 and c 2 . S 12 could contain so-called higher order merge conflicts [12,88] where, for example, c 1 starts to call a function, but c 2 changes the results of this function. As we need to integrate the given number of changes per day into our code repository, we accept the risk of such conflicts and execute pre-submit tests in parallel.…”
Section: Pre-submit Testingmentioning
confidence: 99%