899 search results - page 37 / 180 » Cost Analysis of Games, Using Program Logic |
211
click to vote
POPL
2009
ACM
16 years 13 days ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
104
click to vote
CONPAR
1992
15 years 3 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
111
click to vote
CSFW
2004
IEEE
15 years 3 months ago
2004
IEEE
We analyze the multi-party contract-signing protocols of Garay and MacKenzie (GM) and of Baum and Waidner (BW). We use a finite-state tool, MOCHA, which allows specification of pr...
CADE
2009
Springer
16 years 12 days ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
AMAST
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...