eprintid: 4284
rev_number: 7
eprint_status: archive
userid: 414
dir: disk0/00/00/42/84
datestamp: 2020-12-17 08:27:11
lastmod: 2020-12-17 08:27:11
status_changed: 2020-12-17 08:27:11
type: conference_item
metadata_visibility: show
creators_name: Tran, Dinh Duong
creators_name: Ogata, Kazuhiro
creators_name: Bui, Duy Dang
creators_name: Gupta, Parth
creators_id: duongtd@vnu.edu.vn
creators_id: ogata@jaist.ac.jp
creators_id: bddang@jaist.ac.jp
creators_id: parthgupta.iitkgp@gmail.com
title: Lemma Weakening for State Machine Invariant Proofs
ispublished: pub
subjects: IT
divisions: fac_fit
abstract: Lemma conjecture is one of the most challenging tasks in theorem proving. The paper focuses on invariant properties (or invariants) of state machines. Thus, lemmas are also invariants. To prove that a state predicate p is an invariant of a state machine M, in general, we need to find an inductive invariant q of M such that q(s) implies p(s) for all states s of M. q is often in the form p∧p', and p' is often in the form q1 ∧...∧qn. q1, ..., qn are the lemmas of the proof that p is an invariant of M. The paper proposes a technique called Lemma Weakening (LW). LW replaces qi with qi' such that qi(s) implies qi'(s) for all states s of M, which can make the proof reasonably tractable that may become otherwise unreasonably hard. MCS mutual exclusion protocol is used as an example to demonstrate the power of LW.
date: 2020-12-04
full_text_status: public
pres_type: paper
event_title: THE 27TH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE
event_type: conference
refereed: FALSE
citation:   Tran, Dinh Duong and Ogata, Kazuhiro and Bui, Duy Dang and Gupta, Parth  (2020) Lemma Weakening for State Machine Invariant Proofs.  In: THE 27TH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE.     
document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4284/1/apsec_mcs_paper.pdf