HipSpec is a system for automatically deriving and proving properties about functional programs. It uses a novel approach, combining theory exploration, counterexample testing and inductive theorem proving. HipSpec automatically generates a set of equational theorems about the available recursive functions of a program. These equational properties make up an algebraic specification for the program and can in addition be used as a background theory for proving additional user-stated properties. Experimental results are encouraging: HipSpec compares favourably to other inductive theorem provers and theory exploration systems
Over the past few years, machine learning has been successfully combined with automated theorem pro...
Abstract. In this paper we discuss the similarities between program specialisation and inductive the...
Inductive programming is concerned with the automated construction of declarative, often functional,...
HipSpec is a system for automatically deriving and proving properties about functional programs. It ...
Abstract. HipSpec is a system for automatically deriving and proving properties about functional pro...
We have built two state-of-the-art inductive theorem provers named HipSpec and Hipster. The main iss...
Theory exploration is a technique for automatically discovering new interesting lemmas in a mathemat...
A key component of mathematical reasoning is the ability to formulate interesting conjectures about ...
This paper describes Hipster, a system integrating theory exploration with the proof assistant Isabe...
We have built two theory exploration systems, Cohipster and RoughSpec. Theory exploration is a metho...
We have implemented a program for inductive theory formation, called IsaCoSy, which synthesises conj...
A key component of mathematical reasoning is the ability to formulate interesting conjectures about ...
We present Phileas, an automatic theorem prover focused on structural induction. Phileas is capable ...
In this paper we discuss the similarities between program specialisation and inductive theorem provi...
Hipster is a theory exploration tool for the proof assistant Isabelle/HOL. It automatically discover...
Over the past few years, machine learning has been successfully combined with automated theorem pro...
Abstract. In this paper we discuss the similarities between program specialisation and inductive the...
Inductive programming is concerned with the automated construction of declarative, often functional,...
HipSpec is a system for automatically deriving and proving properties about functional programs. It ...
Abstract. HipSpec is a system for automatically deriving and proving properties about functional pro...
We have built two state-of-the-art inductive theorem provers named HipSpec and Hipster. The main iss...
Theory exploration is a technique for automatically discovering new interesting lemmas in a mathemat...
A key component of mathematical reasoning is the ability to formulate interesting conjectures about ...
This paper describes Hipster, a system integrating theory exploration with the proof assistant Isabe...
We have built two theory exploration systems, Cohipster and RoughSpec. Theory exploration is a metho...
We have implemented a program for inductive theory formation, called IsaCoSy, which synthesises conj...
A key component of mathematical reasoning is the ability to formulate interesting conjectures about ...
We present Phileas, an automatic theorem prover focused on structural induction. Phileas is capable ...
In this paper we discuss the similarities between program specialisation and inductive theorem provi...
Hipster is a theory exploration tool for the proof assistant Isabelle/HOL. It automatically discover...
Over the past few years, machine learning has been successfully combined with automated theorem pro...
Abstract. In this paper we discuss the similarities between program specialisation and inductive the...
Inductive programming is concerned with the automated construction of declarative, often functional,...