Game semantics for good general references

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2011, Pages 75-84

  Murawski, Andrzej S ^a   Tzevelekos, Nikos ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DENOTATIONAL MODELS; FULL ABSTRACTION; GAME SEMANTICS; HIGHER ORDER; PROGRAMMING LANGUAGE; TRACE MODELS;

ABSTRACTING; COMPUTER PROGRAMMING; SEMANTICS;

COMPUTATION THEORY;

EID: 80052140779     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2011.31     Document Type: Conference Paper

References (31)

1. S. Abramsky, D. R. Ghica, A. S. Murawski, and C.-H. L. Ong. Applying game semantics to compositional software modelling and verification. In TACAS'04, LNCS 2988, pp 421-435.
2. S. Abramsky, D. R. Ghica, A. S. Murawski, C.-H. L. Ong, and I. D. B. Stark. Nominal games and full abstraction for the nu-calculus. In LICS'04, pp 150-159.
3. S. Abramsky, K. Honda, and G. McCusker. Fully abstract game semantics for general references. In LICS'98, pp 334-344.
4. S. Abramsky and G. McCusker. Call-by-value games. In CSL'97, LNCS 1414, pp 1-17.
5. A. Ahmed, D. Dreyer, and A. Rossberg. State-dependent representation independence. In POPL'09, pp 340-353.
6. L. Birkedal, K. Støvring, and J. Thamsborg. Realisability semantics of parametric polymorphism, general references and recursive types. MSCS, 20(4):655-703, 2010.
7. N. Bohr and L. Birkedal. Relational reasoning for recursive types and references. In APLAS'06, LNCS 4279, pp 79-96.
8. K. B. Bruce, L. Cardelli, and B. C. Pierce. Comparing object encodings. Inf. Comput., 155(1-2):108-133, 1999. (Pubitemid 129610455)
9. N. Charlton and B. Reus. A decidable class of verification conditions for programs with higher order store. ECEASST, 23, 2009.
10. D. Dreyer, G. Neis, and L. Birkedal. The impact of higher-order state and control effects on local relational reasoning. In ICFP'10, pp 143-156.
11. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Asp. Comput., 13:341-363, 2002. (Pubitemid 41204157)
12. D. R. Ghica and G. McCusker. The regular language semantics of second-order Idealized Algol. Theor. Comput. Sci., 309:469-502, 2003.
13. K. Honda and N. Yoshida. Game-theoretic analysis of call-by-value computation. Theor. Comput. Sci., 221(1-2):393-456, 1999. (Pubitemid 129608973)
14. V. Koutavas and M. Wand. Small bisimulations for reasoning about higher-order imperative programs. In POPL'06, pp 141-152.
15. J. Laird. Game semantics for higher-order concurrency. In FSTTCS'06, LNCS 4337, pp 417-428.
16. J. Laird. A fully abstract trace semantics for general references. In ICALP'07, LNCS 4596, pp 667-679.
17. J. Laird. A game semantics of names and pointers. Ann. Pure Appl. Logic, 151:151-169, 2008.
18. J. Laird. Game semantics for call-by-value polymorphism. In ICALP'10, LNCS 6199, pp 187-198.
19. S. B. Lassen and P. B. Levy. Typed normal form bisimulation for parametric polymorphism. In LICS'08, pp 341-352.
20. P. B. Levy. Possible world semantics for general storage in call-by-value. In CSL'02, LNCS 2471, pp 232-246.
21. P. B. Levy. Global state considered helpful. Electr. Notes Theor. Comput. Sci., 218:241-259, 2008.
22. P.-A. Melliès and N. Tabareau. An algebraic account of references in game semantics. Electr. Notes Theor. Comput. Sci., 249:377-405, 2009.
23. A. S. Murawski and N. Tzevelekos. Full abstraction for Reduced ML. In FOSSACS'09, LNCS 5504, pp 32-47.
24. A. M. Pitts and I. Stark. On the observable properties of higher order functions that dynamically create local names, or: What's new? In MFCS'93, pp 122-141.
25. J. C. Reynolds. The essence of Algol. In J. W. de Bakker and J.C. van Vliet, editors, Algorithmic Languages, pp 345-372.
26. D. Sangiorgi, N. Kobayashi, and E. Sumii. Environmental bisimulations for higher-order languages. In LICS'07, pp 293-302, 2007.
27. S. B. Sanjabi and C.-H. L. Ong. Fully abstract semantics of additive aspects by translation. In AOSD'07, ACM ICPS 208, pp 135-148.
28. J. Schwinghammer, L. Birkedal, B. Reus, and H. Yang. Nested hoare triples and frame rules for higher-order store. In CSL'09, LNCS 5771, pp 440-454.
29. I. D. B. Stark. Names and Higher-Order Functions. PhD thesis, University of Cambridge, 1995.
30. N. Tzevelekos. Full abstraction for nominal general references. LMCS, 5(3), 2009.
31. N. Yoshida, K. Honda, and M. Berger. Logical reasoning for higherorder functions with local state. LMCS, 4(4), 2008.