Sciweavers

3713 search results - page 246 / 743
» Constructing a Calculus of Programs
Sort
View
CSFW
2000
IEEE
15 years 8 months ago
Secure Composition of Untrusted Code: Wrappers and Causality Types
We consider the problem of assembling concurrent software systems from untrusted or partially trusted o -the-shelf components, using wrapper programs to encapsulate components and...
Peter Sewell, Jan Vitek
CCS
1998
ACM
15 years 8 months ago
A Probabilistic Poly-Time Framework for Protocol Analysis
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
Patrick Lincoln, John C. Mitchell, Mark Mitchell, ...
IANDC
2008
95views more  IANDC 2008»
15 years 4 months ago
Comparing communication primitives via their relative expressive power
In this paper, we study sixteen communication primitives, arising from the combination of four useful programming features: synchronism (synchronous vs asynchronous primitives), a...
Daniele Gorla
ENTCS
2006
127views more  ENTCS 2006»
15 years 4 months ago
Capability-Passing Processes
Capability passing processes model global applications in a way that decouples the global agreement aspects of protocols from the details of how the communications are actually ma...
Tom Chothia, Dominic Duggan
KI
2008
Springer
15 years 3 months ago
Repairing Decision-Theoretic Policies Using Goal-Oriented Planning
In this paper we address the problem of how decision-theoretic policies can be repaired. This work is motivated by observations made in robotic soccer where decisiontheoretic polic...
Christoph Mies, Alexander Ferrein, Gerhard Lakemey...