Higher Order Logic Theorem Proving and Its Applications: 8th International Workshop, Aspen Grove, UT, USA, September 11 - 14, 1995. Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 98%)
Other sellers (Paperback)
  • All (16) from $1.99   
  • New (6) from $86.39   
  • Used (10) from $1.99   


This book constitutes the proceedings of the 8th International Conference on Higher Order Logic Theorem Proving and Its Applications, held in Aspen Grove, Utah, USA in September 1995.
The 26 papers selected by the program committee for inclusion in this volume document the advances in the field achieved since the predecessor conference. The papers presented fall into three general categories: representation of formalisms in higher order logic; applications of mechanized higher order logic; and enhancements to the HOL and other theorem proving systems.

Read More Show Less

Product Details

  • ISBN-13: 9783540602750
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 9/28/1995
  • Series: Lecture Notes in Computer Science Series, #971
  • Edition description: 1995
  • Edition number: 1
  • Pages: 408
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.85 (d)

Table of Contents

Mechanizing a—-calculus equivalence in HOL.- Non-primitive recursive function definitions.- Experiments with ZF set theory in HOL and Isabelle.- Automatically synthesized term denotation predicates: A proof aid.- On the refinement of symmetric memory prools.- Combining decision procedures in the HOL system.- Deciding cryptographic prool adequacy with HOL.- A practical method for reasoning about distributed systems in a theorem prover.- A theory of finite maps.- Virtual theories.- An automata theory dedicated towards formal circuit synthesis.- Interfacing HOL90 with a functional database query language.- Floating point verification in HOL.- Inductive definitions: Automation and application.- A formulation of TLA in Isabelle.- Formal verification of serial pipeline multipliers.- TkWinHOL: A tool for Window Inference in HOL.- Formal verification of counterflow pipeline architecture.- Deep embedding VHDL.- HOLCF: Higher order logic of computable functions.- A mechanized logic for secure key escrow prool verification.- A new interface for HOL — Ideas, issues and implementation.- Very efficient conversions.- Recording and checking HOL proofs.- Formalization of planar graphs.- A hierarchical method for reasoning about distributed programming languages.

Read More Show Less

Customer Reviews

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

5 Star


4 Star


3 Star


2 Star


1 Star


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


  • - 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)