A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
This paper presents several techniques for formally verifying pipellned microprocessor implementations that contain out-of-order execution and dynamic resolution of data-dependent hazards. Our principal technique models the trace of executed instructions using a tablebased representation called a MAETT. We express invariant properties of pipefined implemenLations by specifying relations between fields in the MAETT. To show the viabifity of this technique, we have proved the correctness of adoi:10.1007/3-540-63166-6_36 fatcat:lrycriyst5aotf5bgyljirz6ja