Sciweavers

95 search results - page 11 / 19
» On Notions of Completeness Weaker than Kripke Completeness
Sort
View
PODC
2012
ACM
11 years 11 months ago
Asynchronous failure detectors
Failure detectors — oracles that provide information about process crashes — are an important ion for crash tolerance in distributed systems. Although current failure-detector...
Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry
BPM
2006
Springer
113views Business» more  BPM 2006»
14 years 16 days ago
Process Equivalence: Comparing Two Process Models Based on Observed Behavior
In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service match...
Wil M. P. van der Aalst, Ana Karla A. de Medeiros,...
ASIACRYPT
2009
Springer
14 years 3 months ago
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
Anja Lehmann, Stefano Tessaro
ESOP
1999
Springer
14 years 1 months ago
Types for Safe Locking
Abstract. A race condition is a situation where two threads manipulate a data structure simultaneously, without synchronization. Race conditions are common errors in multithreaded ...
Cormac Flanagan, Martín Abadi
ACS
2006
13 years 9 months ago
Universality of Coproducts in Categories of Lax Algebras
Abstract. Categories of lax (T, V )-algebras are shown to have pullbackstable coproducts if T preserves inverse images. The general result not only gives a common proof of this pro...
Mojgan Mahmoudi, Christoph Schubert, Walter Tholen