Skip to main content


Applications of interactive proof to data flow analysis and security


Gerwin Klein and Tobias Nipkow



TU Munich


We show how to formalise a small imperative programming language in the theorem prover Isabelle/HOL, how to define its semantics, and how to prove properties about the language, its type systems, and a number of data flow analyses.

The emphasis is not on formalising a complex language deeply, but to teach a number of formalisation techniques and proof strategies using simple examples. For this purpose, we cover a basic type system with type safety proof, more complex security type systems, also with soundness proofs, and different kinds of data flow analyses, in particular definite initialisation analysis and constant propagation, again with correctness proofs.

BibTeX Entry

    publisher        = {IOS Press BV},
    author           = {Klein, Gerwin and Nipkow, Tobias},
    series           = {NATO Science for Peace and Security Series },
    issn             = {1874-6268},
    month            = may,
    volume           = {36},
    editor           = {{Grumberg, O., Seidl, H., Irlbeck, M.}},
    year             = {2014},
    keywords         = {isabelle, semantics, marktoberdorf},
    title            = {Applications of Interactive Proof to Data Flow Analysis and Security},
    booktitle        = {Software Systems Safety},
    pages            = {77-134}


Served by Apache on Linux on seL4.