The MathSAT5 SMT Solver
The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Eén, N., & Sörensson, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24605-3_37 · Cited by 2,629
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
Wos, L. (1985) · American Mathematical Monthly · doi:10.1080/00029890.1985.11971545 · Cited by 1,040
CPAchecker: A Tool for Configurable Software Verification
Beyer, D., & Keremoğlu, M. E. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22110-1_16 · Cited by 716
A Fast Linear-Arithmetic Solver for DPLL(T)
Dutertre, B., & de Moura, L. (2006) · Lecture notes in computer science · doi:10.1007/11817963_11 · Cited by 679
Temporal Induction by Incremental SAT Solving
Eén, N., & Sörensson, N. (2003) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)82542-3 · Cited by 382
SMT Techniques for Fast Predicate Abstraction
Lahiri, S. K., Nieuwenhuis, R., & Oliveras, A. (2006) · Lecture notes in computer science · doi:10.1007/11817963_39 · Cited by 127
Ufo: A Framework for Abstraction- and Interpolation-Based Software Verification
Albarghouthi, A., Li, Y., Gurfinkel, A., & Chećhik, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31424-7_48 · Cited by 102
Deciding floating-point logic with systematic abstraction
Haller, L., Griggio, A., Brain, M., & Kroening, D. (2012) · Oxford University Research Archive (ORA) (University of Oxford) · Cited by 62
Self-citation
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
The nuXmv Symbolic Model Checker
Cavada, R., Cimatti, A., Dorigatti, M., Griggio, A., Mariotti, A., Micheli, A., Mover, S., Roveri, M., & Tonetta, S. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-08867-9_22 · Cited by 545
Self-citationcvc5: A Versatile and Industrial-Strength SMT Solver
Barbosa, H., Barrett, C., Brain, M., Kremer, G., Lachnitt, H., Mann, M., Mohamed, A., Mohamed, M., Niemetz, A., Nötzli, A., et al. (2022) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-99524-9_24 · Cited by 468
A Storm is Coming: A Modern Probabilistic Model Checker
Dehnert, C., Junges, S., Katoen, J.-P., & Volk, M. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63390-9_31 · Cited by 401
Dutertre, B. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-08867-9_49 · Cited by 398
Zhu, X., Wen, S., Camtepe, S., & Xiang, Y. (2022) · ACM Computing Surveys · doi:10.1145/3512345 · Cited by 334
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
- Cimatti, A., Griggio, A., Schaafsma, B. J., & Sebastiani, R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 93-107
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W221832247
- Cited by
- 488
- References
- 12
- FWCI
- 35.36
- 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
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.