Parametric Exploration of Rewriting Logic Computations

Abstract

This paper presents a parameterized technique for the inspection of Rewriting Logic computations that allows the non-deterministic execution of a given rewrite theory to be followed up in different ways. Starting from a selected state in the computation tree, the exploration is driven by a user-defined, inspection criterion that specifies the exploration mode. By selecting different inspection criteria, one can automatically derive useful debugging facilities such as program steppers and more sophisticated dynamic trace slicers that facilitate the detection of control and data dependencies across the computation tree. Our methodology, which is implemented in the Anima graphical tool, allows users to capture the impact of a given criterion, validate input data, and detect improper program behaviors.

Exploring conditional rewriting logic computations

“…A preliminary version of the forward inspection methodology developed in this article first appeared in (Alpuente et al, 2013b) and in its superseded version (Alpuente et al, 2014b). The current approach greatly extends the exploration methodologies of (Alpuente et al, 2013b) and (Alpuente et al, 2014b) in a number of ways.…”

“…• In this article, correctness is formally proven for all the exploration modalities, whereas (Alpuente et al, 2013b) and (Alpuente et al, 2014b) do not provide any formal result for the behavior of the unconditional forward inspection algorithms; • The forward trace slicing technique in this article relies on a unification mechanism to propagate relevant information across the trace slices. This is in contrast with the previous approach that used a much more involved substitution refinement technique.…”

“…The current approach greatly extends the exploration methodologies of (Alpuente et al, 2013b) and (Alpuente et al, 2014b) in a number of ways. The most salient novelties are listed below.…”

“…• The current trace exploration technique applies to conditional rewrite theories while (Alpuente et al, 2013b) and (Alpuente et al, 2014b) can only deal with the much simpler unconditional rewrite theories.…”

A Rewriting-based, Parameterized Exploration Scheme for the Dynamic Analysis of Complex Software Systems

“…Our proposal for trace slicing is aimed at endowing the RWL framework with a new instrument that can be used to analyze Maude execution traces and improve Maude programs. Part II defines a semantics-driven, parameterized trace exploration technique for conditional RWL computations [ABFS13a,ABFS15,ABFS14] that supports both, backward and forward analysis of the computation trace.…”