International Journal of Open Source Software and Processes最新文献_第9页

A Resourceful Approach in Security Testing to Protect Electronic Payment System Against Unforeseen Attack 一种保护电子支付系统免受意外攻击的安全测试方法

International Journal of Open Source Software and Processes Pub Date : 2017-07-01 DOI: 10.4018/IJOSSP.2017070102

Rajat Kumar Behera, A. Sahoo, A. Jena

{"title":"A Resourceful Approach in Security Testing to Protect Electronic Payment System Against Unforeseen Attack","authors":"Rajat Kumar Behera, A. Sahoo, A. Jena","doi":"10.4018/IJOSSP.2017070102","DOIUrl":"https://doi.org/10.4018/IJOSSP.2017070102","url":null,"abstract":"This article describes how electronic payments are financial transactions made over the internet for goods or services. In the digital era, the e-commerce industry has gone beyond the traditional in-store service due to the wide spread of internet-based shopping. Developed countries are greatly relying on e-commerce business and a sizable number of countries have shown concern in regard to the online payment cards such as credit cards, debit cards, e-cash, e-cheques, e-wallets and smart card security. The main downsides are concerns over privacy or a malicious attack and hence safeguard mechanisms are required to protect personal information from falling into the hands of intruders. Before commercializing electronic payment systems (EPS), security tests play a significant role in the software development life cycle to check whether the system is secure and it is safe to use. A resourceful approach covering security policies, secure coding, security attack prevention methodology, security testing tool, security testing metrics, security test case prioritization techniques and a model for effective project management methodology are presented in this article. Early detection and resolution of security weaknesses can be achieved with the authors' proposed approach and would certainly reduce the time, effort and cost of a project. The proposed approach is likely the best-fit implementation of the payment industry, covering channels like B2C (Business to Consumer), C2C (Consumer to Consumer), C2B (Consumer to Business), B2B (Business to Business), People to People (P2P), G2C (Government to Citizen) and C2G (Citizen to Government).","PeriodicalId":53605,"journal":{"name":"International Journal of Open Source Software and Processes","volume":"88 1","pages":"24-48"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79166305","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}

引用次数: 0

A Novel UML Based Approach for Early Detection of Change Prone Classes 一种新的基于UML的易变化类的早期检测方法

International Journal of Open Source Software and Processes Pub Date : 2017-07-01 DOI: 10.4018/IJOSSP.2017070101

Deepa Bura, A. Choudhary, R. K. Singh

引用次数: 4

A Novel Anti-Obfuscation Model for Detecting Malicious Code 一种新的检测恶意代码的抗混淆模型

International Journal of Open Source Software and Processes Pub Date : 2017-04-01 DOI: 10.4018/IJOSSP.2017040102

Yuehan Wang, Tong Li, Yongquan Cai, Zhenhu Ning, Fei Xue, Di Jiao

引用次数: 0

Heuristic Guided Selective Path Exploration for Loop Structure in Coverage Testing 覆盖测试中回路结构的启发式引导选择路径探索

International Journal of Open Source Software and Processes Pub Date : 2017-04-01 DOI: 10.4018/IJOSSP.2017040104

Xuzhou Zhang, Yunzhan Gong, Yawen Wang

{"title":"Heuristic Guided Selective Path Exploration for Loop Structure in Coverage Testing","authors":"Xuzhou Zhang, Yunzhan Gong, Yawen Wang","doi":"10.4018/IJOSSP.2017040104","DOIUrl":"https://doi.org/10.4018/IJOSSP.2017040104","url":null,"abstract":"Static program analysis is a strong technique for analyzing program behavior, but suffers from scalabilityproblem,suchaspathexplosionwhichiscausedbythepresenceofloopsandfunction calls.This article applies the selective executionmechanismandheuristic strategyonexploring pathsthroughloops.Thiscombinatorialstrategytriestoalleviatethepathexplosionproblemfrom threeaspects:1)exploringloopswithdifferentapproachesaccordingtotheirrelativepositiontoa specifictarget;2)combiningstaticanalysis,dynamicexecution,andsymbolicexecutiontodealwith theseparatedprogram;3)applyingaheuristicstrategyonofferingguidanceforthepathexploration. Theseapproachesareintegratedtoautomaticallygeneratepathsforspecifiedtargetsinloopstructure. Experimentalresultsshowthattheauthors’proposedstrategyisavailableforcombinationofdifferent loops.Itoutperformssomeexistingtechniquesonachievingbettercoverageforprogramscontaining loops,andisapplicableinengineering. KEywORdS Heuristic Strategy, Hybrid Strategy, Path Generation, Program Analysis, Symbolic Execution","PeriodicalId":53605,"journal":{"name":"International Journal of Open Source Software and Processes","volume":"33 1","pages":"59-75"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80111212","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}

引用次数: 2

Non-Trivial Software Clone Detection Using Program Dependency Graph 非平凡的软件克隆检测使用程序依赖图

International Journal of Open Source Software and Processes Pub Date : 2017-04-01 DOI: 10.4018/IJOSSP.2017040101

Pratiksha Gautam, H. Saini

{"title":"Non-Trivial Software Clone Detection Using Program Dependency Graph","authors":"Pratiksha Gautam, H. Saini","doi":"10.4018/IJOSSP.2017040101","DOIUrl":"https://doi.org/10.4018/IJOSSP.2017040101","url":null,"abstract":"Codeclonesarecopiedfragmentsthatoccuratdifferentlevelsofabstractionandmayhavedifferent originsinasoftwaresystem.Thisarticlepresentsanapproachwhichshowsthesignificantpartsof sourcecode.Further,byusingsignificantpartsofasourcecode,acontrolflowgraphcanbegenerated. Thiscontrolflowgraphrepresents thestatementsofacode/programintheformofbasicblocks ornodesandtheedgesrepresentthecontrolflowbetweenthosebasicblocks.Ahybridapproach, namedtheProgramDependenceGraph(PDG)isalsopresentedinthisarticleforthedetectionof non-trivialcodeclones.Theprogramdependencygraphapproachconsistsoftwoapproachesasa controldependencygraphandadatadependencygraph.Thecontroldependencygraphisgeneratedby usingacontrolflowgraph.Thisarticleproposesanapproachwhichcaneasilygeneratecontrolflow graphsandbyusingcontrolflowgraphandreducedflowgraphapproach,thetrivialsoftwareclone,a similartextualstructure,canbedetected.Theproposedapproachisbasedonatokenizationconcept. KeywORDS Control Flow, Cyclomatic Complexity, Graph Software Clones, Program Dependency Graph","PeriodicalId":53605,"journal":{"name":"International Journal of Open Source Software and Processes","volume":"5 1","pages":"1-24"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88146203","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}

引用次数: 2

Lock-Free Binary Search Tree Based on Leaf Search 基于叶搜索的无锁二叉搜索树

International Journal of Open Source Software and Processes Pub Date : 2017-04-01 DOI: 10.4018/IJOSSP.2017040103

Yang Zhang, Xin Yu, Dongwen Zhang, Mengmeng Wei, Yanan Liang

{"title":"Lock-Free Binary Search Tree Based on Leaf Search","authors":"Yang Zhang, Xin Yu, Dongwen Zhang, Mengmeng Wei, Yanan Liang","doi":"10.4018/IJOSSP.2017040103","DOIUrl":"https://doi.org/10.4018/IJOSSP.2017040103","url":null,"abstract":"Binary search tree is one of the most important data structures in program design. This article proposesanovellock-freealgorithm,whichcanimplementthelock-freeoperations,suchassearch, insertanddelete,usingcompareandswap(CAS).Unlikethepreviousstudiesofhandlingtheinside nodeinatree,theauthors’algorithmhandlestheinsertanddeleteoperationsbyconsideringofthe subtree.Thisarticlepresentsthedetailsofthelock-freealgorithm,whichcaneffectivelyreducethe contentionbetweentheupdateoperations.Theexperimentcomparesthealgorithmwithothertwo lock-freealgorithmsbythroughput.Evaluationresultsshowthatthethroughputofthealgorithm outperformsthatoftheothertwoconcurrentBSTswhenthenumberofthreadsismorethan4.The authors’algorithmwillbecompetitivewhentheconcurrencyishigh. KeywORdS Binary Search Tree, CAS, Concurrent Data Structure, Lock-Free","PeriodicalId":53605,"journal":{"name":"International Journal of Open Source Software and Processes","volume":"33 1","pages":"44-58"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82277173","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}

引用次数: 0

Evaluating Maintainability of Open Source Software: A Case Study 评估开源软件的可维护性:一个案例研究

International Journal of Open Source Software and Processes Pub Date : 2017-01-01 DOI: 10.4018/IJOSSP.2017010101

Feras Hanandeh, A. Saifan, Mohammed Akour, Noor Khamis Al-Hussein, K. Shatnawi

引用次数: 1

Investigating the Effect of Sensitivity and Severity Analysis on Fault Proneness in Open Source Software 研究开源软件中灵敏度和严重性分析对故障倾向的影响

International Journal of Open Source Software and Processes Pub Date : 2017-01-01 DOI: 10.4018/IJOSSP.2017010103

D. Mala

引用次数: 0

A New Data Mining-Based Framework to Test Case Prioritization Using Software Defect Prediction 基于数据挖掘的软件缺陷预测测试用例优先级划分框架

International Journal of Open Source Software and Processes Pub Date : 2017-01-01 DOI: 10.4018/IJOSSP.2017010102

E. Alsukhni, A. Saifan, Hanadi Alawneh

{"title":"A New Data Mining-Based Framework to Test Case Prioritization Using Software Defect Prediction","authors":"E. Alsukhni, A. Saifan, Hanadi Alawneh","doi":"10.4018/IJOSSP.2017010102","DOIUrl":"https://doi.org/10.4018/IJOSSP.2017010102","url":null,"abstract":"Testcasesdonothavethesameimportancewhenusedtodetectfaultsinsoftware;therefore,itis moreefficienttotestthesystemwiththetestcasesthathavetheabilitytodetectthefaults.This researchproposesanewframeworkthatcombinesdataminingtechniquestoprioritizethetestcases. Itenhancesfaultpredictionanddetectionusingtwodifferenttechniques:1)thedataminingregression classifierthatdependsonsoftwaremetricstopredictdefectivemodules,and2)thek-meansclustering techniquethatisusedtoselectandprioritizetestcasestoidentifythefaultearly.Ourapproachof testcaseprioritizationyieldsgoodresultsincomparisonwithotherstudies.Theauthorsusedthe AveragePercentageofFaultsDetection(APFD)metrictoevaluatetheproposedframework,which resultsin19.9%forallsystemmodulesand25.7%fordefectiveones.Ourresultsgiveusanindication thatitiseffectivetostartthetestingprocesswiththemostdefectivemodulesinsteadoftestingall modulesarbitraryarbitrarily. KeywORDS Data Mining, Software Defect Prediction, Software Testing, Test Case Prioritization","PeriodicalId":53605,"journal":{"name":"International Journal of Open Source Software and Processes","volume":"15 1","pages":"21-41"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84765108","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}

引用次数: 2

Software Reliability Prediction Using Cuckoo Search Optimization, Empirical Mode Decomposition, and ARIMA Model: CS-EEMD-ARIMA Based SRGM 基于杜鹃搜索优化、经验模态分解和ARIMA模型的软件可靠性预测:CS-EEMD-ARIMA的SRGM

International Journal of Open Source Software and Processes Pub Date : 2016-10-01 DOI: 10.4018/IJOSSP.2016100103

Ankur Choudhary, A. Baghel

{"title":"Software Reliability Prediction Using Cuckoo Search Optimization, Empirical Mode Decomposition, and ARIMA Model: CS-EEMD-ARIMA Based SRGM","authors":"Ankur Choudhary, A. Baghel","doi":"10.4018/IJOSSP.2016100103","DOIUrl":"https://doi.org/10.4018/IJOSSP.2016100103","url":null,"abstract":"Thedemandofhighlyreliableandsuperiorqualityopensourcesoftware’sareincreasing daybyday.Thisdemandforcesoftwaredeveloperstoimprovisethereliabilityoftheir software’s.Authorshaveproposedseveralparametricandnon-parametricsoftware reliabilitymodelsbuttheyhavetheirownlimitations,likeparametricmodelsuffer fromunrealisticmodelassumptions,operatingenvironmentconditiondependencies. Incontrasttoparametric,non-parametricmodelsovercometheseissuesbuttheyare computationallycostlier.So,thescopeofoptimizationordevelopmentofnewreliable model still exists. This paper presents an effective software reliability modeling based on Cuckoo Search optimization, Ensemble Empirical Mode Decomposition andARIMAmodelingoftimeseriestoprovidemoreaccurateprediction.Extensive experimentson5realdatasetsisconductedandresultsarecollected.Theanalysisof resultsindicatesthesuperiorityofproposedtechniqueoverexistingparametricand non-parametricmodelsforopensourcesoftware’sandproprietysoftware’s. KEywORDS ARIMA, Cuckoo Search Optimization, EEMD, Software Reliability Growth Model, Time Series Model","PeriodicalId":53605,"journal":{"name":"International Journal of Open Source Software and Processes","volume":"52 1","pages":"39-54"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90418993","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}

引用次数: 2