Sciweavers

328 search results - page 61 / 66
» Proving Termination of Communicating Programs
Sort
View
ESTIMEDIA
2009
Springer
15 years 11 months ago
The wizard of OS: a heartbeat for Legacy multimedia applications
—Multimedia applications are often characterised by implicit temporal constraints but, in many cases, they are not programmed using any specialised real-time API. These “Legacy...
Tommaso Cucinotta, Luca Abeni, Luigi Palopoli, Fab...
IFIP
2005
Springer
15 years 10 months ago
Probable Innocence Revisited
In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze crit...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
129
Voted
IFIP
2005
Springer
15 years 10 months ago
A Logic for Analysing Subterfuge in Delegation Chains
Abstract. Trust Management is an approach to construct and interpret the trust relationships among public-keys that are used to mediate security-critical actions. Cryptographic cre...
Hongbin Zhou, Simon N. Foley
IFIP
2004
Springer
15 years 10 months ago
Truthful Mechanisms for Generalized Utilitarian Problems
In this paper we investigate extensions of the well-known Vickrey-Clarke-Groves (VCG) mechanisms to problems whose objective function is not utilitarian and whose agents’ utiliti...
Giovanna Melideo, Paolo Penna, Guido Proietti, Rog...
IFIP
2004
Springer
15 years 10 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack