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

You must be logged in to access this title.

Sign up now

Already a member? Log in

Synopsis

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.

Book details

Series:
ISSN (Book Volume 20)
Author:
L. J. M. Claesen, M. J. C. Gordon
ISBN:
9781483298405
Related ISBNs:
9780444898807
Publisher:
Elsevier Science
Pages:
582
Reading age:
Not specified
Includes images:
No
Date of addition:
2021-04-16
Usage restrictions:
Copyright
Copyright date:
1993
Copyright by:
Elsevier Science & Technology 
Adult content:
No
Language:
English
Categories:
Computers and Internet, Mathematics and Statistics, Nonfiction, Philosophy