Abstract Reaction Systems (RSs) are a successful computational framework inspired by
biological systems. RSs can involve a large number of reactions and entities, which makes it …

In this paper, we present a novel transformation method for Maude programs featuring both
automatic program diagnosis and correction. The input of our method is a reference …

Reaction systems (RSs) are a computational framework inspired by biochemical
mechanisms. A RS defines a finite set of reactions over a finite set of entities. Typically each …

Cause/effect analysis of complex systems is instrumental in better understanding many
natural phenomena. Moreover, formal analysis requires the availability of suitable abstract …

This work aims to provide a general mechanism for safety enforcement in rewriting logic
computations. Our technique relies on an assertion-guided model transformation that …

We present ABETS, an assertion-based, dynamic analyzer that helps diagnose errors in
Maude programs. ABETS uses slicing to automatically create reduced versions of both a …

The main goal of SMGA is to help human users be able to perceive (non-trivial)
characteristics. The Lim-Jeong-Park-Lee autonomous vehicle intersection control protocol …

State machine graphical animation (SMGA) is a tool that takes a state picture template and a
state sequence of a state machine as inputs and generates a graphical animation of the …

This paper introduces the idea of using assertion checking for enhancing the dynamic
slicing of Maude computation traces. Since trace slicing can greatly simplify the size and …

We develop an automated specialization framework for rewrite theories that model
concurrent systems. A rewrite theory R=(Σ, E⊎ B, R) consists of two main components: an …