loading...
Checking Equivalence for Circuits Containing Incompletely Specified Boxes
Freiburg, Germany September 16-September 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCD.2002.11067482002 IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Christoph Scholl, Albert-Ludwigs-University
Bernd Becker, Albert-Ludwigs-University

We consider the problem of checking whether an implementation which contains parts with incomplete information is equivalent to a given full specification. We study implementations which are not completely specified, but contain boxes which are associated with incompletely specified functions (called Incompletely Specified Boxes or IS-Boxes).

After motivating the use of implementations with Incompletely Specified Boxes we define our notion of equivalence for this kind of implementations and present a method to solve the problem.

A series of experimental results demonstrates the effectiveness and feasibility of the methods presented.

Citation:
Christoph Scholl, Bernd Becker, "Checking Equivalence for Circuits Containing Incompletely Specified Boxes," iccd, pp.56, 2002 IEEE International Conference on Computer Design (ICCD'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.