VNU-UET Repository

ON LOCALLY MINIMUM AND STRONGEST ASSUMPTION GENERATION METHOD FOR COMPONENT-BASED SOFTWARE VERIFICATION

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)

WarningThere is a more recent version of this item available.
Full text not available from this repository.

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.

Item Type: Article
Subjects: Information Technology (IT)
Divisions: Faculty of Information Technology (FIT)
Depositing User: Phạm Ng�c Hùng
Date Deposited: 20 Jun 2019 22:34
Last Modified: 20 Jun 2019 22:34
URI: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/3501

Available Versions of this Item

Actions (login required)

View Item View Item