Affiliation:
1. Artificial Intelligence Laboratory, Computer Science Department, Stanford University, Stanford, CA
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Reference14 articles.
1. Assignment Commands with Array References
2. DOWNEY P. SETHL R. AND TARZAN R. Variations on the common subexpression problem. To appear in J. A CM. 10.1145/322217.322228 DOWNEY P. SETHL R. AND TARZAN R. Variations on the common subexpression problem. To appear in J. A CM. 10.1145/322217.322228
3. Some Completeness Results in the Mathematical Theory of Computation
Cited by
568 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Parikh’s Theorem Made Symbolic;Proceedings of the ACM on Programming Languages;2024-01-05
2. Complete First-Order Reasoning for Properties of Functional Programs;Proceedings of the ACM on Programming Languages;2023-10-16
3. Combining Stable Infiniteness and (Strong) Politeness;Journal of Automated Reasoning;2023-09-27
4. Semi-Automatic Integration of Little Languages;2023 IEEE International Conference on Autonomic Computing and Self-Organizing Systems Companion (ACSOS-C);2023-09-25
5. Some Model Theoretic Properties for Pavelka-Style Gödel Logic, RGL* and Gödel Logic with Δ;Axioms;2023-09-05