Conference ProceedingsOPEN ACCESS

Synchronous game semantics via round abstraction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6604 LNCS 350-364
DOI: 10.1007/978-3-642-19805-2_24
6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A synchronous game semantics-one in which several moves may occur simultaneously-is derived from a conventional (sequential) game semantics using a round abstraction algorithm. We choose the programming language Syntactic Control of Interference and McCusker's fully abstract relational model as a convenient starting point and derive a synchronous game model first by refining the relational semantics into a trace semantics, then applying a round abstraction to it. We show that the resulting model is sound but not fully abstract. This work is practically motivated by applications to hardware synthesis via game semantics. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Ghica, D. R., & Menaa, M. N. (2011). Synchronous game semantics via round abstraction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6604 LNCS, pp. 350–364). https://doi.org/10.1007/978-3-642-19805-2_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free