Hipster: Integrating theory exploration in a proof assistant
Paper in proceedings, 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.

Author

Moa Johansson

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Dan Rosén

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Nicholas Smallbone

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Koen Lindström Claessen

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 8543 108-122

Subject Categories

Computer Science

DOI

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

ISBN

978-3-319-08433-6

More information

Created

10/7/2017