Correctness of pipelined machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1954, Issue , 2000, Pages 161-178

  Manolios, Panagiotis ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; FORMAL METHODS;

COMPOSITIONALITY; CORRECTNESS CONDITIONS; INSTRUCTION SET ARCHITECTURE; LIVENESS PROPERTIES; MECHANICAL PROOF; MECHANICAL SUPPORT; MICRO ARCHITECTURES; PIPELINED MACHINES;

COMPUTER ARCHITECTURE;

EID: 84947266085     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (28)

1. B. Brock, M. Kaufmann, and J. S. Moore. ACL2 theorems about commercial microprocessors. In M. Srivas and A. Camilleri, editors, Formal Methods in Computer-Aided Design (FMCAD'96), pages 275-293. Springer-Verlag, 1996.
2. M. Browne, E. Clarke, and O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59, 1988.
3. R. E. Bryant, S. German, and M. N. Velev. Exploiting positive equality in a logic of equality with uninterpreted functions. In N. Halbwachs and D. Peled, editors, Computer-Aided Verification-CAV '99, volume 1633 of LNCS, pages 470-482. Springer-Verlag, 1999.
4. J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In Computer-Aided Verification (CAV '94), volume 818 of LNCS, pages 68-80. Springer-Verlag, 1994.
5. D. Cyrluk. Microprocessor verification in PVS: A methodology and simple exam-ple. Technical Report SRI-CSL-93-12, SRI, Dec. 1993.
6. T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Assume-guarantee refinement between different time scales. In N. Halbwachs and D. Peled, editors, Computer-Aided Verification-CAV '99, volume 1633 of LNCS, pages 208-221. Springer-Verlag, 1999.
7. R. Hosabettu, G. Gopalakrishnan, and M. Srivas. A proof of correctness of a processor implementing Tomasulo's algorithm without a reorder buffer. In L. Pierre and T. Kropf, editors, Correct Hardware Design and Verification Methods, 10th IFIP WG10.5 Advanced Research Working Conference, (CHARME '99), volume 1703 of LNCS, pages 8-22. Springer-Verlag, 1999.
8. R. Hosabettu, M. Srivas, and G. Gopalakrishnan. Decomposing the proof of correctness of a pileplined microprocessors. In A. J. Hu and M. Vardi, editors, Computer-Aided Verification-CAV '98, volume 1427 of LNCS. Springer-Verlag, 1998.
9. R. Hosabettu, M. Srivas, and G. Gopalakrishnan. Proof of correctness of a proces-sor with reorder buffer using the completion functions approach. In N. Halbwachs and D. Peled, editors, Computer-Aided Verification-CAV '99, volume 1633 of LNCS. Springer-Verlag, 1999.
10. M. Kaufmann, P. Manolios, and J. S. Moore, editors. Computer-Aided Reasoning: ACL2 Case Studies. Kluwer Academic Press, June 2000.
11. M. Kaufmann, P. Manolios, and J. S. Moore. Computer-Aided Reasoning: An Approach. Kluwer Academic Press, July 2000.
12. M. Kaufmann and J. S. Moore. ACL2 homepage. See URL http://www.cs.utexas.edu/users/moore/acl2.
13. M. Kaufmann and J. S. Moore. Structured theory development for a mech-anized logic. Journal of Automated Reasoning, 2000. To appear, See URL http://www.cs.utexas.edu/users/moore/publications/acl2-papers.html\#Foundations.
14. P. Manolios. Homepage of Panagiotis Manolios, 2000. See URL http://www.cs.utexas.edu/users/pete.
15. P. Manolios. Well-founded equivalence bisimulation. Technical report, Depart-ment of Computer Sciences, University of Texas at Austin, 2000. In preparation.
16. P. Manolios, K. Namjoshi, and R. Sumners. Linking theorem proving and model-checking with well-founded bisimulation. In N. Halbwachs and D. Peled, editors, Computer-Aided Verification-CAV '99, volume 1633 of LNCS, pages 369-379. Springer-Verlag, 1999.
17. K. L. McMillan. Verification of an implementation of Tomasulo's algorithm by compositional model checking. In A. J. Hu and M. Y. Vardi, editors, Computer Aided Verification (CAV '98), volume 1427 of LNCS, pages 110-121. Springer-Verlag, 1998.
18. R. Milner. Communication and Concurrency. Prentice-Hall, 1990.
19. K. S. Namjoshi. A simple characterization of stuttering bisimulation. In 17th Con-ference on Foundations of Software Technology and Theoretical Computer Science, volume 1346 of LNCS, pages 284-296, 1997.
20. D. Park. Concurrency and automata on infinite sequences. In Theoretical Com-puter Science, volume 104 of LNCS, pages 167-183. Springer-Verlag, 1981.
21. A. Pnueli, Y. Rodeh, O. Shtrichman, and M. Siegel. Deciding equality formu-las by small domain instantiations. In N. Halbwachs and D. Peled, editors, Computer-Aided Verification-CAV '99, volume 1633 of LNCS, pages 455-469. Springer-Verlag, 1999.
22. J. Sawada. Formal Verification of an Advanced Pipelined Machine. PhD thesis, University of Texas at Austin, Dec. 1999. See URL http://www.cs.utexas.edu/users/sawada/dissertation/.
23. J. Sawada. Verification of a simple pipelined machine model. In M. Kaufmann, P. Manolios, and J. S. Moore, editors, Computer-Aided Reasoning: ACL2 Case Studies, pages 137-150. Kluwer Academic Press, 2000.
24. J. Sawada and W. A. Hunt, Jr. Trace table based approach for pipelined micro-processor verification. In Computer Aided Verification (CAV '97), volume 1254 of LNCS, pages 364-375. Springer-Verlag, 1997.
25. J. Sawada and W. A. Hunt, Jr. Processor verification with precise exceptions and speculative execution. In A. J. Hu and M. Y. Vardi, editors, Computer Aided Verification (CAV '98), volume 1427 of LNCS, pages 135-146. Springer-Verlag, 1998.
26. M. Srivas and M. Bickford. Formal verification of a pipelined microprocessor. IEEE Software, pages 52-64, Sept. 1990.
27. M. K. Srivas and S. P. Miller. Formal verification of an avionics microprocessor. Technical Report CSL-95-04, SRI International, 1995.
28. P. J. Windley and M. L. Coe. A correctness model for pipelined microprocessors. In Theorem Provers in Circuit Design, volume 901 of LNCS, pages 33-52. Springer-Verlag, 1994.