Checking equivalence for circuits containing incompletely specified boxes

Author

Scholl, Christoph ; Becker, Bernd

Author_Institution

Dept. of Comput. Sci., Albert-Ludwigs-Univ., Germany

fYear

2002

fDate

2002

Firstpage

56

Lastpage

63

Abstract

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.

Keywords

combinational circuits; equivalence classes; formal verification; logic testing; Boolean functions; Incompletely Specified Boxes; VLSI CAD; combinational equivalence checking; equivalence; specification; verification; Aerospace industry; Boolean functions; Circuits; Computer science; Data structures; Educational institutions; Performance evaluation; State-space methods; Testing; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Design: VLSI in Computers and Processors, 2002. Proceedings. 2002 IEEE International Conference on

ISSN

1063-6404

Print_ISBN

0-7695-1700-5

Type

conf

DOI

10.1109/ICCD.2002.1106748

Filename

1106748