{"title":"用于规范验证的自动化工具:设计和初步实现","authors":"N. Boudriga, A. Mili, R. Zalila","doi":"10.1109/HICSS.1992.183279","DOIUrl":null,"url":null,"abstract":"A specification is complete if it carries all the information required by the user, and minimal if it carries nothing but the information required by the user. The authors have designed a lifecycle of the requirements specification phase, whose purpose is to help achieve completeness and minimality by the proper use of redundancy. In their view of the lifecycle, the verification and validation group elicits information from the user and matches it against the generated specification to check completeness and minimality. In this paper, the authors give details of this lifecycle, and present an automated system that carries out the proofs of completeness and minimality using Prolog's inference capability.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An automated tool for specification validation: design and preliminary implementation\",\"authors\":\"N. Boudriga, A. Mili, R. Zalila\",\"doi\":\"10.1109/HICSS.1992.183279\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A specification is complete if it carries all the information required by the user, and minimal if it carries nothing but the information required by the user. The authors have designed a lifecycle of the requirements specification phase, whose purpose is to help achieve completeness and minimality by the proper use of redundancy. In their view of the lifecycle, the verification and validation group elicits information from the user and matches it against the generated specification to check completeness and minimality. In this paper, the authors give details of this lifecycle, and present an automated system that carries out the proofs of completeness and minimality using Prolog's inference capability.<<ETX>>\",\"PeriodicalId\":103288,\"journal\":{\"name\":\"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-01-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HICSS.1992.183279\",\"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 of the Twenty-Fifth Hawaii International Conference on System Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1992.183279","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An automated tool for specification validation: design and preliminary implementation
A specification is complete if it carries all the information required by the user, and minimal if it carries nothing but the information required by the user. The authors have designed a lifecycle of the requirements specification phase, whose purpose is to help achieve completeness and minimality by the proper use of redundancy. In their view of the lifecycle, the verification and validation group elicits information from the user and matches it against the generated specification to check completeness and minimality. In this paper, the authors give details of this lifecycle, and present an automated system that carries out the proofs of completeness and minimality using Prolog's inference capability.<>