My Account Log in

1 option

Automated Verification of Concurrent Search Structures / by Siddharth Krishna, Nisarg Patel, Dennis Shasha, Thomas Wies.

Springer Nature Synthesis Collection of Technology Collection 10 Available online

View online
Format:
Book
Author/Creator:
Siddharth, Krishna, author.
Series:
Synthesis Lectures on Computer Science, 1932-1686
Language:
English
Subjects (All):
Mathematics.
Computer science.
Computer Science.
Local Subjects:
Mathematics.
Computer Science.
Physical Description:
1 online resource (180 pages)
Edition:
1st ed. 2021.
Place of Publication:
Cham : Springer Nature Switzerland : Imprint: Springer, 2021.
Summary:
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.
Contents:
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.
ISBN:
9783031018060
3031018060

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account