eprintid: 3503 rev_number: 4 eprint_status: archive userid: 304 dir: disk0/00/00/35/03 datestamp: 2019-06-20 22:34:01 lastmod: 2019-06-20 22:34:01 status_changed: 2019-06-20 22:34:01 type: article succeeds: 3501 metadata_visibility: show creators_name: Tran, Hoang Viet creators_name: Pham, Ngoc Hung creators_name: Nguyen, Viet Ha creators_id: vietth2004@gmail.com creators_id: hungpn@vnu.edu.vn creators_id: hanv@vnu.edu.vn title: ON LOCALLY MINIMUM AND STRONGEST ASSUMPTION GENERATION METHOD FOR COMPONENT-BASED SOFTWARE VERIFICATION ispublished: inpress subjects: IT subjects: isi divisions: fac_fit abstract: Since software becomes more complex during its life cycle, the verification cost becomes higher, especially for such methods which are using model checking in general and assume-guarantee reasoning in specific. To address the problem of reducing the assume-guarantee verification cost, this paper presents a method to generate locally minimum and strongest assumptions for verification of component-based software. For this purpose, we integrate a variant of membership queries answering technique to an algorithm which considers candidate assumptions that are smaller and stronger first, larger and weaker later. Because the algorithm stops as soon as it reaches a conclusive result, the generated assumptions are the locally minimum and strongest ones. The correctness proof of the proposed algorithm is also included in the paper. An implemented tool, test data, and experimental results are presented and discussed. date: 2019 publisher: IEICE full_text_status: none publication: IEICE Transactions on Information and Systems refereed: FALSE issn: 0916-8532 citation: Tran, Hoang Viet and Pham, Ngoc Hung and Nguyen, Viet Ha (2019) ON LOCALLY MINIMUM AND STRONGEST ASSUMPTION GENERATION METHOD FOR COMPONENT-BASED SOFTWARE VERIFICATION. IEICE Transactions on Information and Systems . ISSN 0916-8532 (In Press)