An overview of the self-organizing map algorithm, on which the papers in this issue are based, is presented in this article.

The Self-Organizing Map

Regression testing is a testing activity that is performed to provide confidence that changes do not harm the existing behaviour of the software. Test suites tend to grow in size as software evolves, often making it too costly to execute entire test suites. A number of different approaches have been studied to maximize the value of the accrued test suite: minimization, selection and prioritization. Test suite minimization seeks to eliminate redundant test cases in order to reduce the number of tests to run. Test case selection seeks to identify the test cases that are relevant to some set of recent changes. Test case prioritization seeks to order test cases in such a way that early fault detection is maximized. This paper surveys each area of minimization, selection and prioritization technique and discusses open problems and potential directions for future research. Copyright © 2010 John Wiley & Sons, Ltd.

Regression testing minimization, selection and prioritization: a survey

[서평]「Component Software」 - Beyond Object-Oriented Programming -

Extensively class tested, this text takes an innovative approach to explaining the process of software testing: it defines testing as the process of applying a few well-defined, general-purpose test criteria to a structure or model of the software. The structure of the text directly reflects the pedagogical approach and incorporates the latest innovations in testing, including techniques to test modern types of software such as OO, web applications, and embedded software.

Introduction to Software Testing: List of Figures

In this chapter, you will see how the simplex method simplifies when it is applied to a class of optimization problems that are known as “network flow models.” You will also see that if a network flow model has “integer-valued data,” the simplex method finds an optimal solution that is integer-valued.

Flows in Networks

Web applications can be composed of heterogeneous selfcontained web services. Such applications are usually modified to fix errors or to enhance their functionality. After modifications, regression testing is essential to ensure that modifications do not lead to adverse effects. In this paper, we present a safe regression testing algorithm that selects an adequate number of non-redundant test sequences aiming to find modification-related errors. In our technique, a web application and the behavior of its composed components are specified by a two-level abstract model represented as a Timed Labeled Transition System. Our algorithm selects every test sequence that corresponds to a different behavior in the modified system. We discuss three situations for applying this algorithm: (1) connecting to a newly established web service that fulfills a composed web service, (2) adding or removing an operation in any of the composed web services, (3) modifying the specification of the web application. Moreover, modifications handled by the algorithm are classified into three classes: (a) adding an operation, (b) deleting an operation, (c) fixing a condition or an action. Key-words : label transition systems, testing, verification, web service, web application.

Regression Testing Web Services-based Applications

Joint routing and location-based service in VANETs

The cost of developing and deploying web applications is reduced by dynamically integrating other heterogeneous self-contained web services. However, the malfunctioning of such systems would cause severe losses. This paper presents a technique for building reliable web applications composed of web services. All relevant web services are linked to the component under test at the testing time; thus, the availability of suitable web services is guaranteed at invocation time. In our technique, a web application and its composed components are specified by a two-level abstract model. The web application is represented as Task Precedence Graph (TPG) and the behavior of the composed components is represented as a Timed Labeled Transition System (TLTS). Three sets of test sequences are generated from the WSDL files, the TLTS and the TPG representing the integrated components and the whole web application. Test cases are executed automatically using a test execution algorithm and a test framework is also presented. This framework wraps the test cases with SOAP interfaces and validates the testing results obtained from the web services.

A simple approach for testing web service based applications

Location-based services provide (and maintain) location information used by geographic routing protocols. Routing and location service are widely related, but handled separately in usual studies about Vehicular Ad hoc Network (VANET). In this paper, we propose a hybrid approach, denoted mobility-Prediction-based Hybrid Routing and Hierarchical Location Service (PHRHLS), coupling a VANET routing protocol, the Greedy Perimeter Stateless Routing (GPSR), and the Hierarchical Location Service (HLS) extended with a mobility prediction algorithm. We show that our approach, PHRHLS, reduces the localization overhead and enhances the routing performances. Indeed, our extensive simulations show promising results in terms of end-to-end latency, packet delivery ratio and control message overhead.

PHRHLS: A movement-prediction-based joint routing and Hierarchical Location Service for VANETs

In this paper, we propose a combination between a routing protocol Greedy Perimeter Stateless Routing (GPSR) and Hierarchical Location Service (HLS) that we denote Hybrid Hierarchical Location Service (HHLS) HLS and GPSR used to be combined in the original work with a direct method, ie GPRS takes care of routing packets and HLS is called to get the destination position when the target node position is not known or is not fresh enough When a destination is quite far away from the sender, the exact position of the target is calculated, and an extra overhead is generated from sender to receiver Our main purpose is to reduce this overhead in HHLS We suggest to proceed as follows: when a packet has to be sent to the destination, it will be sent directly to the former position of the target instead of requesting for the exact position When the packet is approaching the former position, the exact position request is then sent We have proposed a patch over the NS-2 simulator for HHLS according to our proposal We have conducted experimentations which show promising results in terms of latency, packet delivery rate and overhead

/pdf/hhls-a-hybrid-routing-technique-for-vanets-jthxehd8ci.pdf

Hacène Fouchal

Papers

Regression Testing Web Services-based Applications

Joint routing and location-based service in VANETs

A simple approach for testing web service based applications

PHRHLS: A movement-prediction-based joint routing and Hierarchical Location Service for VANETs

HHLS: A hybrid routing technique for VANETs