首页期刊导航|计算机科学技术学报（英文版）
期刊信息/Journal information
计算机科学技术学报（英文版）
计算机科学技术学报（英文版）

李国杰

双月刊

1000-9000

jcst@ict.ac.cn

010-62610746

100080

北京中关村科学院南路6号 《计算机科学技术学报（英）》编辑部

计算机科学技术学报（英文版）/Journal Journal of Computer Science and TechnologyCSCDCSTPCD北大核心EISCI
查看更多>>Journal of Computer Science and Technology(JCST)是中国计算机科学技术领域国际性学术期刊。 JCST于1986 年创刊, 双月刊, 国内外公开发行, 由Springer Science + Business Media代理国际出版发行。 JCST是中国计算机学会会刊, 由中国科学院计算技术研究所承办。JCST由数十位国际计算机界的著名专家和学者联袂编审，把握世界计算机科学技术最新发展趋势。JCST荟萃了国内外计算机科学技术领域中有指导性和开拓性的学术论著，定期组织热点专辑或专题栏目，部分文章邀请了世界著名计算机科学专家撰写。
正式出版
收录年代

    An Empirical Study on Automated Test Generation Tools for Java:Effectiveness and Challenges

    刘相君余萍马晓星
    715-736页
    查看更多>>摘要：Automated test generation tools enable test automation and further alleviate the low efficiency caused by writing hand-crafted test cases.However,existing automated tools are not mature enough to be widely used by software testing groups.This paper conducts an empirical study on the state-of-the-art automated tools for Java,i.e.,EvoSuite,Randoop,JDoop,JTeXpert,T3,and Tardis.We design a test workflow to facilitate the process,which can automatically run tools for test generation,collect data,and evaluate various metrics.Furthermore,we conduct empirical analysis on these six tools and their related techniques from different aspects,i.e.,code coverage,mutation score,test suite size,read-ability,and real fault detection ability.We discuss about the benefits and drawbacks of hybrid techniques based on experi-mental results.Besides,we introduce our experience in setting up and executing these tools,and summarize their usability and user-friendliness.Finally,we give some insights into automated tools in terms of test suite readability improvement,meaningful assertion generation,test suite reduction for random testing tools,and symbolic execution integration.
      原文链接:
    • 万方数据
    • 维普

    Neighborhood Combination Search for Single-Machine Scheduling with Sequence-Dependent Setup Time

    刘晓路徐宏云陈嘉铭苏宙行...
    737-752页
    查看更多>>摘要：In a local search algorithm,one of its most important features is the definition of its neighborhood which is crucial to the algorithm's performance.In this paper,we present an analysis of neighborhood combination search for solv-ing the single-machine scheduling problem with sequence-dependent setup time with the objective of minimizing total weighted tardiness(SMSWT).First,We propose a new neighborhood structure named Block Swap(B1)which can be con-sidered as an extension of the previously widely used Block Move(B2)neighborhood,and a fast incremental evaluation technique to enhance its evaluation efficiency.Second,based on the Block Swap and Block Move neighborhoods,we present two kinds of neighborhood structures:neighborhood union(denoted by B1UB2)and token-ring search(denoted by B1→B2),both of which are combinations of B1 and B2.Third,we incorporate the neighborhood union and token-ring search into two representative metaheuristic algorithms:the Iterated Local Search Algorithm(ILSnew)and the Hybrid Evolutionary Algorithm(HEAnew)to investigate the performance of the neighborhood union and token-ring search.Exten-sive experiments show the competitiveness of the token-ring search combination mechanism of the two neighborhoods.Tested on the 120 public benchmark instances,our HEAnew has a highly competitive performance in solution quality and computational time compared with both the exact algorithms and recent metaheuristics.We have also tested the HEAnew algorithm with the selected neighborhood combination search to deal with the 64 public benchmark instances of the single-machine scheduling problem with sequence-dependent setup time.HEAnew is able to match the optimal or the best known results for all the 64 instances.In particular,the computational time for reaching the best well-known results for five chal-lenging instances is reduced by at least 61.25％.
      原文链接:
    • 万方数据
    • 维普