Simplification by Cooperating Decision Procedures

Author:

Nelson Greg1,Oppen Derek C.1

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)

Subject

Software

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3