![Theorem Proving in Higher Order Logics [electronic resource] : 11th International Conference, TPHOLs'98 Canberra, Australia September 27–October 1, 1998 Proceedings /](/search/themes/bootstrap3/images/libros.png)
Theorem Proving in Higher Order Logics [electronic resource] : 11th International Conference, TPHOLs'98 Canberra, Australia September 27–October 1, 1998 Proceedings /
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.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
1998
|
| Subjects: | Computer science., Logic design., Software engineering., Computer logic., Mathematical logic., Artificial intelligence., Computer Science., Logics and Meanings of Programs., Artificial Intelligence (incl. Robotics)., Software Engineering/Programming and Operating Systems., Mathematical Logic and Formal Languages., Software Engineering., Logic Design., |
| Online Access: | http://dx.doi.org/10.1007/BFb0055125 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|