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

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

SAT-Based Model Checking without Unrolling

Bradley, Aaron R.·2011·Lecture Notes in Computer Science

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.1007/978-3-642-18275-4_7

Cites

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

Research works printed but not linked: 12

  1. Awedh, M., Somenzi, F.: Automatic invariant strengthening to prove properties in bounded model checking. In: DAC, pp. 1073–1076. ACM Press, New York (2006)
  2. Biere, A., Claessen, K.: Hardware model checking competition. In: Hardware Verification Workshop (2010)
  3. Bradley, A.R.: Safety Analysis of Systems. PhD thesis, Stanford University (May 2007)
  4. Bradley, A.R.: k-step relative inductive generalization. Tech. Rep., CU Boulder (March 2010), http://arxiv.org/abs/1003.3649 · arXiv
  5. Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2000)
  6. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238–252. ACM Press, New York (1977)
  7. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61–75. Springer, Heidelberg (2005) · doi:10.1007/11499107_5
  8. Eén, N., Mishchenko, A., Sörensson, N.: Applying logic synthesis for speeding up SAT. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 272–286. Springer, Heidelberg (2007) · doi:10.1007/978-3-540-72788-0_26
  9. Floyd, R.W.: Assigning meanings to programs. In: Symposia in Applied Mathematics, vol. 19, pp. 19–32. American Mathematical Society, Providence (1967)
  10. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, New York (1995) · DOI
  11. de Moura, L., Rueß, H., Sorea, M.: Bounded model checking and induction: From refutation to verification. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 14–26. Springer, Heidelberg (2003) · doi:10.1007/978-3-540-45069-6_2
  12. Vimjam, V.C., Hsiao, M.S.: Fast illegal state identification for improving SAT-based induction. In: DAC, pp. 241–246. ACM Press, New York (2006)

Cited by

See all 548

Metadata

Authors
Bradley, A. R.
Venue
Lecture Notes in Computer Science
Published
2011
Pages
70-87
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W3138459719
Cited by
548
References
12
FWCI
23.48
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: SAT-Based Model Checking without Unrolling. https://app.cochat.ai/papers/10.1007/978-3-642-18275-4_7
The paper
Bradley, A. R. (2011). SAT-Based Model Checking without Unrolling. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-18275-4_7

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.