Symbolic Verification of MOS Circuits
The work
| Authors | Randal E. Bryant |
|---|---|
| Editors | |
| Type | inproceedings |
| Year | 1985 |
| Citekey | bryant1985symbolic |
Where it appeared
| Published in | 1985 Chapel Hill Conference on Very Large Scale Integration |
|---|
Access
| Landing page | https://www.cs.cmu.edu/~bryant/pubdir/unc85.pdf |
|---|
Empty on purpose
| doi |
Related
| Distinct from | bryant1982mossim |
|---|---|
| Distinct from | bryant1986graphbased |
| Distinct from | bryant1987algorithmic |
| Distinct from | bryant1987boolean |
| Distinct from | bryant1987cosmos |
| Distinct from | bryant1991methodology |
| Distinct from | gordon1995semantic |
| Distinct from | leeser1988reasoning |
| Distinct from | seger1995formal |
From bibtex.
Abstract
The program MOSSYM simulates the behavior of a MOS circuit represented as a switch-level network symbolically. That is, during simulator operation the user can set an input to either 0, 1, or a Boolean variable. The simulator then computes the behavior of the circuit as a function of the past and present input variables. By using heuristically efficient Boolean function manipulation algorithms, the verification of a circuit by symbolic simulation can proceed much more quickly than by exhaustive logic simulation. In this paper we present our concept of symbolic simulation, derive an algorithm for switch-level symbolic simulation, and present experimental measurements from MOSSYM.
A copy is held
pdf, 44.5 kB. Not published — it may be under copyright. The facts and links here are.
How it got here
| How it got here | agent via bibtex |
|---|---|
| Added | 2026-09-16 09:33 UTC |
| Approved by | a person 2026-09-16 13:03 UTC |
Filed under
Cite it as
@inproceedings{bryant1985symbolic,
title = {Symbolic Verification of MOS Circuits},
author = {Randal E. Bryant},
year = {1985},
booktitle = {1985 Chapel Hill Conference on Very Large Scale Integration},
}
This record lives at https://refs.drheap.org/bryant1985symbolic/ and will keep doing so.