Backward trace slicing for conditional rewrite theories

Authors:
María Alpuente;Demis Ballis;Francisco Frechina;Daniel Romero
Affiliations:
DSIC-ELP, Universitat Politècnica de València, Valencia, Spain;DIMI, Università degli Studi di Udine, Udine, Italy;DSIC-ELP, Universitat Politècnica de València, Valencia, Spain;DSIC-ELP, Universitat Politècnica de València, Valencia, Spain
Venue:
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2012

Citing 12
Cited 3

Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Descendants and origins in term rewriting

Information and Computation - Special issue on RTA-98
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
Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs

IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
Semantic foundations for generalized rewrite theories

Theoretical Computer Science
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
Model-checking web applications with web-TLR

ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
A Maude coherence checker tool for conditional order-sorted rewrite theories

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Backward trace slicing for rewriting logic theories

CADE'11 Proceedings of the 23rd international conference on Automated deduction

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a trace slicing technique for rewriting logic that is suitable for analyzing complex, textually-large system computations in rewrite theories that may contain conditional equations and/or rules. Given a conditional execution trace T and a slicing criterion for the trace (i.e., a set of positions that we want to observe in the final state of the trace), we traverse T from back to front, and at each rewrite step, we incrementally compute the origins of the observed positions, which is done by inductively processing the conditions of the applied equations and rules. During the traversal, we also carry a boolean compatibility condition that is needed for the executability of the processed rewrite steps. At the end of the traversal, the trace slice is obtained by filtering out the irrelevant data that do not contribute to the criterion of interest.