Sciweavers

241 search results - page 39 / 49
» Design by Contract Using Meta-Assertions
Sort
View
PODC
2004
ACM
14 years 28 days ago
Group membership: a novel approach and the first single-round algorithm
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Roger I. Khazan
ATAL
2009
Springer
13 years 11 months ago
Effective bidding and deal identification for negotiations in highly nonlinear scenarios
Most real-world negotiation scenarios involve multiple, interdependent issues. These scenarios are specially challenging because the agents' utility functions are nonlinear, ...
Ivan Marsá-Maestre, Miguel A. López-...
ECOOP
2005
Springer
14 years 1 months ago
Open Modules: Modular Reasoning About Advice
Advice is a mechanism used by advanced object-oriented and aspect-oriented programming languages to augment the behavior of methods in a program. Advice can help to make programs m...
Jonathan Aldrich
PODC
2003
ACM
14 years 22 days ago
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allo...
Jung Min Park, Edwin K. P. Chong, Howard Jay Siege...
OSDI
1996
ACM
13 years 8 months ago
Safe Kernel Extensions Without Run-Time Checking
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
George C. Necula, Peter Lee