13383 search results - page 405 / 2677 » Abstractions from proofs |
170
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
188
click to vote
FM
2003
Springer
16 years 3 days ago
2003
Springer
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
184
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
192
Voted
CCS
2008
ACM
15 years 9 months ago
2008
ACM
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
168
click to vote
FSE
2008
Springer
15 years 8 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...