Executable Test Sequence for the Protocol Data Portion with Overlapping

• Main Authors: Cho Ching Lu, 呂卓青
• Other Authors: Wen-Huei Chen
• Format: Others
• Language: zh-TW
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/25541145684640843295

碩士 === 輔仁大學 === 電子工程學系 === 90 === Thesis paper improves an earlier executable test sequence generation method for testing the conformance of a protocol implementation to its specification modeled by an Extended Finite State Machine (EFSM), where a test sequence is executable if it has certain feasible parameter values which make the predicates of the EFSM true. The earlier method of W.H. Chen involves embedding feasible parameter values into a Flow Digraph of the EFSM for constructing a Behavior Machine Digraph where executable define-clear-use paths for tracing the variable and parameter values are obtained; and a Selecting Chinese Postman Algorithm to connect these define-clear-use paths into a short executable test sequence that satisfies the All-Use Criterion. The first improvement involves overlapping these define-clear-use paths into a shorter executable test sequence that satisfies the All-Use criterion based on a proposed Overlap Tree data structure. The second improvement involves an Integer Programming technique to overlap these define-clear-use paths. The first improvement obtains a shorter executable test sequence than the second one. However the first one involves a complex process for constructing the Behavior Machine and solve cases is generated.