author | haftmann |

Tue Mar 25 08:29:50 2008 +0100 (2008-03-25 ago) | |

changeset 26388 | b879f68cf92b |

parent 26387 | 7807cbf7640f |

child 26389 | 3835c431e141 |

removed

doc-src/Abstract/abstract.html | file | annotate | diff | revisions | |

doc-src/Abstract/abstract.tex | file | annotate | diff | revisions |

1.1 --- a/doc-src/Abstract/abstract.html Mon Mar 24 23:34:31 2008 +0100 1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000 1.3 @@ -1,22 +0,0 @@ 1.4 -<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> 1.5 - 1.6 -<!-- $Id$ --> 1.7 - 1.8 -<html> 1.9 - 1.10 - <head> 1.11 - <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1"> 1.12 - <title>Isabelle</title> 1.13 - </head> 1.14 - 1.15 - <body bgcolor="#ffffff"> 1.16 - <h1>Isabelle</h1> 1.17 - <p><a href="http://isabelle.in.tum.de/">Isabelle</a> is a generic proof assistant. It allows mathematical formulas to be expressed in a formal language and provides tools for proving those formulas in a logical calculus. The main potential application in industry is <em>formal verification</em>, which includes proving the correctness of computer hardware or software and proving properties of computer languages and protocols. Among its research applications are the formalization of mathematical proofs. </p> 1.18 - <p>Compared with similar tools, Isabelle's distinguishing feature is its flexibility. Most proof assistants are built around a single formal calculus, typically higher-order logic. Isabelle has the capacity to accept a variety of formal calculi. The distributed version supports higher-order logic but also axiomatic set theory and several <a href="http://isabelle.in.tum.de/logics.html">other formalisms</a>. Isabelle provides excellent notational support: new notations can be introduced, using normal mathematical symbols. Proofs can be written in a structured notation based upon traditional proof style, or more straightforwardly as sequences of commands. Definitions and proofs may include TeX source, from which Isabelle can automatically generate typeset documents.</p> 1.19 - <p>The main limitation of all such systems is that proving theorems requires much effort from an expert user. Isabelle incorporates some tools to improve the user's productivity by automating some parts of the proof process. In particular, Isabelle's <em>classical reasoner</em> can perform long chains of reasoning steps to prove formulas. The <em>simplifier</em> can prove certain arithmetic facts and can reason about equations. Isabelle is closely integrated with the <a href="http://www.cl.cam.ac.uk/users/lcp/papers/protocols.html">Proof General</a> user interface, which eases the task of writing and maintaining proof scripts.. </p> 1.20 - <p>Isabelle includes with large theories of formally verified mathematics, including elementary number theory (for example, Gauss's law of quadratic reciprocity), analysis (basic properties of limits, derivatives and integrals), algebra (up to Sylow's theorem) and set theory (the relative consistency of the Axiom of Choice). Also provided are numerous examples arising from research into formal verification. Isabelle is <a href="http://isabelle.in.tum.de/dist/">distributed</a> free of charge to academic users.</p> 1.21 - <p>Ample <a href="http://isabelle.in.tum.de/dist/docs.html">documentation</a> is available, including a <a href="http://www4.in.tum.de/%7enipkow/LNCS2283/">Tutorial</a> published by Springer-Verlag. Several <a href="http://www.cl.cam.ac.uk/users/lcp/papers/isabelle.html">papers</a> on the design of Isabelle are available. There is also a list of past and present <a href="http://www.cl.cam.ac.uk/Research/HVG/Isabelle/projects.html">projects</a> undertaken using Isabelle. </p> 1.22 - <p>Isabelle is a joint project between <a href="http://www.cl.cam.ac.uk/users/lcp/">Lawrence C. Paulson</a> (University of Cambridge, UK) and <a href="http://www.in.tum.de/%7enipkow/">Tobias Nipkow</a> (Technical University of Munich, Germany).</p> 1.23 - </body> 1.24 - 1.25 -</html>

