Publication Type |
technical report |
School or College |
College of Engineering |
Department |
Computing, School of |
Program |
Advanced Research Projects Agency |
Creator |
Gopalakrishnan, Ganesh |
Title |
Asynchronous circuit verification using trace theory and CCS |
Date |
1992 |
Description |
We investigate asynchronous circuit verification using Dill's trace theory as well as Milner's CCS (as mechanized by the Concurrency Workbench). Trace theory is a formalism specifically designed for asynchronous circuit specification and verification. CCS is a general purpose calculus of communicating systems that is recently being applied for hardware specification and verification also. Although both formalisms are similar in many respects, we find that there are many interesting differences between them when applied to asynchronous circuit specification and verification. The purpose of this paper is to point out these differences, many of which are precautions for avoiding writing incorrect specifications. A long-term objective of this work is to find a way to take advantage of the strengths of both the Trace Theory verifier and the Concurrency Workbench in verifying asynchronous circuits. |
Type |
Text |
Publisher |
University of Utah |
Subject |
Trace theory; Verification; CCS |
Subject LCSH |
Asynchronous circuits |
Language |
eng |
Bibliographic Citation |
Gopalakrishnan, G. (1992). Asynchronous circuit verification using trace theory and CCS. UUCS-92-008. |
Series |
University of Utah Computer Science Technical Report |
Relation is Part of |
ARPANET |
Rights Management |
©University of Utah |
Format Medium |
application/pdf |
Format Extent |
254,840 bytes |
Source |
University of Utah School of Computing |
ARK |
ark:/87278/s63r1b7p |
Setname |
ir_uspace |
ID |
704545 |
Reference URL |
https://collections.lib.utah.edu/ark:/87278/s63r1b7p |