Vinay Arora

Literature Analysis on Model based Slicing

To understand and test a large software product is very challenging task. One way to ease this is program slicing technique that decomposes the large programs into smaller ones and another is model based slicing that decomposes the large software architecture model into smaller models at the early stage of SDLC (Software Development Life Cycle). This literature analysis presents an overview of Model based slicing, including the various general approaches and techniques used to compute slices. General Terms Slicing, UML Models

Synthesizing test scenarios in UML activity diagram using a bio-inspired approach

Abstract The model-based analysis is receiving a wide acceptance as compare to code-based analysis in the context of prioritizing and guiding the testing effort and speeding up the development process. Ordinarily, system analysts as well as developers follow Unified Modeling Language (UML) activity diagrams to render all realizable flows of controls commonly recognized as scenarios of use cases. This paper applies a bio-inspired algorithm to produce test scenarios for the concurrent section in UML activity diagram. Here, the heuristic draws its inspiration from the internal mechanism of the slime mould Physarum Polycephalum , a large single-celled amoeboid organism. Simulations are performed using eight subject systems taken from the LINDHOLMEN data-set, two models taken from real life student projects and five synthetic models. The results obtained through different approaches are validated through the statistical analysis which demonstrates that our proposed approach is better than the existing Ant Colony Optimization (ACO) and Genetic Algorithm (GA) by a number of feasible test scenarios generated.

Debugging and visualization techniques for multithreaded programs: A survey

Multithreaded programs deal with simultaneous execution of multiple threads. There are various bugs that can arise in multithreaded programs. Bugs like deadlock, livelock, race condition and other synchronization faults fall in this category. These bugs are difficult to detect and correct due to non-deterministic nature of multithreaded program execution. This paper presents a critical analysis of these bugs by categorizing them on the basis of their detection techniques. Previously identified techniques visualize bugs, for better understanding of their location and cause. This paper also categorizes bug visualization techniques. By visualizing those bugs, debugging techniques can be easily applied over them. At the end, analysis of various tools for visualizing multithreaded programs is summarized in a table.

A systematic review of approaches for testing concurrent programs

Concurrent programs are replacing the sequential programs as they utilize the true capabilities of multicore architecture. The extensive use of multicore systems and multithreaded paradigms warrants more attention to the testing of the concurrent programs. The testing concurrent program is not a new field as it has been more than 40 years because the first problem related to the testing concurrent program was addressed by the researchers. The field covers various domains, which include concurrency problems, testing approaches, techniques, graphical representations, tools, and subject systems. This paper aims at providing an overview of research in the domain of testing concurrent programs by classifying it into eight categories: (a) reachability testing, (b) structural testing, (c) model‐based testing, (d) mutation‐based testing, (e) slicing‐based testing, (f) formal methods, (g) random testing, and (h) search‐based testing. The survey is focused on the techniques applied, methodologies followed, and tools used in these aforementioned approaches. Furthermore, the gaps are also identified in different approaches. The paper concludes with the consolidation of various testing parameters along with the future directions. Copyright

A novel approach for automatic test sequence generation for java fork/join from activity diagram

Test sequence generation is considered as an important phase of testing. Test sequences can be generated either by using code or model. Test sequence generation can be automated to make testing easier. This paper presents an approach for automatic test sequence generation from UML activity diagram of the Java7 Fork/Join framework. The activity diagram is first converted to an XML file, which is then traversed to find test sequences. Infeasible test sequences are avoided in this approach. Cost and overheads involved are also very less.

Evaluation of Flow Graph and Dependence Graphs for Program Representation

Graphical methods offer the structural icon of the system that facilitates testing the logical progress of the program. A control flow graph describes the sequence in which the instructions of a program will get executed. PDG represents a program as a graph where statements and predicate expressions can be characterized by the nodes. The System Dependence Graph (SDG) is an extension of the Program Dependence Graph (PDG) and represents a program that consists of multiple procedures and involves procedural calls. An assessment of flow graphs & dependence graphs can be performed on the basis of properties like control dependence, data dependence, transitive dependence, flow sensitivity, parameter passing etc. General Terms Flow graph, dependence graph.

Visualization of deadlock and wait-notify anomaly in multithreaded programs

The paper addresses deadlock due to lock acquisition dependency and wait-notify anomalies. In this work, dependencies are visualized with three types of dependence graphs namely data-control, lock acquisition and wait-notify dependence graphs. Algorithms are also proposed for generating graphs; and hence, bugs are detected due to blockage. Graphical method is used to detect bugs. A prototype tool “Bug Visualizer” is implemented in Java version 7.

Practical approach for model based slicing

Software testing is an activity that will aim at evaluating an attribute or capability of system and determine that whether it meets required expectations. Test cases can be designed at model level of software development. But to visualize the software model or architecture is difficult due to its large and complex structure. We have presented a novel methodology to extract the sub-model from model diagrams correspond to point of interest to ease the software visualization. The proposed methodology use the concept of model based slicing to slice the sequence diagram to extract the desired chunk. Keywords - Software Testing, Sequence diagram, Model based slicing.

ERA-AODV for MANETs to Improve Reliability in Energy Efficient Way

The nodes in MANETs communicate with each other through wireless medium and are constantly moving. To maintain the links in a continuously changing topology is a challenge, especially for longer duration of time, and in such scenarios, the reliability of the links becomes the prime issue. Further, the reliability must be maintained in an energy-efficient way. The paper presents energy-efficient version of RA-AODV named as ERA-AODV which measures reliability in terms of end-to-end delay, bandwidth, and mobility of the intermediate nodes. Since the prime factor which determines the consumption of energy of the node is the distance of communication between them, the proposed scheme takes into account adjustment of the transmission range of the mobile nodes according to residual energy, to provide improved energy efficiency. The parameters considered as performance measure which include packet delivery ratio, throughput and remaining energy demonstration improvement over the existing scheme.

Information Retrieval in Web Crawling Using Population Based, and Local Search Based Meta-heuristics: A Review

The exponential growth and dynamic nature of the world wide web has created challenges for the traditional Information Retrieval (IR) methods. Both issues are the imperative source of problems for locating the information on web. The crawlers expedite web based information retrieval systems by following hyperlinks in web pages to automatically download new and updated content. The web crawlers systematically traverse the web pages, and fetch the information viz. nature of the web content, hyper-links present on the web page, etc. This paper reviews and compares the meta-heuristic approaches like population based, evolutionary algorithms, and local search used for IR in web crawling. This paper reviews how these techniques has been developed, enhanced and applied.