12052 search results - page 665 / 2411 » computing 2010 |
237
click to vote
JOC
2010
15 years 2 months ago
2010
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
209
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
170
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
We present an automatic verification procedure based on RGSep that is suitable for reasoning about fine-grained concurrent heapmanipulating programs. The procedure computes a set o...
284
click to vote
ASM
2010
ASM
16 years 4 months ago
2010
ASM
A natural encoding of synchronous message exchange with direct wait-control is proved to be equivalent in a distributed environment to a refinement which uses semaphores to implem...
186
click to vote
ASM
2010
ASM
16 years 4 months ago
2010
ASM
Abstract. The aim of this paper is to gradually introduce formalism in the requirement engineering phase in order to facilitate its validation. We analyze and elicit our requiremen...