Theorem Proving in Higher Order Logics 11th International Conference, TPHOLs'98, Canberra, Australia, September 27 - October 1, 1998, Proceedings /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Grundy, Jim (Editor, http://id.loc.gov/vocabulary/relators/edt), Newey, Malcolm (Editor, http://id.loc.gov/vocabulary/relators/edt)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
• Edition: 1st ed. 1998.
• Series: Lecture Notes in Computer Science, 1479
• Subjects: Computer logic.; Artificial intelligence.; Software engineering.; Mathematical logic.; Logic design.; Logics and Meanings of Programs.; Artificial Intelligence.; Software Engineering/Programming and Operating Systems.; Mathematical Logic and Formal Languages.; Software Engineering.; Logic Design.
• Physical Description: IX, 496 p. online resource.
• ISBN: 9783540498018
• ISSN: 0302-9743 ;
• DOI: 10.1007/BFb0055125

This book constitutes the refereed proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics, TPHOLs '98, held in Canberra, Australia, in September/October 1998. 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.