Parameterized verification by probabilistic abstraction

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

Volumn 2620, Issue , 2003, Pages 87-102

  Arons, Tamarah ^a   Pnueli, Amir ^a   Zuck, Lenore ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PHILOSOPHICAL ASPECTS;

AUTOMATIC VERIFICATION; FINITE STATE SYSTEMS; LIVENESS PROPERTIES; MUTUAL EXCLUSION PROTOCOL; PARAMETERIZED VERIFICATIONS; PROBABILISTIC ABSTRACTION; PROBABILISTIC PROTOCOLS; SYMBOLIC MODEL CHECKERS;

MODEL CHECKING;

EID: 21144439846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (32)

1. K. R. Apt and D. Kozen. Limits for automatic program verification of finite-state concurrent systems. Information Processing Letters, 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. T. Arons, A. Pnueli, and L. Zuck. Verification by probabilistic abstraction. Weizmann Institute of Science Technical Report, 2003.
4. M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many finite state processes. In Proc. 5th ACM Symp. Princ. of Dist. Comp., pages 240-248, 1986.
5. K. Baukus, Y. Lakhnesche, and K. Stahl. Verification of parameterized protocols. Journal of Universal Computer Science, 7(2):141-158, 2001.
6. 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.
7. 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.
8. E. A. Emerson and K. S. Namjoshi. Reasoning about rings. In Proc. 22th ACM Conf. on Principles of Programming Languages, POPL'95, San Francisco, 1995.
9. E.A. Emerson and K.S. Namjoshi. Automatic verification of parameterized synchronous systems. In R. Alur and T. Henzinger, editors, Proc. 8th Intl. Conference on Computer Aided Verification (CAV'96), volume 1102 1102 of Lect. Notes in Comp. Sci., Springer-Verlag, 1996.
10. W. Feller. An Introduction to Probability Theory and its Applicaitons, volume 1. John Wiley & Sons, 3 edition, 1968.
11. S. Hart, M. Sharir, and A. Pnueli. Termination of probabilistic concurrent programs. In Proc. 9th ACM Symp. Princ. of Prog. Lang., pages 1-6, 1982.
12. R.P. Kurshan and K.L. McMillan. A structural induction theorem for processes. Information and Computation, 117:1-11, 1995.
13. M. Kwiatkowska, G. Norman, and D. Parker. Verifying randomized distributed algorithms with prism. In Proc. of the Workshop on Advances in Verification (WAVe) 2000. 2000.
14. M. Kwiatkowska, G. Norman, and D. Parker. Prism: Probabilistic symbolic model checker. In TOOLS 2002, volume 2324 of LNCS, 2002.
15. Y. Kesten and A. Pnueli. Control and data abstractions: The cornerstones of practical formal verification. Software Tools for Technology Transfer, 4(2):328-342, 2000.
16. Y. Kesten, A. Pnueli, and L. Raviv. Algorithmic verification of linear temporal logic specifications. In K.G. Larsen, S. Skyum, and G. Winskel, editors, Proc. 25th Int. Colloq. Aut. Lang. Prog., volume 1443 of LNCS, pages 1-16. Springer-Verlag, 1998.
17. Y. Kesten, A. Pnueli, E. Shahar, and L. Zuck. Network invariants in action. In Proceeding? of Concur'02, volume 2421 of LNCS. Springer-Verlag, 2002.
18. D. Lehmann and M.O. Rabin. On the advantages of free choice: A symmetric and fully distibuted solution to the dining philosophers problem (exended abstract). In Proc. 8th ACM Symp. Princ. of Prog. Lang., pages 133-138, 1981.
19. B.D. Lubachevsky. An approach to automating the verification of compact parallel coordination programs. Acta Infromatica, 21, 1984.
20. Z. Manna, A. Anuchitanukul, N. Bjerner, A. Browne, E. Chang, M. Colon, L. De Alfaro, H. Devarajan, H. Sipma, and T.E. Uribe. STeP: The Stanford Temporal Proven Technical Report STAN-CS-TR-94-1518, Dept. of Comp. Sci., Stanford University, Stanford, California, 1994.
21. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
22. A. Pnucli. On the extremely fair treatment of probabilistic algorithms. In Proc. 15th ACM Symp. Theory of Comp., pages 278-290, 1983.
23. A. Pnueli and E. Shahar. A platform for combining deductive with algorithmic verification. In R. Alur and T. Henzinger, editors, Proc. 8th Intl. Conference on Computer Aided Verification (CAV'96), volume 1102 of Lect. Notes in Comp. Sci., Springer-Verlag, pages 184-195, 1996.
24. ∼zuck/pubs/cav02.ps.
25. A. Pnueli and L. Zuck. Probablistic verification by tableaux. In Proc. First IEEE Symp. Logic in Comp. Sci., pages 322-331, 1986.
26. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1:53-72, 1986.
27. A. Pnueli and L.D. Zuck. Probabilistic verification. Information and Computation, 103(1):1-29, 1993.
28. M.O. Rabin. The choice coordination problem. Acta Informatica, 17:121-134, 1982.
29. Z. Shtadler and O. Grumberg. Network grammars, communication behaviors and automatic verification.- In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, volume 407 of LNCS, pages 151-165. Springer-Verlag, 1989.
30. 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.
31. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, volume 407 of LNCS, pages 68-80. Springer-Verlag, 1989.
32. rd workshop on Verification, Model Checking, and Abstract Interpretation, volume 2294 of LNCS, 2002.