Pub Date : 2019-05-23DOI: 10.1049/IET-SEN.2018.5356
Vamshi Krishna Epuri, Sushma Sakala, Tae-Hyuk Ahn, Myoungkyu Song
Software modification often requires consistent program changes, a group of similar, related changes, at multiple locations in a program. Developers are typically uneasy to (i) detect potential change anomalies such as omission errors or incorrect edits and (ii) determine related locations to apply consistent changes, which is a tedious and error-prone process. To address this problem, this study presents a technique for managing consistent program changes, checking and applying repetitive program transformation (CARP). Given program differencing results between original and edited program versions, CARP (i) infers change patterns to detect change anomalies, (ii) identifies required edit locations, and (iii) automatically applies adequate edits. It has been implemented in the context of the integrated development environment as an Eclipse plug-in. The authors evaluated CARP on three open-source projects and found that CARP detects seeded anomalies with 99.1% accuracy on average. Furthermore, it identifies change locations and transforms them with 98% accuracy. Their results show that CARP should help developers detect potential change anomalies in repetitive program changes and perform consistent changes automatically.
{"title":"Tool support for managing repetitive program changes in evolving software","authors":"Vamshi Krishna Epuri, Sushma Sakala, Tae-Hyuk Ahn, Myoungkyu Song","doi":"10.1049/IET-SEN.2018.5356","DOIUrl":"https://doi.org/10.1049/IET-SEN.2018.5356","url":null,"abstract":"Software modification often requires consistent program changes, a group of similar, related changes, at multiple locations in a program. Developers are typically uneasy to (i) detect potential change anomalies such as omission errors or incorrect edits and (ii) determine related locations to apply consistent changes, which is a tedious and error-prone process. To address this problem, this study presents a technique for managing consistent program changes, checking and applying repetitive program transformation (CARP). Given program differencing results between original and edited program versions, CARP (i) infers change patterns to detect change anomalies, (ii) identifies required edit locations, and (iii) automatically applies adequate edits. It has been implemented in the context of the integrated development environment as an Eclipse plug-in. The authors evaluated CARP on three open-source projects and found that CARP detects seeded anomalies with 99.1% accuracy on average. Furthermore, it identifies change locations and transforms them with 98% accuracy. Their results show that CARP should help developers detect potential change anomalies in repetitive program changes and perform consistent changes automatically.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"25 1","pages":"447-455"},"PeriodicalIF":0.0,"publicationDate":"2019-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74024433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-05-16DOI: 10.1049/IET-SEN.2018.5324
Abdelhakim Hannousse
Coping with crosscutting and dynamic features of software systems has significant impacts on software modularity, reusability, adaptability, and maintainability. However, dealing with such features is a tremendous challenge for different software paradigms, particularly component-based software development (CBSD) where components can be used as black box software units. Fortunately, dealing with crosscutting features is the main focus of aspect-orientation (AO). To compromise, a plethora of different AO and CBSD combinations are available. There is, however, little consensus on how AO and CBSD can be combined and what AO qualities need to be integrated for getting maximum benefits from the combination. In the aim to reach a consensus and increase the understanding of requirements for proper combinations that deal with crosscutting and dynamic features, the authors conduct a domain analysis study of existing combination endeavours; they first identify a set of requirements ought to be fulfilled for proper modelling of crosscutting and dynamic features in component software using AO; second, they group the identified requirements into an evaluation model; third, they check the capability of existing combinations to validate the evaluation model. The study highlighted mandatory requirements for proper combinations and revealed that none of the existing endeavours validates the evaluation model.
{"title":"Dealing with crosscutting and dynamic features in component software using aspect-orientation: requirements and experiences","authors":"Abdelhakim Hannousse","doi":"10.1049/IET-SEN.2018.5324","DOIUrl":"https://doi.org/10.1049/IET-SEN.2018.5324","url":null,"abstract":"Coping with crosscutting and dynamic features of software systems has significant impacts on software modularity, reusability, adaptability, and maintainability. However, dealing with such features is a tremendous challenge for different software paradigms, particularly component-based software development (CBSD) where components can be used as black box software units. Fortunately, dealing with crosscutting features is the main focus of aspect-orientation (AO). To compromise, a plethora of different AO and CBSD combinations are available. There is, however, little consensus on how AO and CBSD can be combined and what AO qualities need to be integrated for getting maximum benefits from the combination. In the aim to reach a consensus and increase the understanding of requirements for proper combinations that deal with crosscutting and dynamic features, the authors conduct a domain analysis study of existing combination endeavours; they first identify a set of requirements ought to be fulfilled for proper modelling of crosscutting and dynamic features in component software using AO; second, they group the identified requirements into an evaluation model; third, they check the capability of existing combinations to validate the evaluation model. The study highlighted mandatory requirements for proper combinations and revealed that none of the existing endeavours validates the evaluation model.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"17 1","pages":"434-446"},"PeriodicalIF":0.0,"publicationDate":"2019-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85638911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-09DOI: 10.1049/IET-SEN.2018.5164
Masoumeh Taromirad, Raman Ramsin
This study presents a process-driven view on the use of model-based testing (MBT) in agile/lightweight processes. It argues that process-related aspects of MBT and agile processes should be explicitly considered in any practical MBT approach intended for use in agile development (AD). It demonstrates that an effective MBT approach for lightweight processes has to specify how MBT activities are integrated into a development process, how and when MBT artefacts are generated in relation to other development artefacts, and who would carry out MBT activities. Accordingly, a set of integration criteria is introduced for complete incorporation of MBT into agile/lightweight processes. The integration criteria demonstrate the specific characteristics of an appropriate MBT process for AD processes, and help identify the benefits and shortcomings of existing methods on the use of MBT in such processes. Evaluation of existing works based on the proposed integration criteria shows that they have all focused on minimal modelling, and only one method has considered the ‘evolution’ of test models and the ‘reuse’ of test cases, whereas ‘evolution’ and ‘reuse’ are essential characteristics of agile processes, which have to be addressed in any MBT approach intended for such processes.
{"title":"MBT in agile/lightweight processes: a process-centred review","authors":"Masoumeh Taromirad, Raman Ramsin","doi":"10.1049/IET-SEN.2018.5164","DOIUrl":"https://doi.org/10.1049/IET-SEN.2018.5164","url":null,"abstract":"This study presents a process-driven view on the use of model-based testing (MBT) in agile/lightweight processes. It argues that process-related aspects of MBT and agile processes should be explicitly considered in any practical MBT approach intended for use in agile development (AD). It demonstrates that an effective MBT approach for lightweight processes has to specify how MBT activities are integrated into a development process, how and when MBT artefacts are generated in relation to other development artefacts, and who would carry out MBT activities. Accordingly, a set of integration criteria is introduced for complete incorporation of MBT into agile/lightweight processes. The integration criteria demonstrate the specific characteristics of an appropriate MBT process for AD processes, and help identify the benefits and shortcomings of existing methods on the use of MBT in such processes. Evaluation of existing works based on the proposed integration criteria shows that they have all focused on minimal modelling, and only one method has considered the ‘evolution’ of test models and the ‘reuse’ of test cases, whereas ‘evolution’ and ‘reuse’ are essential characteristics of agile processes, which have to be addressed in any MBT approach intended for such processes.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"30 1","pages":"327-337"},"PeriodicalIF":0.0,"publicationDate":"2019-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74104626","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-09DOI: 10.1049/IET-SEN.2018.5131
Shaojian Qiu, Lu Lu, Siyu Jiang
Using classification methods to predict software defect is receiving a great deal of attention and most of the existing studies primarily conduct prediction under the within-project setting. However, there usually had no or very limited labelled data to train an effective prediction model at an early phase of the software lifecycle. Thus, cross-project defect prediction (CPDP) is proposed as an alternative solution, which is learning a defect predictor for a target project by using labelled data from a source project. Differing from previous CPDP methods that mainly apply instances selection and classifiers adjustment to improve the performance, in this study, the authors put forward a novel distribution–adaptation-based CPDP approach, joint distribution matching (JDM). Specifically, JDM aims to minimise the joint distribution divergence between the source and target project to improve the CPDP performance. By constructing an adaptive weight vector for the instances of the source project, JDM can be effective and robust at reducing marginal distribution discrepancy and conditional distribution discrepancy simultaneously. Extensive experiments verify that JDM can outperform related distribution–adaptation-based methods on 15 open-source projects that are derived from two types of repositories.
利用分类方法预测软件缺陷受到了广泛的关注，现有的研究大多是在项目内部环境下进行预测。然而，在软件生命周期的早期阶段，通常没有或非常有限的标记数据来训练有效的预测模型。因此，跨项目缺陷预测(CPDP)被提议作为一种替代解决方案，它是通过使用来自源项目的标记数据来学习目标项目的缺陷预测器。与以往CPDP方法主要采用实例选择和分类器调整来提高性能不同，本文提出了一种基于分布自适应的CPDP方法——联合分布匹配(joint distribution matching, JDM)。具体来说，JDM旨在最小化源项目和目标项目之间的联合分布差异，以提高CPDP的性能。通过为源项目实例构造自适应权向量，JDM可以同时有效地减小边际分布差异和条件分布差异。大量的实验验证了JDM在15个源自两种类型存储库的开源项目上的表现优于相关的基于发行版的方法。
{"title":"Joint distribution matching model for distribution-adaptation-based cross-project defect prediction","authors":"Shaojian Qiu, Lu Lu, Siyu Jiang","doi":"10.1049/IET-SEN.2018.5131","DOIUrl":"https://doi.org/10.1049/IET-SEN.2018.5131","url":null,"abstract":"Using classification methods to predict software defect is receiving a great deal of attention and most of the existing studies primarily conduct prediction under the within-project setting. However, there usually had no or very limited labelled data to train an effective prediction model at an early phase of the software lifecycle. Thus, cross-project defect prediction (CPDP) is proposed as an alternative solution, which is learning a defect predictor for a target project by using labelled data from a source project. Differing from previous CPDP methods that mainly apply instances selection and classifiers adjustment to improve the performance, in this study, the authors put forward a novel distribution–adaptation-based CPDP approach, joint distribution matching (JDM). Specifically, JDM aims to minimise the joint distribution divergence between the source and target project to improve the CPDP performance. By constructing an adaptive weight vector for the instances of the source project, JDM can be effective and robust at reducing marginal distribution discrepancy and conditional distribution discrepancy simultaneously. Extensive experiments verify that JDM can outperform related distribution–adaptation-based methods on 15 open-source projects that are derived from two types of repositories.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"48 1","pages":"393-402"},"PeriodicalIF":0.0,"publicationDate":"2019-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90386052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-09DOI: 10.1049/IET-SEN.2018.5087
Shahid Hussain, J. Keung, Mohammad Khalid Sohail, A. Khan, G. Ahmad, M. Mufti, Hasan Ali Khattak
The employment of design patterns is considered as a benchmark of software quality in terms of reducing the number of software faults. However, the quantification of the information about the hinder design issues such as the number of roles, type of design pattern, and their association with anti-pattern classes is still required. The authors propose a new methodology to evaluate the impact of certain design issues on the software quality in terms of quantification of fault density. Firstly, they mine the required information about the classes of each system under study. Secondly, they describe taxonomy to group the classes. Subsequently, they used statistical techniques to formulate and benchmark the results. They include the analysis of four open source projects with six design patterns and six anti-patterns in the case study. The main consequences are (i) the pattern participant classes are less dense in faults, (ii) the classes involved in the structural association between design patterns and anti-patterns are denser in faults, (iii) the pattern participant classes with multi-role and anti-pattern smell association is denser in faults as compared to others. The significant difference between fault density distributions of groups of classes is still unclear and required further empirical investigation.
{"title":"Methodology for the quantification of the effect of patterns and anti-patterns association on the software quality","authors":"Shahid Hussain, J. Keung, Mohammad Khalid Sohail, A. Khan, G. Ahmad, M. Mufti, Hasan Ali Khattak","doi":"10.1049/IET-SEN.2018.5087","DOIUrl":"https://doi.org/10.1049/IET-SEN.2018.5087","url":null,"abstract":"The employment of design patterns is considered as a benchmark of software quality in terms of reducing the number of software faults. However, the quantification of the information about the hinder design issues such as the number of roles, type of design pattern, and their association with anti-pattern classes is still required. The authors propose a new methodology to evaluate the impact of certain design issues on the software quality in terms of quantification of fault density. Firstly, they mine the required information about the classes of each system under study. Secondly, they describe taxonomy to group the classes. Subsequently, they used statistical techniques to formulate and benchmark the results. They include the analysis of four open source projects with six design patterns and six anti-patterns in the case study. The main consequences are (i) the pattern participant classes are less dense in faults, (ii) the classes involved in the structural association between design patterns and anti-patterns are denser in faults, (iii) the pattern participant classes with multi-role and anti-pattern smell association is denser in faults as compared to others. The significant difference between fault density distributions of groups of classes is still unclear and required further empirical investigation.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"os-20 1","pages":"414-422"},"PeriodicalIF":0.0,"publicationDate":"2019-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87896332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-09DOI: 10.1049/IET-SEN.2018.5043
Rajvir Singh, R. Bhatia, Anita Singhrova
The object-oriented (OO) systems have emerged as the core systems in every field. Test case generation (TCG) for these systems has been identified as one of the crucial activity of software testing. Many researchers have been working in the area of TCG to raise the quality and effectiveness of the OO software systems. It is impossible to test the system exhaustively because of limitations of time, monetary cost and human efforts involved in the process of generation of all test cases. Presently, there is no adequate method that considers the contextual demand for the generation of test cases. Therefore, this study proposes a contextual demand-based TCG for OO systems using test paths or scenarios of sequence diagrams (SDs). Unlike the existing approaches, the proposed method considers flexible approach for generation of test cases as per the contextual demand. For the implementation of the proposed technique, two case studies, i.e. the sample SD and the SD of automated teller machine (ATM) system, have been considered. The evaluation of the proposed method showed the significant consideration of the user demand for generating the final test cases.
{"title":"Demand Based Test Case Generation for Object Oriented System","authors":"Rajvir Singh, R. Bhatia, Anita Singhrova","doi":"10.1049/IET-SEN.2018.5043","DOIUrl":"https://doi.org/10.1049/IET-SEN.2018.5043","url":null,"abstract":"The object-oriented (OO) systems have emerged as the core systems in every field. Test case generation (TCG) for these systems has been identified as one of the crucial activity of software testing. Many researchers have been working in the area of TCG to raise the quality and effectiveness of the OO software systems. It is impossible to test the system exhaustively because of limitations of time, monetary cost and human efforts involved in the process of generation of all test cases. Presently, there is no adequate method that considers the contextual demand for the generation of test cases. Therefore, this study proposes a contextual demand-based TCG for OO systems using test paths or scenarios of sequence diagrams (SDs). Unlike the existing approaches, the proposed method considers flexible approach for generation of test cases as per the contextual demand. For the implementation of the proposed technique, two case studies, i.e. the sample SD and the SD of automated teller machine (ATM) system, have been considered. The evaluation of the proposed method showed the significant consideration of the user demand for generating the final test cases.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"95 1","pages":"403-413"},"PeriodicalIF":0.0,"publicationDate":"2019-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76093949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-03-25DOI: 10.1049/IET-SEN.2018.5144
Çagdas Üsfekes, Eray Tüzün, Murat Yilmaz, Yagup Macit, Paul M. Clarke
Today, one of the challenges in software engineering is utilising application lifecycle management (ALM) tools effectively in software development. In particular, it is hard for software developers to engage with the work items that are appointed to themselves in these ALM tools. In this study, the authors have focused on bug tracking in ALM where one of the most important metrics is mean time to resolution that is the average time to fix a reported bug. To improve this metric, they developed a serious game application based on an auction-based reward mechanism. The ultimate aim of this approach is to create an incentive structure for software practitioners to find and resolved bugs that are auctioned where participants are encouraged to solve and test more bugs in less time and improve quality of software development in a competitive environment. They conduct hypothesis tests by performing a Monte Carlo simulation. The preliminary results of this research support the idea that using a gamification approach for an issue tracking system enhances the productivity and decreases mean time to resolution.
{"title":"Auction-based serious game for bug tracking","authors":"Çagdas Üsfekes, Eray Tüzün, Murat Yilmaz, Yagup Macit, Paul M. Clarke","doi":"10.1049/IET-SEN.2018.5144","DOIUrl":"https://doi.org/10.1049/IET-SEN.2018.5144","url":null,"abstract":"Today, one of the challenges in software engineering is utilising application lifecycle management (ALM) tools effectively in software development. In particular, it is hard for software developers to engage with the work items that are appointed to themselves in these ALM tools. In this study, the authors have focused on bug tracking in ALM where one of the most important metrics is mean time to resolution that is the average time to fix a reported bug. To improve this metric, they developed a serious game application based on an auction-based reward mechanism. The ultimate aim of this approach is to create an incentive structure for software practitioners to find and resolved bugs that are auctioned where participants are encouraged to solve and test more bugs in less time and improve quality of software development in a competitive environment. They conduct hypothesis tests by performing a Monte Carlo simulation. The preliminary results of this research support the idea that using a gamification approach for an issue tracking system enhances the productivity and decreases mean time to resolution.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"4 1","pages":"386-392"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84494344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-02-25DOI: 10.1049/IET-SEN.2018.5261
Shohreh Ajoudanian, M. Abadeh
Recommender systems (RSs) are a significant subclass of the information filtering system. RSs seek to predict the rating or preference that a user would give to an item in various online application community fields. Collaborative filtering (CF) is a technique which predicts user distinctions by learning past user-item relationships. However, it is hard to perceive the comparable interests between customers in light of the fact that the sparsity problem is caused by the deficient number of the relationship between users. It is a challenge which limited the ease of use of CF. This paper proposes a novel fuzzy C-means clustering approach which is used to deal with this sparsity problem by utilising a sparsest sub-graph detection algorithm in defining initial centres of the clustering method. The approach uses adaptability of fuzzy logic to make better personalised recommendations in terms of precision, recall and F-measure. The authors present a case study where GitHub is used to show the effectiveness of authors’ approach. Authors’ model can recommend relevant human resources (HR) to project leaders who have participated in similar projects. The comparative experiment results show that the planned approach will effectively solve the sparseness drawback and produce suitable coverage rate and recommendation quality.
{"title":"Recommending human resources to project leaders using a collaborative filtering-based recommender system: Case study of gitHub","authors":"Shohreh Ajoudanian, M. Abadeh","doi":"10.1049/IET-SEN.2018.5261","DOIUrl":"https://doi.org/10.1049/IET-SEN.2018.5261","url":null,"abstract":"Recommender systems (RSs) are a significant subclass of the information filtering system. RSs seek to predict the rating or preference that a user would give to an item in various online application community fields. Collaborative filtering (CF) is a technique which predicts user distinctions by learning past user-item relationships. However, it is hard to perceive the comparable interests between customers in light of the fact that the sparsity problem is caused by the deficient number of the relationship between users. It is a challenge which limited the ease of use of CF. This paper proposes a novel fuzzy C-means clustering approach which is used to deal with this sparsity problem by utilising a sparsest sub-graph detection algorithm in defining initial centres of the clustering method. The approach uses adaptability of fuzzy logic to make better personalised recommendations in terms of precision, recall and F-measure. The authors present a case study where GitHub is used to show the effectiveness of authors’ approach. Authors’ model can recommend relevant human resources (HR) to project leaders who have participated in similar projects. The comparative experiment results show that the planned approach will effectively solve the sparseness drawback and produce suitable coverage rate and recommendation quality.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"11 1","pages":"379-385"},"PeriodicalIF":0.0,"publicationDate":"2019-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84015509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-25DOI: 10.1049/IET-SEN.2018.5161
Marwa Hentati, Abdelwaheb Trabelsi, Lassaad Ben Ammar, A. Mahfoudhi
Search-based Software Engineering stands for an important area of research which involves finding optimal solutions for software engineering problems according to a set of conflicting objectives. One of these problems is improving the software quality such as usability of user interfaces following the model-driven engineering (MDE) paradigm. Transforming models consist of a set of transformation rules that describe how a component from a source model can be transformed into one or several target models. Although alternative target models may be equivalent from the functional viewpoint, they may differ from the non-functional perspectives. Besides, they do not fulfil the same usability aspects. In this context, search-based algorithms aim to identify which alternative transformation will produce a highly-usable target model. This study addresses this issue by combining the power of model transformations engine and search-based techniques. Specifically, the proposed approach defines model transformation as a usability optimisation problem. It allows the search of the optimal alternative transformation from a large search space taking into account a set of required usability attributes and using an evolutionary algorithm.
{"title":"Search-based software engineering for optimising usability of user interfaces within model transformations","authors":"Marwa Hentati, Abdelwaheb Trabelsi, Lassaad Ben Ammar, A. Mahfoudhi","doi":"10.1049/IET-SEN.2018.5161","DOIUrl":"https://doi.org/10.1049/IET-SEN.2018.5161","url":null,"abstract":"Search-based Software Engineering stands for an important area of research which involves finding optimal solutions for software engineering problems according to a set of conflicting objectives. One of these problems is improving the software quality such as usability of user interfaces following the model-driven engineering (MDE) paradigm. Transforming models consist of a set of transformation rules that describe how a component from a source model can be transformed into one or several target models. Although alternative target models may be equivalent from the functional viewpoint, they may differ from the non-functional perspectives. Besides, they do not fulfil the same usability aspects. In this context, search-based algorithms aim to identify which alternative transformation will produce a highly-usable target model. This study addresses this issue by combining the power of model transformations engine and search-based techniques. Specifically, the proposed approach defines model transformation as a usability optimisation problem. It allows the search of the optimal alternative transformation from a large search space taking into account a set of required usability attributes and using an evolutionary algorithm.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"107 1","pages":"368-378"},"PeriodicalIF":0.0,"publicationDate":"2019-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80478644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-01DOI: 10.1049/iet-sen.2015.0171
Ankur Choudhary, A. Baghel, O. Sangwan
The primary challenge of software reliability growth model is to find the unknown model parameters that are used to validate on software failure dataset. Though, numerical estimation technique plays a vital role in parameter estimation of software reliability growth models, they are not optimal as they suffer from constraints sucha as sample size, biasing, and initialisation of parameters. In this study, a parameter estimation of software reliability growth model that utilises a variant of harmony search is proposed. Extensive experiments are conducted on seven different software datasets of varying complexity. A robust experimental setup is developed employing an orthogonal array and Taguchi method. Two-fold performance comparisons are performed. First, the authors tested their proposed approach against Cuckoo search and numerical method (least square estimation) considering mean square error and Theil's statistics as a quality measure. Second, the authors applied statistical tests are performed that demonstrate the superiority of their approach over the others. The underlying motivation to conduct this study is to motivate researchers to utilise their approach for a better estimation of model parameters.
{"title":"Efficient parameter estimation of software reliability growth models using harmony search","authors":"Ankur Choudhary, A. Baghel, O. Sangwan","doi":"10.1049/iet-sen.2015.0171","DOIUrl":"https://doi.org/10.1049/iet-sen.2015.0171","url":null,"abstract":"The primary challenge of software reliability growth model is to find the unknown model parameters that are used to validate on software failure dataset. Though, numerical estimation technique plays a vital role in parameter estimation of software reliability growth models, they are not optimal as they suffer from constraints sucha as sample size, biasing, and initialisation of parameters. In this study, a parameter estimation of software reliability growth model that utilises a variant of harmony search is proposed. Extensive experiments are conducted on seven different software datasets of varying complexity. A robust experimental setup is developed employing an orthogonal array and Taguchi method. Two-fold performance comparisons are performed. First, the authors tested their proposed approach against Cuckoo search and numerical method (least square estimation) considering mean square error and Theil's statistics as a quality measure. Second, the authors applied statistical tests are performed that demonstrate the superiority of their approach over the others. The underlying motivation to conduct this study is to motivate researchers to utilise their approach for a better estimation of model parameters.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"12 8 1","pages":"286-291"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90481877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：