Maude2Lean: Theorem proving for Maude specifications using Lean

被引:0
作者
Rubio, Ruben [1 ]
Riesco, Adrian [1 ,2 ]
机构
[1] Univ Complutense Madrid, Fac Informat, Madrid, Spain
[2] Univ Complutense Madrid, Inst Tecnol Conocimiento, Madrid, Spain
关键词
Theorem proving; Rewriting logic; Maude; Lean; REWRITING LOGIC; FOUNDATIONS; PROVER;
D O I
10.1016/j.jlamp.2024.101005
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页数:22
相关论文
共 43 条
[11]   The Lean 4 Theorem Prover and Programming Language [J].
de Moura, Leonardo ;
Ullrich, Sebastian .
AUTOMATED DEDUCTION, CADE 28, 2021, 12699 :625-635
[12]   The Lean Theorem Prover (System Description) [J].
de Moura, Leonardo ;
Kong, Soonho ;
Avigad, Jeremy ;
van Doorn, Floris ;
von Raumer, Jakob .
AUTOMATED DEDUCTION - CADE-25, 2015, 9195 :378-388
[13]   Logical foundations of CafeOBJ [J].
Diaconescu, R ;
Futatsugi, K .
THEORETICAL COMPUTER SCIENCE, 2002, 285 (02) :289-318
[14]  
Duran F., 2011, CALCO 2011, P400
[15]  
Duran F., 2024, Algebraic Methods Program., V110, DOI [10.1016/j.jlamp.2019.100497.2024, DOI 10.1016/J.JLAMP.2019.100497.2024]
[16]  
Durán F, 2008, LECT NOTES ARTIF INT, V5195, P313, DOI 10.1007/978-3-540-71070-7_27
[17]   Invariant-Driven Strategies for Maude [J].
Duran, Francisco ;
Roldan, Manuel ;
Vallecillo, Antonio .
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 124 (02) :17-28
[18]   On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories [J].
Duran, Francisco ;
Meseguer, Jose .
JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2012, 81 (7-8) :816-850
[19]  
Eker S., 2004, WRLA 2002, P162
[20]   Symbolic Analysis by Using Folding Narrowing with Irreducibility and SMT Constraints [J].
Escobar, Santiago ;
Lopez-Rueda, Raul ;
Sapina, Julia .
PROCEEDINGS OF THE 9TH ACM SIGPLAN INTERNATIONAL WORKSHOP ON FORMAL TECHNIQUES FOR SAFETY-CRITICAL SYSTEMS, FTSCS 2023, 2023, :14-25