Huaikou Miao

Testing a Web Application Involving Web Browser Interaction

Web applications become more and more complex. Thus, systematic approaches for web application testing are needed. Existing methods take into consideration only those actions provided by the application itself and do not involve actions provided by the browser, such as the usage of backward and forward buttons. Base on existing testing techniques, this paper addresses an approach to discovering possible inconsistencies caused by interactions with web browser buttons and the property of a Web page related to web browser buttons. A navigation tree considering the role of the browser buttons while navigating a web application is constructed. Three adequacy criteria based on user actions are presented for test case selection. For illustration, a simple inquiring balance system of a Web application is exemplified.

Manipulating Clocks in Timed Automata Using PVS

Clock is an important notion in TA (Timed automata). In order to manipulate clock easily and conveniently in TA, a mechanized system called FVofTA (Formal Verification of Timed Automata) for specifying and reasoning about real-time systems using TA theory in PVS (Prototype Verification System) is presented in this paper. This system includes two parts: one for modeling real-time system using TA template in PVS and the other for proof intending for formal verification of real-time system. As one of the important modular of FVofTA, clock manipulations are given in PVS specification and mainly include (1) clock interpretation and clock constraints, (2) clock region equivalence definition and its application, and (3) the clock zone and its DBM (Difference-Bound Matrices) representation. Finally, a case study is investigated with the aid of clock manipulation theories and the results are satisfied.

Formal verification of security protocols using Spin

Security protocols are the key to ensure network security. In the context of the state of the art, so many methods have been developed to analyze the security properties of security protocols, such as Ban logic, theorem proving and model checking etc. This paper used model checking method to formally verify security protocols because of its high degree of automation, briefness and effectiveness. The model checker Spin with sound algorithm design has an extraordinary ability of checking and a good support for LTL. This paper studied the use of Spin on security protocols, and proposed a more effective intruder model to formally verify the security properties of security protocols, such as authentication. The method in this paper decreased the number of model states by a wide margin, and avoided the state space explosion effectively. This paper exampled NSPK protocol and DS protocol, and good experimental results were shown.

Applying Assemble Clustering Algorithm and Fault Prediction to Test Case Prioritization

Cluster application is proposed as an efficient approach to improve test case prioritization, Test case in a same cluster are considered to have similar behaviors. In the process of cluster test case, the selection of test case feature and the clusters number have great influence on the clustering results. but to date almost clustering algorithm to improve test case prioritization are selected random clusters number and clustering result are based on one or a few of the code features, the paper propose a new prioritization techniques that not only consider the best clusters number but also produce the best clustering result based on test case multidimensional feature. After clustering, considering the inter-cluster prioritization and intra-cluster prioritization,in order to improve the effectiveness of our approach, the fault prediction value of code corresponding to the test case is used as one of a prioritization weight. Finally,we implemented an empirical studies using an industrial software to illustrate the effectiveness of the test case prioritization techniques.

Formal specification and reasoning for situated multi-agent system

We present a formal specification to engineer situated multi-agent Systems (situated MAS), which has revealed the need for specifying and reasoning of its global property. This paper shows how MAS is specified with modified Object-Z notation with trace semantic of action system, and how to reason about safety and liveness property in this specification. Independent and joint MAS examples are are used to illustrate specifying and reasoning in specification for situated MAS.

A Selenium based approach to automatic test script generation for refactoring JavaScript code

During the development process of Web application, two essential phases are software testing and code refactoring. However, automatic testing script plays an important role in test automation. It has been a hot research topic in Web application. In order to refactor the JavaScript code of Web application more conveniently, an approach to automatic script generation from the defined test case is introduced in this paper. First, it describes the test case using customized XML format. Then, since Selenium platform supports multi-browsers testing, a method to transform XML description into test scripts based on Selenium framework is proposed as the emphasis.

Scenario specification based testing model generation

Building a simplified model for testing complex software system has been highlighted for optimizing test generation. This paper presents an approach to generating the constrained FSM with the scenario. Firstly, we use FSM to describe the behavior model of the target system. Then, we study the method of modeling scenarios with UML diagrams, including use case diagram, activity diagram, sequence diagram and statechart diagram. We describe how to achieve the constraint process by means of mapping and projection operations between FSM and UML diagrams. Finally, we obtain a reduced FSM by using UML activity diagrams to constrain FSM. The main contribution of the paper is to present an effective modeling method to optimize testing generation from the model.

Modeling and Verifying Web Service Applications with Time Constraints

Web services are a very appropriate communication mechanism to perform distributed business processes among several organizations. These processes should be reliable, because a failure in them can cause high economic losses. In this paper, we present an approach to verify Web Service applications with time restrictions which are defined by BPEL4WS using model checking techniques. We introduce a formalism, called WS Timed Automata, to capture the timed behavior of the web service applications, and methods to translate description of web service applications written in BPEL4WS to WS Timed Automata is proposed in this paper. The formal verification tool Uppaal is used to verify related properties of the system. A particular case study, an airline travel reservation system is taken as illustration.

Axiomatic Assessment of FSM-Based Test Adequacy Criteria for Web Application

Compared with traditional software testing, Web application testing is quite different. It has become increasingly important to choose appropriate criteria during the testing. This paper presents a set of test adequacy criteria for FSM-based Web application, and proposes two new test criteria: complete function interaction coverage criteria and function loop interaction coverage criteria. Besides, an axioms system is proposed to assess the FSM-based Web application test coverage criteria. From this axioms system, some useful conclusions are educed as a guide for software engineers in practical testing application.

An empirical study on clustering approach combining fault prediction for test case prioritization

Using Clustering algorithm to improve the effectiveness of test case prioritization has been well recognized by many researchers. Software fault prediction has been one of the active parts of software engineering, but to date, there are few test cases prioritization technique using fault prediction. We conjecture that if the code has a fault-proneness, the test cases covering the code will find fault with higher probability. In addition, most of the existing test cases prioritization techniques using clustering algorithm dont consider the number of clusters. Thus, in this paper, we design a test case prioritization based on clustering approach combining fault prediction. We consider the method to obtain the best number of clusters and the clustering prioritization based on the results of fault prediction. To investigate the effectiveness of our approach, we perform an empirical study using an object which contains test cases and faults. The experiment results indicate that our techniques can improve the effectiveness of test case prioritization.