Logo - springer
Slogan - springer

Philosophy | Theorem Proving in Higher Order Logics - 16th International Conference, TPHOLs 2003, Rom, Italy,

Theorem Proving in Higher Order Logics

16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings

Basin, David, Wolff, Burkhart (Eds.)

2003, X, 366 p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-540-45130-3

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-540-40664-8

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

This volume constitutes the proceedings of the16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003) held September 8–12, 2003 in Rome, Italy. TPHOLs covers all aspects of theorem proving in higher order logics as well as related topics in theorem proving and veri?cation. TPHOLs 2003 was co-located with TABLEAUX, the International Con- rence on Automated Reasoning with Analytic Tableaux and Related Methods, and with Calculemus, the Symposium on the Integration of Symbolic Compu- tion and Mechanized Reasoning. There were 50 papers submitted to TPHOLs in the full research category, each of which was refereed by at least 3 reviewers, selected by the program c- mittee.Ofthesesubmissions,21wereacceptedforpresentationattheconference and publication in this volume. In keeping with tradition, TPHOLs 2003 also o?ered a venue for the presentation of work in progress, where researchers - vite discussion by means of a brief preliminary talk and then discuss their work at a poster session. A supplementary proceedings containing associated papers for work in progress was published by the computer science department at the Universit¨ at Freiburg. The organizers are grateful to Jean-Raymond Abrial, Patrick Lincoln, and Dale Miller for agreeing to give invited talks at TPHOLs 2003. The TPHOLs conference traditionally changes continent each year in order to maximize the chances that researchers from around the world can attend.

Content Level » Research

Keywords » Automat - Coq - Isabelle - automation - logic - proving - theorem proving

Related subjects » Artificial Intelligence - Hardware - Philosophy - Software Engineering - Theoretical Computer Science

Table of contents 

Invited Talk I.- Click’n Prove: Interactive Proofs within Set Theory.- Hardware and Assembler Languages.- Formal Specification and Verification of ARM6.- A Programming Logic for Java Bytecode Programs.- Verified Bytecode Subroutines.- Proof Automation I.- Complete Integer Decision Procedures as Derived Rules in HOL.- Changing Data Representation within the Coq System.- Applications of Polytypism in Theorem Proving.- Proof Automation II.- A Coverage Checking Algorithm for LF.- Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions.- Tool Combination.- Embedding of Systems of Affine Recurrence Equations in Coq.- Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover.- Combining Testing and Proving in Dependent Type Theory.- Invited Talk II.- Reasoning about Proof Search Specifications: An Abstract.- Logic Extensions.- Program Extraction from Large Proof Developments.- First Order Logic with Domain Conditions.- Extending Higher-Order Unification to Support Proof Irrelevance.- Advances in Theorem Prover Technology.- Inductive Invariants for Nested Recursion.- Implementing Modules in the Coq System.- MetaPRL – A Modular Logical Environment.- Mathematical Theories.- Proving Pearl: Knuth’s Algorithm for Prime Numbers.- Formalizing Hilbert’s Grundlagen in Isabelle/Isar.- Security.- Using Coq to Verify Java CardTM Applet Isolation Properties.- Verifying Second-Level Security Protocols.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Philosophy (general).