An Efficient Graph Representation for Arithmetic

Download PDF
0 downloads 0 Views 320KB Size Report
Comment
Nov 1, 2000 - The size of the graph to represent the IEEE floating- point encoding is ... terms of integer functions and their operations [7], [9 ], [1 2 ]. The correctness ...... edge weights are extracted as the greatest common divisor. (Vd CD ) of ...
Carnegie Mellon University

Research Showcase Computer Science Department

School of Computer Science

11-1-2000

An Efficient Graph Representation for Arithmetic Circuit Verification Yirng-An Chen Novas Software

Randal E. Bryant Carnegie Mellon University, [email protected]

Follow this and additional works at: http://repository.cmu.edu/compsci Recommended Citation Chen, Yirng-An and Bryant, Randal E., "An Efficient Graph Representation for Arithmetic Circuit Verification" (2000). Computer Science Department. Paper 157. http://repository.cmu.edu/compsci/157

This Article is brought to you for free and open access by the School of Computer Science at Research Showcase. It has been accepted for inclusion in Computer Science Department by an authorized administrator of Research Showcase. For more information, please contact [email protected].

                !  " # "$%& '  ( )*    +$,.-0/2143657/8:92;=@?7AB/@C2ABDFE(G@HI-0JKA4/KL [email protected] SUTWVYX:X:X jm“b|” ˆ•umZ2t‚Š>[]vP\]Œ€d^`_brPadUƒ„cept0oy^`fh–y}Iv@…j~g]xik