一句话：提出恢复评审间依赖关系的评审链接图方法，并实证表明评审并非独立演进。
现代代码评审（Modern Code Review, MCR）是现代质量保证的重要实践，开发者在代码变更合入前通过评论、修订等交互进行讨论与改进。由于这些评审交互会被归档，研究者已提出审查者推荐、评审结果预测等分析手段来支持 MCR 流程。然而，这些分析通常假设每个评审独立演进和裁决；实际上，评审之间可能存在相互依赖关系。本文提出一种恢复“评审链接图”（review linkage graph）的方法，从归档的评审交互中重建评审之间的关联结构，并围绕该图开展实证研究，考察评审相互依赖的现象及其对代码评审分析的影响。该工作为更准确地建模代码评审过程、改进基于评审数据的分析提供了基础。
Modern Code Review (MCR) is a pillar of contemporary quality assurance approaches, where developers discuss and improve code changes prior to integration. Since review interactions (e.g., comments, revisions) are archived, analytics approaches like reviewer recommendation and review outcome prediction have been proposed to support the MCR process. These approaches assume that reviews evolve and are adjudicated independently; yet in practice, reviews can be interdependent.
DOI 原文 ·
@inproceedings{paperbot5134,
title = {The review linkage graph for code review analytics: a recovery approach and empirical study},
author = {Toshiki Hirao and Shane McIntosh and Akinori Ihara and Kenichi Matsumoto},
booktitle = {FSE},
year = {2019},
doi = {10.1145/3338906.3338949}
}