{"title":"行为驱动开发测试用例的理论验证","authors":"G. Mahalakshmi, V. Vani","doi":"10.1109/ICRTCCM.2017.83","DOIUrl":null,"url":null,"abstract":"Behavior Driven Development insists on generation of early test cases during requirements elicitation. These would form the basis for pseudo use cases in TDD. These early test cases for BDD, aka theoretical test cases, are developed using Named Entity Recognition approaches over expanded use cases. This paper proposes the algorithm for theoretical verification of obtaining the original reduced use case sequences from the obtained BDD test cases.","PeriodicalId":134897,"journal":{"name":"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Theoretical Verification of Test Cases for Behavior Driven Development\",\"authors\":\"G. Mahalakshmi, V. Vani\",\"doi\":\"10.1109/ICRTCCM.2017.83\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Behavior Driven Development insists on generation of early test cases during requirements elicitation. These would form the basis for pseudo use cases in TDD. These early test cases for BDD, aka theoretical test cases, are developed using Named Entity Recognition approaches over expanded use cases. This paper proposes the algorithm for theoretical verification of obtaining the original reduced use case sequences from the obtained BDD test cases.\",\"PeriodicalId\":134897,\"journal\":{\"name\":\"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRTCCM.2017.83\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTCCM.2017.83","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Theoretical Verification of Test Cases for Behavior Driven Development
Behavior Driven Development insists on generation of early test cases during requirements elicitation. These would form the basis for pseudo use cases in TDD. These early test cases for BDD, aka theoretical test cases, are developed using Named Entity Recognition approaches over expanded use cases. This paper proposes the algorithm for theoretical verification of obtaining the original reduced use case sequences from the obtained BDD test cases.