Parallel program design: a foundation
Parallel program design: a foundation
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Theoretical Computer Science
Distributed Algorithms
Comparison of Maude and SAL by Conducting Case Studies Model Checking a Distributed Algorithm
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An Algebraic Framework for Modeling of Mobile Systems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Toolkit for Generating and Displaying Proof Scores in the OTS/CafeOBJ Method
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Symbolic Computation
Verifying security protocols for sensor networks using algebraic specification techniques
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Induction-guided falsification
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
| Hi-index | 0.00 |
Since parallel and distributed algorithms are subject to subtle errors that are unlikely to be detected in usual operation, only testing is not enough to reduce errors. Thus, it is necessary to formally analyze such algorithms in order to confirm that they have desirable properties. This paper describes the case study that Suzuki&Kasami distributed mutual exclusion algorithm is formally analyzed. In the case study, the algorithm has been modeled using UNITY-like models called observational transition systems (OTS'S), the model has been described in CafeOBJ, and it has been verified that the algorithm is mutually exclusive and lockout free with the help of CafeOBJ system. In the verification that the algorithm is lockout free, we have found a hidden assumption necessary for the verification, which is not explicitly mentioned in the original paper written by Suzuki and Kasami.