DMCA
Simplification by cooperating decision procedures (1979)
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 450 - 2 self |
BibTeX
@ARTICLE{Nelson79simplificationby,
author = {Greg Nelson and Derek C. Oppen},
title = {Simplification by cooperating decision procedures},
journal = {ACM Transactions on Programming Languages and Systems},
year = {1979},
volume = {1},
pages = {245--257}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
Keyphrases
decision procedure individual variable lisp function stanford pascal verifier usual boolean connective several theory uninterpreted function symbol predicate car equality predicate arithmetic function quantifier-free theory normal form conditional function single decision procedure function store
