2005
DOI: 10.1016/j.entcs.2004.10.006
|View full text |Cite
|
Sign up to set email alerts
|

A Coordination-based Methodology for Security Protocol Verification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2005
2005
2010
2010

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 32 publications
0
6
0
Order By: Relevance
“…An original aspect of PL is that it can quantify over principal instances. Formulas of PL are checked against the (symbolic) semantics of cIP by a tool called A SPASyA (Automatic Security Protocol Analysis via a SYmbolic model checking Approach) [4].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…An original aspect of PL is that it can quantify over principal instances. Formulas of PL are checked against the (symbolic) semantics of cIP by a tool called A SPASyA (Automatic Security Protocol Analysis via a SYmbolic model checking Approach) [4].…”
Section: Discussionmentioning
confidence: 99%
“…Note that all the conditions of the definition of H t are mutually exclusive 4. For page limits we do not prove it formally, but it can easily be checked by the informal description of join transitions given in this section.…”
mentioning
confidence: 99%
“…Firstly, to improve the modeling through reduction rules of modeling tool or using Lazy Intruder [ 1] method and Run-Bounds [12] method to restrict the actions of intruder and bound model running. The main advantage of the method is simple.…”
Section: General Reduction Methodsmentioning
confidence: 99%
“…Hence, model checking security properties for nominal calculi can only deal with protocol sessions where a finite number of participants run in parallel and all the participants are non-recursive processes. Recently, symbolic ad-hoc model checkers have been proposed to overcome these issues e.g., [5,82,9,2]. Despite the technical differences, all these approaches check a given property by generating a "symbolic" state space, where states collect constraints over the names involved in the execution.…”
Section: Model Checkingmentioning
confidence: 99%
“…At the generic (i + 1)-th iteration, the image through T of the i-th iteration is composed with K as prescribed in (2). The algorithm stops when the fixpointH of (2) is reached.…”
Section: Definition 3 a Hd-automaton Over L Is A Coalgebra For The Fmentioning
confidence: 99%