Sciweavers

4 search results - page 1 / 1
» Extraction of finite state machines from transistor netlists...
Sort
View
ICCD
1995
IEEE
119views Hardware» more  ICCD 1995»
13 years 8 months ago
Extraction of finite state machines from transistor netlists by symbolic simulation
– This paper describes a new technique for extracting clock-level finite state machines(FSMs) from transistor netlists using symbolic simulation. The transistor netlist is prepr...
Manish Pandey, Alok Jain, Randal E. Bryant, Derek ...
ICCAD
1994
IEEE
134views Hardware» more  ICCAD 1994»
13 years 8 months ago
Boolean constrained encoding: a new formulation and a case study
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
Ney Laert Vilar Calazans
WECWIS
2003
IEEE
106views ECommerce» more  WECWIS 2003»
13 years 10 months ago
Contract Representation for Run-time Monitoring and Enforcement
Converting a conventional contract into an electronic equivalent that can be executed and enforced by computers is a challenging task. The difficulties are caused by the ambiguiti...
Carlos Molina-Jiménez, Santosh K. Shrivasta...
ICSE
2003
IEEE-ACM
14 years 4 months ago
Modular Verification of Software Components in C
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh ...