Cantitate/Preț
Produs
Total produse
Vezi coșul
Logic-Based Program Synthesis and Transformation: 32nd International Symposium, LOPSTR 2022, Tbilisi, Georgia, September 21–23, 2022, Proceedings de Alicia Villanueva

Logic-Based Program Synthesis and Transformation: 32nd International Symposium, LOPSTR 2022, Tbilisi, Georgia, September 21–23, 2022, Proceedings: Lecture Notes in Computer Science, cartea 13474

Editat de Alicia Villanueva
en Limba Engleză Paperback – 11 sep 2022
This book constitutes the refereed proceedings of the 32nd International Symposium on Logic-Based Synthesis and Transformation, LOPSTR 2022, which was held during September 21-23, 2022.
The 8 full papers were selected from 17 submissions and cover different 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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34121 lei

Preț vechi: 42652 lei
-20%

Puncte Express: 512
Preț estimativ în valută:
6032€ • 7207$ • 5226£

Carte tipărită la comandă

Livrare economică 14-28 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783031167669
ISBN-10: 303116766X
Pagini: 155
Ilustrații: XIII, 155 p. 31 illus., 16 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.25 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Testing for Robotic Systems.- Automated Termination and Complexity Analysis.- Analysis of Rewrite Systems Analysing Parallel Complexity of Term Rewriting.- Gonnord Confluence Framework: Proving Confluence with CONFident.-Variant-based Equational Anti-unification.- Verification and Synthesis Model Checking Meets Auto-Tuning High-Performance Programs.- Building a Join-Optimizer for Souffl´e.- From Infinity to Choreographies: Extraction for Unbounded Systems.- Logic Programming Typed SLD Resolution: Dynamic Typing for Logic Programming.- On Correctness of Normal Logic Programs.