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
Centre for Intelligent Systems and their ApplicationsA key problem in automating proof by mathematic...
International audienceDeductive program verification is making fast progress these days. One of the ...
In earlier papers we described a technique for automatically constructing inductive proofs, using a ...
TIP is a toolbox for users and developers of inductive provers. It consists of a large number of too...
We have built two state-of-the-art inductive theorem provers named HipSpec and Hipster. The main iss...
This paper describes our collection of benchmarks for inductive theorem provers. The recent spur of ...
We have implemented a program for inductive theory formation, called IsaCoSy, which synthesises conj...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging probl...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging proble...
HipSpec is a system for automatically deriving and proving properties about functional programs. It ...
Over the past few years, machine learning has been successfully combined with automated theorem pro...
We describe rippling: a tactic for the heuristic control of the key part of proofs by mathematical i...
Proof assistants offer tactics to facilitate inductive proofs; however, deciding what arguments to p...
We present a brief overview on completion based inductive theorem proving techniques, point out the ...
Theory exploration is a technique for automatically discovering new interesting lemmas in a mathemat...
Centre for Intelligent Systems and their ApplicationsA key problem in automating proof by mathematic...
International audienceDeductive program verification is making fast progress these days. One of the ...
In earlier papers we described a technique for automatically constructing inductive proofs, using a ...
TIP is a toolbox for users and developers of inductive provers. It consists of a large number of too...
We have built two state-of-the-art inductive theorem provers named HipSpec and Hipster. The main iss...
This paper describes our collection of benchmarks for inductive theorem provers. The recent spur of ...
We have implemented a program for inductive theory formation, called IsaCoSy, which synthesises conj...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging probl...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging proble...
HipSpec is a system for automatically deriving and proving properties about functional programs. It ...
Over the past few years, machine learning has been successfully combined with automated theorem pro...
We describe rippling: a tactic for the heuristic control of the key part of proofs by mathematical i...
Proof assistants offer tactics to facilitate inductive proofs; however, deciding what arguments to p...
We present a brief overview on completion based inductive theorem proving techniques, point out the ...
Theory exploration is a technique for automatically discovering new interesting lemmas in a mathemat...
Centre for Intelligent Systems and their ApplicationsA key problem in automating proof by mathematic...
International audienceDeductive program verification is making fast progress these days. One of the ...
In earlier papers we described a technique for automatically constructing inductive proofs, using a ...