|
19400
|
1 |
|
|
|
2 |
% $Id$
|
|
|
3 |
|
|
|
4 |
\documentclass[11pt,a4paper]{report}
|
|
|
5 |
\usepackage{graphicx}
|
|
|
6 |
\usepackage[english]{babel}
|
|
|
7 |
\usepackage{isabelle,isabellesym}
|
|
|
8 |
\usepackage{pdfsetup}
|
|
|
9 |
|
|
|
10 |
\urlstyle{rm}
|
|
|
11 |
\isabellestyle{it}
|
|
|
12 |
|
|
|
13 |
\renewcommand{\isamarkupheader}[1]{#1}
|
|
|
14 |
|
|
|
15 |
\begin{document}
|
|
|
16 |
|
|
|
17 |
\title{Hoare Logic}
|
|
|
18 |
\author{Various}
|
|
|
19 |
\maketitle
|
|
|
20 |
|
|
|
21 |
\begin{abstract}
|
|
|
22 |
These theories contain a Hoare logic for a simple imperative
|
|
|
23 |
programming language with while-loops, including a verification
|
|
|
24 |
condition generator.
|
|
|
25 |
|
|
|
26 |
Special infrastructure for modelling and reasoning about pointer
|
|
|
27 |
programs is provided, together with many examples, including Schorr-Waite.
|
|
|
28 |
See \cite{MehtaN-CADE03,MehtaN-IC05} for an excellent exposition.
|
|
|
29 |
\end{abstract}
|
|
|
30 |
|
|
|
31 |
\pagestyle{plain}
|
|
|
32 |
\thispagestyle{empty}
|
|
|
33 |
\tableofcontents
|
|
|
34 |
|
|
|
35 |
\newpage
|
|
|
36 |
|
|
|
37 |
\input{session}
|
|
|
38 |
|
|
|
39 |
\bibliographystyle{plain}
|
|
|
40 |
\bibliography{root}
|
|
|
41 |
|
|
|
42 |
\end{document}
|