60 search results - page 2 / 12 » Constraint Solving for Contract-Signing Protocols |
168
click to vote
CSCLP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
241
click to vote
CADE
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
122
click to vote
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
142
Voted
ACSD
2010
IEEE
15 years 1 months ago
2010
IEEE
We extend the partial order reduction algorithm of Clarke et al. [CJM00] to handle branching security protocols, such as optimistic fair exchange protocols. Applications of the pro...
144
Voted
AAAI
2006
15 years 4 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...