We present iJulienne, a trace analyzer for conditional rewriting logic theories that can be used to compute abstract views of Maude executions that help users understand and debug programs. Given a Maude execution trace and a slicing criterion which consists of a set of target symbols occurring in a selected state of the trace, iJulienne is able to track back reverse dependences and causality along the trace in order to incrementally generate highly reduced program and trace slices that reconstruct all and only those pieces of information that are needed to deliver the symbols of interest. iJulienne is also endowed with a trace querying mechanism that increases flexibility and reduction power and allows program runs to be examined at ...
We present techniques that enable higher-order functional computations to “explain” their work by an...
This paper revisits the idea of slicing programs based on their axiomatic semantics, rather than usi...
We present techniques that enable higher-order functional compu-tations to “explain ” their work by ...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-37036-6_7We p...
[EN] Execution traces are an important source of information for program understanding and debugging...
[EN] Understanding the behavior of software is important for the existing software to be improved. I...
Trace slicing is a widely used technique for execution trace analysis that is effectively used in pr...
Trace slicing is a widely used technique for execution trace analysis that is effectively used in pr...
Trace exploration is concerned with techniques that allow computation traces to be dynamically searc...
In this work we develop Julienne, an online trace slicer for the high performance rewriting logic l...
The pervasiveness of computing on the Internet has led to an explosive growth of Web applications t...
This paper presents a parameterized technique for the inspection of Rewriting Logic computations tha...
Trace analysis plays a fundamental role in many program analy-sis approaches, such as runtime verifi...
We present a rewriting algorithm for efficiently testing future time Linear Temporal Logic (LTL) for...
We present ABETS, an assertion-based, dynamic analyzer that helps diagnose errors in Maude programs....
We present techniques that enable higher-order functional computations to “explain” their work by an...
This paper revisits the idea of slicing programs based on their axiomatic semantics, rather than usi...
We present techniques that enable higher-order functional compu-tations to “explain ” their work by ...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-37036-6_7We p...
[EN] Execution traces are an important source of information for program understanding and debugging...
[EN] Understanding the behavior of software is important for the existing software to be improved. I...
Trace slicing is a widely used technique for execution trace analysis that is effectively used in pr...
Trace slicing is a widely used technique for execution trace analysis that is effectively used in pr...
Trace exploration is concerned with techniques that allow computation traces to be dynamically searc...
In this work we develop Julienne, an online trace slicer for the high performance rewriting logic l...
The pervasiveness of computing on the Internet has led to an explosive growth of Web applications t...
This paper presents a parameterized technique for the inspection of Rewriting Logic computations tha...
Trace analysis plays a fundamental role in many program analy-sis approaches, such as runtime verifi...
We present a rewriting algorithm for efficiently testing future time Linear Temporal Logic (LTL) for...
We present ABETS, an assertion-based, dynamic analyzer that helps diagnose errors in Maude programs....
We present techniques that enable higher-order functional computations to “explain” their work by an...
This paper revisits the idea of slicing programs based on their axiomatic semantics, rather than usi...
We present techniques that enable higher-order functional compu-tations to “explain ” their work by ...