Sciweavers

198 search results - page 15 / 40
» Modal Proofs as Distributed Programs (Extended Abstract)
Sort
View
DAGSTUHL
2003
13 years 10 months ago
Organising Computation through Dynamic Grouping
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...
Michael Fisher, Chiara Ghidini, Benjamin Hirsch
ECAI
2006
Springer
14 years 8 days ago
Logic Programs with Multiple Chances
Abstract. In human-like reasoning it often happens that different conditions, partially alternative and hierarchically structured, are mentally grouped in order to derive some conc...
Francesco Buccafurri, Gianluca Caminiti, Domenico ...
JAIR
2010
160views more  JAIR 2010»
13 years 7 months ago
Reasoning About the Transfer of Control
We present DCL-PC: a logic for reasoning about how the abilities of agents and coalitions of agents are altered by transferring control from one agent to another. The logical foun...
Wiebe van der Hoek, Dirk Walther, Michael Wooldrid...
CONCUR
2009
Springer
14 years 1 months ago
Concurrent Kleene Algebra
Abstract. A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange la...
C. A. R. Hoare, Bernhard Möller, Georg Struth...
ICFP
2005
ACM
14 years 8 months ago
Acute: high-level programming language design for distributed computation
Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of ma...
Peter Sewell, James J. Leifer, Keith Wansbrough, F...