Prasad Jayanti "Technique for Machine-Verified Proofs of Linearizability" Part 1
Автор: SPTDC
Загружено: 2024-01-23
Просмотров: 188
Описание:
I will present a simple, universal, sound, and complete proof of methods for producing machine-verifiable proofs of linearizability and strong linearizability. Universality means that our method works for any object type, soundness means that an algorithm can be proved correct by our method only if it is linearizable, and completeness means that any linearizable implementation can be proved using our method. We will demonstrate the simplicity and power of our method by producing proofs of linearizability for the Herlihy-Wing queue and Jayanti's single-scanner snapshot, as well as a proof of strong linearizability of the Jayanti-Tarjan union-find object. All three of these proofs are machine-verified by TLAPS (the Temporal Logic of Actions Proof System).
Part 2 – • Prasad Jayanti "Technique for Machine-Veri...
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
