The Formal Description and Verification of Hardware Timing

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

A formalism in which timing properties of digital hardware may be specified, derived, and formally verified is introduced as a rigorous theory for hardware timing. This approach to reasoning about time differs from current work in that a rigorous modeling framework has been used to create a family of related verification techniques rather than a single timing analysis tool. This framework is based on a model of interacting finite state machines called CIRCAL, a formalism developed for the purpose of describing and validating complex concurrent systems. Its application to digital hardware and the problems associated with timing verification illustrate the utility of a formal approach to hardware description and verification. In this approach to hardware timing analysis, the presence of a composition operator is all pervasive. It provides a single, uniform mechanism for describing the behavior of interacting hardware modules and for establishing and describing the timing properties of such modules. CIRCAL provides us with a proof mechanism for conducting formal hardware verification based on an equivalence relation between CIRCAL terms. This permits the required timing properties of a hardware module to be specified and then formally verified.

Original languageEnglish
Pages (from-to)811-826
Number of pages16
JournalIEEE Transactions on Computers
Volume40
Issue number7
DOIs
Publication statusPublished - 1 Jan 1991
Externally publishedYes

Fingerprint

Timing
Hardware
Timing Analysis
Module
Concurrent Systems
Composition Operator
Finite automata
State Machine
Equivalence relation
Complex Systems
Reasoning
Term
Chemical analysis
Modeling

Cite this

@article{a3e459d3e5cf429292721e6d7b0ceb90,
title = "The Formal Description and Verification of Hardware Timing",
abstract = "A formalism in which timing properties of digital hardware may be specified, derived, and formally verified is introduced as a rigorous theory for hardware timing. This approach to reasoning about time differs from current work in that a rigorous modeling framework has been used to create a family of related verification techniques rather than a single timing analysis tool. This framework is based on a model of interacting finite state machines called CIRCAL, a formalism developed for the purpose of describing and validating complex concurrent systems. Its application to digital hardware and the problems associated with timing verification illustrate the utility of a formal approach to hardware description and verification. In this approach to hardware timing analysis, the presence of a composition operator is all pervasive. It provides a single, uniform mechanism for describing the behavior of interacting hardware modules and for establishing and describing the timing properties of such modules. CIRCAL provides us with a proof mechanism for conducting formal hardware verification based on an equivalence relation between CIRCAL terms. This permits the required timing properties of a hardware module to be specified and then formally verified.",
author = "Milne, {George J.}",
year = "1991",
month = "1",
day = "1",
doi = "10.1109/12.83619",
language = "English",
volume = "40",
pages = "811--826",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "Wiley-IEEE Press",
number = "7",

}

The Formal Description and Verification of Hardware Timing. / Milne, George J.

In: IEEE Transactions on Computers, Vol. 40, No. 7, 01.01.1991, p. 811-826.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The Formal Description and Verification of Hardware Timing

AU - Milne, George J.

PY - 1991/1/1

Y1 - 1991/1/1

N2 - A formalism in which timing properties of digital hardware may be specified, derived, and formally verified is introduced as a rigorous theory for hardware timing. This approach to reasoning about time differs from current work in that a rigorous modeling framework has been used to create a family of related verification techniques rather than a single timing analysis tool. This framework is based on a model of interacting finite state machines called CIRCAL, a formalism developed for the purpose of describing and validating complex concurrent systems. Its application to digital hardware and the problems associated with timing verification illustrate the utility of a formal approach to hardware description and verification. In this approach to hardware timing analysis, the presence of a composition operator is all pervasive. It provides a single, uniform mechanism for describing the behavior of interacting hardware modules and for establishing and describing the timing properties of such modules. CIRCAL provides us with a proof mechanism for conducting formal hardware verification based on an equivalence relation between CIRCAL terms. This permits the required timing properties of a hardware module to be specified and then formally verified.

AB - A formalism in which timing properties of digital hardware may be specified, derived, and formally verified is introduced as a rigorous theory for hardware timing. This approach to reasoning about time differs from current work in that a rigorous modeling framework has been used to create a family of related verification techniques rather than a single timing analysis tool. This framework is based on a model of interacting finite state machines called CIRCAL, a formalism developed for the purpose of describing and validating complex concurrent systems. Its application to digital hardware and the problems associated with timing verification illustrate the utility of a formal approach to hardware description and verification. In this approach to hardware timing analysis, the presence of a composition operator is all pervasive. It provides a single, uniform mechanism for describing the behavior of interacting hardware modules and for establishing and describing the timing properties of such modules. CIRCAL provides us with a proof mechanism for conducting formal hardware verification based on an equivalence relation between CIRCAL terms. This permits the required timing properties of a hardware module to be specified and then formally verified.

UR - http://www.scopus.com/inward/record.url?scp=0026185917&partnerID=8YFLogxK

U2 - 10.1109/12.83619

DO - 10.1109/12.83619

M3 - Article

VL - 40

SP - 811

EP - 826

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 7

ER -