Induction in compositional model checking

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

Volumn 1855, Issue , 2000, Pages 312-327

  McMillan, Kenneth L ^a   Qadeer, Shaz ^b   Saxe, James B ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BAKERIES; COMPUTER AIDED ANALYSIS;

COMPOSITIONAL MODELING; FINITE MODEL; FINITE NUMBER; ISOMORPHISM CLASS; MUTUAL EXCLUSION ALGORITHMS; NATURAL NUMBER; PROOF SYSTEM; SMV MODEL;

MODEL CHECKING;

EID: 84944414585     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_25     Document Type: Conference Paper

References (13)

1. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of in- finite state systems compositionally and automatically. In A.J. Hu and M.Y. Vardi, editors, Computer Aided Verification (CAV'98), volume 1427 of LNCS, pages 319-331. Springer-Verlag, 1998.
2. S. Das, D.L. Dill, and S. Park. Experience with predicate abstraction. In N. Halbwachs and D. Peled, editors, Computer Aided Verification (CAV'99), volume 1633 of LNCS, pages 160-171. Springer-Verlag, 1999.
3. T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Verifying sequential consistency on shared-memory multiprocessor systems. In N. Halbwachs and D. Peled, editors, Computer Aided Verification (CAV'99), volume 1633 of LNCS, pages 301-315. Springer-Verlag, 1999.
4. R. Kurshan and K. L. McMillan. A structural induction theorem for processes. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pages 239-247, 1989
5. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Comm. ACM, 17:453-455, August 1974.
6. K. L. McMillan. A compositional rule for hardware design refinement. In O. Grumberg, editor, Computer Aided Verification (CAV'97), volume 1254 of LNCS, pages 24-35. Springer-Verlag, 1997.
7. 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.
8. K. L. McMillan. Verification of infinite state systems by compositional model checking. In L. Pierre and T. Kropf, editors, Correct Hardware Design and Verification Methods (CHARME'99), volume 1703 of LNCS, pages 219-233. Springer-Verlag, 1999.
9. S. Owre, J.M. Rushby, and N. Shankar. PVS: A prototype Verification system. In D. Kapur, editor, Computer Aided Deduction (CADE'92), volume 607 of LNAI, pages 748-752. Springer-Verlag, 1992.
10. S. Rajan, N. Shankar, and M. K. Srivas. An integration of model checking with automated proof checking. In P. Wolper, editor, Computer Aided Verification (CAV'95), volume 939 of LNCS, pages 84-97. Springer-Verlag, 1995.
11. H. Saïdi and S. Graf. Construction of abstract state graphs with PVS. In O. Grumberg, editor, Computer Aided Verification (CAV'97), volume 1254 of LNCS, pages 72-83. Springer-Verlag, 1997.
12. H. Saïdi and N. Shankar. Abstract and model check while you prove. In N. Halbwachs and D. Peled, editors, Computer Aided Verification (CAV'99), volume 1633 of LNCS, pages 443-454. Springer-Verlag, 1999.
13. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In Workshop on Automatic Verification Methods for Finite State Systems, volume 407 of LNCS, pages 68-80. Springer-Verlag, 1989