Eliminating dead code on recursive data.

DOI10.1016/S0167-6423(02)00134-XzbMath1047.68070OpenAlexW2711511635MaRDI QIDQ1398677

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

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

Related Items (2)

Dynamic slicing of lazy functional programs based on redex trails ⋮ Static Slicing of Rewrite Systems

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