Front matter
1-3
JavaCard Program Verification
Bart Jacobs
4
View from the Fringe of the Fringe
(Joint with CHARME 2001)
Steven D. Johnson
5-26
Using Decision Procedures with a Higher-Order Logic
Natarajan Shankar
1349-1353
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS
Andrew Adams, Martin Dunstan, Hanne Gottliebsen, Tom Kelsey and Ursula Martin, et al.
43-58
An Irrational Construction of ℝ from ℤ
Rob D. Arthan
59-74
HELM and the Semantic Math-Web
Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen and Irene Schena
75-90
Calculational Reasoning Revisited An Isabelle/Isar Experience
Gertrud Bauer and Markus Wenzel
91-104
Mechanical Proofs about a Non-repudiation Protocol
Giampaolo Bella and Lawrence C. Paulson
105-120
Proving Hybrid Protocols Correct
Mark Bickford, Christoph Kreitz, Robbert van Renesse and Xiaoming Liu
121-125
Nested General Recursion and Partiality in Type Theory
Ana Bove and Venanzio Capretta
136-153
A Higher-Order Calculus for Categories
Mario Cáccamo and Glynn Winskel
154-168
Certifying the Fast Fourier Transform with Coq
Venanzio Capretta
169-184
A Generic Library for Floating-Point Numbers and Its Application to Exact Computing
Marc Daumas, Laurence Rideau and Laurent Théry
185-200
Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
Louise A. Dennis and Alan Smaill
201-216
Abstraction and Refinement in Higher Order Logic
Matt Fairtlough, Michael Mendler and Xiaochun Cheng
217-232
A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL
Simon J. Gay
233-248
Representing Hierarchical Automata in Interactive Theorem Provers
Steffen Helke and Florian Kammüller
249-260
Refinement Calculus for Logic Programming in Isabelle/HOL
David Hemer, Ian Hayes and Paul Strooper
265-280
Predicate Subtyping with Predicate Sets
Joe Hurd
281-296
A Structural Embedding of Ocsid in PVS
Pertti Kellomäki
297-312
A Certified Polynomial-Based Decision Procedure for Propositional Logic
Inmaculada Medina-Bulo, 1Francisco Palomo-Lozano and José A. Alonso-Jiménez
313-328
Finite Set Theory in ACL2
J. Strother Moore
329-345
The HOL/NuPRL Proof Translator
A Practical Approach to Formal Interoperability
Pavel Naumov, Mark-Oliver Stehr and José Meseguer
346-361
Formalizing Convex Hull Algorithms
David Pichardie and Yves Bertot
362-377
Experiments with Finite Tree Automata in Coq
Xavier Rival and Jean Goubault-Larrecq
378-393
Mizar Light for HOL Light
Freek Wiedijk
Back matter