Feras Hanandeh

Feature-Based Test Focus Selection Technique Using Classes Connections Weight

Testing could cost more than fifty percent of all development cost, particularly integration testing consumes around eighty percent of testing cost. Integration testing aims to discover errors in the connections among classes which are collaborate and communicate in order to provide specific services. Though, testing all connections among classes is impractical because of the cost, effort and time constraints. Test focus selection might help testers to concentrate on the main and vital connections among classes which it could be the most error prone ones. The authors proposed approach amalgamates the static and dynamic analysis in order to detect, trace, and weight the connections among classes through method level communications. Their approach harnessed an open source tracing tool MUTT. The MUTT allows them to return all the methods in all classes that have been called respecting to any specific feature which has triggered by the system user. The experimental results reveal how the proposed approach achieves good mutation testing score on the systems under study.

Regression Test-Selection Technique Using Component Model Based Modification: Code to Test Traceability

Regression testing is a safeguarding procedure to validate and verify adapted software, and guarantee that no errors have emerged. However, regression testing is very costly when testers need to re-execute all the test cases against the modified software. This paper proposes a new approach in regression test selection domain. The approach is based on meta-models (test models and structured models) to decrease the number of test cases to be used in the regression testing process. The approach has been evaluated using three Java applications. To measure the effectiveness of the proposed approach, we compare the results using the re-test to all approaches. The results have shown that our approach reduces the size of test suite without negative impact on the effectiveness of the fault detection.

Replica control protocol: Triple Quorum Replication (TQR) in Data Grid

Grid computing is the combination of computer resources from multiple administrative domains to compute a complex and time consuming computational problems whereas Data Grids address data intensive applications that deal with the evaluation and mining of large amounts of data in the terabyte and petabyte range. By having large number of data in a complex computing structure such as grid requires a good data management protocol. In this paper, Triple Quorum Replication (TQR) protocol was introduced for grid environment and a comparative study of data availability with Enhanced Diagonal Replication 2D Mesh (EDR2M) Protocol and Arbitrary 2D Structured (A2DS) Protocol are implemented. A simulation of Triple Quorum Replication (TQR) protocol was developed using Java and results have proven that the TQR has higher data availability compare to EDR2M even though the number of nodes are increasing.

Simplified approach for generating integrity tests in distributed database systems

Distributed database systems (DDBS) usually contain massive collections of data that rapidly evolve over time. It is extremely time consuming to make a perfect checking at each database update operation. This paper introduces a new algorithm to generate simplified integrity tests which could be used to automatically verify that database updates does not introduce any violation of integrity. The main attractive features of this approach are simplicity, flexibility in generating sufficient and complete integrity tests, and considering all conjunctive and disjunctive constraints. The experiment results show that the new algorithm provides more tests in comparison with existing techniques.

Checking the efficiency of integrity tests in distributed and parallel database

With the increased use of the applications that deal with massive collections of data, integrity checking became a critical problem. Efficient checking could be achieved by deriving a simplified form of the integrity constraints against the new database state before the update operation is performed. Most of the research projects in this area are concentrated on deriving sufficient integrity tests for distributed databases. However, no attention has been given to validating the appropriateness of these integrity tests. In this paper, we provide a complete solution for checking constraints in the distributed database system. The proposed technique is not limited to generate sufficient and complete integrity tests but it also selects the suitable test from several alternative tests. Experimental results showed how the complete tests can significantly improve the performance of the constraint checking mechanisms with respect to the amount of data transferred across the network.

Evaluating Maintainability of Open Source Software: A Case Study

Maintainability is one of the most important quality attribute that affect the quality of software. There are four factors that affect the maintainability of software which are: analyzability, changeability, stability, and testability. Open source software OSS developed by collaborative work done by volunteers through around the world with different management styles. Open source code is updated and modified all the time from the first release. Therefore, there is a need to measure the quality and specifically the maintainability of such code. This paper discusses the maintainability for the three domains of the open source software. The domains are: education, business and game. Moreover, to observe the most effective metrics that directly affects the maintainability of software. Analysis of the results demonstrates that OSS in the education domain is the most maintainable code and cl_stat number of executable statements metric has the highest degree of influence on the calculation of maintenance in all three domains.

Mobile agents modelling using UML

In software and system design, there are many views that can be demonstrated through visual diagram. State diagrams are widely used to express systems, entities or objects experiences different states according to different events or transitions. Typical state diagrams do not take the complexity of many currently existing systems. The singular view of definite possible states that a traditional state diagram allows is inapplicable for some hybrid complex systems such as mobile agents, graphical user interfaces, etc. In this paper, we take a look at the presented approach for modelling agent mobility with UML sequence diagrams and present a simplified form of UML state diagrams for modelling agent mobility. We proposed enhancements on the traditional state diagram to take into consideration modelling such hybrid complex systems as extension for the traditional state diagram. The concepts from the composite pattern are used in which there is a need for conformity in dealing with composite and component elements.

Using Data Mining Techniques with Open Source Software to Evaluate the Various Factors Affecting Academic Performance: A Case Study of Students in the Faculty of Information Technology

This research paper studies the different factors that could affect the Faculty of Information Technology students’ accumulative averages at Jordanian Universities, by verifying the students’ information, background and academic records. It also has the objective to reveal how this information will affect the students to obtain high grades in their courses. The information of the students is extracted from the students’ records and its attributes are formulated as a huge database. Then, a free open source software (WEKA) which supports data mining tools and techniques are used to decide which attribute(s) will affect the students’ accumulative averages. It was found that the most important factor affects the students’ accumulative averages, is the student acceptance type. A decision tree model and rules are also built to determine how the students can get high grades in their courses. The overall accuracy of the model was 46.8% which is an accepted rate. KEywORDS Academic Performance, Data Mining Techniques, Faculty of Information Technology, FOSS, Jordanian Universities, Jordan, Open Source Software

Horizontal partitioning method for test verification in parallel database systems

In parallel database systems the partitioning methods considered in current researches are static. This research paper presents a partitioning method to divide the database relations into dynamic horizontal partitions. Every partition contains some tuples of the database relation. These partitions will be checked using the subtests generated from the integrity constraints during the test verification process. Furthermore, the integrity of these partitions will be enforced by the generated integrity rules. It presents the algorithm of distributing the integrity tests among the horizontal partitions. As our intention is to parallelise the execution of the integrity tests, the relations specified in the test are dynamically partitioned into several parts based on the number of available processors. Each processor checks the validity of the test concurrently by accessing the partition assigned to it.

Generating Repair Rules for Database Integrity Maintenance

Repair system has two essential components, which are much related to each other. When the update operation is executed, the first component is the detection of the erroneous state if any and the second component is to repair this state by finding the changes to the update operation that would repair it. Failing to have the second component, which is the repair action, will enforce the user to manually correcting and reentering an erroneous update operation. Our approach will take advantage of the integrity before the update operation, which will result on limiting the detection only to the database state after the update operation. Also the repair component will take advantage of the integrity before the update operation and integrity violation after the update operation but before the repair. The focus of this paper is to generate repairs for all first order constraints, and by using only substitution with no resolution search. Multiple constraints can be satisfied in parallel without a sequential process with no possibility of cyclic violation.