Automated Verification of Concurrent Search Structures (Synthesis Lectures on Computer Science) (Paperback)

Before placing an order, please note:

  • You'll receive a confirmation email once your order is complete and ready for pickup. 
  • If you have a membership, please make a note of this in the order comments and we'll apply your discount.
  • If you place a pre-order in the same order as currently available titles, an additional shipping fee will be added to your order. 
  • Women & Children First is not responsible for lost or stolen packages.
Automated Verification of Concurrent Search Structures (Synthesis Lectures on Computer Science) By Siddharth Krishna, Nisarg Patel, Dennis Shasha Cover Image


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.
Product Details
ISBN: 9781636391281
ISBN-10: 1636391281
Publisher: Morgan & Claypool
Publication Date: June 1st, 2021
Pages: 188
Language: English
Series: Synthesis Lectures on Computer Science