Sciweavers

72 search results - page 2 / 15
» Hierarchical Correctness Proofs for Distributed Algorithms
Sort
View
TASE
2009
IEEE
14 years 3 months ago
Verifying Self-stabilizing Population Protocols with Coq
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
Yuxin Deng, Jean-François Monin
ISCC
2000
IEEE
128views Communications» more  ISCC 2000»
14 years 25 days ago
A Fully Distributed Location Management Scheme for Large PCS
Abstract— In [1], [2], we presented the design, specification and proof of correctness of a fully distributed location management scheme for PCS networks and argued that fully r...
Karunaharan Ratnam, Ibrahim Matta, Sampath Rangara...
CSFW
1999
IEEE
14 years 22 days ago
I/O Automaton Models and Proofs for Shared-Key Communication Systems
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
Nancy A. Lynch
ACTA
2011
13 years 3 months ago
Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
Alex A. Aravind, Wim H. Hesselink
JAR
1998
134views more  JAR 1998»
13 years 8 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge