### Skapa referens, olika format (klipp och klistra)

**Harvard**

Rosén, D. (2016) *Theory Exploration and Inductive Theorem Proving*. Göteborg : Chalmers University of Technology

** BibTeX **

@book{

Rosén2016,

author={Rosén, Dan},

title={Theory Exploration and Inductive Theorem Proving},

abstract={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 a method to systematically discover interesting conclusions about a mathematical theory. We use the existing theory exploration system QuickSpec which conjectures properties for a program that seem to hold based on testing. The idea is to try to prove these explored conjectures together with the user-stated goal conjecture. By using this idea and connecting it with our previous work on Hip, the Haskell Inductive Prover, we were able to take new leaps in field of inductive theorem proving.
Additionally, we have developed a benchmark suite named TIP, short for Tons of Inductive Problems, with benchmark problems for inductive theorem provers, and a tool box for converting and manipulating problems expressed in the TIP format. There were two main reasons to this initiative. Firstly, the inductive theorem proving field lacked a shared benchmark suite as well as a format. Secondly, the benchmarks that have been used were outdated: all contemporary provers would solve almost every problem. We have so far added hundreds of new challenges to the TIP suite to encourage further research.
},

publisher={Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers), Chalmers tekniska högskola,},

place={Göteborg},

year={2016},

note={90},

}

** RefWorks **

RT Dissertation/Thesis

SR Electronic

ID 231969

A1 Rosén, Dan

T1 Theory Exploration and Inductive Theorem Proving

YR 2016

AB 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 a method to systematically discover interesting conclusions about a mathematical theory. We use the existing theory exploration system QuickSpec which conjectures properties for a program that seem to hold based on testing. The idea is to try to prove these explored conjectures together with the user-stated goal conjecture. By using this idea and connecting it with our previous work on Hip, the Haskell Inductive Prover, we were able to take new leaps in field of inductive theorem proving.
Additionally, we have developed a benchmark suite named TIP, short for Tons of Inductive Problems, with benchmark problems for inductive theorem provers, and a tool box for converting and manipulating problems expressed in the TIP format. There were two main reasons to this initiative. Firstly, the inductive theorem proving field lacked a shared benchmark suite as well as a format. Secondly, the benchmarks that have been used were outdated: all contemporary provers would solve almost every problem. We have so far added hundreds of new challenges to the TIP suite to encourage further research.

PB Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers), Chalmers tekniska högskola,

LA eng

LK http://www.cse.chalmers.se/~danr/lic.pdf

LK http://publications.lib.chalmers.se/records/fulltext/231969/231969.pdf

OL 30