[EN] Understanding the behavior of software is important for the existing software to be improved. In this paper, we present a trace slicing technique that is suitable for analyzing complex, textually-large computations in rewriting logic, which is a general framework efficiently implemented in the Maude language that seamlessly unifies a wide variety of logics and models of concurrency. Given a Maude execution trace T and a slicing criterion for the trace (i.e., a piece of information that we want to observe in the final computation state), we traverse T from back to front and the backward dependence of the observed information is incrementally computed at each execution step. At the end of the traversal, a simplified trace slice is obtain...
This paper revisits the idea of slicing programs based on their axiomatic semantics, rather than usi...
Web-TLR is a software tool designed for model-checking Web applications that is based on rewriting l...
We present techniques that enable higher-order functional computations to “explain” their work by an...
[EN] Execution traces are an important source of information for program understanding and debugging...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-37036-6_7We p...
In this work we develop Julienne, an online trace slicer for the high performance rewriting logic l...
We present iJulienne, a trace analyzer for conditional rewriting logic theories that can be used to...
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...
[EN] We present ABETS, an assertion-based, dynamic analyzer that helps diagnose errors in Maude prog...
[EN] This is the author’s version of a work that was accepted for publication in . Changes resulting...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-23165-5_3This...
We present ABETS, an assertion-based, dynamic analyzer that helps diagnose errors in Maude programs....
The pervasiveness of computing on the Internet has led to an explosive growth of Web applications t...
This paper revisits the idea of slicing programs based on their axiomatic semantics, rather than usi...
Web-TLR is a software tool designed for model-checking Web applications that is based on rewriting l...
We present techniques that enable higher-order functional computations to “explain” their work by an...
[EN] Execution traces are an important source of information for program understanding and debugging...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-37036-6_7We p...
In this work we develop Julienne, an online trace slicer for the high performance rewriting logic l...
We present iJulienne, a trace analyzer for conditional rewriting logic theories that can be used to...
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...
[EN] We present ABETS, an assertion-based, dynamic analyzer that helps diagnose errors in Maude prog...
[EN] This is the author’s version of a work that was accepted for publication in . Changes resulting...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-23165-5_3This...
We present ABETS, an assertion-based, dynamic analyzer that helps diagnose errors in Maude programs....
The pervasiveness of computing on the Internet has led to an explosive growth of Web applications t...
This paper revisits the idea of slicing programs based on their axiomatic semantics, rather than usi...
Web-TLR is a software tool designed for model-checking Web applications that is based on rewriting l...
We present techniques that enable higher-order functional computations to “explain” their work by an...