Hipster: Integrating theory exploration in a proof assistant
Paper i proceeding, 2014

This paper describes Hipster, a system integrating theory exploration with the proof assistant Isabelle/HOL. Theory exploration is a technique for automatically discovering new interesting lemmas in a given theory development. Hipster can be used in two main modes. The first is exploratory mode, used for automatically generating basic lemmas about a given set of datatypes and functions in a new theory development. The second is proof mode, used in a particular proof attempt, trying to discover the missing lemmas which would allow the current goal to be proved. Hipster's proof mode complements and boosts existing proof automation techniques that rely on automatically selecting existing lemmas, by inventing new lemmas that need induction to be proved. We show example uses of both modes.

Författare

Moa Johansson

Chalmers, Data- och informationsteknik, Programvaruteknik

Dan Rosén

Chalmers, Data- och informationsteknik, Programvaruteknik

Nicholas Smallbone

Chalmers, Data- och informationsteknik, Programvaruteknik

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Programvaruteknik

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 8543 108-122

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1007/978-3-319-08434-3_9

ISBN

978-3-319-08433-6