ABSTRACT
We have analyzed two flawed versions of Qlock, a mutual exclusion (mutex) protocol with Maude and SMGA. Maud is a rewriting logic-based computer language equipped with model checking facilities and SMGA is a state machine graphical animation tool. We demonstrate that SMGA could make it better to comprehend counterexamples generated by Maude. Two properties called the mutex property and the lockout freedom property are taken into account for the two flawed versions of Qlock.
- M. Clavel, F. Dur´an, S. Eker, P. Lincoln, N. Mart´ı-Oliet, J. Meseguer, and C. Talcott. All About Maude. LNCS 4350. Springer, 2007.Google Scholar
- T. T. T. Nguyen and K. Ogata. Graphical animations of state machines. In DASC 2017. IEEE, 2017 (to appear).Google ScholarCross Ref
- T. T. Nguyen and K. Ogata. A way to comprehend counterexamples generated by the Maude LTL model checker. In SATE 2017. IEEE, 2017 (to appear).Google ScholarCross Ref
- S. Santiago, C. L. Talcott, S. Escobar, C. A. Meadows, and J. Meseguer. A graphical user interface for Maude-NPA. Electr. Notes Theor. Comput. Sci., 258(1):3--20, 2009. Google ScholarDigital Library
- M. Li and S. Liu. Integrating animation-based inspection into formal design specification construction for reliable software systems. IEEE Trans. Reliability, 65(1):88--106, 2016.Google ScholarCross Ref
- H. Liang, J. S. Dong, J. Sun, and W. E. Wong. Software monitoring through formal specification animation. Innov. Syst. Softw. Eng., 5(4):231--241, 2016.Google ScholarCross Ref
- S. Hallerstede, M. Leuschel, and D. Plagge. Validation of formal models by refinement animation. Sci. Comput. Program., 78(3):272--292, 2013. Google ScholarDigital Library
- D. Jackson. Software Abstraction (Revised edition). The MIT Press, 2012.Google Scholar
- I. Suzuki and T. Kasami. A distributed mutual exclusion algorithm. ACM TOCS, 3(4): 344-349, 1985. Google ScholarDigital Library
- K. Ogata and K. Futatsugi. Formal analysis of Suzuki&Kasami distributed mutual exclusion algorithm. In 5th FMOODS, pages 181--195. Kluwer, 2002. Google ScholarDigital Library
- K. Ogata and K. Futatsugi. Comparison of Maude and SAL by conducting case studies model checking a distributed algorithm. IEICE Trans. Fundamentals, E90-A(8):1690--1703, 2007. Google ScholarDigital Library
Index Terms
Analysis of Two Flawed Versions of A Mutual Exclusion Protocol with Maude and SMGA
Recommendations
Guessing Properties of the Qlock Mutual Exclusion Protocol based on its Graphical Animations and confirming the Properties by Model Checking
ICSCA '18: Proceedings of the 2018 7th International Conference on Software and Computer ApplicationsThe paper reports on a case study in which we have guessed properties of Qlock, a mutual exclusion (mutex) protocol, based on its graphical animations and confirmed them by model checking. Such properties guessed graphically and confirmed by model ...
MEA: A Framework for Model Checking of Mutual Exclusion Algorithms Focusing on Atomicity
Parallel and Distributed Computing, Applications and TechnologiesAbstractThe mutual exclusion problem is a classic and essential problem in computer science. Since its inception, many related algorithms and variants have been proposed. However, finding the atomicity requirement of mutual exclusion algorithms remains ...
Fair group mutual exclusion
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computingIn the group mutual exclusion problem [6], which generalizes mutual exclusion [2], a process chooses a session when it requests entry to the Critical Section. A group mutual exclusion algorithm must ensure that the mutual exclusion property holds: If ...
Comments