The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
Open accessOverview
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.
Integrity signals
Registry
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.
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
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595
A Temporal Logic of Nested Calls and Returns
Alur, R., Etessami, K., & Madhusudan, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24730-2_35 · Cited by 3,339
(2008) · Texts in Theoretical Computer Science · doi:10.1007/978-3-540-74105-3 · Cited by 290
Clarke, E. M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69850-0_1 · Cited by 264
(2007) · doi:10.1007/978-3-540-74113-8 · Cited by 187
(2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69850-0 · Cited by 140
Cited by
Satisfiability Modulo Theories
Barrett, C., & Tinelli, C. (2018) · Handbook of Model Checking · doi:10.1007/978-3-319-10575-8_11 · Cited by 1,122
S2E: a platform for in-vivo multi-path analysis of software systems
Chipounov, V., Kuznetsov, V., & Candea, G. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950396 · Cited by 514
Debugging the data plane with anteater
Mai, H., Khurshid, A., Agarwal, R., Caesar, M., Godfrey, P. B., & King, S. T. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018470 · Cited by 365
Validating SMT solvers via semantic fusion
Winterer, D., Zhang, C., & Su, Z. (2020) · Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3385412.3385985 · Cited by 82
Detecting critical bugs in SMT solvers using blackbox mutational fuzzing
Mansur, M. N., Christakis, M., Wüstholz, V., & Zhang, F. (2020) · Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering · doi:10.1145/3368089.3409763 · Cited by 53
Metadata
- Authors
- Brummayer, R., & Biere, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 174-177
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1579437898
- Cited by
- 369
- References
- 6
- FWCI
- 23.12
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays. https://app.cochat.ai/papers/10.1007/978-3-642-00768-2_16
- The paper
- Brummayer, R., & Biere, A. (2009). Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-00768-2_16
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.