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

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

ESP: path-sensitive program verification in polynomial time

Das, Manuvir, Lerner, Sorin, Seigle, Mark·2002·Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation

Abstract

In this paper, we present a new algorithm for partial program verification that runs in polynomial time and space. We are interested in checking that a program satisfies a given temporal safety property. Our insight is that by accurately modeling only those branches in a program for which the property-related behavior differs along the arms of the branch, we can design an algorithm that is accurate enough to verify the program with respect to the given property, without paying the potentially exponential cost of full path-sensitive analysis.We have implemented this "property simulation" algorithm as part of a partial verification tool called ESP. We present the results of applying ESP to the problem of verifying the file I/O behavior of a version of the GNU C compiler (gcc, 140,000 LOC). We are able to prove that all of the 646 calls to .fprintf in the source code of gcc are guaranteed to print to valid, open files. Our results show that property simulation scales to large programs and is accurate enough to verify meaningful properties.

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/512529.512538

Cites

20 of 20 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 20 references

Cited by

See all 552

Metadata

Authors
Das, M., Lerner, S., & Seigle, M.
Venue
Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation
Publisher
ACM
Published
2002-05-17
Pages
57-68
ISSN
1531-7102 (ISSN-L)
OpenAlex
W2103714221
Cited by
552
References
20
FWCI
36.43
Type
conference paper
Language
en
Open access
closed

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: ESP: path-sensitive program verification in polynomial time. https://app.cochat.ai/papers/10.1145/512529.512538
The paper
Das, M., Lerner, S., & Seigle, M. (2002). ESP: path-sensitive program verification in polynomial time. Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation. https://doi.org/10.1145/512529.512538

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.