{"title":"基于扩展有限状态机的混合测试生成方法","authors":"Ana Turlea, F. Ipate, R. Lefticaru","doi":"10.1109/SYNASC.2016.037","DOIUrl":null,"url":null,"abstract":"This paper presents a hybrid test generation approach from extended finite state machines combining genetic algorithms with local search techniques. Many test generation methods (both functional and structural testing methods) use genetic algorithms. Genetic algorithms may take a long time to converge to a global optimum and for a huge neighborhood they can be inefficient or unsuccessful. In this paper we use hybrid genetic algorithms to generate test data for some chosen paths for extended finite state machines. Local search is applied to improve the best individual for each generation of the genetic algorithm.","PeriodicalId":268635,"journal":{"name":"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A Hybrid Test Generation Approach Based on Extended Finite State Machines\",\"authors\":\"Ana Turlea, F. Ipate, R. Lefticaru\",\"doi\":\"10.1109/SYNASC.2016.037\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a hybrid test generation approach from extended finite state machines combining genetic algorithms with local search techniques. Many test generation methods (both functional and structural testing methods) use genetic algorithms. Genetic algorithms may take a long time to converge to a global optimum and for a huge neighborhood they can be inefficient or unsuccessful. In this paper we use hybrid genetic algorithms to generate test data for some chosen paths for extended finite state machines. Local search is applied to improve the best individual for each generation of the genetic algorithm.\",\"PeriodicalId\":268635,\"journal\":{\"name\":\"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2016.037\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2016.037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Hybrid Test Generation Approach Based on Extended Finite State Machines
This paper presents a hybrid test generation approach from extended finite state machines combining genetic algorithms with local search techniques. Many test generation methods (both functional and structural testing methods) use genetic algorithms. Genetic algorithms may take a long time to converge to a global optimum and for a huge neighborhood they can be inefficient or unsuccessful. In this paper we use hybrid genetic algorithms to generate test data for some chosen paths for extended finite state machines. Local search is applied to improve the best individual for each generation of the genetic algorithm.