Guiding Program Development Systems by a Connection Based Proof Strategy

. We present an automated proof method for constructive logic based on Wallen's matrix characterization for intuitionistic validity. The proof search strategy extends Bibel's connection method for classical predicate logic. It generates a matrix proof which will then be transformed into a proof within a standard sequent calculus. Thus we can use an efficient proof method to guide the development of constructive proofs in interactive proof/program development systems. 1 Introduction According to the proofs-as-programs paradigm of program synthesis the development of verifiably correct software is strongly related to proving theorems about the satisfiability of a given specification. If such a theorem is proven in a constructive manner then the proof construction implicitly contains an algorithm which is guaranteed to solve the specified problem. In contrast to `deductive' synthesis for which classical proof methods are sufficient, however, synthesis techniques based on this paradigm ha..