<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kagdi, Huzefa</style></author><author><style face="normal" font="default" size="100%">Yusuf, Shehnaaz</style></author><author><style face="normal" font="default" size="100%">Maletic, Jonathan I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Mining sequences of changed-files from version histories</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2006 international workshop on Mining software repositories</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">MSR '06</style></tertiary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">change</style></keyword><keyword><style  face="normal" font="default" size="100%">change history</style></keyword><keyword><style  face="normal" font="default" size="100%">change management</style></keyword><keyword><style  face="normal" font="default" size="100%">change sequences</style></keyword><keyword><style  face="normal" font="default" size="100%">heuristics</style></keyword><keyword><style  face="normal" font="default" size="100%">kde</style></keyword><keyword><style  face="normal" font="default" size="100%">mining software repositories</style></keyword><keyword><style  face="normal" font="default" size="100%">scm</style></keyword><keyword><style  face="normal" font="default" size="100%">sequences</style></keyword><keyword><style  face="normal" font="default" size="100%">source code</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://doi.acm.org/10.1145/1137983.1137996</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://ifipwg213.org/sites/flosshub.org/files/47MiningSequences.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pub-location><style face="normal" font="default" size="100%">New York, NY, USA</style></pub-location><pages><style face="normal" font="default" size="100%">47–53</style></pages><isbn><style face="normal" font="default" size="100%">1-59593-397-2</style></isbn><abstract><style face="normal" font="default" size="100%">Modern source-control systems, such as Subversion, preserve change-sets of files as atomic commits. However, the specific ordering information in which files were changed is typically not found in these source-code repositories. In this paper, a set of heuristics for grouping change-sets (i.e., log-entries) found in source-code repositories is presented. Given such groups of change-sets, sequences of files that frequently change together are uncovered. This approach not only gives the (unordered) sets of files but supplements them with (partial temporal) ordering information. The technique is demonstrated on a subset of KDE source-code repository. The results show that the approach is able to find sequences of changed-files.</style></abstract></record></records></xml>