2025-02-22T12:39:01-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22pp_isofts_kiev_ua-article-186%22&qt=morelikethis&rows=5
2025-02-22T12:39:01-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22pp_isofts_kiev_ua-article-186%22&qt=morelikethis&rows=5
2025-02-22T12:39:01-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T12:39:01-05:00 DEBUG: Deserialized SOLR response
Peterson’s algorithm Total correctness proof in IPCL

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

Full description

Saved in:
Bibliographic Details
Main Author: Zhygallo, A.A.
Format: Article
Language:English
Published: Інститут програмних систем НАН України 2018
Subjects:
Peterson’s algorithm
mutual exclusion
software total correctness
formal verification
liveness property
concurrent program
interleaving
IPCL
composition-nominative languages
UDC 004.415.52
Online Access:https://pp.isofts.kiev.ua/index.php/ojs1/article/view/186
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first

Similar Items