91 search results - page 8 / 19 » Formalizing Construction Knowledge for Concurrent Performanc... |
PKC
2009
Springer
14 years 5 days ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
SBMF
2010
Springer
13 years 2 months ago
2010
Springer
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
IFL
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Sac (Single Assignment C) is a strict, purely functional programming language primarily designed with numerical applications in mind. Particular emphasis is on efficient ...
FM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract: There is growing need to develop formal verification tools for Message Passing Interface (MPI) programs, to eliminate bugs such as deadlocks and local assertion violatio...