Graph Transformation: Lecture Notes in Computer Science, cartea 14774
Editat de Russ Harmer, Jens Kosiolen Limba Engleză Paperback – 11 iul 2024
The 10 full papers and 3 short papers included in this book were carefully reviewed and selected from 21 submissions. They were organized in topical sections as follows: Theoretical Advances; Application Domains; and Tool and Blue Skies Presentations.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 402.01 lei
Preț vechi: 502.51 lei
-20%
Puncte Express: 603
Preț estimativ în valută:
71.08€ • 82.15$ • 61.41£
71.08€ • 82.15$ • 61.41£
Carte disponibilă
Livrare economică 13-27 aprilie
Specificații
ISBN-13: 9783031642845
ISBN-10: 3031642848
Pagini: 252
Ilustrații: XII, 239 p. 82 illus., 36 illus. in color.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:2024
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031642848
Pagini: 252
Ilustrații: XII, 239 p. 82 illus., 36 illus. in color.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:2024
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
.- Graphs, logics and transformations for effective risk analysis.
.- Theoretical Advances.
.- Linear-Time Graph Programs for Unbounded-Degree Graphs.
.- A Bigraph Paper of Sorts.
.- Generalized Weighted Type Graphs for Termination of Graph Transformation Systems.
.- Extension and Restriction of Derivations in Adhesive Categories.
.- Causal Graph Dynamics and Kan Extensions.
.- Application Domains.
.- The ‘Causality’ Quagmire for Formalised Bond Graphs.
.- Localized RETE for Incremental Graph Queries.
.- Using application conditions to rank graph transformations for graph repair.
.- Deriving Delay-Robust Timed Graph Transformation System Models.
.- Taint Analysis for Graph APIs Focusing on Broken Access Control.
.- Tool and Blue Skies Presentations.
.- Checking Transaction Isolation Violations with Graph Queries.
.- Can I teach graph rewriting to my chatbot?.
.- A Graph Transformation-Based Engine for the Automated Exploration of Constraint Models.
.- Theoretical Advances.
.- Linear-Time Graph Programs for Unbounded-Degree Graphs.
.- A Bigraph Paper of Sorts.
.- Generalized Weighted Type Graphs for Termination of Graph Transformation Systems.
.- Extension and Restriction of Derivations in Adhesive Categories.
.- Causal Graph Dynamics and Kan Extensions.
.- Application Domains.
.- The ‘Causality’ Quagmire for Formalised Bond Graphs.
.- Localized RETE for Incremental Graph Queries.
.- Using application conditions to rank graph transformations for graph repair.
.- Deriving Delay-Robust Timed Graph Transformation System Models.
.- Taint Analysis for Graph APIs Focusing on Broken Access Control.
.- Tool and Blue Skies Presentations.
.- Checking Transaction Isolation Violations with Graph Queries.
.- Can I teach graph rewriting to my chatbot?.
.- A Graph Transformation-Based Engine for the Automated Exploration of Constraint Models.