Using Rewriting Rules and Positive Equality to Formally Verify Wide-Issue Out-of-Order Microprocessors with a Reorder Buffer

@inproceedings{Velev2002UsingRR,
  title={Using Rewriting Rules and Positive Equality to Formally Verify Wide-Issue Out-of-Order Microprocessors with a Reorder Buffer},
  author={Miroslav N. Velev},
  booktitle={DATE},
  year={2002}
}
Rewriting rules and Positive Equality [4] are combined in anautomatic way in order to formally verify out-of-order proces-sorsthat have a Reorder Buffer, and can issue/retire multipleinstructions per clock cycle. Only register-register instructionsare implemented, and can be executed out-of-order, as soon astheir data operands can be either read from the Register File, orforwarded as results of instructions ahead in program order inthe Reorder Buffer. The verification is based on the Burch… CONTINUE READING
Highly Cited
This paper has 36 citations. REVIEW CITATIONS
27 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

and S

  • L. Zhang, C. F. Madigan, M. W. Moskewicz
  • Malik, “Efficient Conflict Driven Learning in a…
  • 2001
Highly Influential
5 Excerpts

Pleszkun, “Implementing Precise Interrupts Pipelined Processors,

  • J. E. Smith, A.R
  • IEEE Transactions on Computers,
  • 1988
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…