loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth Great Lakes Symposium on VLSI
Formal Verification of Tree-Structured Carry-Lookahead Adders
Ann Arbor, Michigan
March 04-March 06
ISBN: 0-7695-0104-4
ASCII Text
x 
 
Sae Hwan Kim, Shiu-Kai Chin, "Formal Verification of Tree-Structured Carry-Lookahead Adders," Great Lakes Symposium on VLSI, pp. 232, Ninth Great Lakes Symposium on VLSI, 1999.
 
 
BibTex
x
 
@article{ 10.1109/GLSV.1999.757419,
author = {Sae Hwan Kim and Shiu-Kai Chin},
title = {Formal Verification of Tree-Structured Carry-Lookahead Adders},
journal ={Great Lakes Symposium on VLSI},
volume = {0},
year = {1999},
issn = {1066-1395},
pages = {232},
doi = {http://doi.ieeecomputersociety.org/10.1109/GLSV.1999.757419},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Great Lakes Symposium on VLSI
TI - Formal Verification of Tree-Structured Carry-Lookahead Adders
SN - 1066-1395
SP
EP
A1 - Sae Hwan Kim,
A1 - Shiu-Kai Chin,
PY - 1999
VL - 0
JA - Great Lakes Symposium on VLSI
ER -
 
Sae Hwan Kim, Syracuse University
Shiu-Kai Chin, Syracuse University
Quad trees { trees with four branches, are used to abstractly describe tree-structured carry-lookahead adders using 4-bit components. The specification and implementation descriptions are parameterized and describe tree-structured adders having arbitrarily large inputs and outputs. The descriptions are formally verified using the HOL theorem prover.
Citation:
Sae Hwan Kim, Shiu-Kai Chin, "Formal Verification of Tree-Structured Carry-Lookahead Adders," glsvlsi, pp.232, Ninth Great Lakes Symposium on VLSI, 1999
Usage of this product signifies your acceptance of the Terms of Use.