Rewriting Logic and Its Applications 13th International Workshop, WRLA 2020, Virtual Event, October 20-22, 2020, Revised Selected Papers /
Rewriting Logic and Its Applications 13th International Workshop, WRLA 2020, Virtual Event, October 20-22, 2020, Revised Selected Papers / [electronic resource] :
edited by Santiago Escobar, Narciso MartÃ-Oliet.
- 1st ed. 2020.
- VII, 217 p. 39 illus., 11 illus. in color. online resource.
- Theoretical Computer Science and General Issues, 12328 2512-2029 ; .
- Theoretical Computer Science and General Issues, 12328 .
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.
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.
9783030635954
10.1007/978-3-030-63595-4 doi
Computer science.
Computer Science Logic and Foundations of Programming.
QA75.5-76.95
004.0151
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.
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.
9783030635954
10.1007/978-3-030-63595-4 doi
Computer science.
Computer Science Logic and Foundations of Programming.
QA75.5-76.95
004.0151