Abstract
Game-theoretic ideas have been used to model a wide range of computational notions over the past few years. This has led to some striking results of a foundational character, relating in porticular to definability and full abstraction. The first applications of these ideas, to program analysis and verification, have also begun to appear. We shall give an overview of what has been achieved, and try to map out some objectives for future research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abramsky, S. (2000). Game Semantics: Achievements and Prospects. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_1
Download citation
DOI: https://doi.org/10.1007/3-540-45022-X_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67715-4
Online ISBN: 978-3-540-45022-1
eBook Packages: Springer Book Archive