Dynamic Backward Slicing of Rewriting Logic Computations

Details Dynamic Backward Slicing of Rewriting Logic Computations Dynamic Backward Slicing of Rewriting Logic Computations

2011-05-13

arxiv.org/abs/1105.2665v2

Computer Science

Logic in Computer Science

17 pages, 1 figure, 5 extra pages for Appendix; Extended version of the CADE 23 paper Backward Trace Slicing for Rewriting Log

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Dynamic Backward Slicing of Rewriting Logic Computations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamic Backward Slicing of Rewriting Logic Computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Backward Slicing of Rewriting Logic Computations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27016