The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Change Distilling:Tree Differencing for Fine-Grained Source Code Change Extraction
Abstract
A key issue in software evolution analysis is the identification of particular changes that occur across several versions of a program. We present change distilling, a tree differencing algorithm for fine-grained source code change extraction. For that, we have improved the existing algorithm of Chawathe et al. for extracting changes in hierarchically structured data. Our algorithm detects changes by finding a match between nodes of the compared two abstract syntax trees and a minimum edit script. We can identify change types between program versions according to our taxonomy of source code changes. We evaluated our change distilling algorithm with a benchmark we developed that consists of 1,064 manually classified changes in 219 revisions from three different open source projects. We achieved significant improvements in extracting types of source code changes: our algorithm approximates the minimum edit script by 45% better than the original change extraction approach by Chawathe et al. We are able to find all occurring changes and almost reach the minimum conforming edit script, i.e., we reach a mean absolute percentage error of 34%, compared to 79% reached by the original algorithm. The paper describes both the change distilling and the results of our evaluation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Binary Codes capable of currecting deletions, insertions, and reversals
Levenshtein, V. I. (1965) · Soviet physics. Doklady · Cited by 14,807
Measures of the Amount of Ecologic Association Between Species
Dice, L. R. (1945) · Ecology · doi:10.2307/1932409 · Cited by 11,874
THE DISTRIBUTION OF THE FLORA IN THE ALPINE ZONE. 1
Jaccard, P. (1912) · New Phytologist · doi:10.1111/j.1469-8137.1912.tb05611.x · Cited by 4,561
Clone detection using abstract syntax trees
Baxter, I. D., Yahin, A., Moura, L., Sant'Anna, M., & Bier, L. (2002) · Proceedings. International Conference on Software Maintenance (Cat. No. 98CB36272) · doi:10.1109/icsm.1998.738528 · Cited by 1,277
Programs, life cycles, and laws of software evolution
Lehman, M. M. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11805 · Cited by 1,181
The Tree-to-Tree Correction Problem
Tai, K.-C. (1979) · Journal of the ACM · doi:10.1145/322139.322143 · Cited by 865
Mining version histories to guide software changes
Zimmermann, T., Zeller, A., Weissgerber, P., & Diehl, S. (2005) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2005.72 · Cited by 856
Śliwerski, J., Zimmermann, T., & Zeller, A. (2005) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1082983.1083147 · Cited by 805
A survey on tree edit distance and related problems
Bille, P. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.12.030 · Cited by 751
A fast algorithm for computing longest common subsequences
Hunt, J. W., & Szymanski, T. G. (1977) · Communications of the ACM · doi:10.1145/359581.359603 · Cited by 691
Research works printed but not linked: 13
- 10.1016/0020-0271(74)90020-5 · doi:10.1016/0020-0271(74)90020-5
- Asklund, Identifying Conflicts during Structural Merge, 231
- Bernstein, 2005, SimPack: A Generic Java Library for Similarity Measures in Ontologies
- Demeyer, 1999, Famix—The Famoos Information Exchange Model
- 10.2307/1932409.JSTOR1932409 · doi:10.2307/1932409.jstor1932409
- 10.1109/IWPSE.2004.1334771 · doi:10.1109/iwpse.2004.1334771
- 10.1145/93542.93574 · doi:10.1145/93542.93574
- Kelter, 2005, A Generic Difference Algorithm for UML Models, Software Eng., 105
- 10.1109/ICSM.2004.1357805 · doi:10.1109/icsm.2004.1357805
- 10.1109/WPC.2002.1021334 · doi:10.1109/wpc.2002.1021334
- 10.1109/CMPSAC.1998.716632 · doi:10.1109/cmpsac.1998.716632
- Würsch, 2006, Improving ChangeDistiller—Improving Abstract Syntax Tree Based Source Code Change Detection
- 10.1016/0164-1212(94)90026-4 · doi:10.1016/0164-1212(94)90026-4
Cited by
An exploratory study of the pull-based software development model
Gousios, G., Pinzger, M., & Deursen, A. V. (2014) · Proceedings of the 36th International Conference on Software Engineering · doi:10.1145/2568225.2568260 · Cited by 628
Self-citationFine-grained and accurate source code differencing
Falleri, J.-R., Morandat, F., Blanc, X., Martinez, M., & Monperrus, M. (2014) · Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering · doi:10.1145/2642937.2642982 · Cited by 549
Shaping program repair space with existing patches and similar code
Jiang, J., Xiong, Y., Zhang, H., Gao, Q., & Chen, X. (2018) · Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis · doi:10.1145/3213846.3213871 · Cited by 329
Accurate and efficient refactoring detection in commit history
Tsantalis, N., Mansouri, M., Eshkevari, L. M., Mazinanian, D., & Dig, D. (2018) · Proceedings of the 40th International Conference on Software Engineering · doi:10.1145/3180155.3180206 · Cited by 300
CCT5: A Code-Change-Oriented Pre-trained Model
Lin, B., Wang, S., Liu, Z., Liu, Y., Xia, X., & Mao, X. (2023) · Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering · doi:10.1145/3611643.3616339 · Cited by 69
Developers' code context models for change tasks
Fritz, T., Shepherd, D. C., Kevic, K., Snipes, W., & Bräunlich, C. (2014) · Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering · doi:10.1145/2635868.2635905 · Cited by 45
Detecting differences across multiple instances of code clones
Lin, Y., Xing, Z., Xue, Y., Liu, Y., Peng, X., Sun, J., & Zhao, W. (2014) · Proceedings of the 36th International Conference on Software Engineering · doi:10.1145/2568225.2568298 · Cited by 41
Exploring the Capabilities of LLMs for Code-Change-Related Tasks
Fan, L., Liu, J., Liu, Z., Lo, D., Xia, X., & Li, S. (2025) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3709358 · Cited by 41
“After the launch of a project, developers constantly change code to introduce new features and maintain existing code (e.g., performing refactoring and fixing bugs) [11, 14, 16].”
Can GPT-4 Replicate Empirical Software Engineering Research?
Liang, J. T., Badea, C., Bird, C., DeLine, R., Ford, D., Forsgren, N., & Zimmermann, T. (2024) · Proceedings of the ACM on Software Engineering · doi:10.1145/3660767 · Cited by 19
“The authors identify bug fix revisions and bug-introducing changes and use Change Distiller [20] to compute syntactic program differences.”
MethodLogUpdater : Automated Detection and Repair of Specific Defects in Logging Statements
Zhong, R., Li, Y., Kuang, J., Gu, W., Huo, Y., & Lyu, M. R. (2026) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3731754 · Cited by 7
Metadata
- Authors
- Fluri, B., Wursch, M., PInzger, M., & Gall, H.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 2007-11
- Volume
- 33
- Issue
- 11
- Pages
- 725-743
- ISSN
- 0098-5589 (ISSN-L)
- 1939-3520
- 2326-3881
- OpenAlex
- W2153150125
- Cited by
- 607
- References
- 39
- FWCI
- 55.90
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.