Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Algorithmic Game Semantics and Component-Based Verification
 

Summary: Algorithmic Game Semantics and
Component-Based Verification
Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
Oxford University Computing Laboratory
ABSTRACT
We present a research programme dedicated to the application of
Game Semantics to program analysis and verification. We high-
light several recent theoretical results and describe a prototypical
software modeling and verification tool. The distinctive novel fea-
tures of the tool are its ability to handle open programs and the
fact that the models it produces are observationally fully abstract.
These features are essential in the modeling and verification of soft-
ware components such as modules. Incidentally, these features also
lead to very compact models of programs.
1. INTRODUCTION AND BACKGROUND
Game Semantics has emerged as a powerful paradigm for giving
semantics to a variety of programming languages and logical sys-
tems. 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-

  

Source: Abramsky, Samson - Computing Laboratory, University of Oxford

 

Collections: Computer Technologies and Information Sciences