Cantitate/Preț
Produs

Progress of Concurrent Objects

Autor Hongjin Liang, Xinyu Feng
en Limba Engleză Paperback – 18 mai 2020
Implementations of concurrent objects in programming languages should guarantee linearizability and a progress property. These progress properties describe conditions under which a method call is guaranteed to complete. However, they fail to describe how clients are affected, making it difficult to utilize them in layered and modular program verification. Even worse, none of the existing results applies to concurrent objects with partial methods. Progress of Concurrent Objects examines the progress properties of concurrent objects. It formulates each progress property in terms of contextual refinement so that, when verifying clients of the objects, concrete object implementations can be replaced with their abstractions with certainty, achieving modular verification. For concurrent objects with partial methods, two new progress properties, partial starvation-freedom (PSF) and partial deadlock-freedom (PDF) are described. Finally, a rely-guarantee style program logic LiLi for verifying linearizability and progress together for concurrent objects is introduced. This tutorial is intended for use by researchers and students. It surveys the current state of the topic and introduces the reader to recent advances in a tutorial style that makes the topic accessible to newcomers to the field.
Citește tot Restrânge

Preț: 48354 lei

Preț vechi: 60442 lei
-20% Nou

Puncte Express: 725

Preț estimativ în valută:
9257 9622$ 7675£

Carte tipărită la comandă

Livrare economică 06-20 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781680836721
ISBN-10: 1680836722
Pagini: 148
Dimensiuni: 156 x 234 x 8 mm
Greutate: 0.24 kg
Editura: Now Publishers Inc

Descriere

Examines the progress properties of concurrent objects. The book formulates each progress property in terms of contextual refinement so that, when verifying clients of the objects, concrete object implementations can be replaced with their abstractions with certainty, achieving modular verification.