… defined in rewriting logic. KOOL has been designed as an experimental language … of the flexibility provided by rewriting logic, which allows for the rapid … of rewriting logic. This support is illustrated with several examples. …
RTA 2007: 246-256 [doi]… by Rewriting-Logic specifications. We propose an automatic procedure for verifying Rewriting-Logic specifications against Reachability-Logic properties. We prove … Reachability Logic is a recently introduced formalism, which is currently used …
In Logic, Rewriting and Concurrency: Festschrift Symposium in Honor of José Meseguer. 2015:… executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification … and equality conditions. Rewriting logic is reflective, in the sense of being …
TCS, 285(2):187-243, 2002. [doi]… , a sublogic of rewriting logic also implemented in Maude. The invariants can … for rewriting-logic specifications also available in the Maude environment. We … logic, a formal specification language implemented in the Maude system. Our …
tap 2010: 135-150 [doi]… This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming languages. Several operational semantics styles are addressed: big-step and small-step …
iandc, 207(2):305-340, 2009. [doi]… The 2nd Rewrite Engines Competition (REC) was celebrated as part of the 7th Workshop on Rewriting Logic and its Applications (WRLA 2008). In this edition of the competition participated ve systems, namely ASF+SDF, Maude, Stratego/XT …
ENTCS, 238(3):281-291, 2009. [doi]… This paper presents the main results and conclusions of the Third Rewrite Engines Competition (REC III). This edition of the competition took place as part of the 8th Workshop on Rewriting Logic and its Applications (WRLA 2010 …
WRLA 2010: 243-261 [doi]