| 书目名称 | Theorem Proving in Higher Order Logics |
| 副标题 | 11th International C |
| 编辑 | Jim Grundy,Malcolm Newey |
| 视频video | http://file.papertrans.cn/923/922777/922777.mp4 |
| 概述 | Includes supplementary material: |
| 丛书名称 | Lecture Notes in Computer Science |
| 图书封面 |  |
| 描述 | 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. |
| 出版日期 | Conference proceedings 1998 |
| 关键词 | Annotation; Coq; Isabelle; Variable; algorithm; algorithms; automata; formal specification; formal verificat |
| 版次 | 1 |
| doi | https://doi.org/10.1007/BFb0055125 |
| isbn_softcover | 978-3-540-64987-8 |
| isbn_ebook | 978-3-540-49801-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 1998 |
|Archiver|手机版|小黑屋|
派博传思国际
( 京公网安备110108008328)
GMT+8, 2025-8-17 15:14
发表于 2025-3-21 17:49:04
