Concurrent Algorithms in SPIN Model Checker

Analysis and finding errors in concurrent software/system particularly when it is used in safety or industrial critical systems is gaining more and more attention. Software testing is an important technique for finding errors, however for concurrent algorithms, testing often does not ensure correctn...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2016 International Conference on Frontiers of Information Technology (FIT) s. 193 - 198
Hlavní autoři: Nawaz, M. Saqib, Ali, Hussam, Lali, M. Ikram Ullah
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2016
Témata:
Algorithm design and analysis
Automata
Bakery algorithm
Computational modeling
Dekker algorithm
Liveness
LTL
Mathematical model
Model checking
PROMELA
Safety
Software algorithms
SPIN
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Analysis and finding errors in concurrent software/system particularly when it is used in safety or industrial critical systems is gaining more and more attention. Software testing is an important technique for finding errors, however for concurrent algorithms, testing often does not ensure correctness or absence of errors. The model checker SPIN is widely and successfully used to formally verify the correctness requirements for systems of concurrently executing processes. Software/system model is first developed in PROMELA modeling language and SPIN model checker accepts correctness claims that are declared as linear temporal logic (LTL) formulas. In this article, two famous concurrent algorithms for mutual exclusion problem (Bakery algorithm and Dekker algorithm) are analyzed and formally verified in SPIN. Mutual exclusion for both algorithms is verified with in-line assertion and as correctness claims with the help of LTL formulas. Furthermore, safety and liveness properties of both algorithms are verified with LTL formulas.
DOI:10.1109/FIT.2016.043