EUVIMEDObjevte EUVIMED
Crossref

Peterson’s algorithm Total correctness proof in IPCL

A.A. Zhygallo

PROBLEMS IN PROGRAMMING · 2016

DOI: 10.15407/pp2016.02-03.113 ↗

At a glance

Journal article in PROBLEMS IN PROGRAMMING, 2016. Written by A.A. Zhygallo. 12 references.

AbstraktBibliografické údajeCiteRelated studies

Abstract (original language)

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 properties proof in Interleaving Parallel Compositional Languages (IPCL). Conclusions about adequacy of the Method usage for such a kind of tasks (thanks to flexibility of composition-nominative platform) and its practicality as well as ease of use for real-world systems have been made based on this and other author’s works.

Cite

APA

Zhygallo, A. (2016). Peterson’s algorithm Total correctness proof in IPCL. PROBLEMS IN PROGRAMMING. https://doi.org/10.15407/pp2016.02-03.113

Vancouver

Zhygallo A. Peterson’s algorithm Total correctness proof in IPCL. PROBLEMS IN PROGRAMMING. 2016. doi:10.15407/pp2016.02-03.113

BibTeX
@article{Zhygallo2016,
  author = {Zhygallo, A.A.},
  title = {Peterson’s algorithm Total correctness proof in IPCL},
  journal = {PROBLEMS IN PROGRAMMING},
  year = {2016},
  doi = {10.15407/pp2016.02-03.113}
}
Start for free →