592 search results - page 19 / 119 » Can Component Service-Based Systems Be Proved Correct |
155
click to vote
AFRICACRYPT
2009
Springer
15 years 10 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...
125
click to vote
SCS
2003
15 years 4 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...
128
click to vote
CSFW
1999
IEEE
15 years 7 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...
154
Voted
JACM
2011
14 years 6 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...
124
Voted
EMSOFT
2006
Springer
15 years 7 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...