Sciweavers

4224 search results - page 334 / 845
» Reasoning about Choice
Sort
View
ESORICS
2005
Springer
16 years 1 months ago
Quantifying Probabilistic Information Flow in Computational Reactive Systems
Information flow and non-interference are well-established techniques for expressing both integrity and privacy properties. Because of the enormous potential to transmit informati...
Michael Backes
199
Voted
RTA
2005
Springer
16 years 1 months ago
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
Proof-carrying code provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set ...
Amy P. Felty
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
16 years 1 months ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
COORDINATION
2004
Springer
16 years 28 days ago
Optimistic Concurrency Semantics for Transactions in Coordination Languages
There has been significant recent interest in exploring the role of coordination languages as middleware for distributed systems. These languages provide operations that allow pro...
Suresh Jagannathan, Jan Vitek
KR
2004
Springer
16 years 27 days ago
Knowledge of Other Agents and Communicative Actions in the Fluent Calculus
The Fluent Calculus has largely been focused on building agents that work individually. However, agents often need to interact with each other to learn more about their environmen...
Yves Martin, Iman Narasamdya, Michael Thielscher