Muutke küpsiste eelistusi

Logic-Based Program Synthesis and Transformation: 34th International Symposium, LOPSTR 2024, Milan, Italy, September 910, 2024, Proceedings 2024 ed. [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 241 pages, kõrgus x laius: 235x155 mm, 19 Illustrations, color; 38 Illustrations, black and white; XVI, 241 p. 57 illus., 19 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14919
  • Ilmumisaeg: 07-Sep-2024
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031712935
  • ISBN-13: 9783031712937
Teised raamatud teemal:
  • Pehme köide
  • Hind: 56,11 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 66,01 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 241 pages, kõrgus x laius: 235x155 mm, 19 Illustrations, color; 38 Illustrations, black and white; XVI, 241 p. 57 illus., 19 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14919
  • Ilmumisaeg: 07-Sep-2024
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031712935
  • ISBN-13: 9783031712937
Teised raamatud teemal:
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 910, 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.

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