Static slicing of rewrite systems

DOI10.1016/J.ENTCS.2007.01.010MaRDI QIDQ2873792zbMATH OpenOpenAlexFDO

Authors Diego Cheda, Josep Silva, Germán Vidal

Publication date 24 January 2014

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2007.01.010

zbMATH Keywords

program slicingrewrite systems

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Program Slicing
• Static and dynamic slicing of constraint logic programs
• Forward slicing of functional logic programs by partial evaluation
• Forward slicing of multi-paradigm declarative programs based on partial evaluation
• A novel formal approach to program slicing

Cites work

• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Eliminating dead code on recursive data.
• scientific article; zbMATH DE number 512906 (Why is no real title available?)
• Program Slicing
• Termination of term rewriting using dependency pairs
• The program dependence graph and its use in optimization

Cited in

(9)

• Dynamic slicing of lazy functional programs based on redex trails
• A novel formal approach to program slicing
• Backward trace slicing for conditional rewrite theories
• Forward slicing of multi-paradigm declarative programs based on partial evaluation
• Forward slicing of functional logic programs by partial evaluation
• Backward trace slicing for rewriting logic theories
• Programming Languages and Systems
• FLIC: application to caching of a dynamic dependency analysis for a 3D oriented CRS
• The expression dependence graph

This page was built for publication: Static slicing of rewrite systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873792)