Abstract is missing.
- Composition of Graph-Transformation-Based DSL Definitions by AmalgamationFrancisco Durán. 1-20 [doi]
- Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?Yehia Abd Alrahman, Marina Andric, Alessandro Beggiato, Alberto Lluch-Lafuente. 21-41 [doi]
- Real-Time Maude and Its ApplicationsPeter Csaba Ölveczky. 42-79 [doi]
- Conditional Narrowing Modulo in Rewriting Logic and MaudeLuis Aguirre, Narciso Martí-Oliet, Miguel Palomino, Isabel Pita. 80-96 [doi]
- Language Definitions as Rewrite TheoriesAndrei Arusoaie, Dorel Lucanu, Vlad Rusu, Traian-Florin Serbanuta, Andrei Stefanescu, Grigore Rosu. 97-112 [doi]
- Infinite-State Model Checking of LTLR Formulas Using NarrowingKyungmin Bae, José Meseguer. 113-129 [doi]
- Modelling and Verifying Contract-Oriented Systems in MaudeMassimo Bartoletti, Maurizio Murgia, Alceste Scalas, Roberto Zunino. 130-146 [doi]
- Towards Static Analysis of Functional Programs Using Tree Automata CompletionThomas Genet. 147-161 [doi]
- A Framework for Mobile Ad hoc Networks in Real-Time MaudeSi Liu, Peter Csaba Ölveczky, José Meseguer. 162-177 [doi]
- Strong and Weak Operational Termination of Order-Sorted Rewrite TheoriesSalvador Lucas, José Meseguer. 178-194 [doi]
- 2D Dependency Pairs for Proving Operational Termination of CTRSsSalvador Lucas, José Meseguer. 195-212 [doi]
- FunKons: Component-Based Semantics in KPeter D. Mosses, Ferdinand Vesely. 213-229 [doi]
- An Integration of CafeOBJ into Full MaudeAdrián Riesco. 230-246 [doi]
- Rewriting Modulo SMT and Open System AnalysisCamilo Rocha, José Meseguer, César A. Muñoz. 247-262 [doi]
- Formal Specification of Button-Related Fault-Tolerance MicropatternsMu Sun, José Meseguer. 263-279 [doi]
- A Formal Semantics of the OSEK/VDX Standard in $${\mathbb {K}}$$ Framework and Its ApplicationsMin Zhang 0002, Yunja Choi, Kazuhiro Ogata. 280-296 [doi]