Peterson’s algorithm Total correctness proof in IPCL

• Veröffentlicht in: PROBLEMS IN PROGRAMMING
• Datum: 2018
• Heft: 2-3
• Сторінки: 113-118
• ISSN: 1727-4907
• Автори та афіліації: A.A. Zhygallo — Kiev Taras Shevchkenko National University
• 1. Verfasser: Zhygallo, A.A.
• Format: Artikel
• Sprache: Englisch
• Veröffentlicht: PROBLEMS IN PROGRAMMING 2018
• Schlagworte: Peterson’s algorithm; mutual exclusion; software total correctness; formal verification; liveness property; concurrent program; interleaving; IPCL; composition-nominative languages; UDC 004.415.52
• Online Zugang: https://pp.isofts.kiev.ua/index.php/ojs1/article/view/186
• Назва журналу: Problems in programming

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...