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

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

Efficient state merging in symbolic execution

Open access
Kuznetsov, Volodymyr, Kinder, Johannes, Bucur, Stefan, Candea, George·2012·Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation

Abstract

Symbolic execution has proven to be a practical technique for building automated test case generation and bug finding tools. Nevertheless, due to state explosion, these tools still struggle to achieve scalability. Given a program, one way to reduce the number of states that the tools need to explore is to merge states obtained on different paths. Alas, doing so increases the size of symbolic path conditions (thereby stressing the underlying constraint solver) and interferes with optimizations of the exploration process (also referred to as search strategies). The net effect is that state merging may actually lower performance rather than increase it.

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

Cites

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

Cited by

See all 193

Metadata

Authors
Kuznetsov, V., Kinder, J., Bucur, S., & Candea, G.
Venue
Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher
ACM
Published
2012-06-11
Pages
193-204
ISSN
1531-7102 (ISSN-L)
OpenAlex
W1979693894
Cited by
193
References
1
FWCI
14.05
Type
conference paper
Language
en
Open access
green

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: Efficient state merging in symbolic execution. https://app.cochat.ai/papers/10.1145/2254064.2254088
The paper
Kuznetsov, V., Kinder, J., Bucur, S., & Candea, G. (2012). Efficient state merging in symbolic execution. Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/2254064.2254088

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.