Automated Verification of Concurrent Search Structures
- ISBN-10
- 3031018060
- ISBN-13
- 9783031018060
- Category
- Mathematics
- Pages
- 182
- Language
- English
- Published
- 2022-05-31
- Publisher
- Springer Nature
- Authors
- Shasha Dennis, Krishna Siddharth, Patel Nisarg
Description
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.
Get the book
Other editions
-
- 2021-06-01
- 188 pages
- Ebook
- Morgan & Claypool Publishers
Similar books
-
Integral Geometry and Tomography: Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, Held June 24-30, 1989, with Support from the...
By Eric Grinberg, Eric Todd QuintoIn Section 2 we will deal with the “discrete” case. Let S be a locally finite tree T endowed with the natural integer-valued distance function: the ...
-
Ordinary Differential Equations and Linear Algebra: A Systems Approach
By Todd Kapitula... for in this case [yp](s)=s[yp](s), [yp](s)=s2[yp](s). As we will see in the examples, this assumption also makes it possible to deal with the initial ...
-
Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis
By Iris van Rooij, Mark Blokpoel, Johan Kwisthoutx,y∈S δ(x,y) is maximum. u(x) + ADDITIVE SUBSET CHOICE Input: A set X = {x1 ,x2 ... F Tractability cycle Test 8.2 How (Not) to Deal with Intractability 173.
-
Mymathlab -- Standalone Access Card
By Pearson Education, David P Pearson Education, Hall H Pearson EducationSeveral versions of Pearson's MyLab & Mastering products exist for each title, including customized versions for individual schools, and registrations are not transferable.
-
Mymathlab Student Acc Kit + Intro Alg Wrkshts
By Inc. Pearson EducationMymathlab Student Acc Kit + Intro Alg Wrkshts
-
Pearson Mathematics 7: H.P
By Pearson Education Australia StaffPearson Mathematics homework program for Year 7 provides tear-out sheets which correspond with student book sections, providing systematic and cumulative skills revision of basic skills and current class topics in the form of take-home ...
-
Worksheets for Classroom Or Lab Practice for Intermediate Algebra: Graphs & Models
By Addison-WesleyWorksheets for Classroom Or Lab Practice for Intermediate Algebra: Graphs & Models
-
Pearson Mathematics New South Wales 8 Student Book: Australian Curriculum
By Pearson Education Australia Staff, Gael McLeod, David CoffeyThe Student Book provides an easy-to-use 'nuts and bolts' book at each year level.
-
Matrix Iterative Analysis
By Richard S. Varga... partial differential equations have received a great deal of attention. For excellent bibliographical coverage, see Todd (1956), Richtmyer (1957), ...
-
Mathematical Modelling: Education, Engineering and Economics - ICTMA 12
By C Haines, P Galbraith, W BlumTodd, P. A., McKeen, .l. ... ANALYTICAL SUPPORT PROBLEM SOLVING Cognitive Perspectives on Modelling HOW DO STUDENTS AND TEACHERS DEAL Sodhi and Son 219 NOTE ...