Automatic data refinement. We present the Autoref tool for Isabelle/HOL, which automatically refines algorithms specified over abstract concepts like maps and sets to algorithms over concrete implementations like red-black-trees, and produces a refinement theorem. It is based on ideas borrowed from relational parametricity due to Reynolds and Wadler.par The tool allows for rapid prototyping of verified, executable algorithms. Moreover, it can be configured to fine-tune the result to the user’s needs. Our tool is able to automatically instantiate generic algorithms, which greatly simplifies the implementation of executable data structures.par Thanks to its integration with the Isabelle refinement framework and the Isabelle collection framework, Autoref can be used as a backend to a stepwise refinement based development approach, having access to a rich library of verified data structures. We have evaluated the tool by synthesizing efficiently executable refinements for some complex algorithms, as well as by implementing a library of generic algorithms for maps and sets.
Keywords for this software
References in zbMATH (referenced in 6 articles , 1 standard article )
Showing results 1 to 6 of 6.
- Aransay, Jesús; Divasón, Jose: A formalisation in HOL of the fundamental theorem of linear algebra and its application to the solution of the least squares problem (2017)
- Lochbihler, Andreas: Probabilistic functions and cryptographic oracles in higher order logic (2016)
- Martin-Dorel, Érik; Hanrot, Guillaume; Mayero, Micaela; Théry, Laurent: Formally verified certificate checkers for hardest-to-round computation (2015)
- Aransay, Jesús; Divasón, Jose: Formalization and execution of linear algebra: from theorems to algorithms (2014)
- Huffman, Brian; Kunčar, Ondřej: Lifting and transfer: a modular design for quotients in Isabelle/HOL (2013)
- Lammich, Peter: Automatic data refinement (2013)