Application of automatic transformations to program verification

Authors:
R. L. Veroff;L. J. Henschen
Affiliations:
Applied Mathematics Division, Argonne National Laboratory, Argonne, IL;Electrical Eng. and Computer Scl., Northwestern University, Evanston, IL
Venue:
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Year:
1981

Citing 6
Cited 0

Interpolation Theorems for Resolution in Lower Predicate Calculus

Journal of the ACM (JACM)
Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets

Journal of the ACM (JACM)
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

Journal of the ACM (JACM)
Hyperparamodulation: A Refinement of Paramodulation

Proceedings of the 5th Conference on Automated Deduction
Adding Dynamic Paramodulation to Rewrite Algorithms

Proceedings of the 5th Conference on Automated Deduction
Automatic transformations in the inference process

Automatic transformations in the inference process

Quantified Score

Hi-index	0.00

Visualization

Abstract

A technique for incorporating automatic transformations into processes such as the application of inference rules, subsumptlon, and demodulation provides a mechanism for improving search strategies for theorem proving problems arising from the field of program verification. The incorporation of automatic transformations into the inference process can later the search space for a given problem and is particularly useful for problems having "broad" rather than "deep" proofs. The technique can also be used to permit the generation of inferences that might otherwise be blocked and to build some commutatlvlty or associativity into the unification process. Appropriate choice of transformations and new literal clashing and unification algorithms for applying them showed significant improvement on several real problems according to several distinct criteria.