{"title":"TPBT - a traversal probability based conformance testing method for protocols specified as communicating finite state machines","authors":"Xingang Shi, Jianping Wu, Xia Yin","doi":"10.1109/IPOM.2004.1547626","DOIUrl":null,"url":null,"abstract":"Conformance testing is the procedure to verify whether protocol implementations conform to their specifications. In this paper, we propose a traversal probability based conformance testing method - TPBT, which can be used to test protocols specified as communicating finite state machines (CFSM) efficiently. In fact, TPBT is a random walk based adaptive method, which aims to traverse all transitions in component machines in steps as few as possible. We apply it to two example CFSM models, and the results show that it achieves better performance than other random walk based adaptive methods. Applying TPBT to the mobile IPv6 protocol, all component machines' transitions are traversed within about 600 steps, for which pre-generated test cases are tedious long and error-prone.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Workshop on IP Operations and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPOM.2004.1547626","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Conformance testing is the procedure to verify whether protocol implementations conform to their specifications. In this paper, we propose a traversal probability based conformance testing method - TPBT, which can be used to test protocols specified as communicating finite state machines (CFSM) efficiently. In fact, TPBT is a random walk based adaptive method, which aims to traverse all transitions in component machines in steps as few as possible. We apply it to two example CFSM models, and the results show that it achieves better performance than other random walk based adaptive methods. Applying TPBT to the mobile IPv6 protocol, all component machines' transitions are traversed within about 600 steps, for which pre-generated test cases are tedious long and error-prone.