Cantitate/Preț
Produs

Rewriting Logic and Its Applications: Lecture Notes in Computer Science, cartea 11152

Editat de Vlad Rusu
en Limba Engleză Paperback – 8 sep 2018
This book constitutes revised selected papers from the 12th International Workshop on Rewriting Logic and Its Applications, WRLA 2018, held in Thessaloniki, Greece, in June 2018.
The 12 full papers presented in this volume were carefully reviewed and selected from 21 submissions. They deal with rewriting, a natural model of computation and an expressive semantic framework for concurrency, parallelism, communication, and interaction, and its applications. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32093 lei

Preț vechi: 40117 lei
-20%

Puncte Express: 481

Preț estimativ în valută:
5675 6508$ 4905£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai


Specificații

ISBN-13: 9783319998398
ISBN-10: 3319998390
Pagini: 276
Ilustrații: XII, 261 p. 24 illus.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.42 kg
Ediția:1st ed. 2018
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Benchmarking Implementations of Term Rewriting and Pattern Matching in Algebraic, Functional, and Object-Oriented Languages - The 4th Rewrite Engines Competition.- Automaton and Equation based Approximations for Reachability Analysis.- Multiparadigm Programming in Maude.- MUnit: A Unit testing framework for Maude.- Parameterized Programming for Compositional System Specification.- Specification and Verification of Data-aware BPMN Processes using Rewriting Modulo SMT.- Associative Unification and Symbolic Reasoning Modulo Associativity in Maude.- Proving Structural Properties of Sequent Systems in Rewriting Logic.- Formal Modeling and Analysis of the Walter Transactional Data Store.- Extending Timbuk to Verify Functional Programs.- Generalized Rewrite Theories and Coherence Completion.- Proving Ground Confluence of Equational Specifications Modulo Axioms.- Uniform Strong Normalization for Multi-Discipline Calculi.- Real-time Rewriting Logic Semantics for Spatial Concurrent ConstraintProgramming.- Approximating any Logic Program by a CS-Program.