| 000 | 03679nam a22005295i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-01806-0 | ||
| 003 | DE-He213 | ||
| 005 | 20240730164226.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 220601s2021 sz | s |||| 0|eng d | ||
| 020 |
_a9783031018060 _9978-3-031-01806-0 |
||
| 024 | 7 |
_a10.1007/978-3-031-01806-0 _2doi |
|
| 050 | 4 | _aQA1-939 | |
| 072 | 7 |
_aPB _2bicssc |
|
| 072 | 7 |
_aMAT000000 _2bisacsh |
|
| 072 | 7 |
_aPB _2thema |
|
| 082 | 0 | 4 |
_a510 _223 |
| 100 | 1 |
_aKrishna, Siddharth. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _983121 |
|
| 245 | 1 | 0 |
_aAutomated Verification of Concurrent Search Structures _h[electronic resource] / _cby Siddharth Krishna, Nisarg Patel, Dennis Shasha, Thomas Wies. |
| 250 | _a1st ed. 2021. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2021. |
|
| 300 |
_aX, 182 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_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. | ||
| 650 | 0 |
_aMathematics. _911584 |
|
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 1 | 4 |
_aMathematics. _911584 |
| 650 | 2 | 4 |
_aComputer Science. _99832 |
| 700 | 1 |
_aPatel, Nisarg. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _983122 |
|
| 700 | 1 |
_aShasha, Dennis. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _983123 |
|
| 700 | 1 |
_aWies, Thomas. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _983124 |
|
| 710 | 2 |
_aSpringerLink (Online service) _983127 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031000744 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031006784 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031029349 |
| 830 | 0 |
_aSynthesis Lectures on Computer Science, _x1932-1686 _983128 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-01806-0 |
| 912 | _aZDB-2-SXSC | ||
| 942 | _cEBK | ||
| 999 |
_c85456 _d85456 |
||