001451096 000__ 06323cam\a2200685\i\4500
001451096 001__ 1451096
001451096 003__ OCoLC
001451096 005__ 20230310004642.0
001451096 006__ m\\\\\o\\d\\\\\\\\
001451096 007__ cr\cn\nnnunnun
001451096 008__ 221111s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001451096 019__ $$a1350686287
001451096 020__ $$a9783031210174$$q(electronic bk.)
001451096 020__ $$a3031210174$$q(electronic bk.)
001451096 020__ $$z9783031210167
001451096 020__ $$z3031210166
001451096 0247_ $$a10.1007/978-3-031-21017-4$$2doi
001451096 035__ $$aSP(OCoLC)1350616554
001451096 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP$$dOCLCF$$dOCLCQ
001451096 049__ $$aISEA
001451096 050_4 $$aQA76.9.S54
001451096 08204 $$a005.1/4$$223/eng/20221116
001451096 1112_ $$aSSS (Symposium)$$n(24th :$$d2022 :$$cClermont-Ferrand, France)
001451096 24510 $$aStabilization, safety, and security of distributed systems :$$b24th International Symposium, SSS 2022, Clermond Ferrand, France, November 15-17, 2022, proceedings /$$cStéphane Devismes, Franck Petit, Karine Altisen, Giuseppe Antonio Di Luna, Antonio Fernandez Anta (eds.).
001451096 264_1 $$aCham :$$bSpringer,$$c[2022]
001451096 264_4 $$c©2022
001451096 300__ $$a1 online resource (x, 372 pages) :$$billustrations (some color).
001451096 336__ $$atext$$btxt$$2rdacontent
001451096 337__ $$acomputer$$bc$$2rdamedia
001451096 338__ $$aonline resource$$bcr$$2rdacarrier
001451096 4901_ $$aLecture notes in computer science ;$$v13751
001451096 500__ $$aConference proceedings.
001451096 500__ $$aIncludes author index.
001451096 5050_ $$aIntro -- Preface -- Organization -- Contents -- Invited Papers -- Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs -- 1 Introduction -- 2 Temporal Graphs -- 2.1 Strictness/Properness/Simpleness -- 2.2 Does It Really Matter? (Example of Spanners) -- 2.3 Happy Temporal Graphs -- 3 Expressivity in Terms of Reachability -- 3.1 Separations -- 3.2 Transformations -- 3.3 Summary and Discussions -- 4 More Facts About Happy Temporal Graphs -- 5 Concluding Remarks and Open Questions -- References
001451096 5058_ $$aInvited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles -- 1 Introduction -- 2 Preliminaries -- 2.1 Cactus Graph -- 2.2 Mobile Agent and Graph Exploration -- 3 Snap-Stabilizing Perpetual Exploration -- 3.1 Port Traversal Graph -- 3.2 Algorithm for a Single Agent with One-Bit Agent Memory -- 4 Exploration by an Oblivious Agent -- References -- Invited Paper: Towards Practical Atomic Distributed Shared Memory: An Experimental Evaluation -- 1 Introduction -- 2 Algorithms Overview -- 2.1 ARES -- 2.2 Cassandra -- 2.3 Redis
001451096 5058_ $$a3 Experimental Evaluation -- 3.1 Experimentation Setup -- 3.2 Scenarios -- 3.3 Experimental Results -- 4 Conclusions -- References -- Invited Paper: Cross-Chain State Machine Replication -- 1 Introduction -- 2 Model of Computation -- 3 State Machines -- 3.1 Example: Simple Swap -- 3.2 Example: Decentralized Autonomous Organization (DAO) -- 4 State Machine Replication Protocol -- 4.1 Path Signatures -- 4.2 Reliable Delivery -- 4.3 Initialization, Moves, and Settlement -- 4.4 Dynamic Funding -- 5 Remarks -- 6 Related Work -- References -- Regular Papers
001451096 5058_ $$aPlateau: A Secure and Scalable Overlay Network for Large Distributed Trust Applications -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Works -- 2 Model and Preliminaries -- 3 The Plateau Network Design and Statement of Results -- 4 Concluding Remarks and Future Work -- References -- The Limits of Helping in Non-volatile Memory Data Structures -- 1 Introduction -- 1.1 Contributions -- 1.2 Related Work -- 2 Characterization of the Crash-Recovery Model -- 3 Process Helping -- 4 Strict-Linearizability vs. Linearization-Helping -- 4.1 Sticky-Bit Object
001451096 5058_ $$a4.2 An Equivalence Between Linearizability and Strict-Linearizability -- 5 Strict-Linearizability vs. Universal-Helping -- 5.1 Equivalence Between Strict-Linearizability and Universal-Help Freedom -- References -- Treasure Hunt in Graph Using Pebbles -- 1 Introduction -- 1.1 Background and Motivation -- 1.2 Model and Problem Definition -- 1.3 Contribution -- 1.4 Related Work -- 2 Treasure Hunt Algorithm When k<D -- 2.1 D2k < D -- 2.2 k<D2 -- 3 Treasure Hunt Algorithm When kD -- 3.1 Idea of Treasure Hunt in Tree for k=cD Pebbles -- 3.2 Extending the Idea for General Graphs -- 4 Lower Bound
001451096 506__ $$aAccess limited to authorized users.
001451096 520__ $$aThis book constitutes the proceedings of 24th International Symposium, SSS 2022, which took place in Clermont-Ferrand, France, in November 2022. The 17 regular papers together with 4 invited papers and 7 brief announcements, included in this volume were carefully reviewed and selected from 58 submissions. The SSS 2022 focus on systems built such that they are able to provide on their own guarantees on their structure, performance, and/or security in the face of an adverse environment. The Symposium presents three tracks reflecting major trends related to the conference: (i) Self-stabilizing Systems: Theory and Practice, (ii) Concurrent and Distributed Computing: Foundations, Faulttolerance, and Security, and (iii) Dynamic, Mobile, and Nature-Inspired Computing.
001451096 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed November 16, 2022).
001451096 650_0 $$aSelf-stabilization (Computer science)$$vCongresses.
001451096 650_0 $$aElectronic data processing$$xDistributed processing$$xSecurity measures$$vCongresses.
001451096 650_0 $$aComputer security$$vCongresses.
001451096 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001451096 655_7 $$aConference papers and proceedings.$$2lcgft
001451096 655_0 $$aElectronic books.
001451096 7001_ $$aDevismes, Stéphane,$$eeditor.
001451096 7001_ $$aPetit, Franck,$$eeditor.
001451096 7001_ $$aAltisen, Karine,$$eeditor.
001451096 7001_ $$aDi Luna, Giuseppe Antonio,$$eeditor.
001451096 7001_ $$aAnta, Antonio Fernández,$$eeditor.$$1https://isni.org/isni/0000000361744874
001451096 77608 $$iPrint version: $$z3031210166$$z9783031210167$$w(OCoLC)1347224820
001451096 830_0 $$aLecture notes in computer science ;$$v13751.
001451096 852__ $$bebk
001451096 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-21017-4$$zOnline Access$$91397441.1
001451096 909CO $$ooai:library.usi.edu:1451096$$pGLOBAL_SET
001451096 980__ $$aBIB
001451096 980__ $$aEBOOK
001451096 982__ $$aEbook
001451096 983__ $$aOnline
001451096 994__ $$a92$$bISE