{"title":"基础证明代码","authors":"A. Appel","doi":"10.1109/LICS.2001.932501","DOIUrl":null,"url":null,"abstract":"Proof-carrying code is a framework for the mechanical verification of safety properties of machine-language programs, but the problem arises of \"quis custodiat ipsos custodes\" - i.e. who verifies the verifier itself? Foundational proof-carrying code is verification from the smallest possible set of axioms, using the simplest possible verifier and the smallest possible runtime system. I describe many of the mathematical and engineering problems to be solved in the construction of a foundational proof-carrying code system.","PeriodicalId":366313,"journal":{"name":"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"360","resultStr":"{\"title\":\"Foundational proof-carrying code\",\"authors\":\"A. Appel\",\"doi\":\"10.1109/LICS.2001.932501\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Proof-carrying code is a framework for the mechanical verification of safety properties of machine-language programs, but the problem arises of \\\"quis custodiat ipsos custodes\\\" - i.e. who verifies the verifier itself? Foundational proof-carrying code is verification from the smallest possible set of axioms, using the simplest possible verifier and the smallest possible runtime system. I describe many of the mathematical and engineering problems to be solved in the construction of a foundational proof-carrying code system.\",\"PeriodicalId\":366313,\"journal\":{\"name\":\"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"360\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.2001.932501\",\"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 16th Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2001.932501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Proof-carrying code is a framework for the mechanical verification of safety properties of machine-language programs, but the problem arises of "quis custodiat ipsos custodes" - i.e. who verifies the verifier itself? Foundational proof-carrying code is verification from the smallest possible set of axioms, using the simplest possible verifier and the smallest possible runtime system. I describe many of the mathematical and engineering problems to be solved in the construction of a foundational proof-carrying code system.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