2.1 --- a/doc-src/Abstract/abstract.tex Mon Mar 24 23:34:31 2008 +0100 2.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000 2.3 @@ -1,67 +0,0 @@ 2.4 -\documentclass[11pt]{article} 2.5 - 2.6 -\title{Isabelle: An Overview} 2.7 -\author{Lawrence C. Paulson} 2.8 - 2.9 -\date{October 2003} 2.10 - 2.11 -\usepackage{basic,times,mathtime} 2.12 - 2.13 -\makeatletter 2.14 -\@ifundefined{pdfoutput}{\message{No PDF output}% 2.15 - \usepackage{../url}% 2.16 - \newcommand{\hfootref}[2]{#2\footnote{\url{#1}}}}% 2.17 -{\message{Generating PDF output}% 2.18 - \usepackage{color}\definecolor{darkblue}{rgb}{0,0,0.5}% 2.19 - \usepackage[pdftex,colorlinks=true,linkcolor=darkblue,citecolor=darkblue,filecolor=darkblue,pagecolor=darkblue,urlcolor=darkblue]{hyperref} \newcommand{\hfootref}[2]{\href{#1}{#2}\footnote{\url{#1}}}} 2.20 - 2.21 -\makeatother 2.22 - 2.23 -\begin{document} 2.24 -\maketitle 2.25 - 2.26 - Isabelle~\cite{isa-tutorial} is a generic proof assistant. It allows mathematical formulas to be expressed in a 2.27 -formal language and provides tools for proving those formulas in a 2.28 -logical calculus. The main potential application in industry is 2.29 -\emph{formal verification}, which includes proving the 2.30 -correctness of computer hardware or software and proving 2.31 -properties of computer languages and protocols. Among its research 2.32 -applications are the formalization of mathematical proofs. 2.33 - 2.34 -Compared with similar tools, Isabelle's distinguishing feature is its flexibility. Most proof assistants 2.35 -are built around a single formal calculus, typically higher-order logic. 2.36 -Isabelle has the capacity to 2.37 -accept a variety of formal calculi. The distributed version 2.38 -supports higher-order logic but also axiomatic set theory and several other 2.39 -formalisms. Isabelle provides excellent notational support: 2.40 -new notations can be introduced, using normal mathematical symbols. 2.41 - 2.42 -The main limitation of all such systems is that proving theorems 2.43 -requires much effort 2.44 -from an expert user. Isabelle incorporates some tools to improve 2.45 -the user's productivity by automating some parts of the proof process. 2.46 -In particular, Isabelle's \emph{classical reasoner} can perform long 2.47 -chains of reasoning steps to prove formulas. The \emph{simplifier} 2.48 -can prove certain arithmetic facts and can reason about equations. 2.49 - 2.50 -Isabelle is closely integrated with the 2.51 -\hfootref{http://www.cl.cam.ac.uk/users/lcp/papers/protocols.html}{Proof General} user interface, which greatly eases the task of interacting with 2.52 -Isabelle. Proof General is open-source software under the GNU General Public 2.53 -License. Using Isabelle without Proof General would be difficult. 2.54 - 2.55 -Isabelle is distributed with large theories of formalized mathematics, 2.56 -including elementary number theory (for example, Gauss's law of quadratic reciprocity), analysis (basic properties of limits, derivatives and integrals) and algebra (up to Sylow's theorem). Also provided are numerous 2.57 -examples arising from research into formal verification. The total size of 2.58 -the distribution (program sources and documentation) is about 5.4MB. 2.59 - 2.60 -\paragraph*{Sponsorship.} 2.61 -Isabelle is a joint project between Cambridge and the Technical University 2.62 -of Munich, Germany. Prof.\ Tobias Nipkow leads the German team; other significant contributors at Munich include Dr. Markus Wenzel, Dr. Gerwin Klein and Mr.\ Stefan Berghofer. 2.63 - The development of Isabelle at Cambridge was funded by the following grants: 2.64 -\begin{itemize} \item \emph{Supporting Logics} (6/1986--11/1989). SERC grant GR/E0355.7 \item \emph{Logical Frameworks: Design, Implementation and Experiment} (6/1989--3/1992). ESPRIT Basic Research Action 3245 \item \emph{Types for Proofs and Programs}: ESPRIT Basic Research Action 6453 (9/1992--8/1995) 2.65 -\item \emph{Combining HOL with Isabelle} (9/1992--8/1995). EPSRC grant GR/H40570 \item \emph{Mechanising Temporal Reasoning} (11/1995--4/1999). EPSRC grant reference GR/K57381 \item \emph{Authentication Logics: New Theory and Implementations} (1/1996--6/1999). EPSRC grant GR/K77051 \item \emph{Compositional Proofs of Concurrent Programs} (10/1999--6/2003). EPSRC grant GR/M75440 (RG28587) \item \emph{Verifying Electronic Commerce Protocols} (10/2000--9/2003). EPSRC grant GR/R 01156/01 (NRAG/002) %\item \emph{Automation for Interactive Proof} (2/2004--1/2007). 2.66 -%EPSRC grant GR/S57198/01 (NRAG/071) 2.67 -\end{itemize} 2.68 -Lawrence Paulson was the Principal Investigator on all of these grants. 2.69 -The Munich side had support from German sponsors. 2.70 - \bibliographystyle{plain} \footnotesize\raggedright\frenchspacing \bibliography{string,atp,funprog,general,isabelle,theory,crossref} \end{document} 2.71 \ No newline at end of file