{"title":"可执行的测试序列用于协议控制和数据流属性的重叠","authors":"Wen-Huei Chen, Cho-Ching Lu","doi":"10.1109/ISCC.2002.1021687","DOIUrl":null,"url":null,"abstract":"We improve an earlier test sequence generation method for testing the conformance of a protocol implementation to its specification modeled by an extended finite state machine (EFSM) represented by a flow digraph. The earlier method produces an executable test sequence (i.e., one that has feasible parameter values) that covers a set of define-clear-use paths of the flow digraph for testing the data portion of the EFSM. We first overlap these define-clear-use paths into a shorter executable test sequence that tests the data portion. Second, we overlap the new test sequence with a set of transition-verifying paths for testing the control portion.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Executable test sequence for the protocol control and data flow property with overlapping\",\"authors\":\"Wen-Huei Chen, Cho-Ching Lu\",\"doi\":\"10.1109/ISCC.2002.1021687\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We improve an earlier test sequence generation method for testing the conformance of a protocol implementation to its specification modeled by an extended finite state machine (EFSM) represented by a flow digraph. The earlier method produces an executable test sequence (i.e., one that has feasible parameter values) that covers a set of define-clear-use paths of the flow digraph for testing the data portion of the EFSM. We first overlap these define-clear-use paths into a shorter executable test sequence that tests the data portion. Second, we overlap the new test sequence with a set of transition-verifying paths for testing the control portion.\",\"PeriodicalId\":261743,\"journal\":{\"name\":\"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC.2002.1021687\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2002.1021687","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Executable test sequence for the protocol control and data flow property with overlapping
We improve an earlier test sequence generation method for testing the conformance of a protocol implementation to its specification modeled by an extended finite state machine (EFSM) represented by a flow digraph. The earlier method produces an executable test sequence (i.e., one that has feasible parameter values) that covers a set of define-clear-use paths of the flow digraph for testing the data portion of the EFSM. We first overlap these define-clear-use paths into a shorter executable test sequence that tests the data portion. Second, we overlap the new test sequence with a set of transition-verifying paths for testing the control portion.