Prafulla Kumar Behera

Automatic Test case Generation From UML State Chart Diagram

re than 50% of software development effort is spent in testing phase in a typical software development project. Test case design as well as execution consumes a lot of time. So automated generation of test cases is highly required. We present a testing methodology to test object oriented software based on UML state chart diagrams. In our approach we apply function minimization technique and generate test cases automatically from UML state chart diagrams. Here, first the state chart diagram is constructed. Then the diagram is traversed. Here, we perform a DFS to select the associated predicates. After selecting the predicates, we guess an initial dataset. These conditional predicates are, then transformed to generate test cases automatically. Our technique achieves adequate test coverage without unduly increasing the number of test cases. Our approach achieves many important coverage like state coverage, transition coverage, transition pair coverage etc.. This paper also describes how minimization technique is used in testing.

Prioritizing test scenarios from UML communication and activity diagrams

Due to the large size and complexity of software, exhaustive testing becomes impossible. Hence, testing must be done in an optimized way keeping in mind factors, such as requirements of the customer, cost and time. For this, there is a need to generate test cases and exercise them to gain maximum throughput by uncovering defects. Test case/scenario prioritization is a well known and efficient technique to ensure the software quality. Prioritization of test scenarios helps in early detection of bugs. In this paper, we present an integrated approach and a prioritization technique to generate cluster-level test scenarios from UML communication and activity diagrams. In our approach, we first construct a tree representation of communication diagrams, and then a tree representation of activity diagrams. We convert them into an intermediate tree named as COMMACT tree. We, then carry out a post-order traversal of the constructed tree for selecting conditional predicates from the intermediate tree. Then, we propose an algorithm to generate test scenarios from the constructed tree. Next, the necessary information, such as method-activity sequence, associated objects, and constraint conditions is extracted from test scenario. The test sequences are a set of theoretical paths starting from initialization to end, while taking conditions (pre- and post-condition) into consideration. Each generated test sequence corresponds to a particular scenario of the considered use case. The third phase is to generate test scenarios from the tree satisfying the message–activity path test adequacy criteria. Preliminary results obtained on a case-study indicate that the technique is effective in extracting the critical scenarios from the communication and activity diagrams. Our approach generates redundant test scenarios and still achieves adequate test coverage.

Prospects of Group-Based Communication in Mobile Ad hoc Networks

This paper describes the possible prospects of a group-based ad hoc network. It presents the formation of a semi-ad hoc network of mobile hosts termed as a mobile users club. Using a DSR like protocol in such a network simplifies routing protocol selection. Communication through a club improves security in the inherently insecure mobile ad hoc network. Also it sustains variation in node population, node density, and node mobility. Apart from this, DS-CDMA technique used for medium access by the club members ensures better utilization of limited battery power and bandwidth.

Minimal TestCase Generation for Object-Oriented Software with State Charts

Today statecharts are a de facto standard in industry for modeling system behavior. Test data generation is one of the key issues in software testing. This paper proposes an reduction approach to test data generation for the state-based software testing. In this paper, first state transition graph is derivedfrom state chart diagram. Then, all the required information are extracted from the state chart diagram. Then, test cases are generated. Lastly, a set of test cases are minimized by calculating thenode coverage for each test case. It is also determined that which test cases are covered by other test cases. The advantage of our test generation technique is that it optimizes test coverage by minimizing time and cost. The present test data generation scheme generates test cases which satisfy transition path coveragecriteria, path coverage criteria and action coverage criteria. A case study on Railway Ticket Vending Machine (RTVM) has been presented to illustrate our approach.

Slicing-based test case generation using UML 2.0 sequence diagram

We present a novel test case generation technique using the features of UML 2.0 sequence diagrams. First, we construct the UML sequence diagram of a system. Then, we construct message dependency graph MDG from the sequence diagram SD and select conditional predicates by traversing MDG. Then, we compute slices corresponding to each conditional predicate. Finally, we generate test cases with respect to a given slicing criterion. Our testing strategy derives test cases using slice test coverage, high path coverage and full predicate coverage criteria. Here, we focus on testing of sequences of messages among objects of use case scenarios. Our technique can be used for system and cluster level testing accommodating the object message and condition information. Thus, our test cases are suitable for detecting object interactions and operational faults. Finally, we have made an analysis and comparison of our approach with the existing approaches, through a case study.

Effective communication in ad hoc network of mobile users group

This paper describes a model to provide effective communication in an ad hoc network through the use of a mobile users group, where only a limited number of registered users would communicate and help each other for routing under the supervision of a club controller. The mobile users club can be viewed as a semi-ad hoc network since the communication among the mobile hosts is guided and facilitated by the club administration. This technique would help to provide a more protected and secure communication in the inherently insecure mobile ad hoc network. Apart from this, DS-CDMA technique used for medium access by the club members would enhance the security and further ensure better utilization of limited battery power and bandwidth.

Dynamic Slicing of Object-Oriented Programs in Presence of Inheritance

This paper proposes an DG traversal dynamic slicing algorithm for dynamic slicing of object-oriented programs in presence of inheritance, which can facilitate various software engineering activities like program comprehension, testing, debugging, reverse engineering, maintenance etc. This paper creates an intermediate program representation called dynamic graph to represent the execution trace of an object-oriented program. Then the proposed slicing algorithm is applied on the intermediate representation to compute the dynamic slice. The advantage of this approach is that, the intermediate program representation is small, hence needs less memory to store and the proposed algorithm is space efficient as well as time efficient and computes precise dynamic slices.

Secured packet inspection with hierarchical pattern matching implemented using incremental clustering algorithm

In the present scenario, most of the computing operations are performed over the Internet. Many companies provide their services using Internet, so networking services becomes more important these days. Hence, there is high demand for secured management of information, along with faster processing of operations. Due to increased demand for network services, there is a need to increase the performance of these services. The gradual increase in the amount of important information increases the packet payloads. EHMA is a faster searching algorithm that reduces the searching time significantly. In the original paper [1], EHMA is implemented in two tiers, but this paper considers the implementation of EHMA in three tiers. It follows incremental clustering algorithm for grouping clusters according to their impact factors. This three tier implementation of EHMA improves the security of the information as it uses SHA-256 for security.

Computing Dynamic Slices of Object-Oriented Programs using Dependency Information

a days, object-oriented programs are becoming very popular amongst the developers and hence almost all software are designed using the object-oriented paradigm. Advanced features of object-oriented programming has made it complicated to understand, test, debug and maintain. To better manage these software, slicing techniques have been proved to be quite efficient. This paper proposed an algorithm for dynamic slicing of object-oriented software. It uses SDG(System Dependence Graph) and DG(Dynamic Graph) as the intermediate program representation while computing the dynamic slices. In this paper dynamic slicing algorithm is based on traversing through the outgoing control dependence edges and incoming data dependence edges of Dynamic Graph. The major advantage of the proposed algorithm is that the time required to compute the dynamic slice of the object- oriented programs is directly proportional to the number of dependencies (control and/or data) arising during the run time. Also the proposed algorithm depends on the numbers of nodes present in the intermediate program representation.