Algorithmic Game Semantics

Algorithmic Game Semantics (2001)

by Samson Abramsky

Venue:	In Schichtenberg and Steinbruggen [16
Citations:	44 - 3 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Algorithmic Game Semantics	user correction - Legacy Corrections
AUTHOR NAME	Samson Abramsky	SVM HeaderParse 0.1
AUTHOR AFFIL	Oxford University Computing Laboratory	SVM HeaderParse 0.2
ABSTRACT	Introduction SAMSON ABRAMSKY (samson@comlab.ox.ac.uk) Oxford University Computing Laboratory 1. Introduction Game Semantics has emerged as a powerful paradigm for giving semantics to a variety of programming languages and logical systems. It has been used to construct the first syntax-independent fully abstract models for a spectrum of programming languages ranging from purely functional languages to languages with non-functional features such as control operators and locally-scoped references [4, 21, 5, 19, 2, 22, 17, 11]. A substantial survey of the state of the art of Game Semantics circa 1997 was given in a previous Marktoberdorf volume [6]. Our aim in this tutorial presentation is to give a first indication of how Game Semantics can be developed in a new, algorithmic direction, with a view to applications in computer-assisted verification and program analysis. Some promising steps have already been taken in this	user correction - Legacy Corrections
YEAR	2001	INFERENCE
VENUE	In Schichtenberg and Steinbruggen [16	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	21--47	INFERENCE
CITATIONS	35 found	ParsCit 1.0