Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems

Authors:
Jeffrey Van Baalen;Steven Roach
Affiliations:
-;-
Venue:
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Year:
1998

Citing 12
Cited 1

Logic for computer science: foundations of automatic theorem proving

Logic for computer science: foundations of automatic theorem proving
Tops: theory operationalization for program synthesis

Tops: theory operationalization for program synthesis
A Practical Decision Procedure for Arithmetic with Function Symbols

Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Deciding Combinations of Theories

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
META-AMPHION: Synthesis of Efficient Domain-Specific Program Synthesis Systems

Automated Software Engineering
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
On Shostak's Decision Procedure for Combinations of Theories

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Deductive Composition of Astronomical Software from Subroutine Libraries

CADE-12 Proceedings of the 12th International Conference on Automated Deduction

Efficient E-Matching for SMT Solvers

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a class of decision procedures that we have found useful for efficient, domain-specific deductive synthesis, and a method for integrating this type of procedure into a general-purpose refutation-based theorem prover. We suggest that this is a large and interesting class of procedures and show how to integrate these procedures to accelerate a general-purpose theorem prover doing deductive synthesis. While much existing research on decision procedures has been either in isolation or in the context of interfacing procedures to non-refutation-based theorem provers, this appears to be the first reported work on decision procedures in the context of refutation-based deductive synthesis where witnesses must be found.