Clarke E. M., Khaira K. and Zhao X. [1993], Word level model checking | a new approach for verifying arithmetic circuits, in `Proc. 30th ACM/IEEE Design Automation Conference (DAC '93)', IEEE Computer society press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

No context found.

Clarke E. M., Khaira K. and Zhao X. [1993], Word level model checking | a new approach for verifying arithmetic circuits, in `Proc. 30th ACM/IEEE Design Automation Conference (DAC '93)', IEEE Computer society press.

....same set of recursive 12 equations also gives a new way of explaining hybrid transform diagrams, an efficient datastructure for D valued boolean functions. The use of such diagrams has resulted in the development of new verification methods for computer arithmetic, like word level model checking [9]. It is clear that these ideas are not confined to applications in digital circuit design. D valued boolean functions, expressed in terms of hybrid transform diagrams (in particular MTBDDs) can be used to represent large matrices [6] The arguments of these functions are the binary ....

E. M. Clarke, K. Khaira, and X. Zhao. Word level model checking --- a new approach for verifying arithmetic circuits. In Proceedings os the 33rd ACM/IEEE Design Automation Conference. IEEE Computer society press, June 1993.

....same set of recursive equations also gives a new way of explaining hybrid transform diagrams, an efficient data structure for D valued boolean functions. The use of such diagrams has resulted in the development of new verification methods for computer arithmetic, like word level model checking [9]. It is clear that these ideas are not confined to applications in digital circuit design. D valued boolean functions, expressed in terms of hybrid transform diagrams (in particular MTBDDs) can be used to represent large matrices [6] The arguments of these functions are the binary ....

E. M. Clarke, K. Khaira, and X. Zhao. Word level model checking --- a new approach for verifying arithmetic circuits. In Proceedings os the 33rd ACM/IEEE Design Automation Conference. IEEE, June 1993.

....algebraic framework for computing spectral transforms [10] and hybrid transform diagrams (an efficient data structure for D valued boolean functions) 7, 8] in an efficient manner. The use of such diagrams has resulted in the development of new verification methods for computer arithmetic [9]. It is clear that these ideas are not confined to applications in digital circuit design. D valued boolean functions, expressed in terms of hybrid transform diagrams can be used to represent large matrices [6] Thus, applications of such methods in numerical analysis and linear algebra are ....

E. M. Clarke, K. Khaira, and X. Zhao. Word level model checking --- a new approach for verifying arithmetic circuits. In Proceedings os the 33rd ACM/IEEE Design Automation Conference. IEEE, June 1993.

....same set of recursive equations also gives a new way of explaining hybrid transform diagrams, an efficient datastructure for D valued boolean functions. The use of such diagrams has resulted in the development of new verification methods for computer arithmetic, like word level model checking [9]. It is clear that these ideas are not confined to applications in digital circuit design. D valued boolean functions, expressed in terms of hybrid transform diagrams (in particular MTBDDs) can be used to represent large matrices [6] The arguments of these functions are the binary ....

E. M. Clarke, K. Khaira, and X. Zhao. Word level model checking --- a new approach for verifying arithmetic circuits. In Proceedings os the 33rd ACM/IEEE Design Automation Conference. IEEE Computer society press, June 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC