Table of Contents

Composition of Graph-Transformation-Based DSL Definitions by Amalgamation.- Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude.- Real-Time Maude and Its Applications.- Conditional Narrowing Modulo in Rewriting Logic and Maude.- Language Definitions as Rewrite Theories.- Infinite-State Model Checking of LTLR Formulas Using Narrowing.- Modelling and Verifying Contract-Oriented Systems in Maude.- Towards Static Analysis of Functional Programs Using Tree Automata Completion.- Framework for Mobile Ad hoc Networks in Real-Time Maude.- Strong and Weak Operational Termination of Order-Sorted Rewrite Theories.- 2D Dependency Pairs for Proving Operational Termination of CTRSs.- FunKons: Component-Based Semantics in K.- An Integration of CafeOBJ into Full Maude.- Rewriting Modulo SMT and Open System Analysis.- Formal Specification of Button-Related Fault-Tolerance Micropatterns.- A Formal Semantics of the OSEK/VDX Standard in K Framework and Its Applications.