Detecing and Correcting Faulty Conjectures
نویسندگان
چکیده
We present a method for patching faulty conjectures and program diagnosis in automatic theorem proving during a proof attempt. In this paper we discuss correctness of the approach and we show the application of corrective predicates to program diagnosis when conjectures are unprovable. The approach is implemented in an interactive theorem prover called SPES.
منابع مشابه
The Use of Abduction and Recursion-Editor Techniques for the Correction of Faulty Conjectures
The synthesis of programs as well as other synthetic tasks often end up with an unprovable, partially false conjecture. A successful subsequent synthesis attempt depends on determining why the conjecture is faulty and how it can be corrected. Hence, it is highly desirable to have an automated means for detecting and correcting faulty conjec-
متن کاملDistal Approaches in Patellofemoral Pain: A Systematic Review, Part I
Purpose: Increased patellofemoral joint reaction force (PFJRF) is the main cause of patellofemoral pain syndrome (PFP). Foot pronation causes faulty joint coupling of the lower limb and increases the PFJRF. Therefore, the aim of systematic review is effect of the distal interventions on the clinical symptoms and kinematic of PFP patients. Methods: The search strategy was carried out from Goo...
متن کاملThe New Quickcheck for Isabelle - Random, Exhaustive and Symbolic Testing under One Roof
The new Quickcheck is a counterexample generator for Isabelle/HOL that uncovers faulty specifications and invalid conjectures using various testing strategies. The previous Quickcheck only tested conjectures by random testing. The new Quickcheck extends the previous one and integrates two novel testing strategies: exhaustive testing with concrete values; and symbolic testing, evaluating conject...
متن کاملThe New Quickcheck for Isabelle Random, Exhaustive and Symbolic Testing Living Under One Roof
The new Quickcheck is a counterexample generator for Isabelle/HOL that uncovers faulty specifications and invalid conjectures using various testing strategies. The previous Quickcheck only tested conjectures by random testing. The new Quickcheck extends the previous one and integrates two novel testing strategies: exhaustive testing with concrete values; and symbolic testing, evaluating conject...
متن کاملCounterexample generation for higher-order logic using functional and logic programming
This thesis presents a counterexample generator for the interactive theorem prover Isabelle/HOL that uncovers faulty specifications and invalid conjectures using various testing methods. The primary contributions are two novel testing strategies: exhaustive testing with concrete values; and symbolic testing, evaluating conjectures with a narrowing strategy. Orthogonally to the strategies, this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006