This book constitutes the refereed proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics, TPHOL '96, held in Turku, Finland, in August 1996. The 27 revised full papers included together with one invited paper were carefully selected from a total of 46 submissions. The topics addressed are theorem proving technology, proof automation and decision procedures, mechanized theorem proving, extensions of higher order logics, integration of external tools, novel applications, and others. All in all, the volume is an up-to-date report on the state of the art in this increasingly active field.
Author(s): Sten Agerholm (auth.), Gerhard Goos, Juris Hartmanis, Jan van Leeuwen, Joakim von Wright, Jim Grundy, John Harrison (eds.)
Series: Lecture Notes in Computer Science 1125
Edition: 1
Publisher: Springer Berlin Heidelberg
Year: 1996
Language: English
Pages: 449
Tags: Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics); Logic Design; Logics and Meanings of Programs; Mathematical Logic and Foundations; Software Engineering
Translating specifications in VDM-SL to PVS....Pages 1-16
A comparison of HOL and ALF formalizations of a categorical coherence theorem....Pages 17-32
Modeling a hardware synthesis methodology in isabelle....Pages 33-50
Inference rules for programming languages with side effects in expressions....Pages 51-60
Deciding cryptographic protocol adequacy with HOL: The implementation....Pages 61-76
Proving liveness of fair transition systems....Pages 77-92
Program derivation using the refinement calculator....Pages 93-108
A proof tool for reasoning about functional programs....Pages 109-124
Coq and hardware verification: A case study....Pages 125-139
Elements of mathematical analysis in PVS....Pages 141-156
Implementation issues about the embedding of existing high level synthesis algorithms in HOL....Pages 157-172
Five axioms of alpha-conversion....Pages 173-190
Set theory, higher order logic or both?....Pages 191-201
A mizar mode for HOL....Pages 203-220
Stålmarck’s algorithm as a HOL derived rule....Pages 221-234
Towards applying the composition principle to verify a microkernel operating system....Pages 235-250
A modular coding of UNITY in COQ....Pages 251-266
Importing mathematics from HOL into Nuprl....Pages 267-281
A structure preserving encoding of Z in isabelle/HOL....Pages 283-298
Improving the result of high-level synthesis using interactive transformational design....Pages 299-314
Using lattice theory in higher order logic....Pages 315-330
Formal verification of algorithm W : The monomorphic case....Pages 331-345
Verification of compiler correctness for the WAM....Pages 347-361
Synthetic domain theory in type theory: Another logic of computable functions....Pages 363-380
Function definition in higher-order logic....Pages 381-397
Higher-order annotated terms for proof search....Pages 399-413
A comparison of MDG and HOL for hardware verification....Pages 415-430
A mechanisation of computability theory in HOL....Pages 431-446
