Cantitate/Preț
Produs

Rewriting Logic and Its Applications: 14th International Workshop, WRLA 2022, Munich, Germany, April 2–3, 2022, Revised Selected Papers: Lecture Notes in Computer Science, cartea 13252

Editat de Kyungmin Bae
en Limba Engleză Paperback – 30 iul 2022
This book constitutes selected papers from the refereed proceedings of the 14th International Workshop on Rewriting Logic and Its Applications, WRLA 2022, held in Munich, Germany, in April 2022.

The 9 full papers included in this book were carefully reviewed and selected from 13 submissions. They focus on topics in rewriting logic and its applications. The book also contains 2 invited papers, 2 invited tutorials and an experience report.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 45710 lei

Preț vechi: 57137 lei
-20% Nou

Puncte Express: 686

Preț estimativ în valută:
8748 9229$ 7290£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031124402
ISBN-10: 3031124405
Pagini: 295
Ilustrații: VIII, 295 p. 39 illus., 14 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.43 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

​Invited Papers.- From Static to Dynamic Analysis and Allocation of Resources for BPMN Processes.- Rewriting Privacy.- Invited Tutorials and Experience Report.- Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method.- An Overview of the Maude Strategy Language and its Applications.- Teaching Formal Methods to Undergraduate Students Using Maude.- Regular Papers.- Business Processes Analysis with Resource-aware Machine Learning Scheduling in Rewriting Logic.- Modeling, Algorithm Synthesis, and Instrumentation for Co-simulation in Maude.- An Efficient Canonical Narrowing Implementation for Protocol Analysis.- Checking Sufficient Completeness by Inductive Theorem Proving.- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies.- Automating Safety Proofs about Cyber-Physical Systems using Rewriting ModuloSMT.- Executable Semantics and Type Checking for Session-Based Concurrency in Maude.- Tool Papers.- Parallel Maude-NPA for Cryptographic Protocol Analysis.- Maude as a Library: An Efficient All-Purpose Programming Interface.