In English

Theory Exploration on Infinite Structures

Sólrún Halla Einarsdóttir
Göteborg : Chalmers tekniska högskola, 2017. 42 s.
[Examensarbete på avancerad nivå]

Hipster is a theory exploration system for the interactive theorem prover Isabelle/HOL which has previously been used to discover and prove inductive properties. In this thesis we present our extension to Hipster which adds the capability to discover and prove coinductive properties, allowing the exploration of infinite structures that Hipster could not handle before.

We have extended Hipster with a coinductive proof tactic, allowing it to discover and prove coinductive lemmas. As Hipster’s theory exploration relies on generating terms and testing their equality, exploring infinite types whose equality cannot be determined presents a challenge. To solve this we have added support for observational equivalence to test the equivalence of infinite terms.

We have evaluated our extension on a number of examples and found that it is capable of proving a variety of coinductive theorems and discovering useful coinductive lemmas. To the best of our knowledge, Hipster is the first theory exploration system to be capable of handling infinite structures and discovering coinductive properties about them.

Nyckelord: Theory exploration, coinduction, automatic theorem proving, infinite structures, Hipster, Isabelle/HOL, QuickSpec, formal methods, functional programming



Publikationen registrerades 2017-10-12. Den ändrades senast 2017-10-12

CPL ID: 252478

Detta är en tjänst från Chalmers bibliotek