米努斯卡迈向正式验证的编程语言框架

Jan Tušil, Jan Obdržálek
{"title":"米努斯卡迈向正式验证的编程语言框架","authors":"Jan Tušil, Jan Obdržálek","doi":"arxiv-2409.11530","DOIUrl":null,"url":null,"abstract":"Programming language frameworks allow us to generate language tools (e.g.,\ninterpreters) just from a formal description of the syntax and semantics of a\nprogramming language. As these frameworks tend to be quite complex, an issue\narises whether we can trust the generated tools. To address this issue, we\nintroduce a practical formal programming language framework called Minuska,\nwhich always generates a provably correct interpreter given a valid language\ndefinition. This is achieved by (1) defining a language MinusLang for\nexpressing programming language definitions and giving it formal semantics and\n(2) using the Coq proof assistant to implement an interpreter parametric in a\nMinusLang definition and to prove it correct. Minuska provides strong\ncorrectness guarantees and can support nontrivial languages while performing\nwell. This is the extended version of the SEFM24 paper of the same name.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"3 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minuska: Towards a Formally Verified Programming Language Framework\",\"authors\":\"Jan Tušil, Jan Obdržálek\",\"doi\":\"arxiv-2409.11530\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Programming language frameworks allow us to generate language tools (e.g.,\\ninterpreters) just from a formal description of the syntax and semantics of a\\nprogramming language. As these frameworks tend to be quite complex, an issue\\narises whether we can trust the generated tools. To address this issue, we\\nintroduce a practical formal programming language framework called Minuska,\\nwhich always generates a provably correct interpreter given a valid language\\ndefinition. This is achieved by (1) defining a language MinusLang for\\nexpressing programming language definitions and giving it formal semantics and\\n(2) using the Coq proof assistant to implement an interpreter parametric in a\\nMinusLang definition and to prove it correct. Minuska provides strong\\ncorrectness guarantees and can support nontrivial languages while performing\\nwell. This is the extended version of the SEFM24 paper of the same name.\",\"PeriodicalId\":501197,\"journal\":{\"name\":\"arXiv - CS - Programming Languages\",\"volume\":\"3 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Programming Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.11530\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Programming Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11530","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

编程语言框架允许我们仅根据对编程语言语法和语义的正式描述就生成语言工具(如解释器)。由于这些框架往往相当复杂,因此出现了一个问题,即我们是否可以信任生成的工具。为了解决这个问题,我们引入了一个名为 Minuska 的实用形式化编程语言框架,它总能在语言定义有效的情况下生成可证明正确的解释器。这是通过以下方法实现的:(1) 定义 MinusLang 语言来表达编程语言定义,并赋予其形式语义;(2) 使用 Coq 证明助手来实现 MinusLang 定义中的解释器参数,并证明其正确性。Minuska 提供了很强的正确性保证,可以支持非难语言,同时性能良好。本文是 SEFM24 同名论文的扩展版本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Minuska: Towards a Formally Verified Programming Language Framework
Programming language frameworks allow us to generate language tools (e.g., interpreters) just from a formal description of the syntax and semantics of a programming language. As these frameworks tend to be quite complex, an issue arises whether we can trust the generated tools. To address this issue, we introduce a practical formal programming language framework called Minuska, which always generates a provably correct interpreter given a valid language definition. This is achieved by (1) defining a language MinusLang for expressing programming language definitions and giving it formal semantics and (2) using the Coq proof assistant to implement an interpreter parametric in a MinusLang definition and to prove it correct. Minuska provides strong correctness guarantees and can support nontrivial languages while performing well. This is the extended version of the SEFM24 paper of the same name.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Memory Consistency and Program Transformations No Saved Kaleidosope: an 100% Jitted Neural Network Coding Language with Pythonic Syntax Towards Quantum Multiparty Session Types The Incredible Shrinking Context... in a decompiler near you Scheme Pearl: Quantum Continuations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1