Abstract
The dif f 3 algorithm is widely considered the gold standard for merging uncoordinated changes to list-structured data such as text files. Surprisingly, its fundamental properties have never been studied in depth. We offer a simple, abstract presentation of the diff3 algorithm and investigate its behavior. Despite abundant anecdotal evidence that people find diff3's behavior intuitive and predictable in practice, characterizing its good properties turns out to be rather delicate: a number of seemingly natural intuitions are incorrect in general. Our main result is a careful analysis of the intuition that edits to "well-separated" regions of the same document are guaranteed never to conflict. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Khanna, S., Kunal, K., & Pierce, B. C. (2007). A formal investigation of Diff3. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4855 LNCS, pp. 485–496). Springer Verlag. https://doi.org/10.1007/978-3-540-77050-3_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
