A Fully Abstract Trace Semantics for General References
暂无分享,去创建一个
[1] James Laird. A game semantics of names and pointers , 2008, Ann. Pure Appl. Log..
[2] Julian Rathke,et al. Towards a theory of bisimulation for local names , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).
[3] Mitchell Wand,et al. Small bisimulations for reasoning about higher-order imperative programs , 2006, POPL '06.
[4] Davide Sangiorgi,et al. Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .
[5] Kohei Honda,et al. Sequentiality and the π-Calculus , 2001 .
[6] Nobuko Yoshida,et al. An observationally complete program logic for imperative higher-order functions , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[7] Samson Abramsky,et al. A fully abstract game semantics for general references , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).
[8] Julian Rathke,et al. Java Jr: Fully Abstract Trace Semantics for a Core Java Language , 2005, ESOP.
[9] Sam Lindley,et al. Extensional Rewriting with Sums , 2007, TLCA.
[10] Vincent Danos,et al. Game semantics and abstract machines , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[11] C.-H. Luke Ong,et al. Fully abstract semantics of additive aspects by translation , 2007, AOSD.
[12] C.-H. Luke Ong,et al. Pi-Calculus, Dialogue Games and PCF. , 1995 .
[13] C.-H. Luke Ong,et al. Pi-calculus, dialogue games and full abstraction PCF , 1995, FPCA '95.
[14] Brian Campbell,et al. Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.