Bøker av Thomas Wies

This book constitutes the refereed proceedings of the 11th International Conference on Networked Systems, NETYS 2023, held in Benguerir, Morocco, during May 22¿24, 2023.The 9 full papers and 3 short papers presented were carefully reviewed and selected from 31 submissions. The scope of the conference covers all aspects related to the design and the development of these systems, including, e.g., cloud systems, formal verification, concurrent and distributed algorithms, data management, data science, parallel/concurrent/distributed programming, machine learning, multi-core architectures, networks, and security.

This open access book constitutes the proceedings of the 32nd European Symposium on Programming, ESOP 2023, which was held during April 22-27, 2023, in Paris, France, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023.The 20 regular papers presented in this volume were carefully reviewed and selected from 55 submissions. They deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems.

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.