2011/05/13 by María Alpuente, Marı́a Alpuente, Demis Ballis +6
Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Security and Verification in Computing #Software Testing and Debugging Techniques #cs.LO
paper · pdf · doi:10.48550/arxiv.1105.2665
17 pages, 1 figure, 5 extra pages for Appendix; Extended version of the CADE 23 paper Backward Trace Slicing for Rewriting Logic Theories
openalex publication_date 2011/05/13 · arxiv created 2011/06/06 · arxiv updated 2011/06/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.