Data refinement in Isabelle/HOL

Authors:
Florian Haftmann;Alexander Krauss;Ondřej Kunčar;Tobias Nipkow
Affiliations:
Technische Universität München, Germany;Technische Universität München, Germany;Technische Universität München, Germany;Technische Universität München, Germany
Venue:
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Year:
2013

Citing 10
Cited 1

Non-deterministic data types: models and implementations

Acta Informatica
Data refinement refined

Proc. of the European symposium on programming on ESOP 86
Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types?

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Software Development: A Rigorous Approach

Software Development: A Rigorous Approach
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Efficient execution in an automated reasoning environment

Journal of Functional Programming
Quotients revisited for Isabelle/HOL

Proceedings of the 2011 ACM Symposium on Applied Computing
Animating the formalised semantics of a Java-like language

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Automatic proof and disproof in Isabelle/HOL

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Code generation via higher-order rewrite systems

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming

Verified decision procedures for MSO on words based on derivatives of regular expressions

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper shows how the code generator of Isabelle/HOL supports data refinement, i.e., providing efficient code for operations on abstract types, e.g., sets or numbers. This allows all tools that employ code generation, e.g., Quickcheck or proof by evaluation, to compute with these abstract types. At the core is an extension of the code generator to deal with data type invariants. In order to automate the process of setting up specific data refinements, two packages for transferring definitions and theorems between types are exploited.