Automated Verification of Concurrent Search Structures (Record no. 85456)

000 -LEADER
fixed length control field 03679nam a22005295i 4500
001 - CONTROL NUMBER
control field 978-3-031-01806-0
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730164226.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2021 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031018060
-- 978-3-031-01806-0
082 04 - CLASSIFICATION NUMBER
Call Number 510
100 1# - AUTHOR NAME
Author Krishna, Siddharth.
245 10 - TITLE STATEMENT
Title Automated Verification of Concurrent Search Structures
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2021.
300 ## - PHYSICAL DESCRIPTION
Number of Pages X, 182 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Acknowledgments -- 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 ## - SUMMARY, ETC.
Summary, etc Search 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.
700 1# - AUTHOR 2
Author 2 Patel, Nisarg.
700 1# - AUTHOR 2
Author 2 Shasha, Dennis.
700 1# - AUTHOR 2
Author 2 Wies, Thomas.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-01806-0
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2021.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematics.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematics.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Science.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 1932-1686
912 ## -
-- ZDB-2-SXSC

No items available.