Three-valued abstractions of games: Uncertainty, but with precision

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 170-179

  De Alfaro, Luca ^a   Godefroid, Patrice ^b   Jagadeesan, Radha ^c  

^a University of California Santa Cruz   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c DEPAUL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER SIMULATION; MODAL ANALYSIS; NETWORK PROTOCOLS; SECURITY OF DATA; THEOREM PROVING;

3-VALUED SENSE; MODAL TRANSITIONS SYSTEMS (MTS); THREE-VALUED ABSTRACTIONS; UNIVERSAL FRAGMENTS;

GAME THEORY;

EID: 4544323138     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319611     Document Type: Conference Paper

References (38)

1. S. Abramsky. Semantics of interaction. In Trees in Algebra and Programming - CAAP'96, Proc. 21st Int. Coll., Linköping, volume 1059. Springer-Verlag, 1996.
2. R. Alur, T. Henzinger, and O. Kupferman. Alternating time temporal logic. J. ACM, 49:672-713, 2002.
3. R. Alur, T. Henzinger, O. Kupferman, and M. Vardi. Alternating refinement relations. In CONCUR 98: Concurrency Theory. 9th Int. Conf., volume 1466 of Lect. Notes in Comp. Sci., pages 163-178. Springer-Verlag, 1998.
4. T. Ball, A. Podelski, and S. K. Rajamani. Boolean and Cartesian Abstraction for Model Checking C Programs. In Proceedings of TACAS'2001, 2001.
5. G. Bruns and P. Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In Proceedings of the 11th Conference on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 274-287. Springer Verlag, July 1999.
6. G. Bruns and P. Godefroid. Generalized Model Checking: Reasoning about Partial State Spaces. In Proceedings of CONCUR'2000 (11th International Conference on Concurrency Theory), volume 1877 of Lecture Notes in Computer Science, pages 168-182. Springer Verlag, August 2000.
7. E. Clarke, O. Grumberg, and D. Long. Model checking and abstraction. In Proc. 19th ACM Symp. Princ. of Prog. Lang., pages 343-354, 1992.
8. R. Cleaveland, P. Iyer, and D. Yankelevich. Optimality in abstractions of model checking. In SAS'95: Proc. 2d. Static Analysis Symposium, Lecture Notes in Computer Science 983, pages 51-63. Springer, 1995.
9. J. C. Corbett, M. B. Dwyer, J. Hatcliff, S. Laubach, C. S. Pasareanu, Robby, and H. Zheng. Bandera: Extracting Finite-state Models from Java Source Code. In Proceedings of the 22nd Intl' Conference on Software Engineering, June 2000.
10. D. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Technical University of Eindhoven, 1996.
11. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253-291, 1997.
12. D. Dams and K. Namjoshi. The existence of finite abstractions for branching time model checking. In Proceedings of the 19th IEEE conference on Logic in Computer Science. IEEE, 2004. These proceedings.
13. L. de Alfaro, T. Henzinger, and F. Mang. Detecting errors before reaching them. In CAV 00: Proc. of 12th Conf. on Computer Aided Verification, volume 1855 of Lect. Notes in Camp. Sci., pages 186-201. Springer-Verlag, 2000.
14. E. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In Proc. 32nd IEEE Symp. Found. of Comp. Sci., pages 368-377. IEEE Computer Society Press, 1991.
15. P. Godefroid. Reasoning about Abstract Open Systems with Generalized Module Checking. In Proceedings of EMSOFT'2003 (3rd Conference on Embedded Software), volume 2855 of Lecture Notes in Computer Science, pages 223-240, Philadelphia, October 2003. Springer-Verlag.
16. P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based Model Checking using Modal Transition Systems. In Proceedings of CONCUR '2001 (12th International Conference on Concurrency Theory), volume 2154 of Lecture Notes in Computer Science, pages 426-440, Aalborg, August 2001. Springer-Verlag.
17. T. Henzinger, R. Jhala, R. Majumdar, G. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for systems code. In CAV 02: Proc. of 14th Conf. on Computer Aided Verification, volume 2404 of Lect. Notes in Comp. Sci., pages 526-538. Springer-Verlag, 2002.
18. T. Henzinger, R. Majumdar, F. Mang, and J.-F. Raskin. Abstract interpretation of game properties. In SAS 00: Static Analysis, Lecture Notes in Computer Science 1824, pages 220-239. Springer-Verlag, 2000.
19. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: a foundation for three-valued program analysis. In Proceedings of the European Symposium on Programming (ESOP'2001), volume 2028. Springer Verlag, April 2001.
20. P. Kelb. Model checking and abstraction: a framework preserving both truth and failure information. Technical Report OFFIS, University of Oldenburg, Germany, 1994.
21. S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In Proceedings of the 12th International Conference on Concurrency Theory, volume 2154 of Lecture Notes in Computer Science, pages 551-565. Springer, 2001.
22. S. Kremer and J.-F. Raskin. Game analysis of abuse-free contract signing. In Proceedings of the 15th IEEE Computer Security Foundations Workshop, pages 206-220, 2002.
23. O. Kupferman and M. Vardi. Module Checking. In Proc. 8th Conference on Computer Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 75-86, New Brunswick, August 1996. Springer-Verlag.
24. K. G. Larsen. Modal Specifications. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, number 407 in Lecture Notes in Computer Science, pages 232-246. Springer Verlag, June 12-14 1989. International Workshop, Grenoble, France.
25. K. G. Larsen and B. Thomsen. A Modal Process Logic. In Third Annual Symposium on Logic in Computer Science, pages 203-210. IEEE Computer Society Press, 1988.
26. K. G. Larsen and L. Xinxin. Equation solving using modal transition systems. In Proceedings of the 5th IEEE conference on Logic in Computer Science, pages 108-117. IEEE, 1990.
27. F. Levi. A symbolic semantics for abstract model checking. In Static Analysis Symposium: SAS'98, volume 1503 of Lecture Notes in Computer Science. Springer Verlag, 1998.
28. 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: An International Journal, 6(1): 11-44, January 1995.
29. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
30. P. Manolios and R. J. Trefler. Safety and liveness in branching time. In Proceedings of the 16th IEEE conference on Logic in Computer Science, pages 366-375. IEEE, 2001.
31. R. Milner. An algebraic definition of simulation between programs. In Second International Joint Conference on Artificial Intelligence, pages 481-489. The British Computer Society, 1971.
32. K. S. Namjoshi. Abstraction for branching time properties. In Proceedings of the 15th International Conference on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 288-300. Springer, 2003.
33. C. S. Pasareanu, M. B. Dwyer, and W. Visser. Finding feasible counter-examples when model checking abstracted Java programs. Lecture Notes in Computer Science, 2031, 2001.
34. S. Shoham. A game-based framework for ctl counter-examples and 3-valued abstraction-refinement. Master's thesis, TECHNION - Israel Institute of Technology, 2003. Paper with O. Grumberg in Proceedings of CAV 2003.
35. S. Shoham and O. Grumberg. Monotonic abstraction-refinement for ctl. In Tools and Algorithms for the Construction and Analysis of Systems: 10th International Conference, number 2988 in Lecture Notes in Computer Science, pages 546-560. Springer Verlag, 2004.
36. P. Stevens. Abstract games for infinite state processes. In Proceedings of the 9th International Conference on Concurrency Theory, volume 1466 of Lecture Notes in Computer Science, 1998.
37. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4, pages 135-191. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.
38. W. Thomas. On the synthesis of strategies in infinite games. In Proc. of 12th Annual Symp. on Theor. Asp. of Camp. Sci., volume 900 of Lect. Notes in Comp. Sci., pages 1-13. Springer-Verlag, 1995.