60 search results - page 12 / 12 » Compositional Proofs with Symbolic Execution |
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
ICTAC
2009
Springer
13 years 2 months ago
2009
Springer
Testing from first-order specifications has mainly been studied for flat specifications, that are specifications of a single software module. However, the specifications of large s...
POPL
2011
ACM
12 years 7 months ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
SIGCSE
2009
ACM
13 years 11 months ago
2009
ACM
Jeannette Wing’s call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic...
CSFW
1999
IEEE
13 years 9 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...