Sciweavers

Share
ENTCS
2006
129views more  ENTCS 2006»
9 years 9 months ago
The Algebra of Multi-Agent Dynamic Belief Revision
We refine our algebraic axiomatization in [8,9] of epistemic actions and epistemic update (notions defined in [5,6] using Kripke-style semantics), to incorporate a mechanism for d...
Alexandru Baltag, Mehrnoosh Sadrzadeh
ENTCS
2006
141views more  ENTCS 2006»
9 years 9 months ago
A Concurrent Model for Linear Logic
We build a realizability model for linear logic using a name-passing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and...
Emmanuel Beffara
ENTCS
2006
93views more  ENTCS 2006»
9 years 9 months ago
A Rule-based System for Web site Verification
In this paper, we describe a system, written in Haskell, for the automated verification of Web sites which can be used to specify (partial) correctness and completeness properties...
Demis Ballis, Javier García-Vivó
ENTCS
2006
136views more  ENTCS 2006»
9 years 9 months ago
Automated Game Analysis via Probabilistic Model Checking: a case study
It has been recognised for some time that there are close links between the various logics developed for the analysis of multi-agent systems and the many game-theoretic models dev...
Paolo Ballarini, Michael Fisher, Michael Wooldridg...
ENTCS
2006
109views more  ENTCS 2006»
9 years 9 months ago
Roles as a Coordination Construct: Introducing powerJava
In this paper we apply the role metaphor to coordination. Roles are used in sociology as a way to structure organizations and to coordinate their behavior. In our model, the featu...
Matteo Baldoni, Guido Boella, Leendert W. N. van d...
ENTCS
2006
109views more  ENTCS 2006»
9 years 9 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
ENTCS
2006
110views more  ENTCS 2006»
9 years 9 months ago
First Steps in Synthetic Computability Theory
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
Andrej Bauer
ENTCS
2006
156views more  ENTCS 2006»
9 years 9 months ago
Computational Effects in Topological Domain Theory
This paper contributes towards establishing the category QCB, of topological quotients of countably based spaces, and its subcategory TP, of topological predomains, as a flexible ...
Ingo Battenfeld
ENTCS
2006
134views more  ENTCS 2006»
9 years 9 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
ENTCS
2006
108views more  ENTCS 2006»
9 years 9 months ago
Preventing Timing Leaks Through Transactional Branching Instructions
Gilles Barthe, Tamara Rezk, Martijn Warnier
books