Verkauf durch Sack Fachmedien

Escobar / Titolo

Logic-Based Program Synthesis and Transformation

35th International Symposium, LOPSTR 2025, Rende, Italy, September 9-10, 2025, Proceedings

Medium: Buch
ISBN: 978-3-032-04847-9
Verlag: Springer-Verlag GmbH
Erscheinungstermin: 13.09.2025
vorbestellbar, Erscheinungstermin ca. September 2025

This volume constitutes the proceedings of 35th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2025, held in Rende, Italy, during September 9–10, 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.


Produkteigenschaften


  • Artikelnummer: 9783032048479
  • Medium: Buch
  • ISBN: 978-3-032-04847-9
  • Verlag: Springer-Verlag GmbH
  • Erscheinungstermin: 13.09.2025
  • Sprache(n): Englisch
  • Auflage: Erscheinungsjahr 2025
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert
  • Gewicht: 347 g
  • Seiten: 213
  • Format (B x H x T): 155 x 235 x 13 mm
  • Ausgabetyp: Kein, Unbekannt
Autoren/Hrsg.

Herausgeber

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