Test Case Generation Based on Constraint Logic Graph

• Main Authors: Chiao-Yi Huang, 黃喬苡
• Other Authors: Nai-Wei Lin
• Format: Others
• Language: zh-TW
• Published: 2015
• Online Access: http://ndltd.ncl.edu.tw/handle/03196099579427658817

碩士 === 國立中正大學 === 資訊工程研究所 === 103 === Constraint-based testing is one of the main approaches for test case generation. In constraint-based testing, the test case generation problem is formulated as a constraint satisfaction problem. In constraint-based testing, constraint logic expressions are involved in the specification of software behaviors, the partitioning of software behaviors into equivalent classes, the management of test coverage criteria, and the formulation of a representative software behavior in an equivalence class as a constraint satisfaction problem. In this thesis, constraint logic graphs are proposed as a succinct graphical representation of constraint logic expressions. This thesis describes the design and implementation of a black-box method-level test case generator based on constraint logic graph. A constraint logic graph can be viewed as a succinct graphical representation of constraint logic expressions in disjunctive normal form. Each complete path of the constraint logic graph corresponds to a conjunctive clause of the disjunctive normal form and thus a test case. Therefore, constraint logic graphs are suitable for performing partitioning of software behaviors into equivalent classes. Constraint logic graphs are also suitable for performing management of graph-based test coverage criteria. This test case generator is implemented as an Eclipse plugin. A preliminary performance evaluation is also given in the thesis.