Operation-Based, Fine-Grained Version Control Model for Tree-Based Representation

Abstract

Abstract. Existing version control systems are often based on text line-oriented models for change representation, which do not facilitate software developers in understanding code evolution. Other advanced change representation models that encompass more program semantics and structures are still not quite practical due to their high computational complexity. This paper presents OperV, a novel operation-based version control model that is able to support both coarse and fine levels of granularity in program source code. In OperV, a software system is represented by a project tree whose nodes represent all program entities, such as packages, classes, methods, etc. The changes of the system are represented via edit operations on the tree. OperV also provides the algorithms to differ, store, and retrieve the versions of such entities. These algorithms are based on the mapping of the nodes between versions of the project tree. This mapping technique uses 1) divide-and-conquer technique to map coarse-and fine-grained entities separately, 2) unchanged text regions to map unchanged leaf nodes, and 3) structure-based similarity of the sub-trees to map their root nodes bottom-up and then topdown. The empirical evaluation of OperV has shown that it is scalable, efficient, and could be useful in understanding program evolution.

Augmenting metamodels with seamless support for planning, tracking, and slicing model evolution timelines

“…There are multiple approaches that create evolution histories via a sequence of applied operations: Operation-based VCSs [20,21] store evolution in version-control system by capturing the modifications that were performed instead of the state resulting from those modifications. Change-oriented programming [22] uses change objects synthesized from applied operations to represent evolutionary modifications on implementation artifacts.…”