The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Simplification by Cooperating Decision Procedures
Open accessAbstract
A method for combining decision procedures for several theories into a single decision procedure for their combination is described, and a simplifier based on this method is discussed. The simplifier finds a normal form for any expression formed from individual variables, the usual Boolean connectives, the equality predicate =, the conditional function if-then-else, the integers, the arithmetic functions and predicates +, -, and ≤, the Lisp functions and predicates car, cdr, cons, and atom, the functions store and select for storing into and selecting from arrays, and uninterpreted function symbols. If the expression is a theorem it is simplified to the constant true, so the simplifier can be used as a decision procedure for the quantifier-free theory containing these functions and predicates. The simplifier is currently used in the Stanford Pascal Verifier.
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
Shoenfield, J. R. (1967) · Cited by 2,108
A Decision Method for Elementary Algebra and Geometry
Tarski, A. (1998) · Texts and Monographs in Symbolic Computation · doi:10.1007/978-3-7091-9459-1_3 · Cited by 1,643
A Basis for a Mathematical Theory of Computation )
(1963) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)72018-4 · Cited by 692
Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
Craig, W. (1957) · Journal of Symbolic Logic · doi:10.2307/2963594 · Cited by 667
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
A Basis for a Mathematical Theory of Computation
(1959) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(09)70099-0 · Cited by 321
A Practical Decision Procedure for Arithmetic with Function Symbols
Shostak, R. E. (1979) · Journal of the ACM · doi:10.1145/322123.322137 · Cited by 171
Complexity, convexity and combinations of theories
Oppen, D. C. (1980) · Theoretical Computer Science · doi:10.1016/0304-3975(80)90059-6 · Cited by 115
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
Knowledge Representation and Reasoning
(2024) · Encyclopedia of Computer Graphics and Games · doi:10.1007/978-3-031-23161-2_300700 · Cited by 819
EXE: automatically generating inputs of death
Cadar, C., Ganesh, V., Pawlowski, P. M., Dill, D. L., & Engler, D. R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180445 · Cited by 788
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
Self-citationEquations and Rewrite Rules: A Survey
Huet, G., & Oppen, D. C. (1980) · Formal Language Theory · doi:10.1016/b978-0-12-115350-2.50017-8 · Cited by 714
Self-citationBarrett, C., Conway, C. L., Deters, M., Hadarean, L., Jovanović, D., King, T., Reynolds, A., & Tinelli, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22110-1_14 · Cited by 655
Satisfiability modulo theories: introduction and applications
De Moura, L., & Bjørner, N. (2011) · Communications of the ACM · doi:10.1145/1995376.1995394 · Cited by 645
A Decision Procedure for Bit-Vectors and Arrays
Ganesh, V., & Dill, D. L. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73368-3_52 · Cited by 585
ESP: path-sensitive program verification in polynomial time
Das, M., Lerner, S., & Seigle, M. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512538 · Cited by 552
Dutertre, B. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-08867-9_49 · Cited by 398
Leino, K. R. M. (1998) · Programming Concepts and Methods PROCOMET ’98 · doi:10.1007/978-0-387-35358-6_1 · Cited by 393
The design and implementation of a certifying compiler
Necula, G. C., & Lee, P. (1998) · Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation · doi:10.1145/277650.277752 · Cited by 358
EXE: Automatically Generating Inputs of Death
Cadar, C., Ganesh, V., Pawlowski, P. M., Dill, D. L., & Engler, D. R. (2008) · ACM Transactions on Information and System Security · doi:10.1145/1455518.1455522 · Cited by 342
Expressiveness and tractability in knowledge representation and reasoning1
Levesque, H. J., & Brachman, R. J. (1987) · Computational Intelligence · doi:10.1111/j.1467-8640.1987.tb00176.x · Cited by 320
Formal verification in hardware design: a survey
Kern, C., & Greenstreet, M. R. (1999) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/307988.307989 · Cited by 284
Automated deduction by theory resolution
Stickel, M. (1985) · Journal of Automated Reasoning · doi:10.1007/bf00244275 · Cited by 280
Degano, P. (1983) · Pictorial Data Analysis · doi:10.1007/978-3-642-82017-5_12 · Cited by 265
History of Interactive Theorem Proving
Harrison, J., Urban, J., & Wiedijk, F. (2014) · Handbook of the History of Logic · doi:10.1016/b978-0-444-51624-4.50004-6 · Cited by 107
Introduction to Neural Network Verification
Albarghouthi, A. (2021) · Foundations and Trends® in Programming Languages · doi:10.1561/2500000051 · Cited by 78
Metadata
- Authors
- Nelson, G., & Oppen, D. C.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1979-10
- Volume
- 1
- Issue
- 2
- Pages
- 245-257
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2164778826
- Cited by
- 908
- References
- 8
- FWCI
- 6.86
- Type
- journal article
- 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
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.