VNU-UET Repository: No conditions. Results ordered -Date Deposited. 2024-10-08T09:20:54ZEPrintshttp://eprints.uet.vnu.edu.vn/images/sitelogo.pnghttps://eprints.uet.vnu.edu.vn/eprints/2020-12-17T08:27:11Z2020-12-17T08:27:11Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/4284This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/42842020-12-17T08:27:11ZLemma Weakening for State Machine Invariant ProofsLemma 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.Dinh Duong Tranduongtd@vnu.edu.vnKazuhiro Ogataogata@jaist.ac.jpDuy Dang Buibddang@jaist.ac.jpParth Guptaparthgupta.iitkgp@gmail.com2020-08-02T06:23:09Z2020-09-29T11:12:16Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/4037This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/40372020-08-02T06:23:09ZFormal verification of an abstract version of Anderson protocol with CafeOBJ, CiMPA and CiMPGAnderson 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.Dinh Duong Tranduongtd@vnu.edu.vnKazuhiro Ogataogata@jaist.ac.jp2018-12-11T16:23:07Z2018-12-21T01:15:29Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/3204This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/32042018-12-11T16:23:07ZA method of Automated User Interface Testing for Windows-based ApplicationsDinh Duong Tranduongtd@vnu.edu.vnManh Hung Nguyenhungnguyen@vnu.edu.vnNgoc Hung Phamhungpn@vnu.edu.vn2018-10-19T06:29:14Z2018-10-19T06:29:14Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/3124This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/31242018-10-19T06:29:14ZA Method for Automated User Interface Testing of Windows-based ApplicationsDinh Duong Tranduongtd@vnu.edu.vnNgoc Hung Phamhungpn@vnu.edu.vnDuy Tung Nguyentung.nguyenduy@toshiba-tsdv.com