Results 1  10
of
58
Algorithmic Game Semantics
 In Schichtenberg and Steinbruggen [16
, 2001
"... 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 syntaxindependen ..."
Abstract

Cited by 70 (5 self)
 Add to MetaCart
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 syntaxindependent fully abstract models for a spectrum of programming languages ranging from purely functional languages to languages with nonfunctional features such as control operators and locallyscoped 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 computerassisted verification and program analysis. Some promising steps have already been taken in this
Glueing and Orthogonality for Models of Linear Logic
 Theoretical Computer Science
, 2003
"... We present the general theory of the method of glueing and associated technique of orthogonality for constructing categorical models of all the structure of linear logic: in particular we treat the exponentials in detail. We indicate simple applications of the methods and show that they cover famili ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
(Show Context)
We present the general theory of the method of glueing and associated technique of orthogonality for constructing categorical models of all the structure of linear logic: in particular we treat the exponentials in detail. We indicate simple applications of the methods and show that they cover familiar examples. 1
A manifesto for agent technology: Towards next generation computing
 Journal of Autonomous Agents and MultiAgent Systems
, 2004
"... Abstract. The European Commission’s eEurope initiative aims to bring every citizen, home, school, business and administration online to create a digitally literate Europe. The value lies not in the objective itself, but in its ability to facilitate the advance of Europe into new ways of living and w ..."
Abstract

Cited by 38 (7 self)
 Add to MetaCart
(Show Context)
Abstract. The European Commission’s eEurope initiative aims to bring every citizen, home, school, business and administration online to create a digitally literate Europe. The value lies not in the objective itself, but in its ability to facilitate the advance of Europe into new ways of living and working. Just as in the first literacy revolution, our lives will change in ways never imagined. The vision of eEurope is underpinned by a technological infrastructure that is now taken for granted. Yet it provides us with the ability to pioneer radical new ways of doing business, of undertaking science, and, of managing our everyday activities. Key to this step change is the development of appropriate mechanisms to automate and improve existing tasks, to anticipate desired actions on our behalf (as human users) and to undertake them, while at the same time enabling us to stay involved and retain as much control as required. For many, these mechanisms are now being realised by agent technologies, which are already providing dramatic and sustained benefits in several business and industry domains, including B2B exchanges, supply chain management, car manufacturing, and so on. While there are many real successes of agent technologies to report, there is still much to be done in research and development for the full benefits to be achieved. This is especially true in the context of environments of pervasive computing devices that are envisaged in coming years. This paper describes the current stateoftheart of agent technologies and
Significance of Models of Computation, from Turing Model to Natural Computation
"... The increased interactivity and connectivity of computational devices along with the spreading of computational tools and computational thinking across the fields, has changed our understanding of the nature of computing. In the course of this development computing models have been extended from th ..."
Abstract

Cited by 22 (11 self)
 Add to MetaCart
The increased interactivity and connectivity of computational devices along with the spreading of computational tools and computational thinking across the fields, has changed our understanding of the nature of computing. In the course of this development computing models have been extended from the initial abstract symbol manipulating mechanisms of standalone, discrete sequential machines, to the models of natural computing in the physical world, generally concurrent asynchronous processes capable of modelling living systems, their informational structures and dynamics on both symbolic and subsymbolic information processing levels. Present account of models of computation highlights several topics of importance for the development of new understanding of computing and its role: natural computation and the relationship between the model and physical implementation, interactivity as fundamental for computational modelling of concurrent information processing systems such as living organisms and their networks, and the new developments in logic needed to support this generalized framework. Computing understood as information processing is closely related to natural sciences; it helps us recognize connections between sciences, and provides a unified approach for modeling and simulating of both living and nonliving systems.
Generic Composition
, 2002
"... This paper presents a technique called generic composition to provide a uniform basis for modal operators, sequential composition, di#erent kinds of parallel compositions and various healthiness conditions appearing in a variety of semantic theories. The weak inverse of generic composition is define ..."
Abstract

Cited by 21 (13 self)
 Add to MetaCart
This paper presents a technique called generic composition to provide a uniform basis for modal operators, sequential composition, di#erent kinds of parallel compositions and various healthiness conditions appearing in a variety of semantic theories. The weak inverse of generic composition is defined. A completeness theorem shows that any predicate can be written in terms of generic composition and its weak inverse. A number of algebraic laws that support reasoning are derived.
Dialogue Games in MultiAgent Systems
 Informal Logic
, 2002
"... Formal dialogue games have been studied in philosophy since at least the time of Aristotle. Recently they have been applied in various contexts in computer science and arti cial intelligence, particularly as the basis for interaction between autonomous software agents. We review these applicati ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
(Show Context)
Formal dialogue games have been studied in philosophy since at least the time of Aristotle. Recently they have been applied in various contexts in computer science and arti cial intelligence, particularly as the basis for interaction between autonomous software agents. We review these applications and discuss the many open research questions and challenges at this exciting interface between philosophy and computer science.
Interface Synthesis and Protocol Conversion
 Formal Aspects of Computing
, 2008
"... Abstract. Given deterministic interfaces P and Q, we investigate the problem of synthesising an interface R such that P composed with R refines Q. We show that a solution exists iff P and Q ⊥ are compatible, and the most general solution is given by (P � Q ⊥ ) ⊥ , where P ⊥ is the interface P with ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Abstract. Given deterministic interfaces P and Q, we investigate the problem of synthesising an interface R such that P composed with R refines Q. We show that a solution exists iff P and Q ⊥ are compatible, and the most general solution is given by (P � Q ⊥ ) ⊥ , where P ⊥ is the interface P with inputs and outputs interchanged. Remarkably, the result holds both for asynchronous and synchronous interfaces. We model interfaces using the interface automata formalism of de Alfaro and Henzinger. For the synchronous case, we give a new definition of synchronous interface automata based on Mealy machines and show that the result holds for a weak form of nondeterminism, called observable nondeterminism. We also characterise solutions to the synthesis problem in terms of winning input strategies in the automaton (P ⊗ Q ⊥ ) ⊥ , and the most general solution in terms of the most permissive winning strategy. We apply the solution to the synthesis of converters for mismatched protocols in both the asynchronous and synchronous domains. For the asynchronous case, this leads to automatic synthesis of converters for incompatible network protocols. In the synchronous case, we obtain automatic converters for mismatched intellectual property blocks in systemonchip designs. The work reported here is based on earlier work on interface synthesis in [Bha05] for the asynchronous case, and [BR06] for the synchronous one.
Category theory for linear logicians
 Linear Logic in Computer Science
, 2004
"... This paper presents an introduction to category theory with an emphasis on those aspects relevant to the analysis of the model theory of linear logic. With this in mind, we focus on the basic definitions of category theory and categorical logic. An analysis of cartesian and cartesian closed categori ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
(Show Context)
This paper presents an introduction to category theory with an emphasis on those aspects relevant to the analysis of the model theory of linear logic. With this in mind, we focus on the basic definitions of category theory and categorical logic. An analysis of cartesian and cartesian closed categories and their relation to intuitionistic logic is followed by a consideration of symmetric monoidal closed, linearly distributive and ∗autonomous categories and their relation to multiplicative linear logic. We examine nonsymmetric monoidal categories, and consider them as models of noncommutative linear logic. We introduce traced monoidal categories, and discuss their relation to the geometry of interaction. The necessary aspects of the theory of monads is introduced in order to describe the categorical modelling of the exponentials. We conclude by briefly describing the notion of full completeness, a strong form of categorical completeness, which originated in the categorical model theory of linear logic. No knowledge of category theory is assumed, but we do assume knowledge of linear logic sequent calculus and the standard models of linear logic, and modest familiarity with typed lambda calculus. 0
Evolving Games and Essential Nets for Affine Polymorphism
"... This paper presents a game model of Secondorder Intuitionistic Multiplicative Affine Logic (IMAL2). We extend Lamarche's essential nets to the secondorder ane setting and use them to show that the model is fully and faithfully complete. ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
This paper presents a game model of Secondorder Intuitionistic Multiplicative Affine Logic (IMAL2). We extend Lamarche's essential nets to the secondorder ane setting and use them to show that the model is fully and faithfully complete.