Stabilization, Safety, and Security of Distributed Systems

1. Front Matter

   PDF

2. Invited Talks Abstracts

   1. Arcane Information, Solving Relations, and Church Censorship

      • Leonid A. Levin

      Pages 1-1

   2. Computation of Equilibria and Stable Solutions

      • Mihalis Yannakakis

      Pages 2-2

   3. A Geometry of Networks

      • Yechiam Yemini

      Pages 3-3

3. Contributed Papers

   1. Systematic Correct Construction of Self-stabilizing Systems: A Case Study

      • Ananda Basu, Borzoo Bonakdarpour, Marius Bozga, Joseph Sifakis

      Pages 4-18

   2. A Fault-Resistant Asynchronous Clock Function

      • Ezra N. Hoch, Michael Ben-Or, Danny Dolev

      Pages 19-34

   3. Self-stabilizing Leader Election in Dynamic Networks

      • Ajoy K. Datta, Lawrence L. Larmore, Hema Piniganti

      Pages 35-49

   4. Loop-Free Super-Stabilizing Spanning Tree Construction

      • Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil

      Pages 50-64

   5. A New Technique for Proving Self-stabilizing under the Distributed Scheduler

      • Sven Köhler, Volker Turau

      Pages 65-79

   6. A Tranformational Approach for Designing Scheduler-Oblivious Self-stabilizing Algorithms

      • Abhishek Dhama, Oliver Theel

      Pages 80-95

   7. On Byzantine Containment Properties of the min + 1 Protocol

      • Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil

      Pages 96-110

   8. Efficient Self-stabilizing Graph Searching in Tree Networks

      • Jean Blair, Fredrik Manne, Rodica Mihai

      Pages 111-125

   9. Adaptive Containment of Time-Bounded Byzantine Faults

      • Yukiko Yamauchi, Toshimitsu Masuzawa, Doina Bein

      Pages 126-140

   10. Brief Announcement: Fast Convergence in Route-Preservation

       • Jorge A. Cobb

       Pages 141-143

   11. Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure

       • S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich

       Pages 144-158

   12. On Applicability of Random Graphs for Modeling Random Key Predistribution for Wireless Sensor Networks

       • Tuan Manh Vu, Reihaneh Safavi-Naini, Carey Williamson

       Pages 159-175

   13. “Slow Is Fast” for Wireless Sensor Networks in the Presence of Message Losses

       • Mahesh Arumugam, Murat Demirbas, Sandeep S. Kulkarni

       Pages 176-190

   14. Modeling and Analyzing Periodic Distributed Computations

       • Anurag Agarwal, Vijay K. Garg, Vinit Ogale

       Pages 191-205

   15. Complexity Issues in Automated Model Revision without Explicit Legitimate State

       • Fuad Abujarad, Sandeep S. Kulkarni

       Pages 206-220

   16. Algorithmic Verification of Population Protocols

       • Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis

       Pages 221-235

The papers in this volume were presented at the 12th International Sym- sium on Stabilization, Safety, and Security of Distributed Systems (SSS), held September 20–22, 2010 at Columbia University, NYC, USA. The SSS symposium is an international forum for researchersand practiti- ers in the design and development of distributed systems with self-* properties: (theclassical)self-stabilizing,self-con?guring,self-organizing,self-managing,se- repairing,self-healing,self-optimizing,self-adaptive,andself-protecting. Research in distributed systems is now at a crucial point in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wi- lesssensornetworks,mobileadhocnetworks,cloudcomputing,roboticnetworks, etc. Moreover, new applications such as grid and web services, banking and- commerce, e-health and robotics, aerospaceand avionics, automotive, industrial process control, etc. , have joined the traditional applications of distributed s- tems. SSS started as the Workshop on Self-Stabilizing Systems (WSS), the ?rst two of which were held in Austin in 1989 and in Las Vegas in 1995. Starting in 1995, the workshop began to be held biennially; it was held in Santa Barbara (1997), Austin (1999), and Lisbon (2001). As interest grew and the community expanded, the title of the forum was changed in 2003 to the Symposium on Self- Stabilizing Systems (SSS). SSS was organized in San Francisco in 2003 and in Barcelona in 2005. As SSS broadened its scope and attracted researchers from other communities, a couple of changes were made in 2006. It became an - nual event, and the name of the conference was changed to the International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS).

• Peer
• adaptive systems
• anonymous networks
• asynchronous systems
• broadcasting
• cloud computing security
• component-based modeling
• distributed algorithms
• distributed systems
• dynamic networks
• network security
• self-stabilization
• transactional scheduling
• vulnerability detection
• algorithm analysis and problem complexity

• Department of Computer Science, Ben-Gurion University of the Negev,Beer-Sheva, Israel

  Shlomi Dolev

• Department of Computer Science, The University of Texas at Dallas, Richardson, USA

  Jorge Cobb

• Department of Computer Science, Yale University, New Haven, USA

  Michael Fischer

• Department of Computer Science, Columbia University, New York, NY, USA

  Moti Yung

Policies and ethics