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 libr...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 142; p. 101005
Main Authors Rubio, Rubén, Riesco, Adrián
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.01.2025
Subjects
Lean
Maude
Rewriting logic
Theorem proving
Maude
Rewriting logic
Lean
Theorem proving
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2024.101005