%0 Conference Paper
%A Tran, Dinh Duong
%A Ogata, Kazuhiro
%B International Conference on Software Engineering and Knowledge Engineering
%C Wyndham Pittsburgh University Center, Pittsburgh, USA
%D 2020
%F SisLab:4037
%T Formal verification of an abstract version of Anderson protocol with CafeOBJ, CiMPA and CiMPG
%U https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4037/
%X Anderson protocol is a mutual exclusion protocol. It uses a finite Boolean array shared by all processes and the modulo (or remainder) operation of natural numbers. This is why it is challenging to formally verify that the protocol enjoys the mutual exclusion property in a sense of theorem proving. Then, we make an abstract version of the protocol called A-Anderson protocol that uses an infinite Boolean array instead. We describe how to formally specify A-Anderson protocol in CafeOBJ, an algebraic specification language and how to formally verify that the protocol enjoys the mutual exclusion property in three ways: (1) by writing proof scores in CafeOBJ, (2) with a proof assistant CiMPA for CafeOBJ and (3) with a proof generator CiMPG for CafeOBJ. We mention how to formally verify that Anderson protocol enjoys the property by showing that A-Anderson protocol simulates Anderson protocol.