1226 search results - page 205 / 246 » Proofs, Programs and Abstract Complexity |
150
click to vote
IFIP
2009
Springer
16 years 14 days ago
2009
Springer
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
180
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
137
click to vote
AISC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
170
click to vote
SAS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
175
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...