Cantitate/Preț
Produs
Total produse
Vezi coșul
Rewriting Logic and Its Applications: 13th International Workshop, WRLA 2020, Virtual Event, October 20-22, 2020, Revised Selected Papers de Santiago Escobar

Rewriting Logic and Its Applications: 13th International Workshop, WRLA 2020, Virtual Event, October 20-22, 2020, Revised Selected Papers: Lecture Notes in Computer Science, cartea 12328

Editat de Santiago Escobar, Narciso Martí Oliet
en Limba Engleză Paperback – 11 dec 2020
This book constitutes selected papers from the 12th International Workshop on Rewriting Logic and Its Applications, WRLA 2020, held in Dublin, Ireland, in April 2020. Due to the COVID-19 pandemic the workshop took place virtually.
The 11 full papers presented in this volume were carefully reviewed and selected from 16 submissions Rewriting logic is a natural model of computation and an expressive semantic framework for concurrency, parallelism, communication, and interaction. It can be used for specifying a wide range of systems and languages in various application fields.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31659 lei

Preț vechi: 39575 lei
-20% Nou

Puncte Express: 475
Preț estimativ în valută:
5601€ • 6585$ • 4906£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030635947
ISBN-10: 3030635945
Pagini: 250
Ilustrații: VII, 217 p. 39 illus., 11 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.33 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Models of rewriting and rewriting logic.- Termination, confluence, coherence, and complexity.- Unification, generalization, and narrowing.- Graph rewriting.- Tree automata.- Rewriting strategies.- Rewriting-based declarative languages.- Explicit-state and symbolic model checking techniques.- Rewriting-based theorem proving, including (co)inductive theorem proving.- Rewriting-based constraint solving and satisfiability.