Del 14919 i serien Lecture Notes in Computer Science

Logic-Based Program Synthesis and Transformation

34th International Symposium, LOPSTR 2024, Milan, Italy, September 9–10, 2024, Proceedings

Häftad, Engelska, 2024

939 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 34th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2024, held in Milan, Italy, during September 9–10, 2024.The 12 full papers and 1 short paper included in this book were carefully reviewed and selected from 28 submissions. They were organized in topical sections as follows: Synthesis and Transformation; Decision Procedures; Deployment; Specification, Refactoring and Testing; and Term and Graph Rewriting.

Produktinformation

Utgivningsdatum2024-09-07
Mått155 x 235 x 15 mm
Vikt400 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor241
FörlagSpringer International Publishing AG
ISBN9783031712937

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

.- Synthesis and Transformation..- Parallel Assembly Synthesis..- Improving Logic Programs by Adding Functions..- Decision Procedures..- Deciding Knowledge Problems Modulo Classes of Permutative Theories..- Binary Implication Hypergraphs for the Representation and Simplification of Propositional Formulae..- Combined Abstract Congruence Closure for Theories with Associativity or Commutativity..- A Certifying Algorithm for Linear (and Integer) Feasibility in Horn Constraint Systems..- Deployment..- Pick a Flavour: Towards Sustainable Deployment of Cloud-Edge Applications..- Specification, Refactoring and Testing..- An Axiomatic Category-Based Access Control Model for Smart Homes..- Towards Specification-Guarded Refactoring..- Impact and Performance of Randomized Test-Generation Using Prolog..- Term and Graph Rewriting..- Proving Uniqueness of Normal Forms wrt Reduction of Term Rewriting Systems..- Rewriting Induction for Higher-Order Constrained Term Rewriting Systems..- Introducing Quantification into a Hierarchical Graph Rewriting Language..- Introducing Quantification into a Hierarchical Graph Rewriting Language.