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

The DOI matches its Crossref record.

Avoiding exponential explosion: generating compact verification conditions

Flanagan, Cormac, Saxe, James B.·2001·Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Abstract

Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. This paper describes a two-stage VC generation algorithm that generates compact VCs whose size is worst-case quadratic in the size of the source fragment, and is close to linear in practice.This two-stage VC generation algorithm has been implemented as part of the Extended Static Checker for Java. It has allowed us to check large and complex methods that would otherwise be impossible to check due to time and space constraints.

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

Cites

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

Cited by

See all 220

Metadata

Authors
Flanagan, C., & Saxe, J. B.
Venue
Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Publisher
ACM
Published
2001-01
Pages
193-205
OpenAlex
W1992431017
Cited by
220
References
0
FWCI
7.37
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: Avoiding exponential explosion: generating compact verification conditions. https://app.cochat.ai/papers/10.1145/360204.360220
The paper
Flanagan, C., & Saxe, J. B. (2001). Avoiding exponential explosion: generating compact verification conditions. Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. https://doi.org/10.1145/360204.360220

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.