×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001. Proceedings / Edition 1
     

Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001. Proceedings / Edition 1

by Richard J. Boulton
 

ISBN-10: 354042525X

ISBN-13: 9783540425250

Pub. Date: 10/02/2001

Publisher: Springer Berlin Heidelberg

This book constitutes the thoroughly refereed proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2001, held in Edinburgh, Scotlang, UK in September 2001. The 23 revised full papers presented together with one invited paper and two invited abstracts were carefully reviewed and selected from a total of 47 submissions.

Overview

This book constitutes the thoroughly refereed proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2001, held in Edinburgh, Scotlang, UK in September 2001. The 23 revised full papers presented together with one invited paper and two invited abstracts were carefully reviewed and selected from a total of 47 submissions. All current issues in HOL theorem proving and formal verification of hardware and software systems are addressed. Among the HOL theorem proving systems evaluated are Coq, HOL, Isabelle, and PVS.

Product Details

ISBN-13:
9783540425250
Publisher:
Springer Berlin Heidelberg
Publication date:
10/02/2001
Series:
Lecture Notes in Computer Science Series , #2152
Edition description:
2001
Pages:
402
Product dimensions:
6.10(w) x 9.17(h) x 0.03(d)

Table of Contents

Invited Talks.- JavaCard Program Verification.- View from the Fringe of the Fringe.- Using Decision Procedures with a Higher-Order Logic.- Regular Contributions.- Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS.- An Irrational Construction of— from—.- HELM and the Semantic Math-Web.- Calculational Reasoning Revisited An Isabelle/Isar Experience.- Mechanical Proofs about a Non-repudiation Prool.- Proving Hybrid Prools Correct.- Nested General Recursion and Partiality in Type Theory.- A Higher-Order Calculus for Categories.- Certifying the Fast Fourier Transform with Coq.- A Generic Library for Floating-Point Numbers and Its Application to Exact Computing.- Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain.- Abstraction and Refinement in Higher Order Logic.- A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL.- Representing Hierarchical Automata in Interactive Theorem Provers.- Refinement Calculus for Logic Programming in Isabelle/HOL.- Predicate Subtyping with Predicate Sets.- A Structural Embedding of Ocsid in PVS.- A Certified Polynomial-Based Decision Procedure for Propositional Logic.- Finite Set Theory in ACL2.- The HOL/NuPRL Proof Translator.- Formalizing Convex Hull Algorithms.- Experiments with Finite Tree Automata in Coq.- Mizar Light for HOL Light.

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews