Verification of data-insensitive circuits: An in-order-retirement case study

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

Volumn 1522, Issue , 1998, Pages 351-368

  Pnueli, Amir ^a   Arons, T ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; FORMAL METHODS; TIMING CIRCUITS;

ENUMERATIVE METHOD; REGISTER FILES; SEQUENTIAL ALGORITHM; UNINTERPRETED FUNCTIONS;

ELECTRIC NETWORK ANALYSIS;

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

References (34)

1. M. Abadi and L. Lamport. Composing specifications. Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, LNCS-430:1-41, 1990.
2. T. Arons and A. Pnueli. Verifying tomasulo's algorithm by refinement. Technical report, Weizmann Institute, 1998.
3. S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Properties preserving simulations. CAV'92:251-263, 1992.
4. N. Bjørner, I.A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. 1st Intl. Conf. on Principles and Practice of Constraint Programming, LNCS-976:589-623, 1995.
5. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond. Inf. and Comp., 98(2):142-170, 1992.
6. J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. CAV'94:68-80, 1994.
7. G. Barrett and A. McIsaac. Model-checking in a microprocessor design project. CAV'97, 1997.
8. R.E. Bryant and M. Velev. Deciding a theory of positive equality with uninterpreted functions. This volume.
9. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. POPL'77.
10. Y.A. Chen, E.M. Clarke, P.-H. Ho, Y. Hoskote, T. Kam, M. Khaira, J. OLeary, and X. Zhao. Verification of all circuits in a floating point unit using word-level modelchecking. FMCAD'96:1-18, 1996.
11. E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. CONCUR'95:395-407, 1995.
12. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Trans. Prog. Lang. Sys., 16(5):1512-1542, 1994.
13. E.M. Clarke, D.E. Long, and K.L. McMillan. Compositional model checking. Proc. 4th IEEE Symp. Logic in Comp. Sci.:353-362, 1989.
14. D. Cyrluk and P. Narendran. Ground temporal logic: A logic for hardware verification. CAV'94:247-259, 1994.
15. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Trans. Prog. Lang. Sys., 19(2), 1997.
16. W. Damm and A. Pnueli. Verifying out-of-order executions. CHARME'97:23-47, Montreal, 1997. Chapmann & Hall.
17. W. Damm, A. Pnueli, and S. Ruah. Herbrand automata for hardware verification. CONCUR'98, 1998.
18. S. Greibach. Theory of program structures: schemes, semantics, verification, volume 36 of Lect. Notes in Comp. Sci. Springer-Verlag, Heidelberg, 1975.
19. R. Hojati, A. Isles, D. Kirkpatrick, and R.K. Brayton. Veri_cation using uninterpreted functions and _nite instantiations. FMCAD'96:218-232, 1996.
20. N. Halbwachs, F. Lagnier, and C. Ratel. An experience in proving regular networks of processes by modular model checking. Acta Informatica, 29(6/7):523-543, 1992.
21. J.L. Hennessy and D.A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers Inc., 1996.
22. K. Keutzer. The need for formal methods for integrated circuit design. FMCAD'96:1-18, 1996.
23. R.P. Kurshan and K.L. McMillan. A structural induction theorem for processes. Information and Computation, 117:1-11, 1995.
24. Y. Kesten and A. Pnueli. An αsts-based common semantics for signal, statechart, dc+, and C. Tech. report, Weizmann Institute, 1996.
25. Gwennap L. Intel's p6 uses decoupled superscalar design. Microprocessor Report, 9(2):9-15, 1995.
26. D.C. Luckham, D.M.R. Park, and M.S. Paterson. On formalized computer programs. J. Comp. Sys. Sci., 4(3):220-249, 1970.
27. K.L. McMillan. A compositional rule for hardware design refinement. CAV'97.
28. K.L. McMillan. Verification of an implementation of Tomasulo's algorithm by compositional model checking. CAV'98:110-121, 1998.
29. Z. Manna and A. Pnueli. Clocked transition systems. Logic and Software Engineering:3 - 42. World Scientific, Singapore, 1996.
30. S. Owre, J.M. Rushby, N. Shankar, and M.K. Srivas. A tutorial on using PVS for hardware verification. Proceedings of the Second Conference on Theorem Provers in Circuit Design:167-188. FZI Publication, Universität Karlsruhe, 1994.
31. E. Clarke S. Berezin, A. Biere and Y. Zhu. Combining symbolic model checking with uninterpreted functions for out-or-order processor verification. This volume.
32. J.U. Skakkebaek, R.B. Jones, and D.L. Dill. Formal verification of out-of-order execution using incremental flushing. CAV'98:pp 98-110, 1998.
33. J. Sawada and W.A. Hunt Jr. Processor verification with precise exceptions and speculative execution flushing. CAV'98:135-146, 1998.
34. R.M. Tomasulo. An efficient algorithm for exploiting multiple arithmetic units. IBM J. of Research and Development, 11(1):25-33, 1967.