798 search results - page 121 / 160 » Proving More Properties with Bounded Model Checking |
INDOCRYPT
2003
Springer
14 years 24 days ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
IPL
2008
13 years 7 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
EMSOFT
2001
Springer
14 years 3 days ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
CAV
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...