RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication
Capítulo o parte de un libro (BookPart)
Inspecting rewriting logic computations (in a parametric and stepwise way)
Trace inspection is concerned with techniques that allow the
trace content to be searched for specific components. This paper presents
a rich and highly dynamic, parameterized technique for the trace inspection
of Rewriting Logic theories that allows the non-deterministic
execution of a given unconditional rewrite theory to be followed up in
different ways. Using this technique, an analyst can browse, slice, filter,
or search the traces as they come to life during the program execution.
Starting from a selected state in the computation tree, the navigation of
the trace is driven by a user-defined, inspection criterion that specifies
the required exploration mode. By selecting different inspection criteria,
one can automatically derive a family of practical algorithms such
as program steppers and more sophisticated dynamic trace slicers that
facilitate the dynamic 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
thereby facilitating the detection of improper program behaviors., This work has been partially supported by the EU (FEDER), the Spanish MEC project ref. TIN2010-21062-C02-02, the Spanish MICINN complementary action ref. TIN2009-07495-E, and by Generalitat Valenciana ref. PROMETEO2011/052. This work was carried out during the tenure of D. Ballis’ ERCIM “Alain Bensoussan ”Postdoctoral Fellowship. The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement n. 246016. F. Frechina was supported by FPU-ME grant AP2010-5681.