Pith. sign in

REVIEW 1 cited by

The effects of change decomposition on code review -- a controlled experiment

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1805.10978 v2 pith:VXXHBQEK submitted 2018-05-28 cs.SE

classification cs.SE
keywords changereviewcodedecompositionissuesapproachchangescontrolled
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Background: Code review is a cognitively demanding and time-consuming process. Previous qualitative studies hinted at how decomposing change sets into multiple yet internally coherent ones would improve the reviewing process. So far, literature provided no quantitative analysis of this hypothesis. Aims: (1) Quantitatively measure the effects of change decomposition on the outcome of code review (in terms of number of found defects, wrongly reported issues, suggested improvements, time, and understanding); (2) Qualitatively analyze how subjects approach the review and navigate the code, building knowledge and addressing existing issues, in large vs. decomposed changes. Method: Controlled experiment using the pull-based development model involving 28 software developers among professionals and graduate students. Results: Change decomposition leads to fewer wrongly reported issues, influences how subjects approach and conduct the review activity (by increasing context-seeking), yet impacts neither understanding the change rationale nor the number of found defects. Conclusions: Change decomposition reduces the noise for subsequent data analyses but also significantly supports the tasks of the developers in charge of reviewing the changes. As such, commits belonging to different concepts should be separated, adopting this as a best practice in software engineering.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. AtomicCommitBench: Can Coding Agents Reconstruct Commit Histories from Squashed Patches?

    cs.SE 2026-07 conditional novelty 6.5 of 10

    AtomicCommitBench shows retrospective commit-history reconstruction from real squashed patches is hard: agents nearly always replay, but grouping quality tops out near 0.46 ARI and fails mainly via same-file lumping.

Pith tools