Formal Verification of a Combination Decision Procedure

Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Eves. Shostak, in 1984, published a decision procedure for the combination of canonizable and solvable theories. Recently, Ruess and Shankar showed Shostak's method to be incomplete and nonterminating, and presented a correct version of Shostak's algorithm along with informal proofs of termination, soundness, and completeness. We describe a formalization and mechanical verification of these proofs using the PVS verification system. The formalization itself posed significant challenges and the verification revealed some gaps in the informal argument.

• Type: Conference
• Year: 2002
• Where: CADE
• Authors: Jonathan Ford, Natarajan Shankar
• Keywords: Automated Reasoning, CADE 2002, Modern Theorem Provers, Shankar Showed Shostak, Stanford Pascal Verifier