Higher Order Logic Theorem Proving and its Applications

Higher Order Logic Theorem Proving and its Applications

Proceedings of the IFIP TC10/WG10.2 International Workshop on Higher Order Logic Theorem Proving and its Applications - HOL '92 Leuven, Belgium, 21-24 September 1992

1st Edition - February 3, 1993

Write a review

  • Editors: L.J.M. Claesen, M.J.C. Gordon
  • eBook ISBN: 9781483298405

Purchase options

Purchase options
DRM-free (PDF)
Sales tax will be calculated at check-out

Institutional Subscription

Free Global Shipping
No minimum order


The HOL system is a higher order logic theorem proving system implemented at Edinburgh University, Cambridge University and INRIA. Its many applications, from the verification of hardware designs at all levels to the verification of programs and communication protocols are considered in depth in this volume. Other systems based on higher order logic, namely Nuprl and LAMBDA are also discussed. Features given particular consideration are: novel developments in higher order logic and its implementations in HOL; formal design and verification methodologies for hardware and software; public domain availability of the HOL system. Papers addressing these issues have been divided as follows: Mathematical Logic; Induction; General Modelling and Proofs; Formalizing and Modelling of Automata; Program Verification; Hardware Description Language Semantics; Hardware Verification Methodologies; Simulation in Higher Order Logic; Extended Uses of Higher Order Logic. Academic and industrial researchers involved in formal hardware and software design and verification methods should find the publication especially interesting and it is hoped it will also provide a useful reference tool for those working at software institutes and within the electronics industries.

Table of Contents

  • Preface. Conference Organization. Mathematical Logic Issues. The HOL Logic Extended with Quantification over Type Variables (T.F. Melham). A Lazy Approach to Fully-Expansive Theorem Proving (R.J. Boulton). Efficient Representation and Computation of Tableaux Proofs (K. Schneider, R. Kumar, T. Kropf). A Note on Interactive Theorem Proving with Theorem Continuation Functions (C.-T. Chou). A Sequent Formulation of a Logic of Predicates in HOL (C.-T. Chou). A Classical Type Theory with Transfinite Types (G. Pottinger). Induction. Unification-Based Induction (H. Busch). Introducing Well-Founded Function Definitions in HOL (M. van der Voort). Boyer-Moore Automation for the HOL System (R.J. Boulton). General Modelling and Proofs. Constructing the Real Numbers in HOL (J. Harrison). Modelling Generic Hardware Structures by Abstract Datatypes (K. Schneider, R. Kumar, T. Kropf). A Methodology for Reusable Hardware Proofs (M. Aagaard, M. Leeser). Abstract Theories in HOL (P.J. Windley). Machine Abstraction in Microprocessor Specification (M. McAllister). Formalizing and Modelling of Automata. A Formal Theory of Simulations Between Infinite Automata (P. Loewenstein). A Comparison between Statecharts and State Transition Assertions (N. Day). An Embedding of Timed Transition Systems in HOL (R. Cardell-Oliver, R. Hale, J. Herbert). Formalizing a Modal Logic for CSS in the HOL Theorem Prover (M. Nesi). Modelling Non-Deterministic Systems in HOL (J. Alves-Foss). Program Verification. Mechanising Some Advanced Refinement Concepts (J. von Wright, J. Hekanaho, P. Luostarinen, T. Langbåcka). Deriving Correctness Properties of Compiled Code (P. Curzon). A HOL Mechanization of the Axiomatic Semantics of a Simple Distributed Programming Language (W.L. Harrison, M. Archer, K.N. Levitt). Hardware Description Language Semantics. A Formalisation of the VHDL Simulation Cycle (J.P. Van Tassel). The Formal Semantics Definition of a Multi-Rate DSP Specification Language in HOL (C. Angelo, L. Claesen, H. De Man). Design-Flow Graph Partitioning (R.B. Hughes, G. Musgrave). Hardware Verification Methodologies. Implementation and use of Annotations in HOL (S. Kalvala, M. Archer, K.N. Levitt). Towards a Formal Verification of a Floating Point Coprocessor and its Composition with a Central Processing Unit (J. Pan, K.N. Levitt, M. Archer, S. Kalvala). Deriving a Correct Computer (L.-G. Wang). Formal Tools for Tri-State Design in Busses (R.B. Hughes, M.D. Francis, S.P. Finn, G. Musgrave). Specification and Formal Synthesis of Digital Circuits (M. Bombana, P. Cavalloro, G. Zaza). Simulation in Higher Order Logic. Operational Semantics Based Formal Symbolic Simulation (K.G.W. Goosens). Simulating Microprocessors from Formal Specifications (K.M. Hall, P.J. Windley). Executing HOL Specifications: Towards an Evaluation Semantics for Classical Higher Order Logic (P.S. Rajan). Extended Uses of Higher Order Logic. Linking Other Theorem Provers to HOL Using PM: Proof Manager (M. Archer, G. Fink, L. Yang). Adding New Rules to an LCF-Style Logic Implementation (K. Slind). Why We Can't Have SML Style Declarations in HOL (E.L. Gunter).

Product details

  • No. of pages: 582
  • Language: English
  • Copyright: © North Holland 1993
  • Published: February 3, 1993
  • Imprint: North Holland
  • eBook ISBN: 9781483298405

About the Editors

L.J.M. Claesen

Affiliations and Expertise

Interuniversity Micro-Electronics Center & Katholieke Universiteit Leuven, Leuven, Belgium

M.J.C. Gordon

Affiliations and Expertise

Computer Laboratory, University of Cambridge, Cambridge, England

Ratings and Reviews

Write a review

There are currently no reviews for "Higher Order Logic Theorem Proving and its Applications"