Formal verification by symbolic evaluation of partially-ordered trajectories
- 1 March 1995
- journal article
- research article
- Published by Springer Science and Business Media LLC in Formal Methods in System Design
- Vol. 6 (2), 147-189
- https://doi.org/10.1007/bf01383966
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Model checking and abstractionPublished by Association for Computing Machinery (ACM) ,1992
- A methodology for hardware verification based on logic simulationJournal of the ACM, 1991
- ON THE COMPLEXITY OF VLSI IMPLEMENTATIONS AND GRAPH REPRESENTATIONS OF BOOLEAN FUNCTIONS WITH APPLICATION TO INTEGER MULTIPLICATIONIEEE Transactions on Computers, 1991
- Formal verification of memory circuits by switch-level simulationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- Fast Methods for Switch-Level Verification of MOS CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Boolean Analysis of MOS CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- On a Ternary Model of Gate NetworksIEEE Transactions on Computers, 1979
- Edinburgh LCFPublished by Springer Science and Business Media LLC ,1979