Why higher-order logic is a good formalism for specifying and verifying hardware

The work

AuthorsMike Gordon
Editors
Typetechreport
Year1985
Citekeygordon1985why

Where it appeared

PublisherUniversity of Cambridge Computer Laboratory
Number in seriesUCAM-CL-TR-77
SchoolUniversity of Cambridge Computer Laboratory

Identifiers

report_numberUCAM-CL-TR-77
ISSN1476-2986

Related

Distinct frombasin1989verification
Distinct frombasin1991formally
Distinct fromcamilleri1986hardware
Distinct fromcamilleri1988simulation
Distinct fromclocksin1985logic
Distinct fromdhingra1988formalising
Distinct fromgammie2013synchronous
Distinct fromgordon1983lcflsm
Distinct fromgordon1985hol
Distinct fromgordon1987hol
Distinct fromguzmanmiranda2025fvm
Distinct fromherbert1988case
Distinct fromjoyce1986proving
Distinct fromjoyce1987hardware
Distinct frompaulson2018michael
Distinct fromwinskel1987relating

From bibtex.

Abstract

Higher-order logic was originally developed as a foundation for mathematics. In this paper we show how it can be used as: 1. a hardware description language and 2. a formalism for proving that designs meet their specifications. Examples are given which illustrate various specification and verification techniques. These include a CMOS inverter, a CMOS full adder, an n-bit ripple-carry adder, a sequential multiplier and an edge-triggered Dtype register.

A copy is held

pdf, 838.0 kB. Not published — it may be under copyright. The facts and links here are.

How it got here

How it got hereagent via bibtex
Added2026-09-15 22:14 UTC
Approved bya person 2026-09-16 09:23 UTC

Cite it as

@techreport{gordon1985why,
  title        = {Why higher-order logic is a good formalism for specifying and verifying hardware},
  author       = {Mike Gordon},
  year         = {1985},
  publisher    = {University of Cambridge Computer Laboratory},
  school       = {University of Cambridge Computer Laboratory},
  issn         = {1476-2986},
}

This record lives at https://refs.drheap.org/gordon1985why/ and will keep doing so.