Backward Trace Slicing for Rewriting Logic Theories
Trace slicing is a widely used technique for execution trace analysis that is effectively used in program debugging, analysis and comprehension. In this paper, we present a backward trace slicing technique that can be used for the analysis of Rewriting Logic theories. Our trace slicing technique allows us to systematically trace back rewrite sequences modulo equational axioms (such as associativity and commutativity) by means of an algorithm that dynamically simplifies the traces by detecting control and data dependencies, and dropping useless data that do not influence the final result. Our methodology is particularly suitable for analyzing complex, textually-large system computations such as those delivered as counter-example traces by Maude model-checkers.
KeywordsExecution Trace Label Procedure Relevant Position Contractum Pattern Rewrite Theory
Unable to display preview. Download preview PDF.
- 1.Alpuente, M., Ballis, D., Espert, J., Romero, D.: Backward trace slicing for RWL rewriting logic theories (Technical Report), http://hdl.handle.net/10251/10770
- 15.Riesco, A., Verdejo, A., Martí-Oliet, N.: Declarative Debugging of Missing Answers for Maude Specifications. In: Proc. RTA 2010, LIPIcs, vol. 6, pp. 277–294 (2010)Google Scholar
- 18.TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)Google Scholar