Theorem Proving in Higher Order Logics

11th International Conference, TPHOLs'98, Canberra, Australia, September 27 - October 1, 1998, Proceedings

AvJim Grundy,Malcolm Newey

Häftad, Engelska, 1998

Del i serien Lecture Notes in Computer Science

559 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:1998-09-09
Mått:155 x 233 x 28 mm
Vikt:774 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:496
Upplaga:1998
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540649878

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT
Programmeringsböcker inom Data och IT

Innehållsförteckning

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.