TIP: Tools for Inductive Provers
نویسندگان
چکیده
TIP is a toolbox for users and developers of inductive provers. It consists of a large number of tools which can, for example, simplify an inductive problem, monomorphise it or find counterexamples to it. We are using TIP to help maintain a set of benchmarks for inductive theorem provers, where its main job is to encode aspects of the problem that are not natively supported by the respective provers. TIP makes it easier to write inductive provers, by supplying necessary tools such as lemma discovery which prover authors can simply import into their own prover.
منابع مشابه
Theory Exploration and Inductive Theorem Proving
We have built two state-of-the-art inductive theorem provers named HipSpec and Hipster. The main issue when automating proofs by induction is to discover essential helper lemmas. Our theorem provers use the technique theory exploration, which is amethod to systematically discover interesting conclusions about a mathematical theory. We use the existing theory exploration system QuickSpec which c...
متن کاملTIP: Tons of Inductive Problems
This paper describes our collection of benchmarks for inductive theorem provers. The recent spur of interest in automated inductive theorem proving has increased the demands for evaluation and comparison between systems. We expect the benchmark suite to continually grow as more problems are submitted by the community. New challenge problems will promote further development of provers which will...
متن کاملOne Logic to Use Them All
Deductive program veri cation is making fast progress these days. One of the reasons is a tremendous improvement of theorem provers in the last two decades. This includes various kinds of automated theorem provers, such as ATP systems and SMT solvers, and interactive proof assistants. Yet most tools for program veri cation are built around a single theorem prover. Instead, we defend the idea th...
متن کاملData Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application
This paper presents modeling of a binary tree that represents a natural number and gives an inductive proof for its properties using theorem provers. We define a function for converting data from a natural number into a binary tree and give an inductive proof for its well-definedness. We formalize this method, develop a computational model based on it, and apply it to an electronic cash protoco...
متن کاملPredicting Failures of and Repairing Inductive Proof Attempts⋆
Inductive reasoning is critical for ensuring reliability of computational descriptions, especially of algorithms defined on recursive data structures. Despite advances made in automating inductive reasoning, proof attempts by theorem provers frequently fail while performing inductive reasoning. A user of such a system must scrutinize a failed proof attempt and do intensive debugging to understa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015