Methodology for hardware verification using compositional model checking

Science of Computer Programming

Volumn 37, Issue 1, 2000, Pages 279-309

  McMillan, K L ^a  

^a 2001 Addison St ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUFFER STORAGE; COMPUTER HARDWARE; DATA REDUCTION; NETWORK PROTOCOLS;

CACHE COHERENCE PROTOCOLS; COMPOSITIONAL MODEL CHECKING; HARDWARE VERIFICATION; SYMBOLIC MODEL CHECKING;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0033731380     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(99)00030-1     Document Type: Article

References (32)

1. Abadi M., Lamport L. Composing specifications. ACM Trans. Prog. Lang. Systems. 15(1):1993;73-132.
2. R. Alur, T.A. Henzinger, Reactive modules, 11th Annual IEEE Symp. Logic in Computer Science (LICS '96), 1996.
3. Alur R., Henzinger T.A., Mang F.Y.C., Qadeer S., Rajamani S.K., Tasiran S. Mocha: modularity in model checking. Hu A.J., Vardi M.Y. Conf. on Computer-aided Verification (CAV '98). Lecture Notes in Computer Science. vol. 1427:1998;521-525 Springer, Berlin.
4. Berezin S., Biere A., Clarke E., Zhu Y. Combining symbolic model checking with uninterpreted functions for out-of-order processor verification. Gopalakrishnan G., Windley P. Formal Methods in Computer-Aided Design (FMCAD '98). Lecture Notes in Computer Science. vol. 1522:1998;351-368 Springer, Berlin.
5. Burch J.R., Dill D.L. Automatic verification of pipelined microprocessor control, in: Computer-Aided Verification (CAV '94). 1994;Springer, Berlin.
6. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, 4th POPL, ACM Press, New York, 1977, pp. 238-252.
7. Cyrluk D. Inverting the abstraction mapping: a methodology for hardware verification. Srivas M., Camilleri A. Formal Methods in Computer-Aided Design (FMCAD '96). Lecture Notes in Computer Science. vol. 1166:1996;Springer, Berlin.
8. Eiriksson A. Formal Design of 1M-gate ASICs. Gopalakrishnan G., Windley P. Formal Methods in Computer-Aided Design (FMCAD '98). Lecture Notes in Computer Science. vol. 1522:1998;49-63 Springer, Berlin.
9. Hojati R., Brayton R.K. Automatic datapath abstraction of hardware systems. Wolper P. Conf. on Computer-Aided Verification (CAV '95). Lecture Notes in Computer Science. vol. 939:1995;98-113 Springer, Berlin.
10. Hojati R., Isles A., Kirkpatrick D., Brayton R.K. Verification using uninterpreted functions and finite instantiations. Srivas M., Camilleri A. Formal Methods in Computer-Aided Design (FMCAD '96). Lecture Notes in Computer Science. vol. 1166:1996;218-232 Springer, Berlin.
11. Hunt W.A. Jr. FM8501: A Verified Microprocessor. Lecture Notes in Computer Science. vol. 795:1994;Springer, Berlin.
12. Ip C.N., Dill D.L. Better verification through symmetry. Formal Methods System Des. 9(1-2):1996;41-75.
13. R.B. Jones, D.L. Dill, J.R. Burch, Efficient validity checking for processor verification, IEEE/ACM Int. Conf. on Computer Aided Design (ICCAD '95), 1995.
14. Kuehlmann A., Srinivasan A., LaPotin D.P. Verity - a formal verification program for custom CMOS circuits. IBM J. Res. Dev. 39(1-2):1995;149-165.
15. R.S. Lazić, A.W. Roscoe, Verifying determinism of concurrent systems which use unbounded arrays, Tech. Report PRG-TR-2-98, Oxford Univ. Computing Lab., 1998.
16. O. Lichtenstein, A. Pnueli, Checking that finite state concurrent programs satisfy their linear specification, 12th Annual ACM Symp. on Principles on Programming Languages, January 1985.
17. D.E. Long, Model checking, abstraction, and compositional verification, Tech. Report CMU-CS-93-178, Carnegie Mellon School of Computer Science, July 1993. Ph.D. Thesis.
18. McMillan K.L. Symbolic Model Checking. 1993;Kluwer, Dordrecht.
19. K.L. McMillan, Circular compositional reasoning about liveness, http://www-cad.eecs.berkeley. edu/ ̃kenmcmil/papers/1999-02.ps.gz, February 1999.
20. K.L. McMillan, Verification of infinite state systems by compositional model checking, http://www-cad.eecs.berkeley.edu/ ̃kenmcmil/papers/1999-01.ps.gz, February 1999.
21. Owicki S., Gries D. Verifying properties of parallel programs. Comm. ACM. 19(5):1976;279-285.
22. A. Pnueli, In transition from global to modular temporal reasoning about programs, Logics and Models of Concurrent Systems, NATO ASI Series, Springer, Berlin, 1984, pp. 123-144.
23. Sawada J., Hunt W.A. Jr. Processor verification with precise exceptions and speculative execution. Hu A.J., Vardi M.Y. Conf. on Computer-Aided Verification (CAV '98). Lecture Notes in Computer Science. vol. 1427:1998;135-146 Springer, Berlin.
24. Shankar N. PVS: combining specification, proof checking and model checking. Srivas M., Camilleri A. Formal Methods in Computer-Aided Design (FMCAD '96). Lecture Notes in Computer Science. vol. 1166:1996;257-264 Springer, Berlin.
25. Skakkabaek J.U., Jones R.B., Dill D.L. Formal verification of out-of-order execution using incremental flushing. Hu A.J., Vardi M.Y. Conf. on Computer-Aided Verification (CAV '98). Lecture Notes in Computer Science. vol. 1427:1998;98-109 Springer, Berlin.
26. Tomasulo R.M. An efficient algorithm for exploiting multiple arithmetic units. IBM J. Res. Dev. 11(1):1967;25-33.
27. T. Truman, T. Pering, R. Doering, R. Broderson, The InfoPad multimedia terminal: a portable device for wireless information access, IEEE Trans. Comput. (1999) to appear.
28. T.E. Truman, A methodology for the design and implementation of communication protocols for embedded wireless systems, Ph.D. Thesis, Dept. of EECS, University of CA, Berkeley, May 1998.
29. M. Vardi, P. Wolper, An automata-theoretic approach to automatic program verification, First Annual Symp. on Logic in Comput. Science, June 1986.
30. Velev M., Bryant R.E. Bit-level abstraction in the verification of pipelined microprocessors by correspondence checking. Gopalakrishnan G., Windley P. Formal Methods in Computer-Aided Design (FMCAD '98). Lecture Notes in Computer Science. vol. 1522:1998;18-35 Springer, Berlin.
31. Velev M., Bryant R.E. Verification of data-intensive circuits: an in-order-retirement case study. Gopalakrishnan G., Windley P. Formal Methods in Computer-Aided Design (FMCAD '98). Lecture Notes in Computer Science. vol. 1522:1998;351-368 Springer, Berlin.
32. P. Wolper, Epressing interesting properties of programs in propositional temporal logic, 13th ACM POPL, 1986, pp. 184-193.