Theorem Proving in Higher Order Logics
Home > Mathematics and Science Textbooks > Mathematics > Applied mathematics > Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings(1690 Lecture Notes in Computer Science)
Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings(1690 Lecture Notes in Computer Science)

Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings(1690 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



International Edition


About the Book

This book contains the proceedings of the 12th International Conference on TheoremProvinginHigherOrderLogics(TPHOLs'99),whichwasheldinNice at the University of Nice-Sophia Antipolis, September 14{17, 1999. Thirty- ve papers were submitted as completed research, and each of them was refereed by at least three reviewers appointed by the program committee. Twenty papers were selected for publication in this volume. Followingawell-establishedtraditioninthisseriesofconferences,anumberof researchers also came to discuss work in progress, using short talks and displays at a poster session. These papers are included in a supplementary proceedings volume. These supplementary proceedings take the form of a book published by INRIA in its series of research reports, under the following title : Theorem ProvinginHigherOrderLogics:EmergingTrends1999. The organizers were pleased that Dominique Bolignano, Arjeh Cohen, and Thomas Kropf accepted invitations to be guest speakers for TPHOLs'99. For several years, D. Bolignano has been the leader of the VIP team in the Dyade consortium between INRIA and Bull and is now at the head of a company Trusted Logic. His team has been concentrating on the use of formal methods for the e ective veri cationof securityproperties for protocols used in electronic commerce. A. Cohen has had a key in?uence on the development of computer algebra in The Netherlands and his contribution has been of particular imp- tance to researchersinterested in combining the severalknown methods of using computers to perform mathematical investigations. T. Kropf is an important actor in the Europe-wide project PROSPER, which aims to deliver the be- ts of mechanized formal analysis to system builders in industry.

Table of Contents:
Recent Advancements in Hardware Verification — How to Make Theorem Proving Fit for an Industrial Usage.- Disjoint Sums over Type Classes in HOL.- Inductive Datatypes in HOL — Lessons Learned in Formal-Logic Engineering.- Isomorphisms — A Link Between the Shallow and the Deep.- Polytypic Proof Construction.- Recursive Function Definition over Coinductive Types.- Hardware Verification Using Co-induction in COQ.- Connecting Proof Checkers and Computer Algebra Using OpenMath.- A Machine-Checked Theory of Floating Point Arithmetic.- Universal Algebra in Type Theory.- Locales A Sectioning Concept for Isabelle.- Isar — A Generic Interpretative Approach to Readable Formal Proof Documents.- On the Implementation of an Extensible Declarative Proof Language.- Three Tactic Theorem Proving.- Mechanized Operational Semantics via (Co)Induction.- Representing WP Semantics in Isabelle/ZF.- A HOL Conversion for Translating Linear Time Temporal Logic to ?-Automata.- From I/O Automata to Timed I/O Automata.- Formal Methods and Security Evaluation.- Importing MDG Verification Results into HOL.- Integrating Gandalf and HOL.- Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving.- Symbolic Functional Evaluation.


Best Sellers


Product Details
  • ISBN-13: 9783540664635
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 233 mm
  • No of Pages: 364
  • Returnable: Y
  • Sub Title: 12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings
  • ISBN-10: 3540664637
  • Publisher Date: 01 Sep 1999
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 1690 Lecture Notes in Computer Science
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings(1690 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings(1690 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings(1690 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!