Shailendra Mishra

Accessing and Evaluating AspectJ based Mutation Testing Tools

ABSTRACT Software testing plays a crucial role in software development life cycle. Without testing, quality of software product is questionable. Mutation testing, widely accepted fault based testing technique. Aspect Oriented Programming is a new methodology that introduces the concept of modularization. AspectJ is an aspect oriented programming language that provides the concept of pointcut and advice. With new features, AOP introduces new faults that can be easily handled by mutation testing. In this paper, we evaluate the available AspectJ based mutation testing tools and identify the basic requirements that must be satisfied by any developed tool. research plans. Keyword Mutation testing, Automated Mutation Testing tool, Fault based mutation testing tool, Mutation testing tool for AspectJ, AOP based Mutation testing tool. 1. INTRODUCTION Software testing is the activity of establishing confidence that a system does what it is supposed to do and does not what it is not supposed to do. Since it is impossible to build an error-free system, testing a system is an essential process in software development. Thus, a great deal of research on software testing has been carried out for many years [2,4]. Traditionally, software systems have been developed in a procedural environment and then in object oriented environment. Recently, a new approach to system decomposition has become popular called aspect-oriented programming (AOP), which makes it possible to clearly express programs involving such aspects, including appropriate isolation, composition and reuse of the aspect code [5,12]. The advent of object-oriented methodologies pulled the state of the system into individual objects, where it could be made private and controlled through access methods and logic [31]. This leads to the current situation: Developers are still having difficulty fully expressing a problem into a completely modular and encapsulated model. Although breaking a problem into objects makes sense, some pieces of functionality must be made available across objects. Aspect-oriented programming (AOP) is one of the most promising solutions to the problem of creating clean, well-encapsulated objects without extraneous functionality. The purpose of this work is to attempt to evaluate advantages and limitations of the current AspectJ based mutation testing tools. In this paper, we will find out the basic requirements to develop a mutation testing tool for AspectJ based systems. In this paper, we will compare the available AspectJ based mutation testing tools on the basis of requirements and identify the limitations. The structure of the paper is as follows. Section 2 describes the mutation testing process. Section 3 describes the current aspect oriented mutation testing tools. Section 4 describes the basic requirements to develop a mutation testing tool. Finally, section 5 makes a conclusion on the requirements on the basis of current aspect oriented mutation testing tools and proposes future

Review of Different Inpainting Algorithms

inpainting was historically done manually by painters for removing defect from paintings and photographs. Fill the region of missing information from a signal using surrounding information and re-form signal is the basic work of inpainting algorithms. Here in this paper we have studied and reviewed many different algorithms present for doing image inpainting and explain their approach. We have briefly explain some algorithms for video inpainting applications. This paper contain work done in the field of image inpainting and guide newcomers who are willing to work in image inpainting field.

Novel Approach to Automated Test Data Generation for AOP

Aspect oriented programming is a new programming paradigm. AOP is based on object oriented programming. Most of the researchers target this new paradigm towards the programming not for testing. Testing of aspect oriented programs is an emerging field of research as a very few research work is going on currently on ASP. In this paper, we investigate a new way of testing aspect oriented programs. Here we propose a framework of automated test data generation for evolutionary testing on AOP. On the basis of generated data we will compare evolutionary testing with random testing in terms of effort reduction and improvement of test effectiveness. We will justify our comparison with the help of empirical study on AspectJ programs.

Network Structure and Topology based Routing Techniques in Wireless Sensor Network- A survey

techniques in Wireless Sensor Network has always been important area of exploration due to change in demands of various applications such as Area monitoring, Environmental/Earth monitoring, passive localization and tracking, Industrial monitoring etc. Energy efficiency is crucial issue in WSN because sensor nodes in WSN are with limited battery power/Resources .This results in rapid change in design of routing algorithms. Day by day various routing techniques are being proposed. It is because of energy efficiency, Scalability, Network lifetime and other important factors of routing techniques. Each routing mechanism has its advantages and disadvantages related to energy efficiency also. There is no single, best routing protocol that is suitable for all applications. Routing mechanism might differ depending on the application, network architecture and topologies. This paper gives review of recent research of the network structure and topology based different routing strategies and gives brief idea about energy efficiency of routing protocols in WSN. This paper also represents classification of various routing techniques with their advantages and disadvantages.

An Algorithmic Approach to Predict Fault Propagation and Defects in Dependent Modules based on Coupling

