{"title":"基于规则的反应性系统的系统增量验证","authors":"R. Hall","doi":"10.1109/KBSE.1994.342676","DOIUrl":null,"url":null,"abstract":"Validating the specification of a reactive system, such as a telephone switching system, traffic controller, or automated network service, is difficult, primarily because it is extremely hard even to state a complete and correct set of requirements, let alone to prove that a specification satisfies them. A previous paper, R.J. Hall(1993), described a new validation proof technique, sound scenario generalization, which computes and proves a general validation lemma from a specific requirement-scenario and a candidate specification. That paper left open how the user should employ the technique to systematically validate a complete system. This paper describes an approach, based on a novel knowledge structure called a library of generalized scenario fragments, that combines the advantages of traditional software testing and automated theorem proving of specifications, avoiding most of their shortcomings. I also describe preliminary experience with ISAT-VA, a prototype of such an assistant.<<ETX>>","PeriodicalId":412417,"journal":{"name":"Proceedings KBSE '94. Ninth Knowledge-Based Software Engineering Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Systematic incremental validation of rule-based reactive systems\",\"authors\":\"R. Hall\",\"doi\":\"10.1109/KBSE.1994.342676\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Validating the specification of a reactive system, such as a telephone switching system, traffic controller, or automated network service, is difficult, primarily because it is extremely hard even to state a complete and correct set of requirements, let alone to prove that a specification satisfies them. A previous paper, R.J. Hall(1993), described a new validation proof technique, sound scenario generalization, which computes and proves a general validation lemma from a specific requirement-scenario and a candidate specification. That paper left open how the user should employ the technique to systematically validate a complete system. This paper describes an approach, based on a novel knowledge structure called a library of generalized scenario fragments, that combines the advantages of traditional software testing and automated theorem proving of specifications, avoiding most of their shortcomings. I also describe preliminary experience with ISAT-VA, a prototype of such an assistant.<<ETX>>\",\"PeriodicalId\":412417,\"journal\":{\"name\":\"Proceedings KBSE '94. Ninth Knowledge-Based Software Engineering Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings KBSE '94. Ninth Knowledge-Based Software Engineering Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KBSE.1994.342676\",\"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 KBSE '94. Ninth Knowledge-Based Software Engineering Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KBSE.1994.342676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Systematic incremental validation of rule-based reactive systems
Validating the specification of a reactive system, such as a telephone switching system, traffic controller, or automated network service, is difficult, primarily because it is extremely hard even to state a complete and correct set of requirements, let alone to prove that a specification satisfies them. A previous paper, R.J. Hall(1993), described a new validation proof technique, sound scenario generalization, which computes and proves a general validation lemma from a specific requirement-scenario and a candidate specification. That paper left open how the user should employ the technique to systematically validate a complete system. This paper describes an approach, based on a novel knowledge structure called a library of generalized scenario fragments, that combines the advantages of traditional software testing and automated theorem proving of specifications, avoiding most of their shortcomings. I also describe preliminary experience with ISAT-VA, a prototype of such an assistant.<>