000			03557nam a22004455i 4500
999			_c387861 _d387861
001			387861
003			ES-MaUEC
005			20230425112432.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			230425s2021 sz | s |||| 0|eng d
020			_a9783031018060
024	7		_a10.1007/978-3-031-01806-0 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9.D3 _b2021 EB
100	1		_aKrishna, Siddharth _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9688247
245	1	0	_aAutomated Verification of Concurrent Search Structures _cby Krishna Siddharth, Patel Nisarg, Shasha Dennis, Wies Thomas
250			_a1st edition 2021
264		1	_aCham _bSpringer International Publishing _c2021
300			_a1 recurso en línea (X, 182 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Computer Science _x1932-1686
505	0		_aAcknowledgments -- Introduction -- Preliminaries -- Separation Logic -- Ghost State -- The Keyset Resource Algebra -- The Edgeset Framework for Single-Copy Structures -- The Flow Framework -- Verifying Single-Copy Concurrent Search Structures -- Verifying Multicopy Structures -- The Edgeset Framework for Multicopy Structures -- Reasoning about Non-Static and Non-Local Linearization Points -- Verifying the LSM DAG Template -- Proof Mechanization and Automation -- Related Work, Future Work, and Conclusion -- Bibliography -- Authors' Biographies.
520			_aSearch structures support the fundamental data storage primitives on key-value pairs: insert a pair, delete by key, search by key, and update the value associated with a key. Concurrent search structures are parallel algorithms to speed access to search structures on multicore and distributed servers. These sophisticated algorithms perform fine-grained synchronization between threads, making them notoriously difficult to design correctly. Indeed, bugs have been found both in actual implementations and in the designs proposed by experts in peer-reviewed publications. The rapid development and deployment of these concurrent algorithms has resulted in a rift between the algorithms that can be verified by the state-of-the-art techniques and those being developed and used today. The goal of this book is to show how to bridge this gap in order to bring the certified safety of formal verification to high-performance concurrent search structures. Similar techniques and frameworks can be applied to concurrent graph and network algorithms beyond search structures.
988			_aSynthesis Collection of Technology_2021
650		7	_2embne _9151535 _aEstructuras de datos (Informática)
700	1		_aPatel, Nisarg _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9688248
700	1		_aShasha, Dennis Elliott _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686965
700	1		_aWies, Thomas _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9688249
776	0	8	_iPrinted edition: _z9783031000744
776	0	8	_iPrinted edition: _z9783031006784
776	0	8	_iPrinted edition: _z9783031029349
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-01806-0 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b04/2023 _dz _eIG _zSI