1 option
Stabilization, Safety, and Security of Distributed Systems : 14th International Symposium, SSS 2012, Toronto, Canada, October 1-4, 2012, Proceedings / edited by Andréa W. Richa, Christian Scheideler.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 7596.
- Theoretical Computer Science and General Issues ; 7596
- Language:
- English
- Subjects (All):
- Computer networks.
- Software engineering.
- Application software.
- Computer logic.
- Algorithms.
- Computer security.
- Computer Communication Networks.
- Software Engineering.
- Information Systems Applications (incl. Internet).
- Logics and Meanings of Programs.
- Algorithm Analysis and Problem Complexity.
- Systems and Data Security.
- Local Subjects:
- Computer Communication Networks.
- Software Engineering.
- Information Systems Applications (incl. Internet).
- Logics and Meanings of Programs.
- Algorithm Analysis and Problem Complexity.
- Systems and Data Security.
- Physical Description:
- 1 online resource (XIX, 330 pages) : 70 illustrations.
- Edition:
- First edition 2012.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2012, held in Toronto, Canada, in October 2012. The 21 full papers and 10 brief announcements presented in this volume were carefully reviewed and selected from 75 submissions. The conference provides a wide spectrum of topics, covered in the following tracks: self-stabilization, ad-hoc and sensor networks, fault-tolerance and dependable systems, safety and security, cloud computing, formal methods, social networks, peer-to-peer, self-organizing and autonomic systems.
- Contents:
- Communication-Efficient Self-stabilization in Wireless Networks
- Self-stabilizing Local k-Placement of Replicas with Minimal Variance
- Self-stabilizing Algorithm for Maximal Graph Partitioning into Triangles
- Brief Announcement: Self-stabilizing Synchronization of Arbitrary Digraphs in Presence of Faults
- Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network
- On the Self-stabilization of Mobile Oblivious Robots in Uniform Rings
- Optimal Grid Exploration by Asynchronous Oblivious Robots
- Terminating Population Protocols via Some Minimal Global Knowledge Assumptions
- Brief Announcement: The Degrading Effect of Forgetting on a Synchronizer
- Brief Announcement: Mobile Agent Rendezvous on Edge Evolving Rings
- High-Level Executable Specifications of Distributed Algorithms
- Formal Verification of Security Preservation for Migrating Virtual Machines in the Cloud
- Evaluating Practical Tolerance Properties of Stabilizing Programs through Simulation: The Case of Propagation of Information with Feedback
- Self-stabilizing End-to-End Communication in (Bounded Capacity, Omitting, Duplicating and non-FIFO) Dynamic Networks (Extended Abstract)
- Self-stabilizing Distributed Data Fusion
- From Self- to Self-stabilizing with Service Guarantee 1-hop Weight-Based Clustering
- Brief Announcement: Verification of Stabilizing Programs with SMT Solvers
- Brief Announcement: MP-State: State-Aware Software Model Checking of Message-Passing Systems
- Oblivious Assignment with m Slots
- BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom filters
- DQMP: A Decentralized Protocol to Enforce Global Quotas in Cloud Environments
- Brief Announcement: KARYON: Towards Safety Kernels for Cooperative Vehicular Systems
- Brief Announcement: Arbitrators in the Security Infrastructure
- Optimization in a Self-stabilizing Service Discovery Framework for Large Scale Systems
- Scalable Byzantine Agreement with a Random Beacon
- On Finding Better Friends in Social Networks
- Brief Announcement: Detecting Users' Connectivity on Online Social Networks
- Brief Announcement: Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols
- All-to-All Gradecast Using Coding with Byzantine Failures
- Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents
- A Theory of Fault Recovery for Component-Based Models.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-33536-5
- 9783642335365
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.