is an enormous amount of research going on to minimize the effect of coupling between the software modules and to reduce the defects present in them. In this paper, an algorithmic approach is proposed that gives a probability, such that the highly dependent modules in system must be analyzed by the development team for fault proneness and defects. The higher the coupling, interdependency between the modules is increased and it is alarming issue in software engineering tasks. There is an enormous amount of research done on direct and indirect coupling, but this paper approaches on the effect of coupling to predict defects and how they are propagating between the modules. Every software product is tested for defects and bugs before it is given to acceptance testing to users. The paper focuses on testing the defect propagation percentage of every module in a dependent system (dependent modules).The greater the percentage of defect propagation factor between two dependent module, implies that the coupling between them is higher and the probability of the module to be fault prone increases. Taking this into consideration, the testing team saves the time by considering more on the modules for which the percentage defect propagation factor is higher. It ensures time, cost and efficiency which are the main factors of a software industry.

Comparison of Sorting Algorithms based on Input Sequences

Ordering is a very important for mankind .If anything is in unordered then it will not easily understand by anyone but if it is in order then it will easily understand and used by anyone. So ordering is a very important issue in computer science also. In computer science many programming applications use ordering to solving a problem either it is in ascending or descending order. In this paper we discuss four sorting algorithms which are already existed named as Insertion Sort, Bubble Sort, Selection Sort, Merge Sort and we design a new sorting algorithm named as index sort also. In this paper we check the performance and comparison of all five sorting algorithm on the basis of increasing the no of elements in bulk. We check how much processing time is taken by all four sorting algorithms with Index Sort and compared them and finding which sorting algorithm takes less time to sort the elements like 10, 100, 1000, 10000 . If any algorithm takes less processing time it means that it sorts the element faster than others. The processing time of a sorting algorithm is based on the processing speed of a Processor as well as internal memory (RAM) used by the system.

Comparison between Centralized & Decentralized Overlay Networks for Media Streaming

paper we examine the performance of two types of Overlay networks i.e. Peer-to-Peer (P2P) & Content Delivery Network (CDN) media streaming using Multiple Description Coding (MDC). In both the approaches many servers simultaneously serve one requesting client with complementary descriptions. This approach improves reliability and decreases the data rate a server has to provide. We have implemented both approaches in the ns-2 network simulator. The experimental results indicate that the performance of Multiple Description Coding-based media streaming in case of P2P network is better than CDN.

Media Streaming Using Multiple Description Coding in Overlay Networks

In this paper we examine the performance of two types of Overlay networks i.e. Peer-to-Peer (P2P) & Content Delivery Network (CDN) media streaming using Multiple Description Coding (MDC). In both the approaches many servers simultaneously serve one requesting client with complementary descriptions. This approach improves reliability and decreases the data rate a server has to provide. We have implemented both approaches in the ns-2 network simulator. The experimental results indicate that the performance of Multiple Description Coding-based media streaming in case of P2P network is better than CDN.

Spreading-factor based addressing-tree protocol for ad-hoc wireless sensor networks

Tree-routing (TR) is a fundamental protocol most suited for a tree-like sensor network. Here, a sensor node deployed as leaf node senses the environmental phenomenon and forwards it to the sink node positioned as the root node by following a fixed parent-child path. This strategy prevents the network from flooding path search messages and saves bandwidth. The enhanced-tree-routing (ETR) protocol is an improvement to the TR protocol that uses a structured node address assignment scheme and considers neighbouring tables stored at each sensor node to find the shortest path to the sink. This requires minimum computation energy, storage and provides energy-efficient routing. In this paper the authors have proposed a spreading factor-based addressing (SFBA-tree) approach based on a non-blocking orthogonal vector spreading factor addressing technique, for the TR protocol and usage of movable sinks to eliminate excessive multi-hopping caused by the ETR protocol while discovering the shortest paths. Also, the authors have shown an SFBA-tree implementation to the ZigBee networks to prevent storage space and computation. The simulation result shows that the new scheme provides energy-efficient addressing and communication in a moderate size tree network.

Review on Protocol based Approaches to Extend Lifetime of Wireless Sensor Networks

Researchers in wireless Micro-sensor networks (M-WSN) have proposed various protocols for energy conservations. Each protocol is aimed to optimize power utilization in wireless sensor networks. The different protocol approaches optimize power consumption either considering their application areas or network topologies. This paper studies various energy-saving protocols for micro sensor networks and presents their brief classifications. An M-WSN is a group of hundreds or thousands of small energy-limited sensors that are densely deployed in a large geographical region. These micro sensors in sensor network are autonomous devices responsible for forwarding locally collected data to a central node called sink node by following multi-hop wireless paths. The sink node performs data fusion to form a single meaningful result. The micro sensors work by utilizing limited battery-power, the considerable part is to use this power for a maximum time. Although recent developments in electronics has enabled the development of low-cost & low-power sensors networks, still there is a challenging job of energy conservation optimization within the wireless sensor networks (WSNs).