Applications of Interactive Proof to Data Flow Analysis and Security


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… (More)
DOI: 10.3233/978-1-61499-385-8-77

6 Figures and Tables


  • Presentations referencing similar topics