Verification of infinite state systems by compositional model checking

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

Volumn 1703, Issue , 1999, Pages 219-237

  McMillan, K L ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN; HARDWARE; RECONFIGURABLE HARDWARE;

CASE SPLITTING; COMPOSITIONAL MODELING; COMPOSITIONAL VERIFICATION; EXECUTION UNITS; INFINITE WORD; REGISTER FILES; UNINTERPRETED FUNCTIONS; VERIFICATION OF INFINITE-STATE SYSTEMS;

MODEL CHECKING;

EID: 84958653356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48153-2_17     Document Type: Conference Paper

References (18)

1. R. Alur, T. A. Henzinger, F. Mang, S. Qadeer, S. K. Rajamani, and S. Tasiran. Mocha: Modularity in model checking. In A. J. Hu and M. Y. Vardi, editors, CAV’98, number 1427 in LNCS, pages 521–25. Springer-Verlag.
2. S. Berezin, A. Biere, E. Clarke, and Y. Zhu. Combining symbolic model checking with uninterpreted functions for out-of-order processor verification. In FMCAD’98, number 1522 in LNCS, pages 351–68. Springer, 1998.
3. R. E. Bryant and C.-J. Seger. Formal verification of digital circuits using symbolic ternary system models. In R. Kurshan and E. M. Clarke, editors, Workshop on Computer-Aided Verification, New Brunswick, New Jersey, June 1990.
4. J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In Computer-Aided Verification (CAV’94). Springer-Verlag, 1994.
5. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th POPL, pages 238–252. ACM Press, 1977.
6. A. Eiriksson. Formal design of 1M-gate ASICs. In FMCAD’98, number 1522 in LNCS, pages 49–63. Springer, 1998.
7. R. Hojati and R. K. Brayton. Automatic datapath abstraction of hardware systems. In CAV’95, number 939 in LNCS, pages 98–113. Springer-Verlag, 1995.
8. R. Hojati, A. Isles, D. Kirkpatrick, and R. K. Brayton. Verification using uninterpreted functions and finite instantiations. In FMCAD’96, volume 1166 of LNCS, pages 218–32. Springer, 1996.
9. C. Ip and D. Dill. Better verification through symmetry. Formal Methods in System Design, 9(1-2):41–75, Aug. 1996.
10. R. B. Jones, D. L. Dill, and J. R. Burch. Efficient validity checking for processor verification. In ICCAD’95, 1995.
11. R. S. Lazić and A. W. Roscoe. Verifying determinism of concurrent systems which use unbounded arrays. Technical Report PRG-TR-2-98, Oxford Univ. Computing Lab., 1998.
12. D. E. Long. Model checking, abstraction, and compositional verification. Tecnical report CMU-CS-93-178, CMU School of Comp. Sci., July 1993. Ph.D. Thesis.
13. K. L. McMillan. Verification of an implementation of tomasulo’s algorithm by compositional model checking. In CAV’98, number 1427 in LNCS, pages 100–21. Springer-Verlag, 1998.
14. J. U. Skakkabaek, R. B. Jones, and D. L. Dill. Formal verification of out-of-order execution using incremental flushing. In CAV’98, number 1427 in LNCS, pages 98–109. Springer-Verlag, 1998.
15. R. M. Tomasulo. An efficient algorithm for exploiting multiple arithmetic units. IBM J. of Research and Development, 11(1):25–33, Jan. 1967.
16. T. E. Truman. A Methodology for the Design and Implementation of Communication Protocols for Embedded Wireless Systems. PhD thesis, Dept. of EECS, University of CA, Berkeley, May 1998.
17. M. Velev and R. E. Bryant. Bit-level abstraction in the verification of pipelined microprocessors by correspondence checking. In FMCAD’98, number 1522 in LNCS, pages 18–35. Springer, 1998.
18. P. Wolper. Epressing interesting properties of programs in propositional temporal logic. In 13th ACM POPL, pages 184–193, 1986.