Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1479)
Conference series link(s): TPHOLs: International Conference on Theorem Proving in Higher Order Logics
Conference proceedings info: TPHOLs 1998.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (28 papers)
-
Front Matter
About this book
The 26 revised full papers presented were carefully reviewed and selected from a total of 52 submissions. Also included are two invited papers. The papers address all current aspects of theorem proving in higher order logics and formal verification and program analysis. Besides the HOL system, the theorem provers Coq, Isabelle, LAMBDA, LEGO, NuPrl, and PVS are discussed.
Bibliographic Information
Book Title: Theorem Proving in Higher Order Logics
Book Subtitle: 11th International Conference, TPHOLs'98, Canberra, Australia, September 27 - October 1, 1998, Proceedings
Editors: Jim Grundy, Malcolm Newey
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/BFb0055125
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1998
Softcover ISBN: 978-3-540-64987-8Published: 09 September 1998
eBook ISBN: 978-3-540-49801-8Published: 14 January 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: IX, 496
Topics: Logics and Meanings of Programs, Artificial Intelligence, Software Engineering/Programming and Operating Systems, Mathematical Logic and Formal Languages, Software Engineering, Logic Design