[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[PVS] SSS 2011 - Call for Participation



Apologies if you receive multiple copies of this announcement.

******************************************************************************
                                - SSS 2011 -

                        * CALL FOR PARTICIPATION *

                       13th International Symposium on
         Stabilization, Safety, and Security of Distributed Systems

                           October 10-12, 2011
                            Grenoble, France
                (Previously in Shinagawa (Tokyo), Japan)

                      http://www.jaist.ac.jp/sss2011/
******************************************************************************

The Symposium is a prestigious international forum for researchers and
practitioners in the design and development of fault-tolerant distributed
systems with self-* properties, such as self-stabilizing, self-configuring,
self-organizing, self-managing, self-repairing, self-healing, self-optimizing,
self-adaptive, and self-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 wireless sensor networks,
mobile ad hoc networks, robotic networks, etc. Moreover, new applications such
as grid and web services, banking and e-commerce, e-health and robotics,
aerospace and avionics, automotive, industrial process control, etc. have
joined the traditional applications of distributed systems.

The conference provides a wide spectrum of topics, covered in the following
tracks:
* Ad-Hoc, Sensor, and Dynamic Networks
* Fault-Tolerance and Dependable Systems
* Overlay and Peer-to-Peer Networks
* Safety and Verification
* Security
* Self-Organizing and Autonomic Networks
* Self-Stabilization

Registration information is available at http://www.jaist.ac.jp/sss2011/

-=-=-=-=-=-=-=-=-
TENTATIVE PROGRAM
-=-=-=-=-=-=-=-=-

-----------------------
Sunday, October 9, 2011
-----------------------

17:30 - 20:00 Welcome, pre-registration at Aconit
(http://www.aconit.org/index_en.php)

------------------------
Monday, October 10, 2011
------------------------

 8:00 -  8:45 Registration

 8:45 -  9:00 Opening

 9:00 - 10:00 Invited Speaker

 Toshimitsu Masuzawa
 Silence is Golden: Self-stabilizing Protocols Communication-efficient
after Convergence

10:00 - 10:30 Pause

10:30 - 12:00 Session 1: Self-Stabilization #1

 Noga Alon, Shlomi Dolev, Swan Dubois, Hagit Attiya, Maria Gradinariu
Potop-Butucaru, and Sebastien Tixeuil
 Pragmatic Self-Stabilization of Atomic Memory in Message-Passing Systems

 Borzoo Bonakdarpour and Sandeep Kulkarni
 Active Stabilization

 Stephane Devismes, Ajoy K. Datta, Lawrence Larmore, and Yvan Rivierre
 Self-Stabilizing Labeling and Ranking in Ordered Trees

12:00 - 14:00 Lunch

14:00 - 15:30 Session 2: Fault-Tolerance and Dependable Systems #1

 Marc Shapiro, Nuno Preguiça, Carlos Baquero, and Marek Zawirski
 Conflict-free Replicated Data Types

 Roberto Baldoni, Silvia Bonomi, and Amir Soltani Nezhad
 An Algorithm for implementing BFT Registers in Distributed Systems
with Bounded Churn

 H B Acharya, Taehwan Choi, Rida Bazzi, and Mohamed Gouda
 The K-Observer Problem in Computer Networks

15:30 - 16:00 Pause

16:00 - 17:00 Session 3: Self-Organizing and Autonomic Networks

 M. C. Dourado, L.D. Penso, D. Rautenbach, and J.L. Szwarcfiter
 The South Zone: Distributed Algorithms for Alliances

 Jun Kiniwa and Kensaku Kikuta
 Price Stabilization in Networks - What Is an Appropriate Model?

17:00 - 17:10 Break

17:10 - 18:00 Brief Announcements #1: Autonomic and Peer-to-peer Networks

 Richard Anthony, Mariusz Pelc, and Haffiz Shuaib
 Towards Interoperability Standards and Services for Autonomic Systems

 Roberto Beraldi, Adriano Cerocchi, Fabio Papale, and Leonardo Querzoni
 Distributed Self-Organizing Event Space Partitioning for
Content-Based Publish/Subscribe Systems

 H B Acharya, Anil Kumar Katti, and Mohamed Gouda
 A Conjecture on Traceability, and a New Class of Traceable Networks

 Jacek Cichon, Rafal Kapelko, and Karol Marchwicki
 A Note On Replication of Documents

 Ajoy K. Datta, Anne-Marie Kermarrec, Lawrence L. Larmore, and Erwan Le Merrer
 A Stable and Robust Membership Protocol

18:00 - 18:30 Business Meeting


-------------------------
Tuesday, October 11, 2011
-------------------------

 8:00 -  8:30 Registration

 8:30 -  9:30 Invited Speaker

 Nicola Santoro
 Computing in Time-Varying Networks

 9:30 - 10:00 Pause

10:00 - 12:30 Session 4: Ad-Hoc, Sensor, and Dynamic Networks #1

 Ingy Ramzy and Anish Arora
 Using Zero Knowledge to Share a Little Knowledge: Bootstrapping Trust
in Device Networks

 Tatsuro Iida, Atsuko Miyaji, and Kazumasa Omote
 POLISH: Proactive co-Operative LInk Self-Healing for Wireless Sensor Networks

 Neeraj Singh and Dominique Mery
 Analysis of DSR protocol in Event-B

 Andreas Klappenecker, Hyunyoung Lee, and Jennifer Welch
 Dynamic Regular Registers in Systems with Churn

12:30 - 14:00 Lunch

14:00 - 15:30 Session 5: Security, Safety and Verification

 Christian Gorecki, Felix Freiling, Marc Kuehrer, and Thorsten Holz
 TRUMANBOX: Improving Dynamic Malware Analysis by Emulating the Internet

 Ofer Hermoni, Niv Gilboa, Eyal Felstaine, Yuval Elovici, and Shlomi Dolev
 Rendezvous Tunnel for Anonymous Publishing: Clean Slate and Tor Based Designs

 Bernadette Charron-Bost, Henri Debrat, and Stephan Merz
 Formal Verification of Consensus Algorithms Tolerating Malicious Faults

15:30 - 16:00 Pause

16:00 - 17:00 Session 6: Self-Stabilization #2

 Sven Köhler and Volker Turau
 Space-Efficient Fault-Containment in Dynamic Networks

 William Leal, Micah Mccreery, and Daniel Codo De Faria
 The OCRC Fuel Cell Lab Safety System: A Self-Stabilizing Safety-Critical System

17:00 - 17:10 Break

17:10 - 18:00 Brief Announcements #2: Self-Stabilization,
Fault-tolerance, and Dynamic Networks

 Fawaz Al-Azemi and Mehmet Karaata
 A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs

 Stephane Devismes, Ajoy K. Datta, and Lawrence Larmore
 Sorting on Skip Chains

 Yonghwan Kim, Tadashi Araragi, Junya Nakamura, and Toshimitsu Masuzawa
 A Concurrent Partial Snapshot Algorithm for Large-scale, and Dynamic
Distributed Systems

 Bjorn Saballus, Stephan-Alexander Posselt, and Thomas Fuhrmann
 Fault-Tolerant Object Location in Large Compute Clusters

 Shailesh Vaya
 Faster Gossiping in Bidirectional Radio Networks with Large Labels

19:00 - Banquet

---------------------------
Wednesday, October 12, 2011
---------------------------

 8:30 - 10:00 Session 7: Best Papers

 - Best Paper
 Andrew Berns, Sukumar Ghosh, and Sriram Pemmaraju
 Building Self-Stabilizing Overlay Networks with the Transitive
Closure Framework

 - Best Student Paper (ex aequo)
 Damien Imbs and Michel Raynal
 The Weakest Failure Detector to Implement a Register in Asynchronous
Systems with Hybrid Communication

 - Best Student Paper (ex aequo)
 Rizal Nor, Mikhail Nesterenko, and Christian Scheideler
 Corona: A Stabilizing Deterministic Message-Passing Skip List

10:00 - 10:30 Pause

10:30 - 11:30 Session 8: Overlay and Peer-to-Peer Networks

 Davide Frey, Arnaud Jegou, and Anne-Marie Kermarrec
 Social Market: Combining Explicit and Implicit Social Networks

 Phillip Stevens, Andrea Richa, and Christian Scheideler
 Self-Stabilizing De Bruijn Networks

11:30 - 12:30 Session 9: Fault-Tolerance and Dependable Systems #2

 Danny Dolev, Matthias Fuegger, Christoph Lenzen, and Ulrich Schmid
 Fault-tolerant Algorithms for Tick-Generation in Asynchronous Logic:
Robust Pulse Generation

 Armando Castaneda and Hagit Attiya
 A Non-topological Impossibility Proof of k-set Agreement

12:30 - 14:00 Lunch

14:00 - 15:00 Session 10: Fault-Tolerance and Dependable Systems #3

 Achour Mostefaoui, Michel Raynal, and Julien Stainer
 Relations Linking Failure Detectors Associated with k-set Agreement
in Message-Passing Systems

 Mohamed Ibrahim and Binoy Ravindran
 Snake: Control Flow Distributed Software Transactional Memory

15:00 - 15:30 Pause

15:30 - 17:00 Session 11: Ad-Hoc, Sensor, and Dynamic Networks #2

 Zohir Bouzid and Anissa Lamani
 Robot Networks with Homonyms: The Case of Patterns Formation

 Joffroy Beauquier, Peva Blanchard, Janna Burman, and Sylvie Delaet
 Computing Time Complexity of Population Protocols with Cover Times -
The ZebraNet Example

 Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, and Paul Spirakis
 The Computational Power of Simple Protocols for Self-Awareness on Graphs

17:00 - Closing