Backward Trace Slicing for Rewriting Logic Theories

Alpuente, María; Ballis, Demis; Espert, Javier; Romero, Daniel

doi:10.1007/978-3-642-22438-6_5

Cited by 21 publications

(50 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Trace slicing [1,2,3,4,5] is a transformation technique for RWL theories that can drastically reduce the size and complexity of entangled, textually-large execution traces by focusing on selected computation aspects. This is done by uncovering data dependences among related parts of the trace w.r.t.…”

Section: Enhancing Trace Slicingmentioning

confidence: 99%

Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis

Alpuente

Ballis

Frechina

et al. 2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. 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 complexity of the analyzed traces, our methodology can be useful for improving the diagnosis of erroneous Maude programs. The proposed methodology is based on (i) a logical notation for specifying two types of user-defined assertions that are imposed on execution runs: functional assertions and system assertions; (ii) a runtime checking technique that dynamically tests the assertions and is provably safe in the sense that all errors flagged are definite violations of the specifications; and (iii) a mechanism based on equational least general generalization that automatically derives accurate criteria for slicing from falsified assertions.

show abstract

Section: Enhancing Trace Slicingmentioning

confidence: 99%

Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis

Alpuente

Ballis

Frechina

et al. 2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The processing of reaction traces produced by DUV and the reference model can be also called trace rewriting (e.g., [10]). This term is used for describing of symbolic trace reducing methods based on some set of rules.…”

Section: Related Workmentioning

confidence: 99%

Simulation-based Hardware Verification Back-end: Diagnostics

Chupilko¹,

Protsenko²

2014

Proceedings of the Spring/Summer Young Researchers' Colloquium on Software Engineering

View full text Add to dashboard Cite

Abstract-Hardware development processes include verification as one of the most important part. Verification is very often done in simulation-based way. After comparison of design behavior and its reference model behavior, the verdict about their correspondence appears. It is very useful to have some means of analyzing potential inconsistency of their output data. It is exactly the subject of this work to supply verification engineers with a method and a back-end tool for diagnostics of incorrect behavior using wave diagrams and reaction trace analysis based on recombination of reaction traces.

show abstract

“…This article offers an up-to-date, comprehensive, and uniform presentation with examples of the backward tracing slicing methodology as developed in [2,9,10,11].…”

Section: Introductionmentioning

confidence: 99%

Using conditional trace slicing for improving Maude programs

Alpuente

Ballis

Frechina

et al. 2014

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

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 obtained by filtering out all the irrelevant data that were found not to influence the data of interest. By narrowing the size of the trace, the slicing technique favors better inspection and debugging activities since most tedious and irrelevant inspections that are routinely performed during diagnosis and bug localization can be eliminated automatically. Moreover, cutting down the execution trace can expose opportunities for further improvement, which we illustrate by means of several examples.

show abstract

Backward Trace Slicing for Rewriting Logic Theories

Cited by 21 publications

References 14 publications

Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis

Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis

Simulation-based Hardware Verification Back-end: Diagnostics

Using conditional trace slicing for improving Maude programs

Contact Info

Product

Resources

About