A logic for virtual memory
Authors
School of Computer Science and Engineering
University of NSW
Sydney 2052
Australia
NICTA
Sydney
Australia
Abstract
We present an extension to classical separation logic which allows reasoning about virtual memory. Our logic is formalised in the Isabelle/HOL theorem prover in a manner allowing classical separation logic notation to be used at an abstract level. We demonstrate that in the common cases, such as user applications, our logic reduces to classical separation logic. At the same time we can express properties about page tables, direct physical memory access, virtual memory access, and shared memory in detail.
BibTeX Entry
@inproceedings{Kolanski_08,
publisher = {Elsevier},
title = {A Logic for Virtual Memory},
series = {Electronic Notes in Computer Science},
booktitle = {Proceedings of the 3rd Workshop on Systems Software Verification},
author = {Rafal Kolanski},
year = {2008},
month = {Feb},
volume = {217},
editor = {Ralf Huuck and Gerwin Klein and Bastian Schlich},
address = {Sydney, Australia},
pages = {61--77}
}