An Approach To Test Concurrent Client/Server Database Applicaion

• Main Authors: Sheng-Jun Chang, 張勝仁
• Other Authors: Gwan-Hwan Hwang
• Format: Others
• Language: zh-TW
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/50418525924348916396

碩士 === 國立暨南國際大學 === 資訊管理學系 === 90 === An execution of a client-server application with database access exercises a sequence of database transaction events, calls a transaction sequence (or T-sequence). A client-server database application may have non-deterministic behavior, since its multiple executions with the same input may produce different T-sequences. In our research, we present a framework for testing all possible T-sequences of a client-server database application. Such testing is referred to as reachability testing. We define race conditions between transactions. For a collected T-sequence, we show how to change the outcomes of race conditions in order to derive race-variants, which are prefixes of other T-sequences. Then, we discuss how to perform prefix-based testing of a database application, according to a race-variant, in order to generate new T-sequences. We also present a new approach to analyze and derive race-variant for a T-sequence. The new approach is called “2|e|-1 combination”. The approach is changed the in-edge to out-edge from a node in race-graph. Compare to the approach “Race-variant Diagram”, it reduces the duplicated numbers of testing. And we offer experiment studies to compare non-deterministic testing and reachabiliy tesing. Keywords: client-server, client-server testing, non-deterministic behavior, SQL transaction, database