Abstract interpretation of game properties

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

Volumn 1824 LNCS, Issue , 2000, Pages 220-240

  Henzinger, Thomas A ^a   Majumdar, Rupak ^a   Mang, Freddy ^a   Raskin, Jean François ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CALCULATIONS; DISTRIBUTED COMPUTER SYSTEMS; MODEL CHECKING; SEMANTICS; STATIC ANALYSIS; TEMPORAL LOGIC; FORMAL LOGIC;

ABSTRACT INTERPRETATIONS; ABSTRACT SEMANTICS; AUTOMATIC VERIFICATION; BOOLEAN OPERATIONS; COLLABORATIVE RELATIONSHIPS; CONCURRENT PROGRAM; PROTOCOL CONVERTERS; SOUNDNESS AND COMPLETENESS;

GAME THEORY;

EID: 84906087402     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45099-3_12     Document Type: Conference Paper

References (29)

1. R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 100-109. IEEE Computer Society Press, 1997
2. R. Alur, T.A. Henzinger, O. Kupferman, and M.Y. Vardi. Alternating refinement relations. In D. Sangiorgi and R. de Simone, editors, CONCUR 97: Concurrency T heory, Lecture Notes in Computer Science 1466, pages 163-178. Springer-Verlag, 1998
3. R. Alur, T.A. Henzinger, F.Y.C. Mang, S. Qadeer, S.K. Rajamani, and S. Tasiran. Mocha: modularity in mod el checking. In CAV 98: Computer-aided Verification, Lecture Notes in Computer Science 1427, pages 521-525. Springer-Verlag, 1998
4. Berkeley Wireless Research Center. http://bwrc.eecs.berkeley.edu.
5. E.M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks using abstraction and regular languages. In CONCUR 95: Concurrency Theory, Lecture Notes in Computer Science 962, pages 395-407. S pringer-Verlag, 1995
6. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. In Proceedings of the 19th Annual Symposium on Principles of Programming Languages, pages 343-354. ACM Press, 1992
7. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for the static analysis of programs by construction or approximation of fixpoints. In Proceedings of the Fourth Annual Symposium on Principles of Programming Languages. ACM Press, 1977
8. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2/ 3):103-179, 1992.
9. P. Cousot R. Cousot, Abstract interpretation frameworks, Journal of Logic and Computation, 2,4,511-547,1992.
10. P. Cousot and R. Cousot. Refining model checking by abstract interpretation. Automated Software Engineering, 6(1):69-95, 1999
11. P. Cousot and R. Cousot. Temporal abstract interpretation. In Proc eedings of the 27th Annual Symposium on Principles of Programming Languages, pages 12-25. ACM Press, 2000
12. D.R. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology, The Netherlands, 1996
13. D.R.Dams, R.Gerth, G. D ̈ohmen, R. Herrmann, P. Kelb, and H. Pargmann. Model checking using adaptive state and data abstraction. In CAV 94: Compu ter-Aided Verification, Lecture Notes in Computer Science 818, pages 455-467. Springer-Verlag, 1994
14. D.R. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253-291, 1997
15. S. Das, D. Dill, and S. Park. Experience with predicate abstraction. In CAV 99: Computer-aided Verification, Lecture Notes in Computer Science 1633, pages 160-171. Springer-Verlag, 1999
16. L. de Alfaro, T.A. Henzinger, and O. Kupferman. Concurrent reachability games. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 564-575. IEEE Computer Society Press, 1998
17. L. de Alfaro, T.A. Henzinger, and R. Majumdar. Symbolic algorithms for infinitestate games. Technical report, University of California, Berkeley, 2000
18. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976
19. D.L. Dill and H. Wong-Toi. Verification of real-time systems by successi ve overand underapproximation. In CAV 95: Computer-aided Verification, Lecture Notes in Computer Science 939, pages 409-422. Springer-Verlag, 1995
20. E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995-1072. Elsevier Science Publishers, 1990
21. R. Giacobazzi, F. Ranzato, and F. Scozzari. Complete abstract interpretatio ns made constructive. In MFCS 98: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1450, pages 366-377. Springer-Verlag, 1998
22. R. Giacobazzi, F. Ranzato, and F. Sco zzari. Making abstract interpretation complete. Journal of the ACM, 2000. To appear
23. S. Graf. Verification of a distributed cache memory by using abstractions. In CAV 9 4: Computer-aided Verification, Lecture Notes in Computer Science 818, pages 207-219. Springer-Verlag, 1994
24. S. Graf and H. Sä idi. Construction of abstract state graphs with pvs. In CAV 97: Computer-aided Verification, Lecture Notes in Computer Science 1254, pages 72-83. Springer-Verlag, 1997
25. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:11-44, 1995
26. D.E. Long. Model checking, abstraction, and compositional verification. PhDthesis, Carnegie Mellon University, Pittsburgh, PA, 1993
27. K.L. McMillan. Verification of infinite state systems by compositional model checking. In CHARME 99: Correct Hardware Design and Verification Methods, Lecture Notes in Co mputer Science 1703, pages 219-233. Springer-Verlag, 1999
28. P.J. Ramadge and W.M. Wonham. Supervisory control of a class of discrete-event processes. SIAM Journal of Control and Optimization, 25(1):206-230, 1987
29. P. Stevens. Abstract interpretation of games. In Proceedings of the 2nd International Workshop on Verification, Model Checking and Abstract Interpretation, 1998