Automating inductive proofs using theory exploration

Authors:
Koen Claessen;Moa Johansson;Dan Rosén;Nicholas Smallbone
Affiliations:
Department of Computer Science and Engineering, Chalmers University of Technology, Sweden;Department of Computer Science and Engineering, Chalmers University of Technology, Sweden;Department of Computer Science and Engineering, Chalmers University of Technology, Sweden;Department of Computer Science and Engineering, Chalmers University of Technology, Sweden
Venue:
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Year:
2013

Citing 13
Cited 0

QuickCheck: a lightweight tool for random testing of Haskell programs

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
Rippling: meta-level guidance for mathematical reasoning

Rippling: meta-level guidance for mathematical reasoning
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
QuickSpec: guessing formal specifications using testing

TAP'10 Proceedings of the 4th international conference on Tests and proofs
Dynamic rippling, middle-out reasoning and lemma discovery

Verification, induction termination analysis
The ACL2 sedan theorem proving system

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Conjecture Synthesis for Inductive Theories

Journal of Automated Reasoning
Scheme-based theorem discovery and concept invention

Expert Systems with Applications: An International Journal
Case-Analysis for rippling and inductive proof

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Automating induction with an SMT solver

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Zeno: an automated prover for properties of recursive data structures

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
HALO: haskell to logic through denotational semantics

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.