1716 search results - page 261 / 344 » Proving Conditional Termination |
135
click to vote
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Regret based algorithms have been proposed to control a wide variety of multi-agent systems. The appeal of regretbased algorithms is that (1) these algorithms are easily implement...
105
click to vote
CCS
2007
ACM
15 years 9 months ago
2007
ACM
er presents a novel approach for concisely abstracting authentication s and for subsequently analyzing those abstractions in a sound manner, i.e., deriving authentication guarante...
129
click to vote
CSCLP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
139
click to vote
EUROCRYPT
2007
Springer
15 years 9 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
133
click to vote
LOPSTR
2007
Springer
15 years 9 months ago
2007
Springer
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...