Peterson’s algorithm Total correctness proof in IPCL

The total correctness of the Peterson’s Algorithm has been proved. States and transitions were fixed by the program. Runtime environment considered is interleaving concurrency with shared memory. Invariant of the program was constructed. All reasoning provided in terms of Method for software propert...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Datum:2018
1. Verfasser: Zhygallo, A.A.
Format: Artikel
Sprache:English
Veröffentlicht: Інститут програмних систем НАН України 2018
Schlagworte:
Online Zugang:https://pp.isofts.kiev.ua/index.php/ojs1/article/view/186
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Problems in programming

Institution

Problems in programming