Vlad Rusu
Proceedings of the 12th International Workshop on Rewriting Logic and Its Applications
WRLA, 2018.

@proceedings{WRLA-2018,
	doi           = "10.1007/978-3-319-99840-4",
	editor        = "Vlad Rusu",
	isbn          = "['978-3-319-99839-8', '978-3-319-99840-4']",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 12th International Workshop on Rewriting Logic and Its Applications}",
	volume        = 11152,
	year          = 2018,
}

Contents (14 items)

WRLA-2018-GaravelTA

Benchmarking Implementations of Term Rewriting and Pattern Matching in Algebraic, Functional, and Object-Oriented Languages - The 4th Rewrite Engines Competition (HG, MAT, ISA), pp. 1–25.

WRLA-2018-Escobar

Multi-paradigm Programming in Maude (SE), pp. 26–44.

WRLA-2018-Riesco

MUnit: A Unit Framework for Maude (AR0), pp. 45–58.

WRLA-2018-MartinVM

Parameterized Programming for Compositional System Specification (ÓM, AV, NMO), pp. 59–75.

WRLA-2018-DuranRS

Symbolic Specification and Verification of Data-Aware BPMN Processes Using Rewriting Modulo SMT (FD, CR, GS), pp. 76–97.

WRLA-2018-DuranEEMMT

Associative Unification and Symbolic Reasoning Modulo Associativity in Maude (FD, SE, SE, NMO, JM, CLT), pp. 98–114.

WRLA-2018-OlartePR

Proving Structural Properties of Sequent Systems in Rewriting Logic (CO, EP, CR), pp. 115–135.

WRLA-2018-LiuOWM

Formal Modeling and Analysis of the Walter Transactional Data Store (SL0, PCÖ, QW0, JM), pp. 136–152.

WRLA-2018-GenetGHC

Extending Timbuk to Verify Functional Programs (TG, TG, TH, SLC), pp. 153–163.

WRLA-2018-Meseguer

Generalized Rewrite Theories and Coherence Completion (JM), pp. 164–183.

WRLA-2018-DuranMR

Proving Ground Confluence of Equational Specifications Modulo Axioms (FD, JM, CR), pp. 184–204.

WRLA-2018-DownenJA

Uniform Strong Normalization for Multi-discipline Calculi (PD, PJF, ZMA), pp. 205–225.

WRLA-2018-Ramirez0RV

Real-Time Rewriting Logic Semantics for Spatial Concurrent Constraint Programming (SR, MR0, CR, FV), pp. 226–244.

WRLA-2018-BoichutPR

Approximating Any Logic Program by a CS-Program (YB, VP, PR), pp. 245–260.