{"title":"基于一套规则的网络服务规范自动抽取系统","authors":"M. Ohba, T. Ohta","doi":"10.1109/AICT.2009.27","DOIUrl":null,"url":null,"abstract":"Proposals have been made to describe services programs in a rule-based language, because it is easier to describe programs in a rule-based language than a procedural language. But, it is difficult to find bugs in programs described in a rule-based language. To solve the problem and to make it easier for service developers to find bugs in programs, service specifications can be elicited from programs described in a rule-based language. This paper proposes a system for automatically eliciting state transition diagrams based on an enhanced state transition model from a set of rules.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Automatic Elicitation System of Network Service Specifications from a Set of Rules\",\"authors\":\"M. Ohba, T. Ohta\",\"doi\":\"10.1109/AICT.2009.27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Proposals have been made to describe services programs in a rule-based language, because it is easier to describe programs in a rule-based language than a procedural language. But, it is difficult to find bugs in programs described in a rule-based language. To solve the problem and to make it easier for service developers to find bugs in programs, service specifications can be elicited from programs described in a rule-based language. This paper proposes a system for automatically eliciting state transition diagrams based on an enhanced state transition model from a set of rules.\",\"PeriodicalId\":409336,\"journal\":{\"name\":\"2009 Fifth Advanced International Conference on Telecommunications\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fifth Advanced International Conference on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICT.2009.27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth Advanced International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICT.2009.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Automatic Elicitation System of Network Service Specifications from a Set of Rules
Proposals have been made to describe services programs in a rule-based language, because it is easier to describe programs in a rule-based language than a procedural language. But, it is difficult to find bugs in programs described in a rule-based language. To solve the problem and to make it easier for service developers to find bugs in programs, service specifications can be elicited from programs described in a rule-based language. This paper proposes a system for automatically eliciting state transition diagrams based on an enhanced state transition model from a set of rules.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
