Theorem Proving in Higher Order Logics : 9th International Conference, TPHOLs'96, Turku, Finland, August 26 - 30, 1996, Proceedings

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 submiss...

Full description

Corporate Author: SpringerLink (Online service)
Other Authors: Wright, Joakim von (Editor), Grundy, Jim (Editor), Harrison, John (Editor)
Format: eBook
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1996, 1996
Edition:1st ed. 1996
Series:Lecture Notes in Computer Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Translating specifications in VDM-SL to PVS
  • A comparison of HOL and ALF formalizations of a categorical coherence theorem
  • Modeling a hardware synthesis methodology in isabelle
  • Inference rules for programming languages with side effects in expressions
  • Deciding cryptographic protocol adequacy with HOL: The implementation
  • Proving liveness of fair transition systems
  • Program derivation using the refinement calculator
  • A proof tool for reasoning about functional programs
  • Coq and hardware verification: A case study
  • Elements of mathematical analysis in PVS
  • Implementation issues about the embedding of existing high level synthesis algorithms in HOL
  • Five axioms of alpha-conversion
  • Set theory, higher order logic or both?
  • A mizar mode for HOL
  • Stålmarck’s algorithm as a HOL derived rule
  • Towards applying the composition principle to verify a microkernel operating system
  • A modular coding of UNITY in COQ
  • Importing mathematics from HOL into Nuprl
  • A structure preserving encoding of Z in isabelle/HOL
  • Improving the result of high-level synthesis using interactive transformational design
  • Using lattice theory in higher order logic
  • Formal verification of algorithm W: The monomorphic case
  • Verification of compiler correctness for the WAM
  • Synthetic domain theory in type theory: Another logic of computable functions
  • Function definition in higher-order logic
  • Higher-order annotated terms for proof search
  • A comparison of MDG and HOL for hardware verification
  • A mechanisation of computability theory in HOL.