Pith. sign in

REVIEW 1 cited by

SequenceR: Sequence-to-Sequence Learning for End-to-End Program Repair

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1901.01808 v3 pith:JGNBOKKK submitted 2018-12-24 cs.SE cs.LGstat.ML

Zimin Chen , Steve Kommrusch , Michele Tufano , Louis-Noël Pouchet , Denys Poshyvanyk , Martin Monperrus This is my paper · ORCID
classification cs.SEcs.LGstat.ML
keywords repairlearningprogramsequence-to-sequencesequencerapproachbugscode
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents a novel end-to-end approach to program repair based on sequence-to-sequence learning. We devise, implement, and evaluate a system, called SequenceR, for fixing bugs based on sequence-to-sequence learning on source code. This approach uses the copy mechanism to overcome the unlimited vocabulary problem that occurs with big code. Our system is data-driven; we train it on 35,578 samples, carefully curated from commits to open-source repositories. We evaluate it on 4,711 independent real bug fixes, as well on the Defects4J benchmark used in program repair research. SequenceR is able to perfectly predict the fixed line for 950/4711 testing samples, and find correct patches for 14 bugs in Defects4J. It captures a wide range of repair operators without any domain-specific top-down design.

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. AuPair: Golden Example Pairs for Code Repair

    cs.SE 2025-02 conditional novelty 6.0 of 10

    Providing a different submodularly selected (guess, fix) example on each repair call improves LLM code repair over best-of-N and self-repair.

Pith tools