Logic-Based Program Synthesis and Transformation

This volume constitutes the proceedings of 35th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2025, held in Rende, Italy, during September 910, 2025.

The 17 full papers and 4 short paper included in this book were carefully reviewed and selected from 21 submissions. These papers cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large.

Klappentext

.- Symbolic Computation and Verification Methods in Maude. .- Verifying Smart Contracts in Yul via Transformation to CHC by Interpreter Specialization. .- Implementing a Many-Valued Semantics for Logic Programs with Ordered Disjunction Using ASP. .- Extending the FSyntax/Hiord Approach with Imperative Notation. .- Higher-Order Pattern Unification Modulo Similarity Relations. .- A Completion Procedure for Equational Rewriting Systems with Binders. .- Automated Certification of Logic Programs Groundness Analysis. .- Managing Analysis and Verification Information about Curry Packages. .- Program synthesis for geometric modeling. .- Recurrent Pairs Revisited. .- Logica and LogicLM Program Synthesis Evaluation. .- Characterizing Equivalence of Logically Constrained Terms via Existentially Constrained Terms. .- Focusing Recursive LLM Descents with Plans Expressed as Logic Programs.

Inhalt

.- Symbolic Computation and Verification Methods in Maude.

.- Verifying Smart Contracts in Yul via Transformation to CHC by
Interpreter Specialization.

.- Implementing a Many-Valued Semantics for Logic Programs with
Ordered Disjunction Using ASP.

.- Extending the FSyntax/Hiord Approach with Imperative Notation.

.- Higher-Order Pattern Unification Modulo Similarity Relations.

.- A Completion Procedure for Equational Rewriting Systems with Binders.

.- Automated Certification of Logic Programs Groundness Analysis.

.- Managing Analysis and Verification Information about Curry Packages.

.- Program synthesis for geometric modeling.

.- Recurrent Pairs Revisited.

.- Logica and LogicLM Program Synthesis Evaluation.

.- Characterizing Equivalence of Logically Constrained Terms via
Existentially Constrained Terms.

.- Focusing Recursive LLM Descents with Plans Expressed as Logic
Programs.