DMCA
A formalisation of Smallfoot in HOL (2009)
| Venue: | of Lecture Notes in Computer Science |
| Citations: | 20 - 1 self |
BibTeX
@INPROCEEDINGS{Tuerk09aformalisation,
author = {Thomas Tuerk},
title = {A formalisation of Smallfoot in HOL},
booktitle = {of Lecture Notes in Computer Science},
year = {2009},
pages = {469--484},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. In this paper a general framework for separation logic inside Separation Logic. It contains a model of an abstract, imperative programming language as well as an abstract specification logic for this language. While the formalisation mainly follows the original definition of Abstract Separation Logic, it contains some additional features. Most noticeably is added support for procedures. As a case study, the framework is instantiated to build a tool that is able to parse Smallfoot specifications and verify most of them completely automatically. In contrast to Smallfoot this instantiation can handle the content of data-structures as well as their shape. This enables it to verify fully functional specifications. Some noteworthy examples that have been verified are parallel mergesort and an interactive filter-function for single linked lists. 1
Keyphrases
separation logic parallel mergesort case study abstract specification logic noteworthy example added support additional feature interactive filter-function functional specification general framework original definition imperative programming language abstract separation logic smallfoot specification
