The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Satisfiability modulo theories: introduction and applications
Abstract
Checking the satisfiability of logical formulas, SMT solvers scale orders of magnitude beyond custom ad hoc solvers.
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
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
Self-citationThe complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
A machine program for theorem-proving
Davis, M., Logemann, G., & Loveland, D. (1962) · Communications of the ACM · doi:10.1145/368273.368557 · Cited by 3,220
PVS: A prototype verification system
Owre, S., Rushby, J. M., & Shankar, N. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55602-8_217 · Cited by 1,415
Extended static checking for Java
Flanagan, C., Leino, K. R. M., Lillibridge, M., Nelson, G., Saxe, J. B., & Stata, R. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512558 · Cited by 1,340
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 Spec# Programming System: An Overview
Barnett, M., Leino, K. R. M., & Schulte, W. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30569-9_3 · Cited by 986
The S LAM project: debugging system software via static analysis
Ball, T., & Rajamani, S. K. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503274 · Cited by 923
Simplification by Cooperating Decision Procedures
Nelson, G., & Oppen, D. C. (1979) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357073.357079 · Cited by 908
Simplify: a theorem prover for program checking
Detlefs, D., Nelson, G., & Saxe, J. B. (2005) · Journal of the ACM · doi:10.1145/1066100.1066102 · Cited by 786
Nieuwenhuis, R., Oliveras, A., & Tinelli, C. (2006) · Journal of the ACM · doi:10.1145/1217856.1217859 · Cited by 783
Frontiers in Artificial Intelligence and Applications
To, W., Tryfonas, T., & FARTHING, D. W. (2009) · IOS Press eBooks · Cited by 720
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
Computer-Aided Reasoning: An Approach
Kaufmann, M., Moore, J. S., & Manolios, P. (2011) · Cited by 608
VCC: A Practical System for Verifying Concurrent C
Cohen, E., Dahlweid, M., Hillebrand, M. A., Leinenbach, D., Moskal, M., Santen, T., Schulte, W., & Tobies, S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03359-9_2 · Cited by 565
Towards a Mathematical Science of Computation
McCarthy, J. (1993) · Studies in Cognitive Systems · doi:10.1007/978-94-011-1793-7_2 · Cited by 525
Software Verification with BLAST
Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-44829-2_17 · Cited by 424
Variations on the Common Subexpression Problem
Downey, P. J., Sethi, R., & Tarjan, R. E. (1980) · Journal of the ACM · doi:10.1145/322217.322228 · Cited by 368
Boolean satisfiability from theoretical hardness to practical success
Malik, S., & Zhang, L. (2009) · Communications of the ACM · doi:10.1145/1536616.1536637 · Cited by 174
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
Barrett, C., Dill, D. L., & Stump, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45657-0_18 · Cited by 150
The S LAM project: debugging system software via static analysis
Ball, T., & Rajamani, S. K. (2002) · ACM SIGPLAN Notices · doi:10.1145/565816.503274 · Cited by 132
Automating Software Testing Using Program Analysis
Godefroid, P., de Halleux, P., Nori, A. V., et al. (2008) · IEEE Software · doi:10.1109/ms.2008.109 · Cited by 122
Complexity, convexity and combinations of theories
Oppen, D. C. (1980) · Theoretical Computer Science · doi:10.1016/0304-3975(80)90059-6 · Cited by 115
Cited by
Symbolic execution for software testing: three decades later
Cadar, C., & Sen, K. (2013) · Communications of the ACM · doi:10.1145/2408776.2408795 · Cited by 776
A survey of symbolic execution techniques
Baldoni, R., Coppa, E., D’elia, D. C., Demetrescu, C., & Finocchi, I. (2019) · ACM Computing Surveys · doi:10.1145/3182657 · Cited by 708
Alur, R., Bodik, R., Juniwal, G., Martin, M. M. K., Raghothaman, M., Seshia, S. A., Singh, R., Solar-Lezama, A., Torlak, E., & Udupa, A. (2013) · 2013 Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2013.6679385 · Cited by 656
(2021) · doi:10.1109/tse.2019.2946563 · Cited by 574
Cloud computing service composition: A systematic literature review
Jula, A., Sundararajan, E., & Othman, Z. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.12.017 · Cited by 402
Metadata
- Authors
- De Moura, L., & Bjørner, N.
- Venue
- Communications of the ACM
- Published
- 2011-09
- Volume
- 54
- Issue
- 9
- Pages
- 69-77
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2137351629
- Cited by
- 645
- References
- 23
- FWCI
- 31.10
- Type
- journal article
- 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.