Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 0

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

DocPrism: Multi-lingual Detection of Incorrectness Inconsistencies between Code and Documentation

Xu, Xiaomeng, Wahab, Zahin, Holmes, Reid, Lemieux, Caroline·2026·Proceedings of the ACM on Software Engineering

Abstract

Code-documentation inconsistencies are common and undesirable: they can lead to developer misunderstandings and software defects. This paper introduces DocPrism, a lightweight multi-language, code-documentation inconsistency detection tool. DocPrism uses a standard large language model (LLM) to analyze and explain inconsistencies, and focuses on outputting incorrectness inconsistencies. Plain use of LLMs for this task yields unacceptably high inconsistency flag rates—i.e., over 90% of functions are flagged as inconsistent with their documentation. One substantial reason is that LLMs identify natural gaps between high-level documentation and code as incompleteness inconsistencies. We introduce and apply the Local Categorization, External Filtering (LCEF) methodology: LCEF uses an LLM’s local completion skills, rather than its long-term reasoning skills, to focus on reporting incorrectness inconsistencies. In our ablation study, LCEF reduces DocPrism’s inconsistency flag rate from 98% to 14%, and increases F1 score from 0.22 to 0.77, compared to standard prompting techniques. On a broad evaluation across Python, TypeScript, C++, and Java, DocPrism maintains a low flag rate of 17%, and achieves a precision of 0.63 without performing any fine-tuning. We also establish a conservative lower bound across four programming languages, showing that inconsistency errors are present in 11% of code-documentation pairs. In addition, DocPrism achieves precision comparable to the state-of-the-art on an established synthetic dataset, but substantially outperforms it on our real-world Java dataset in precision (DocPrism: 0.47–0.67 vs. SOTA: 0.05–0.14).

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3832248

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Research works printed but not linked: 26

  1. 10.1109/ICSE.2019.00122 · DOI · Paper page
  2. 10.4324/9780203771587 · DOI · Paper page
  3. 10.1016/j.eswa.2025.127470 · DOI
  4. Keith Dunnigan. 2008. Confidence interval calculation for binomial proportions. In Proceedings of the SAS Global Forum (MWSUG).
  5. 10.1002/smr.2718 · DOI
  6. 10.1145/3661167.3661187 · DOI
  7. 10.1109/MS.2003.1241364 · DOI
  8. 10.1109/COMPSAC.2018.00028 · DOI
  9. 10.1109/TSE.2021.3138909 · DOI
  10. 10.11613/BM.2012.031 · DOI · Paper page
  11. 10.1007/BF02295996 · DOI · Paper page
  12. 10.1609/aaai.v35i1.16119 · DOI · Paper page
  13. 10.1145/3387904.3389286 · DOI
  14. 10.1109/ASE.2017.8115624 · DOI
  15. 10.1145/3649598 · DOI
  16. 10.1109/ICSE55347.2025.00035 · DOI
  17. 10.1109/ICSE.2015.76 · DOI
  18. 10.1109/SCAM51674.2020.00012 · DOI
  19. 10.1109/TCE.2025.3535632 · DOI
  20. 10.1145/1323293.1294276 · DOI
  21. 10.1109/ICST.2012.106 · DOI
  22. 10.1109/MS.2014.80 · DOI
  23. 10.48550/arXiv.2201.11903 · DOI · Paper page
  24. 10.1145/3728945 · DOI · Paper page
  25. 10.1109/TSE.2024.3358489 · DOI
  26. 10.1145/3691620.3695010 · DOI · Paper page

Metadata

Authors
Xu, X., Wahab, Z., Holmes, R., & Lemieux, C.
Venue
Proceedings of the ACM on Software Engineering
Published
2026-10-01
Volume
3
Issue
ISSTA
Pages
3591-3612
ISSN
2994-970X
Cited by
0
References
2
Language
en
Funders
Natural Sciences and Engineering Research Council of Canada (CRC-2024-00299, RGPIN-2023-04478)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: DocPrism: Multi-lingual Detection of Incorrectness Inconsistencies between Code and Documentation. https://app.cochat.ai/papers/10.1145/3832248
The paper
Xu, X., Wahab, Z., Holmes, R., & Lemieux, C. (2026). DocPrism: Multi-lingual Detection of Incorrectness Inconsistencies between Code and Documentation. Proceedings of the ACM on Software Engineering. https://doi.org/10.1145/3832248

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.