Descendants and origins in term rewriting
Information and Computation - Special issue on RTA-98
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
Rewriting-Based Techniques for Runtime Verification
Automated Software Engineering
Parametric Trace Slicing and Monitoring
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Quantitative Pathway Logic for Computational Biology
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Specification and Verification of Web Applications in Rewriting Logic
FM '09 Proceedings of the 2nd World Congress on Formal Methods
A fold/unfold transformation framework for rewrite theories extended to CCT
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Associative-commutative rewriting on large terms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
The maude LTL model checker and its implementation
SPIN'03 Proceedings of the 10th international conference on Model checking software
The maude formal tool environment
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Model-checking web applications with web-TLR
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Backward trace slicing for conditional rewrite theories
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Slicing-Based trace analysis of rewriting logic specifications with JULIENNE
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Using conditional trace slicing for improving Maude programs
Science of Computer Programming
A rewriting logic approach to the formal specification and verification of web applications
Science of Computer Programming
| Hi-index | 0.00 |
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.