Combining symbolic model checking with uninterpreted functions forout-of-order processor verification

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

Volumn 1522, Issue , 1998, Pages 369-386

  Berezin, Sergey ^a   Biere, Armin ^a   Clarke, Edmund ^a   Zhu, Yunshan ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER ARCHITECTURE; FORMAL METHODS;

DECISION PROCEDURE; INSTRUCTION SCHEDULING; INSTRUCTION SET ARCHITECTURE; REDUCTION TECHNIQUES; SYMBOLIC MODEL CHECKERS; SYMBOLIC MODEL CHECKING; UNINTERPRETED FUNCTION SYMBOLS; UNINTERPRETED FUNCTIONS;

MODEL CHECKING;

EID: 35248886365     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49519-3_24     Document Type: Conference Paper

References (24)

1. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677–691, 1986.
2. J. R. Burch. Techniques for verifying superscalar microprocessors. In 33rd Design Automation Conference (DAC’96), pages 552–557, 1996.
3. J. R. Burch, E. M. Clarke, and K. L. McMillan. Symbolic model checking: 1020 states and beyond. Information and Computation, 98:142–170, 1992.
4. J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In D. L. Dill, editor, CAV’94, volume 818 of LNCS. Springer-Verlag, 1994.
5. E. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proceedings of the IBM Workshop on Logics of Programs, volume 131 of LNCS, pages 52–71. Springer-Verlag, 1981.
6. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, 1986.
7. E. M. Clarke and S. Jha. Symmetry and induction in model checking. Number 1000 in LNCS. Springer-Verlag, 1995.
8. W. Damm and A. Pnueli. Verifying out-of-order executions. In D. Probst, editor, CHARME’97. Chapman & Hall, 1997. To appear.
9. L. Gwennap. Intel’s P6 uses decoupled superscalar design. Microprocessor Report, 9(2):9–15, 1995.
10. J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, 1996.
11. R. Hojati and R. K. Brayton. Automatic datapath abstraction of hardware systems. In CAV’95. Springer-Verlag, 1995.
12. R. Hosabettu, M. Srivas, and G. Gopalakrishnan. Decomposing the proof of correctness of pipelined microprocessors. In Hu and Vardi [13], pages 122–134.
13. Alan J. Hu and Moshe Y. Vardi, editors. CAV’98, number 1427 in LNCS, 1998.
14. S. L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice- Hall, 1987.
15. Peter M. Kogge. The Architecture of Symbolic Computers. McGraw-Hill, 1991.
16. K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.
17. K. L. McMillan. Verification of an implementation of tomasulo’s algorithm by compositional model checking. In Hu and Vardi [13], pages 110–121.
18. K. Sajid, A. Goel, H. Zhou, A. Aziz, and V. Singhal. BDD based procedures for a theory of equality with uninterpreted functions. In Hu and Vardi [13], pages 244–255.
19. J. Sawada and W. A. Hunt. Processor verification with precise exceptions and speculative execution. In Hu and Vardi [13], pages 135–146.
20. N. Shankar, S. Owre, and J. M. Rushby. PVS Tutorial. Computer Science Laboratory, SRI International, 1993.
21. J. U. Skakkebæk, R. B. Jones, and D. L. Dill. Formal verification of out-of-order execution using incremental flushing. In Hu and Vardi [13], pages 98–109.
22. M. N. Velev and R. E. Bryant. Bit-level abstraction in the verification of pipelined microprocessors by correspondence checking. 1998. Submitted for publication.
23. D. H. D. Warren. An abstract prolog instruction set. Tech. Note 309, SRI, 1983.
24. P. Wolper. Expressing interesting properties of programs in propositional temporal logic. In Proceedings of the 13th annual ACM Symposium on Principles of Programming Languages (POPL’86), pages 184–193. ACM, 1986.