loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th International Conference on VLSI Design - 'VLSI for the Information Appliance'
Verifying Tomasulo's Algoithm by Refinement
Goa, India
January 10-January 13
ISBN: 0-7695-0013-7
ASCII Text
x 
 
Tamarah Arons, Amir Pnueli, "Verifying Tomasulo's Algoithm by Refinement," VLSI Design, International Conference on, pp. 306, 12th International Conference on VLSI Design - 'VLSI for the Information Appliance', 1999.
 
 
BibTex
x
 
@article{ 10.1109/ICVD.1999.745165,
author = {Tamarah Arons and Amir Pnueli},
title = {Verifying Tomasulo's Algoithm by Refinement},
journal ={VLSI Design, International Conference on},
volume = {0},
year = {1999},
issn = {1063-9667},
pages = {306},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICVD.1999.745165},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - VLSI Design, International Conference on
TI - Verifying Tomasulo's Algoithm by Refinement
SN - 1063-9667
SP
EP
A1 - Tamarah Arons,
A1 - Amir Pnueli,
PY - 1999
VL - 0
JA - VLSI Design, International Conference on
ER -
 
In this paper Tomasulo's algorithm for out-of-order execution is shown to be a refinement of the sequential instruction execution algorithm. Correctness of Tomasulo's algorithm is established by proving that the register files of Tomasulo's algorithm and the sequential algorithm agree once all instructions have been completed.
Citation:
Tamarah Arons, Amir Pnueli, "Verifying Tomasulo's Algoithm by Refinement," vlsid, pp.306, 12th International Conference on VLSI Design - 'VLSI for the Information Appliance', 1999
Usage of this product signifies your acceptance of the Terms of Use.