412 search results - page 53 / 83 » A New Proof of the F5 Algorithm |
136
click to vote
FM
2008
Springer
15 years 5 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
103
click to vote
DAM
2006
15 years 4 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
133
click to vote
ACTA
2005
15 years 4 months ago
2005
We propose a new type system for information flow analysis for the -calculus. As demonstrated by recent studies, information about whether each communication succeeds is important ...
133
click to vote
DAM
2002
15 years 4 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
148
click to vote
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
We describe a new algorithm for analysing security protocols that use XOR, such as key-management APIs. As a case study, we consider the IBM 4758 CCA API, which is widely used in t...