Asynchronous unfold/fold transformation for fixpoint logic

DOI10.1007/978-3-030-99461-7_3OpenAlexW4285235764MaRDI QIDQ2163155

Mahmudul Faisal Al Ameen, Ryosuke Sato, Naoki Kobayashi

Publication date: 10 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-99461-7_3

zbMATH Keywords

fixed point logicunfold/fold transformationsize change graphs

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17)

Uses Software

• z3

Cites Work

• Automating induction for solving Horn clauses
• Sequent calculi for induction and infinite descent
• On Inductive and Coinductive Proofs via Unfold/Fold Transformations
• Solving Horn Clauses on Inductive Data Types Without Induction
• Proving Properties of Co-Logic Programs by Unfold/Fold Transformations
• Fold/Unfold Transformations for Fixpoint Logic
• The size-change principle for program termination
• Tupling calculation eliminates multiple data traversals

This page was built for publication: Asynchronous unfold/fold transformation for fixpoint logic