Eliminating dead code on recursive data.

DOI10.1016/S0167-6423(02)00134-XMaRDI QIDQ1398677zbMATH OpenOpenAlexFDO

Authors Yanhong A. Liu, Scott D. Stoller

Publication date 7 August 2003

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6423(02)00134-x

zbMATH Keywords

ConstraintsProgram analysisSlicingDead-code eliminationRecursive data structuresRegular-tree grammars

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• scientific article; zbMATH DE number 1832226
• Refinement types for program analysis
• Eliminating partially dead code in explicitly parallel programs
• scientific article; zbMATH DE number 1301731
• Dead code elimination based pointer analysis for multithreaded programs

Cited in

(5)

• Dynamic slicing of lazy functional programs based on redex trails
• Compiler Construction
• A new approach to recursion removal
• Static slicing of rewrite systems
• scientific article; zbMATH DE number 1832226 (Why is no real title available?)

This page was built for publication: Eliminating dead code on recursive data.

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