Skip to main content


Formal memory models for verifying C systems code


Harvey Tuch

School of Computer Science and Engineering



Systems code is almost universally written in the C programming language or a variant. C has a very low level of type and memory abstraction and formal reasoning about C systems code requires a memory model that is able to capture the semantics of C pointers and types. At the same time, proof-based verification demands abstraction, in particular from the aliasing and frame problems.

In this thesis, we study the mechanisation of a series of models, from semantic to separation logic, for achieving this abstraction when performing interactive theorem-prover based verification of C systems code in higher- order logic. We do not commit common oversimplifications, but correctly deal with C's model of programming language values and the heap, while developing the ability to reason abstractly and efficiently. We validate our work by demonstrating that the models are applicable to real, security- and safety-critical code by formally verifying the memory allocator of the L4 microkernel. All formalisations and proofs have been developed and machine-checked in the Isabelle/HOL theorem prover.

BibTeX Entry

    school           = {UNSW},
    title            = {Formal Memory Models for Verifying {C} Systems Code},
    author           = {Harvey Tuch},
    month            = aug,
    year             = {2008},
    address          = {Sydney, Australia}


Served by Apache on Linux on seL4.
Served by Apache on Linux on seL4.