Progress of Concurrent Objects (Paperback)

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.

General

Imprint:	Now Publishers Inc
Country of origin:	United States
Series:	Foundations and Trends (R) in Programming Languages
Release date:	May 2020
First published:	2020
Authors:	Hongjin Liang • Xinyu Feng
Dimensions:	234 x 156mm (L x W)
Format:	Paperback
Pages:	146
ISBN-13:	978-1-68083-672-1
Categories:	Books > Computing & IT > Computer programming > Programming languages > General
LSN:	1-68083-672-2
Barcode:	9781680836721

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!