Liveness by invisible invariants

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

Volumn 4229 LNCS, Issue , 2006, Pages 356-371

  Fang, Yi ^a   McMillan, Kenneth L ^b   Pnueli, Amir ^c   Zuck, Lenore D ^d  

^a MICROSOFT   (United States)

^b CADENCE DESIGN SYSTEMS   (United States)

^c NEW YORK UNIVERSITY   (United States)

^d UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INVARIANCE; MATHEMATICAL MODELS; PARAMETER ESTIMATION; SYSTEMS ANALYSIS; THEOREM PROVING; ARTIFICIAL INTELLIGENCE; COMPUTERS;

INVISIBLE INVARIANTS; LIVENESS MONITORS; SAFETY PROPERTIES; SYSTEM BEHAVIOR; INVARIANT GENERATIONS; INVARIANT PROPERTIES; LIVENESS; LIVENESS PROPERTIES; PARAMETRIZED SYSTEMS; Q STATE; SAFETY PROPERTY; SMALL MODEL THEOREM;

SECURITY SYSTEMS; FORMAL METHODS;

EID: 33750567735     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11888116_26     Document Type: Conference Paper

References (24)

1. [AK86] K. R. Apt and D. Kozen. Limits for automatic program verification of finite-state concurrent systems. Info. Proc. Lett., 22(6), 1986.
2. th Intl. Conference on Computer Aided Verification (CAV'01), volume 2102 of Lect. Notes in Comp. Sci., Springer-Verlag, pages 221-234, 2001.
3. [APZ03] T. Arons, A. Pnueli, and L. Zuck. Parameterized verification by probabilistic abstraction. In 6th International Conference on Foundations of Software Science and Computational Structures, volume 2620 of Lect. Notes in Comp. Sci., pages 87-102, Warsaw, Poland, April 2003. Springer-Verlag.
4. [BAS02] A. Biere, C. Artho, and V. Schuppan. Liveness checking as safety checking. In Rance Cleaveland and Hubert Garavel, editors, Electronic Notes in Theoretical Computer Science, volume 66. Elsevier, 2002.
5. [BBC+95] N. Bjørner, I.A. Browne, E. Chang, M. Colon, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe. STeP: The Stanford Temporal Prover, User's Manual. Technical Report STAN-CS-TR-95-1562, Computer Science Department, Stanford University, November 1995.
6. th Intl. Conference on Computer Aided Verification (CAV'05), Springer-Verlage LNCS 3576, pp. 291-295, 2005.
7. [CGJ95] E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR92), volume 962 of Lect. Notes in Comp. Sci., pages 395-407, Philadelphia, PA, August 1995. Springer-Verlag.
8. [CLP84] S. Cohen, D. Lehmann, and A. Pnueli. Symmetric and economical solutions to the mutual exclusion problem in a distributed system. Theor. Comp. Sci., 34:215-225, 1984.
9. th Intl. Conference on Computer Aided Verification (CAV'02), volume 2404 of Lect. Notes in Comp. Sci., Springer-Verlag, pages 442-454, 2002.
10. [EK00] E.A. Emerson and V. Kahlon. Reducing model checking of the many to the few. In 17th International Conference on Automated Deduction (CADE-17), pages 236-255, 2000.
11. [EN95] E. A. Emerson and K. S. Namjoshi. Reasoning about rings. In Proc. 22nd ACM Conf. on Principles of Programming Languages, POPL'95, San Francisco, 1995.
12. th Intl. Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'04), volume 2988 of Lect. Notes in Comp. Sci., Springer-Verlag, pages 482-496, April 2004.
13. th conference on Verification, Model Checking, and Abstract Interpretation, volume 2937 of Lect. Notes in Comp. Sci., pages 223-238, Venice, Italy, January 2004. Springer-Verlag.
14. th Intl. Conference on Computer Aided Verification, (CAV'97), volume 1254 of Lect. Notes in Comp. Sci., Springer-Verlag, 1997.
15. th Intl. Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), volume 1384 of Lect. Notes in Comp. Sci., Springer-Verlag, pages 424-438, 1998.
16. th Intl. Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), volume 1785 of Lect. Notes in Comp. Sci., Springer-Verlag, 2000.
17. [LHR97] D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of parameterized linear networks of processes. In 24th ACM Symposium on Principles of Programming Languages, POPL'97, Paris, 1997.
18. [McM99] K.L. McMillan. Verification of Infinite State Systems by Compositional Model Checking. In Proc. Charme 1999, volume 1703 of Lect. Notes in Comp. Sci., Springer-Verlag, pages 219-234, 1999.
19. [MP95] Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
20. [OSR93] S. Owre, N. Shankar, and J.M. Rushby. User guide for the PVS specification and verification system (draft). Technical report, Comp. Sci.,Laboratory, SRI International, Menlo Park, CA, 1993.
21. th Intl. Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), volume 2031 of Lect. Notes in Comp. Sci., Springer-Verlag, pages 82-97, 2001.
22. [PXZ02] A. Pnueli, J. Xu, and L. Zuck. Liveness with (0,1, ∞)-counter abstraction, 2002.
23. [VW86] M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. First IEEE Symp. Logic in Comp. Sci., pages 332-344, 1986.
24. [ZP04] L. Zuck and A. Pnueli. Model checking and abstraction to the aid of parameterized systems. Computer Languages, Systems, and Structures, Volume 30(3-4), pp. 139-169 2004.