The topics of the workshop include, but are not limited to:
A. Foundations
- foundations and models of rewriting and rewriting logic, including termination, confluence, coherence and complexity
- unification, generalization, narrowing, and partial evaluation
- constrained rewriting and symbolic algebra
- graph rewriting
- tree automata
- rewriting strategies
- rewriting-based calculi and explicit substitution
B. Rewriting as a Logical and Semantic Framework
- uses of rewriting and rewriting logic as a logical framework, including deduction modulo
- uses of rewriting as a semantic framework for programming language semantics
- rewriting semantics of concurrency models, distributed systems, and network protocols
- rewriting semantics of real-time, hybrid, and probabilistic systems
- uses of rewriting for compilation and language transformation
C. Rewriting Languages
- rewriting-based declarative languages
- type systems for rewriting
- implementation techniques
- tools supporting rewriting languages
D. Verification Techniques
- verification of confluence, termination, coherence, sufficient completeness, and related properties
- temporal, modal and reachability logics for verifying dynamic properties of rewrite theories
- explicit-state and symbolic model checking techniques for verification of rewrite theories
- rewriting-based theorem proving, including (co)inductive theorem proving
- rewriting-based constraint solving and satisfiability
- rewriting-semantics-based verification and analysis of programs
E. Applications
- applications in logic, mathematics, physics, and biology
- rewriting models of biology, chemistry, and membrane systems
- security specification and verification
- applications to distributed, network, mobile, and cloud computing
- specification and verification of real-time, hybrid, probabilistic, and cyber-physical systems
- specification and verification of critical systems
- applications to model-based software engineering
- applications to engineering and planning.
