软件推理

R. Hale
{"title":"软件推理","authors":"R. Hale","doi":"10.1109/HOL.1991.596271","DOIUrl":null,"url":null,"abstract":"Although HOL has mostly been used for hardware verification, it is an equally appropriate tool for reasoning about software. Many kinds of programming language semantics (denotational, algebraic, operational, etc.) may be embedded in the HOL logic. Based on these semantics, one can construct tools to support program verification, e.g. using a standard programming logic. Furthermore, by modelling the compilation process in the HOL logac, one can verify that a program’s meaning is in fact preserved when it is compiled and run, thus bridging the gap between hardware and software. The general approach is illustrated for a simple sequential programming language, by describing ats syntax and semantics, its Hoare Logic, and its compilataon.","PeriodicalId":213603,"journal":{"name":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Reasoning About Software\",\"authors\":\"R. Hale\",\"doi\":\"10.1109/HOL.1991.596271\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although HOL has mostly been used for hardware verification, it is an equally appropriate tool for reasoning about software. Many kinds of programming language semantics (denotational, algebraic, operational, etc.) may be embedded in the HOL logic. Based on these semantics, one can construct tools to support program verification, e.g. using a standard programming logic. Furthermore, by modelling the compilation process in the HOL logac, one can verify that a program’s meaning is in fact preserved when it is compiled and run, thus bridging the gap between hardware and software. The general approach is illustrated for a simple sequential programming language, by describing ats syntax and semantics, its Hoare Logic, and its compilataon.\",\"PeriodicalId\":213603,\"journal\":{\"name\":\"1991., International Workshop on the HOL Theorem Proving System and Its Applications\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1991., International Workshop on the HOL Theorem Proving System and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HOL.1991.596271\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1991., International Workshop on the HOL Theorem Proving System and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HOL.1991.596271","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

虽然HOL主要用于硬件验证,但它同样适用于对软件进行推理。许多种编程语言语义(指称的、代数的、运算的等)可以嵌入到HOL逻辑中。基于这些语义,可以构建工具来支持程序验证,例如使用标准编程逻辑。此外,通过在HOL logac中对编译过程进行建模,可以验证程序在编译和运行时实际上保留了其含义,从而弥合了硬件和软件之间的差距。通过描述简单顺序编程语言的语法和语义、Hoare逻辑和编译,说明了一般方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reasoning About Software
Although HOL has mostly been used for hardware verification, it is an equally appropriate tool for reasoning about software. Many kinds of programming language semantics (denotational, algebraic, operational, etc.) may be embedded in the HOL logic. Based on these semantics, one can construct tools to support program verification, e.g. using a standard programming logic. Furthermore, by modelling the compilation process in the HOL logac, one can verify that a program’s meaning is in fact preserved when it is compiled and run, thus bridging the gap between hardware and software. The general approach is illustrated for a simple sequential programming language, by describing ats syntax and semantics, its Hoare Logic, and its compilataon.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信