Forthcoming articles

 


International Journal of Software Engineering, Technology and Applications

 

These articles have been peer-reviewed and accepted for publication in IJSETA, but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

 

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

 

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

 

Articles marked with this Open Access icon are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

 

Register for our alerting service, which notifies you by email when new issues of IJSETA are published online.

 

We also offer RSS feeds which provide timely updates of tables of contents, newly published articles and calls for papers.

 

International Journal of Software Engineering, Technology and Applications (2 papers in press)

 

Regular Issues

 

  • An Efficient Rejuvenation Policy to Cope with Software Aging Phenomenon   Order a copy of this article
    by Amir Akhavan Bitaraf, Moona Yakhchi, Hakem Beitollahi, Mahdi Fazeli 
    Abstract: Software aging is a well-known challenge in most software systems that lead to serious performance degradation or frequent failures in these systems. Several proactive rejuvenation techniques have been proposed to tackle software aging and prevent failures. Rejuvenation techniques are mostly categorized into two main classes: Time-based techniques and failure prediction based techniques. This article proposes a new method for software rejuvenation that follows a new policy for determining the time of rejuvenation. Our new policy includes two parts: 1) Considering a set of rejuvenation time points based on a static analysis of system behavior in the presence of software aging effect; 2) Dynamically changing the scheduling points based on a dynamic analysis of system workload. In fact, our policy employs a straightforward time-based technique as a base-line and then dynamically changes the selected points based on predicting the lowest workload time. In comparison to the second category of rejuvenation techniques, our policy predicts the occurrence time of the lowest workload instead of occurrence of failure time. Our new strategy effectively and dynamically changes the static points of a time-based policy. Simulation results in comparison to other well-known time-based rejuvenation techniques indicate the system availability improves between 0.3% to 7.3%. Moreover, our technique significantly reduces the overall rejuvenation cost (up to 71%).
    Keywords: Software Aging; Software Rejuvenation.

  • TABU SEARCH PRIORITIZED ANT COLONY METAHEURISTIC OPTIMIZATION BASED DYNAMIC SYMBOLIC GENETIC TECHNIQUE FOR HIGH COVERAGE TEST SUITE GENERATION   Order a copy of this article
    by T. Ramasundaram, V. Sangeetha 
    Abstract: Test suites minimization is a key problem to be solved in software quality management to reduce the time and cost of software testing. Few research works have been developed to perform test suite generation and optimization. However, the optimization performance was not sufficient as it does provide high coverage test suites for testing the software program. In order to overcome such drawbacks, Tabu Search Prioritized Ant Colony Metaheuristic Optimization based Dynamic Symbolic Genetic (TSPACMO-DSG) Technique is proposed. The TSPACMO-DSG Technique generates high coverage test suites with minimal time to improve the quality of the input software application program. The TSPACMO-DSG Technique initially applies the Tabu Search Prioritized Ant Colony Metaheuristic (TSPACM) Approach for test suite generation. During this process, TSPACM Approach selects optimal test cases for formulating the test suites. With the output of TSPACM, then TSPACMO-DSG Technique employs Dynamic Symbolic Genetic Algorithm (DSGA) to attain test suite reduction where the number of test suites constructed is optimized based on fault coverage rate. With the help of optimized test suites, TSPACMO-DSG Technique finally enhances the quality of software program with lower time and cost. Experimental evaluation of TSPACMO-DSG Technique is carried out on factors such as test suite generation time, test suite reduction rate and coverage rate. The experimental result depicts that the TSPACMO-DSG Technique is able to enhance coverage rate and minimizes test suite generation time of software quality management as compared to state-of-the-art works.
    Keywords: Coverage; Gaussian mutation; Heuristic crossover; Objective function; Priority; Test Suites; Tournament selection.