Change distilling algorithms compute a sequence of fine-grained changes that, when executed in order, transform a given source AST into a given target AST. The resulting change sequences are used in the field of mining software repositories to study source code evolution. Unfortunately, detecting and specifying source code evolutions in such a change sequence is cumbersome. We therefore introduce a tool-supported approach that identifies minimal executable subsequences in a sequence of distilled changes that implement a particular evolution pattern, specified in terms of intermediate states of the AST that undergoes each change. This enables users to describe the effect of multiple changes, irrespective of their execution order, while ensuring that different change sequences that implement the same code evolution are recalled. Correspondingly, our evaluation is two-fold. Using examples, we demonstrate the expressiveness of specifying source code evolutions through intermediate ASTs. We also show that our approach is able to recall different implementation variants of the same source code evolution in open-source histories.
Original languageEnglish
Title of host publication24th IEEE International Conference on Software Analysis, Evolution and Reengineering
Place of PublicationKlagenfurt, Austria
Pages171-181
Number of pages11
Edition24
StatePublished - 22 Feb 2017
Event24th International Conference on Software Analysis, Evolution and Reingineering - Klagenfurt, Austria

Conference

Conference24th International Conference on Software Analysis, Evolution and Reingineering
Abbreviated titleSANER
CountryAustria
CityKlagenfurt
Period21/02/1724/02/17

ID: 27856738