592 search results - page 19 / 119 » Can Component Service-Based Systems Be Proved Correct |
AFRICACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a simple zero-knowledge proof of knowledge protocol of which many protocols in the literature are instantiations. These include Schnorr’s protocol for provin...
SCS
2003
13 years 8 months ago
2003
The decomposition of complex systems into manageable parts is an essential principle when dealing with complex technical systems. However, many safety and reliability modelling te...
CSFW
1999
IEEE
13 years 11 months ago
1999
IEEE
Software systems are becoming heterogeneous: instead of a small number of large programs from well-established sources, a user's desktop may now consist of many smaller compo...
JACM
2011
12 years 10 months ago
2011
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
EMSOFT
2006
Springer
13 years 11 months ago
2006
Springer
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...