Sciweavers

ASIAN
2003
Springer
126views Algorithms» more  ASIAN 2003»
13 years 8 months ago
Information Flow Security for XML Transformations
Abstract. We provide a formal definition of information flows in XML transformations and, more generally, in the presence of type driven computations and describe a sound technique...
Véronique Benzaken, Marwan Burelle, Giusepp...
ASIAN
2003
Springer
111views Algorithms» more  ASIAN 2003»
13 years 10 months ago
Unreliable Failure Detectors via Operational Semantics
Abstract. The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony i...
Uwe Nestmann, Rachele Fuzzati
ASIAN
2003
Springer
121views Algorithms» more  ASIAN 2003»
13 years 10 months ago
Paradigm Regained: Abstraction Mechanisms for Access Control
Mark S. Miller, Jonathan S. Shapiro
ASIAN
2003
Springer
102views Algorithms» more  ASIAN 2003»
13 years 10 months ago
Generating Optimal Linear Temporal Logic Monitors by Coinduction
Abstract. A coinduction-based technique to generate an optimal monitor from a Linear Temporal Logic (LTL) formula is presented in this paper. Such a monitor receives a sequence of ...
Koushik Sen, Grigore Rosu, Gul Agha
ASIAN
2003
Springer
113views Algorithms» more  ASIAN 2003»
13 years 10 months ago
Global Predicate Detection under Fine-Grained Modalities
Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global pred...
Punit Chandra, Ajay D. Kshemkalyani
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
13 years 10 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker
ASIAN
2003
Springer
109views Algorithms» more  ASIAN 2003»
13 years 10 months ago
Deaccumulation - Improving Provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating ar...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
ASIAN
2003
Springer
127views Algorithms» more  ASIAN 2003»
13 years 10 months ago
A Calculus of Bounded Capacities
Abstract. Resource control has attracted increasing interest in foundational research on distributed systems. This paper focuses on space control and develops an analysis of space ...
Franco Barbanera, Michele Bugliesi, Mariangiola De...
ASIAN
2003
Springer
115views Algorithms» more  ASIAN 2003»
13 years 10 months ago
Bankable Postage for Network Services
We describe a new network service, the “ticket server”. This service provides “tickets” that a client can attach to a request for a network service (such as sending email o...
Martín Abadi, Andrew Birrell, Michael Burro...