329 search results - page 11 / 66 » Complementing Computational Protocol Analysis with Formal Sp... |
GI
2001
Springer
13 years 11 months ago
2001
Springer
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Recently we had proposed two untraceability protocols for mobile agents and began investigating their quality. We believe that quality evaluation of security protocols should exte...
FUIN
2008
13 years 7 months ago
2008
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...