Imperative functional programming with isabelle/hol (2008)
Cached
Download Links
- [www4.informatik.tu-muenchen.de]
- [www4.in.tum.de]
- [web.cecs.pdx.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In TPHOLs ’08: Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics |
| Citations: | 14 - 3 self |
BibTeX
@INPROCEEDINGS{Bulwahn08imperativefunctional,
author = {Lukas Bulwahn and Er Krauss and Florian Haftmann and Levent Erkök and John Matthews and Technische Universität München},
title = {Imperative functional programming with isabelle/hol},
booktitle = {In TPHOLs ’08: Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics},
year = {2008},
pages = {134--149}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of programs, a polymorphic heap model using enumeration encodings and type classes, and a state-exception monad similar to known counterparts from Haskell. Existing proof automation tools are easily adapted to provide a verification environment. The framework immediately allows for correct code generation to ML and Haskell. Two case studies demonstrate our approach: An array-based checker for resolution proofs, and a more efficient bytecode verifier. 1
