Eliminating dead code on recursive data.

DOI10.1016/S0167-6423(02)00134-XzbMATH Open1047.68070OpenAlexW2711511635MaRDI QIDQ1398677FDOQ1398677

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

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

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)

Cited In (5)

• Compiler Construction
• Dynamic slicing of lazy functional programs based on redex trails
• A new approach to recursion removal
• Static slicing of rewrite systems
• Title not available (Why is that?)

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)