Theorem Proving in Higher Order Logics: 16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$74.74
Used and New from Other Sellers
Used and New from Other Sellers
from $67.54
Usually ships in 1-2 business days
(Save 38%)
Other sellers (Paperback)
  • All (8) from $67.54   
  • New (5) from $80.98   
  • Used (3) from $67.54   

Overview

This book constitutes the refereed proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2003, held in Rome, Italy in September 2003.

The 24 revised full papers presented together with an invited paper were carefully reviewed and selected from 50 submissions. The papers are organized in topical sections on hardware and Assembler languages, proof automation, fool combination, logic extensions, theorem prover technology, mathematical theories, and security. Among the theorem proving systems discussed are HOL, Coq, MetaPRL, and Isabelle/Isar.

Read More Show Less

Product Details

  • ISBN-13: 9783540406648
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 9/29/2003
  • Series: Lecture Notes in Computer Science Series , #2758
  • Edition description: 2003
  • Edition number: 1
  • Pages: 366
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.79 (d)

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 Prools.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)