{"title":"符号数学系统在程序验证中的应用","authors":"R. L. London, D. Musser","doi":"10.1145/800182.810412","DOIUrl":null,"url":null,"abstract":"Program verification is a relatively new application area for symbolic mathematical systems. We report on an interactive program verification system, based on the inductive assertion method, which system is implemented using an existing symbolic mathematical language and supporting system, Reduce. Reduce has been augmented with a number of capabilities which are important to program verification, particularly transformations on relational and Boolean expressions. We believe these capabilities would be valuable in other contexts and should be incorporated more widely into symbolic mathematical systems for general use. The program verification application can serve as a guide to an appropriate definition of such capabilities, particularly with regard to the need to distinguish between undefined program variables and polynomial indeterminates. Additional capabilities which would benefit the program verification application include representation of user-defined functions by internal forms which directly incorporate properties such as commutativity and associativity (as is commonly done with plus and times), and a comprehensive facility for defining conditionally applicable transformations","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"21 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"The application of a symbolic mathematical system to program verification\",\"authors\":\"R. L. London, D. Musser\",\"doi\":\"10.1145/800182.810412\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Program verification is a relatively new application area for symbolic mathematical systems. We report on an interactive program verification system, based on the inductive assertion method, which system is implemented using an existing symbolic mathematical language and supporting system, Reduce. Reduce has been augmented with a number of capabilities which are important to program verification, particularly transformations on relational and Boolean expressions. We believe these capabilities would be valuable in other contexts and should be incorporated more widely into symbolic mathematical systems for general use. The program verification application can serve as a guide to an appropriate definition of such capabilities, particularly with regard to the need to distinguish between undefined program variables and polynomial indeterminates. Additional capabilities which would benefit the program verification application include representation of user-defined functions by internal forms which directly incorporate properties such as commutativity and associativity (as is commonly done with plus and times), and a comprehensive facility for defining conditionally applicable transformations\",\"PeriodicalId\":204185,\"journal\":{\"name\":\"ACM '74\",\"volume\":\"21 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '74\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800182.810412\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '74","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800182.810412","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The application of a symbolic mathematical system to program verification
Program verification is a relatively new application area for symbolic mathematical systems. We report on an interactive program verification system, based on the inductive assertion method, which system is implemented using an existing symbolic mathematical language and supporting system, Reduce. Reduce has been augmented with a number of capabilities which are important to program verification, particularly transformations on relational and Boolean expressions. We believe these capabilities would be valuable in other contexts and should be incorporated more widely into symbolic mathematical systems for general use. The program verification application can serve as a guide to an appropriate definition of such capabilities, particularly with regard to the need to distinguish between undefined program variables and polynomial indeterminates. Additional capabilities which would benefit the program verification application include representation of user-defined functions by internal forms which directly incorporate properties such as commutativity and associativity (as is commonly done with plus and times), and a comprehensive facility for defining conditionally applicable transformations