This volume contains the proceedings of the Eighth International Workshop on Rewriting Logic and its Applications (WRLA 2010) that was held in Paphos, Cyprus, March 20 21, 2010, as a satellite workshop of the European Joint C- ferences on Theory and Practice of Software (ETAPS 2010). Rewriting logic is a natural semantic framework for representing conc- rency,parallelism,communicationandinteraction,aswellasbeing anexpressive (meta)logical framework for representing logics. It can then be used for spe- fying a wide range of systems and programming languages in various appli- tion ?elds. In recent years, several executable speci?cation languages based on rewriting logic (ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim of the WRLA workshop series is to bring together - searchers with a common interest in rewriting logic and its applications, and to give them the opportunity to present their recent works, discuss future research directions, and exchange ideas. Previous WRLA workshops were held in Asilomar (1996), Pont-a-Mousson ` (1998), Kanazawa (2000), Pisa (2002), Barcelona (2004), Vienna (2006), and Budapest (2008), and their proceedings have been published inElectronic Notes in Theoretical Computer Science. In addition, selected papers from WRLA 1996 have been published in a special issue of Theoretical Computer Science,and selected papers from WRLA 2004 appeared in a special issue of Higher-Order and Symbolic Computation.

Klappentext

This book constitutes the refereed proceedings of the 8th International Workshop on Rewriting Logic and its Applications, WRLA 2010, held as a satellite event of ETAPS 2010, Paphos, Cyprus, in March 2010. The 13 revised full papers presented were carefully reviewed and selected from 29 submissions. The papers are organized in topical sections on termination and narrowing; tools; the K framework; applications and semantics; maude model checking and debugging; and rewrite engines.

Inhalt
Invited Talks.- Rewriting, Inference, and Proof.- Twenty Years of Rewriting Logic.- Termination and Narrowing.- Proving Termination in the Context-Sensitive Dependency Pair Framework.- A Dependency Pair Framework for A???C-Termination.- Folding Variant Narrowing and Optimal Variant Termination.- Tools.- A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications.- A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories.- The K Framework.- K-Maude: A Rewriting Based Tool for Semantics of Programming Languages.- Collecting Semantics under Predicate Abstraction in the K Framework.- Applications and Semantics.- Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuits.- A Formal Pattern Architecture for Safe Medical Systems.- On the Behavioral Semantics of Real-Time Domain Specific Visual Languages.- Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding.- Maude Model Checking and Debugging.- The Linear Temporal Logic of Rewriting Maude Model Checker.- Enhancing the Debugging of Maude Specifications.- Rewrite Engines.- The Third Rewrite Engines Competition.