eprintid: 4037 rev_number: 18 eprint_status: archive userid: 414 dir: disk0/00/00/40/37 datestamp: 2020-08-02 06:23:09 lastmod: 2020-09-29 11:12:16 status_changed: 2020-09-29 11:12:16 type: conference_item metadata_visibility: show creators_name: Tran, Dinh Duong creators_name: Ogata, Kazuhiro creators_id: duongtd@vnu.edu.vn creators_id: ogata@jaist.ac.jp title: Formal verification of an abstract version of Anderson protocol with CafeOBJ, CiMPA and CiMPG ispublished: pub subjects: IT divisions: fac_fit 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. date: 2020 date_type: published full_text_status: public pres_type: paper event_title: International Conference on Software Engineering and Knowledge Engineering event_location: Wyndham Pittsburgh University Center, Pittsburgh, USA event_dates: July 9 to 19, 2020 event_type: conference refereed: FALSE citation: Tran, Dinh Duong and Ogata, Kazuhiro (2020) Formal verification of an abstract version of Anderson protocol with CafeOBJ, CiMPA and CiMPG. In: International Conference on Software Engineering and Knowledge Engineering, July 9 to 19, 2020, Wyndham Pittsburgh University Center, Pittsburgh, USA. document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4037/1/paper064.pdf