{"title":"你信任你的编译器吗?应用形式化方法来构造高保证的编译器","authors":"J. M. Boyle, R. Resler, V. Winter","doi":"10.1109/HASE.1997.648033","DOIUrl":null,"url":null,"abstract":"Describes how automatic transformation technology can be used to construct a verified compiler for an imperative language. Our approach is to \"transformationally\" pass a source program through a series of canonical forms, each of which correspond to some goal or objective in the compilation process (e.g. introduction of registers, simplification of expressions, etc.). We describe a denotational semantics-based framework in which it is possible to verify the correctness of transformations; the correctness of the compiler follows from the correctness of the transformations.","PeriodicalId":319609,"journal":{"name":"Proceedings 1997 High-Assurance Engineering Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Do you trust your compiler? Applying formal methods to constructing high-assurance compilers\",\"authors\":\"J. M. Boyle, R. Resler, V. Winter\",\"doi\":\"10.1109/HASE.1997.648033\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Describes how automatic transformation technology can be used to construct a verified compiler for an imperative language. Our approach is to \\\"transformationally\\\" pass a source program through a series of canonical forms, each of which correspond to some goal or objective in the compilation process (e.g. introduction of registers, simplification of expressions, etc.). We describe a denotational semantics-based framework in which it is possible to verify the correctness of transformations; the correctness of the compiler follows from the correctness of the transformations.\",\"PeriodicalId\":319609,\"journal\":{\"name\":\"Proceedings 1997 High-Assurance Engineering Workshop\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1997 High-Assurance Engineering Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HASE.1997.648033\",\"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 1997 High-Assurance Engineering Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HASE.1997.648033","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Do you trust your compiler? Applying formal methods to constructing high-assurance compilers
Describes how automatic transformation technology can be used to construct a verified compiler for an imperative language. Our approach is to "transformationally" pass a source program through a series of canonical forms, each of which correspond to some goal or objective in the compilation process (e.g. introduction of registers, simplification of expressions, etc.). We describe a denotational semantics-based framework in which it is possible to verify the correctness of transformations; the correctness of the compiler follows from the correctness of the transformations.