Sciweavers

310 search results - page 41 / 62
» Sound and complete models of contracts
Sort
View
AAAI
1994
13 years 10 months ago
An Algorithm for Probabilistic Least-Commitment Planning
We de ne the probabilistic planning problem in terms of a probability distribution over initial world states, a boolean combination of goal propositions, a probability threshold, ...
Nicholas Kushmerick, Steve Hanks, Daniel S. Weld
GG
2008
Springer
13 years 10 months ago
A Decentralized Implementation of Mobile Ambients
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...
Fabio Gadducci, Giacoma Valentina Monreale
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 9 months ago
Explicit Evidence Systems with Common Knowledge
Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms fo...
Samuel Bucheli, Roman Kuznets, Thomas Studer
ENTCS
2007
97views more  ENTCS 2007»
13 years 9 months ago
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel ...
Harald Fecher, Heiko Schmidt
ICDT
2009
ACM
121views Database» more  ICDT 2009»
13 years 6 months ago
Automatic verification of database-driven systems: a new frontier
We describe a novel approach to verification of software systems centered around an underlying database. Instead of applying general-purpose techniques with only partial guarantee...
Victor Vianu