Assume-guarantee software verification based on game semantics

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

Volumn 4260 LNCS, Issue , 2006, Pages 529-548

  Dimovski, Aleksandar ^a   Lazić, Ranko ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; FORMAL LOGIC; GAME THEORY; INFORMATION ANALYSIS; MATHEMATICAL MODELS; SEMANTICS;

GAME SEMANTICS; SOFTWARE VERIFICATION; SUBPROGRAMS;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 33845249172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11901433_29     Document Type: Article

References (22)

1. S. Abramsky, D. R. Ghica, A. S. Murawski, and C.-H. L. Ong. Applying Game Semantics to Compositional Software Modeling and Verification. In Proceedings of TACAS, LNCS 2988, (2004), 421-435.
2. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full Abstraction for PCF. Information and Computation, 163(2), (2000).
3. S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In P.W.O'Hearn and R.D.Tennent, editors, Algol-like languages. (Birkhauser, 1997).
4. R. Alur, P. Madhusudan, and W. Nam. Symbolic Compositional Verification by Learning Assumptions. In Proceedings of CAV, LNCS 3576, (2005), 548-562.
5. D. Angluin. Learning Regular Sets from Queries and Counterexamples. Information and Computation, 75(2), (1987), 87-106.
6. T. Ball and S. K. Rajamani. Automatically Validating Temporal Safety Properties of Interfaces. In Proceedings of SPIN, LNCS 2057, (2001), 103-122.
7. S. Chaki, E. Clarke, N. Sharygina, and N. Sinha. Dynamic Component Substiutability Analysis. In Proceedings of FM, LNCS 3582, (2005), 512-528.
8. E.M. Clarke, O. Grumberg and D. Peled, Model Checking. (MIT Press, 2000).
9. J. M. Cobleigh, D. Giannakopoulou, and C. S. Pasareanu. Learning Assumptions for Compositional Verification. In Proceedings of TACAS, LNCS 2619, (2003), 331-346.
10. A. Dimovski and R. Lazic. CSP Representation of Game Semantics for Second-Order Idealized Algol. In Proceedings of ICFEM, LNCS 3308, (2004), 146-161.
11. A. Dimovski, D. R. Ghica, and R. Lazic. Data-Abstraction Refinement: A Game Semantic Approach. In Proceedings of SAS, LNCS 3672, (2005), 102-117.
12. A. Dimovski, D. R. Ghica, and R. Lazic. A Counterexample-Guided Refinement Tool for Open Procedural Programs. In Proceedings of SPIN, LNCS 3925, (2006).
13. Formal Systems (Europe) Ltd (http://www.fsel.com), Failures-Divergence Refinement: FDR2 Manual, 2000.
14. D. R. Ghica and G. McCusker. The Regular-Language Semantics of Second-order Idealized Algol. Theoretical Computer Science 309 (1-3), (2003), 469-502.
15. A. Groce, D. Peled, and M. Yannakakis. Adaptive Model Checking. In Proceedings of TACAS, LNCS 2280, (2002), 357-370.
16. R. Harmer. Games and Full Abstraction for Nondeterministic Languages. PhD thesis, Imperial College, 1999.
17. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Software Verification with BLAST. In Proceedings of SPIN, LNCS 2648, (2003), 235-239.
18. J. M. E. Hyland and C.-H. L. Ong. On Full Abstraction for PCF: I, II, and III. Information and Computation 163, (2000), 285-400.
19. J. Laird. A Fully Abstract Game Semantics of Local Exceptions. In Proceedings of LICS, (2001), 105-114.
20. A. Pnueli. In Transition from Global to Modular Temporal Reasoning about Programs. Logic and Models of Concurrent Systems 13, (1984), 123-144.
21. R.L. Rivest and R.E. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103(2), (1993), 299-347.
22. A. W. Roscoe. Theory and Practice of Concurrency. (Prentice-Hall, 1998).