Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000 Portland, OR, USA, August 14-18, 2000 Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$94.77
Used and New from Other Sellers
Used and New from Other Sellers
from $14.25
Usually ships in 1-2 business days
(Save 89%)
Other sellers (Paperback)
  • All (5) from $14.25   
  • New (3) from $95.55   
  • Used (2) from $14.25   

Overview

This book constitutes the refereed proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2000, held in Portland, Oregon, USA in August 2000.
The 29 revised full papers presented together with three invited contributions were carefully reviewed and selected from 55 submissions. All current aspects of HOL theorem proving, formal verification of hardware and software systems, and formal verification are covered. Among the HOL theorem provers evaluated are COQ, HOL, Isabelle, HOL/SPIN, PVS, and Isabelle/HOL.

Read More Show Less

Product Details

  • ISBN-13: 9783540678632
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 9/6/2000
  • Series: Lecture Notes in Computer Science Series , #1869
  • Edition description: 2000
  • Edition number: 1
  • Pages: 539
  • Product dimensions: 9.21 (w) x 6.14 (h) x 1.12 (d)

Table of Contents

Fix-Point Equations for Well-Founded Recursion in Type Theory.- Programming and Computing in HOL.- Proof Terms for Simply Typed Higher Order Logic.- Routing Information Prool in HOL/SPIN.- Recursive Families of Inductive Types.- Aircraft Trajectory Modeling and Alerting Algorithm Verification.- Intel’s Formal Verification Experience on the Willamette Development.- A Prototype Proof Translator from HOL to Coq.- Proving ML Type Soundness Within Coq.- On the Mechanization of Real Analysis in Isabelle/HOL.- Equational Reasoning via Partial Reflection.- Reachability Programming in HOL98 Using BDDs.- Transcendental Functions and Continuity Checking in PVS.- Verified Optimizations for the Intel IA-64 Architecture.- Formal Verification of IA-64 Division Algorithms.- Fast Tactic-Based Theorem Proving.- Implementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover.- A Strong and Mechanizable Grand Logic.- Inheritance in Higher Order Logic: Modeling and Reasoning.- Total-Correctness Refinement for Sequential Reactive Systems.- Divider Circuit Verification with Model Checking and Theorem Proving.- Specification and Verification of a Steam-Boiler with Signal-Coq.- Functional Procedures in Higher-Order Logic.- Formalizing Stålmarck’s Algorithm in Coq.- TAS — A Generic Window Inference System.- Weak Alternating Automata in Isabelle/HOL.- Graphical Theories of Interactive Systems: Can a Proof Assistant Help?.- Formal Verification of the Alpha 21364 Network Prool.- Dependently Typed Records for Representing Mathematical Structure.- Towards a Machine-Checked Java Specification Book.- Another Look at Nested Recursion.- Automating the Search for Answers to Open Questions.- Appendix: Conjectures Concerning Proof, Design, and Verification.

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)