VNU-UET Repository

Formal verification of an abstract version of Anderson protocol with CafeOBJ, CiMPA and CiMPG

Tran, Dinh Duong and Ogata, Kazuhiro Formal verification of an abstract version of Anderson protocol with CafeOBJ, CiMPA and CiMPG. In: SEKE.

[img]
Preview
PDF - Published Version
Download (165kB) | Preview

Abstract

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.

Item Type: Conference or Workshop Item (Paper)
Subjects: Information Technology (IT)
Depositing User: Tran Dinh Duong
Date Deposited: 02 Aug 2020 06:23
Last Modified: 02 Aug 2020 06:23
URI: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/4037

Actions (login required)

View Item View Item