Sciweavers

154 search results - page 8 / 31
» Computing universal models under guarded TGDs
Sort
View
POPL
2009
ACM
14 years 4 months ago
Speculative N-Way barriers
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
Lukasz Ziarek, Suresh Jagannathan, Matthew Fluet, ...
CRYPTO
2012
Springer
247views Cryptology» more  CRYPTO 2012»
12 years 7 days ago
Black-Box Constructions of Composable Protocols without Set-Up
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
Huijia Lin, Rafael Pass
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 10 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
IPPS
2009
IEEE
14 years 4 months ago
Robust sequential resource allocation in heterogeneous distributed systems with random compute node failures
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...
Vladimir Shestak, Edwin K. P. Chong, Anthony A. Ma...
ATVA
2008
Springer
99views Hardware» more  ATVA 2008»
13 years 11 months ago
Model Checking Recursive Programs with Exact Predicate Abstraction
e Abstraction Arie Gurfinkel1 , Ou Wei2 , and Marsha Chechik2 1 Software Engineering Institute, Carnegie Mellon University 2 Department of Computer Science, University of Toronto A...
Arie Gurfinkel, Ou Wei, Marsha Chechik