Theorem Proving in Higher Order Logics

11th International Conference, TPHOLs'98, Canberra, Australia, September 27 - October 1, 1998, Proceedings
1998
ISBN: 978-3-540-64987-8
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 1479, 496 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1580 g

Reihe: 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.

Zielgruppe

Research

Autoren/Hrsg.

Newey, Malcolm

Grundy, Jim

Fachgebiete

• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
• Mathematik | Informatik EDV | Informatik Informatik Rechnerarchitektur
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
• Mathematik | Informatik EDV | Informatik Technische Informatik Hochleistungsrechnen, Supercomputer
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines

Inhaltsverzeichnis

Verified lexical analysis.- Extending window inference.- Program abstraction in a higher-order logic framework.- The village telephone system: A case study in formal software engineering.- Generating embeddings from denotational descriptions.- An interface between CLAM and HOL.- Classical propositional decidability via Nuprl proof extraction.- A comparison of PVS and Isabelle/HOL.- Adding external decision procedures to HOL90 securely.- Formalizing basic first order model theory.- Formalizing Dijkstra.- Mechanical verification of total correctness through diversion verification conditions.- A type annotation scheme for Nuprl.- Verifying a garbage collection algorithm.- Hot: A concurrent automated theorem prover based on higher-order tableaux.- Free variables and subexpressions in higher-order meta logic.- An LPO-based termination ordering for higher-order terms without ?-abstraction.- Proving isomorphism of first-order logic proof systems in HOL.- Exploiting parallelism in interactive theorem provers.- I/O automata and beyond: Temporal logic and abstraction in Isabelle.- Object-oriented verification based on record subtyping in Higher-Order Logic.- On the effectiveness of theorem proving guided discovery of formal assertions for a register allocator in a high-level synthesis system.- Co-inductive axiomatization of a synchronous language.- Formal specification and theorem proving breakthroughs in geometric modeling.- A tool for data refinement.- Mechanizing relevant logics with HOL.- Case studies in meta-level theorem proving.- Formalization of graph search algorithms and its applications.