Isabelle 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. Isabelle is developed at University of Cambridge (Larry Paulson) and Technische Universität München (Tobias Nipkow). See the Isabelle overview for a brief introduction. Now available: Isabelle2008 Some notable improvements: * HOL: significant speedup of Metis prover; proper support for multithreading. * HOL: new version of primrec command supporting type-inference and local theory targets. * HOL: improved support for termination proofs of recursive function definitions. * New local theory targets for class instantiation and overloading. * Support for named dynamic lists of theorems.
T. Mossakowski, C. Maeder, and K. Lüttich. TACAS 2007, volume 4424 of Lecture Notes in Computer Science, page 519-522. Springer-Verlag Heidelberg, (2007)
J. Jurjens. ASE '06: Proceedings of the 21st IEEE International Conference on Automated Software Engineering (ASE'06), page 167--176. Washington, DC, USA, IEEE Computer Society, (2006)