Maude2Lean：使用精益对 Maude 规范进行定理证明

IF 0.7 4区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-08-30 DOI:10.1016/j.jlamp.2024.101005

Rubén Rubio , Adrián Riesco

{"title":"Maude2Lean：使用精益对 Maude 规范进行定理证明","authors":"Rubén Rubio , Adrián Riesco","doi":"10.1016/j.jlamp.2024.101005","DOIUrl":null,"url":null,"abstract":"<div><p>Maude is a specification language based on rewriting logic whose programs can be executed, model checked, and analyzed with other automated techniques, but not easily theorem proved. On the other hand, Lean is a modern proof assistant based on the calculus of inductive constructions with a wide library of reusable proofs and definitions. This paper presents a translation from the first formalism to the second, and the <span>maude2lean</span> tool that predictably derives a Lean program from a Maude module. Hence, theorems can be proved in Lean about Maude specifications.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"142 ","pages":"Article 101005"},"PeriodicalIF":0.7000,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352220824000592/pdfft?md5=4c71774004ee940c316d76725faf003b&pid=1-s2.0-S2352220824000592-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Maude2Lean: Theorem proving for Maude specifications using Lean\",\"authors\":\"Rubén Rubio , Adrián Riesco\",\"doi\":\"10.1016/j.jlamp.2024.101005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Maude is a specification language based on rewriting logic whose programs can be executed, model checked, and analyzed with other automated techniques, but not easily theorem proved. On the other hand, Lean is a modern proof assistant based on the calculus of inductive constructions with a wide library of reusable proofs and definitions. This paper presents a translation from the first formalism to the second, and the <span>maude2lean</span> tool that predictably derives a Lean program from a Maude module. Hence, theorems can be proved in Lean about Maude specifications.</p></div>\",\"PeriodicalId\":48797,\"journal\":{\"name\":\"Journal of Logical and Algebraic Methods in Programming\",\"volume\":\"142 \",\"pages\":\"Article 101005\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2352220824000592/pdfft?md5=4c71774004ee940c316d76725faf003b&pid=1-s2.0-S2352220824000592-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logical and Algebraic Methods in Programming\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2352220824000592\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logical and Algebraic Methods in Programming","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352220824000592","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

Maude 是一种基于重写逻辑的规范语言，它的程序可以执行、进行模型检查和使用其他自动化技术进行分析，但不容易进行定理证明。另一方面，Lean 是一种基于归纳构造微积分的现代证明助手，拥有大量可重复使用的证明和定义库。本文介绍了从第一种形式主义到第二种形式主义的转换，以及 maude2lean 工具，该工具可预测地从 Maude 模块导出 Lean 程序。因此，可以在 Lean 中证明有关 Maude 规范的定理。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Maude2Lean: Theorem proving for Maude specifications using Lean

Maude is a specification language based on rewriting logic whose programs can be executed, model checked, and analyzed with other automated techniques, but not easily theorem proved. On the other hand, Lean is a modern proof assistant based on the calculus of inductive constructions with a wide library of reusable proofs and definitions. This paper presents a translation from the first formalism to the second, and the maude2lean tool that predictably derives a Lean program from a Maude module. Hence, theorems can be proved in Lean about Maude specifications.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Logical and Algebraic Methods in Programming COMPUTER SCIENCE, THEORY & METHODS-LOGIC

CiteScore

2.60

自引率

22.20%

发文量

期刊介绍： The Journal of Logical and Algebraic Methods in Programming is an international journal whose aim is to publish high quality, original research papers, survey and review articles, tutorial expositions, and historical studies in the areas of logical and algebraic methods and techniques for guaranteeing correctness and performability of programs and in general of computing systems. All aspects will be covered, especially theory and foundations, implementation issues, and applications involving novel ideas.