Environment abstraction for parameterized verification

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

Volumn 3855 LNCS, Issue , 2006, Pages 126-141

  Clarke, Edmund ^a   Talupur, Muralidhar ^a   Veith, Helmut ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ADAPTIVE ALGORITHMS; AUTOMATION; BUFFER STORAGE; CONCURRENT ENGINEERING; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS;

AUTOMATIC VERIFICATIONS; BAKERY ALGORITHMS; LAMPORT'S BAKERY ALGORITHM; PARAMETERIZED SYSTEMS;

PARAMETER ESTIMATION;

EID: 33745637712     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (31)

1. P. A. Abdulla, B. Jonsson, M. Nilsson, and J. d'Orso. Regular modelhecking made simple and efficient. In Proc. 13th International Conference on Concurrency Theory (CONCUR), 2002.
2. K. Apt and D. Kozen. Limits for automatic verification of finite state concurrent systems. Information Processing Letters, 15:307-309, 1986.
3. T. Arons, A. Pnueli, S. Ruah, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In Proc. 13th Intl. Conf. Computer Aided Verification (CAV), 2001.
4. T. Ball, S. Chaki, and S. Rajamani. Verification of multi-threaded software libraries. In ICSE, 2001.
5. K. Baukus, S. Bensalem, Y. Lakhnech, and K. Stahl. Abstracting WS1S systems to verify parameterized networks. In Proc. TACAS, 2000.
6. K. Baukus, Y. Lakhnech, and K. Stahl. Verification of parameterized protocols. In Journal of Universal of Computer Science, 2001.
7. B. Boigelot, A. Legay, and P. Wolper. Iterating transducers in the large. In 15th Intern. Conf. on Computer Aided Verification (CAV'03). LNCS, Springer-Verlag, 2003.
8. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In 12th Intern. Conf. on Computer Aided Verification (CAV'00). LNCS, Springer-Verlag, 2000.
9. M. C. Browne, E. M. Clarke, and O. Grumberg. Reasoning about networks with many identical finite state processes. Information and Computation, 81:13-31, 1989.
10. E. Clarke, M. Talupur, and H. Veith. Environment abstraction for parameterized verification. In www.cs.cmu.edu/~tmurali/vmcai06.ps.
11. E. M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetry in temporal model checking. In Proc. 5th Intl. Conf. Computer Aided Verification (CAV), 1993.
12. G. Delzanno. Automated verification of cache coherence protocols. In Computer Aided Verification 2000 (CAV 00), 2000.
13. A. E. Emerson and V. Kahlon. Model checking guarded protocols. In Eighteenth Annual IEEE Symposium on Logic in Computer Science (LICS), pages 361-370, 2003.
14. E. A. Emerson, J. Havlicek, and R. Trefler. Virtual symmetry. In 15th Annual IEEE Symposium on Logic in Computer Science (LICS), 2000.
15. E. A. Emerson and A. Sistla. Utilizing symmetry when model-checking under fairness assumptions: An automata theoretic approach. TOPLAS, 4, 1997.
16. E. A. Emerson and A. P. Sistla. Symmetry and model checking. In Proc. 5th Intl. Conf. Computer Aided Verification (CAV), 1993.
17. E. A. Emerson and R. Trefler. From asymmetry to full symmetry. In CHARME, 1999.
18. Y. Fang, N. Piterman, A. Pnueli, and L. Zuck. Liveness with incomprehensible ranking. In Proc. VMCAI, 2004.
19. Y. Fang, N. Piterman, A. Pnueli, and L. Zuck. Liveness with invisible ranking. In Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), 2004.
20. S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39, 1992.
21. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In O. Grumberg, editor, Proc. CAV97), volume 1254, pages 72-83. Springer Verlag, 1997.
22. T. Henzinger, R. Jhala, and R. Majumdar. Race checking with context inference. In Proceedings of the International Conference on Programming Language Design and Implementation (PLDI), 2004.
23. Y. Resten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In Proc. CAV'97, volume 1254 of LNCS, pages 424-435. Springer, June 1997.
24. S. K. Lahiri and R. Bryant. Constructing quantified invariants. In Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), 2004.
25. S. K. Lahiri and R. Bryant. Indexed predicate discovery for unbounded system verification. In Proc. 16th Intl. Conf. Computer Aided Verification (CAV), 2004.
26. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Communications of the ACM, 17(8):453-455, 1974.
27. K. L. McMillan, S. Qadeer, and J. B. Saxe. Induction in compositional model checking. In Conference on Computer Aided Verficalion, pages 312-327, 2000.
28. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), 2001.
29. A. Pnueli, J. Xu, and L. Zuck. Liveness with (0, 1, ∞) counter abstraction. In Computer Aided Verification 2002 (CAV02), 2002.
30. I. Suzuki. Proving properties of a ring of finite state machines. Information Processing Letters, 28:213-214, 1988.
31. B. K. Szymanski. A simple solution to Lamport's concurrent programming problem with linear wait. In Proc International Conference on Supercomputing Systems, 1988.