2019/05/20 by Sandeep Dasgupta, Dasgupta, Sandeep, Tanmay Gangwani +1
Computer Science · #Advanced Malware Detection Techniques #FOS: Computer and information sciences #Parallel Computing and Optimization Techniques #Programming Languages (cs.PL) #Software Testing and Debugging Techniques
paper · pdf · doi:10.48550/arxiv.1905.08178
openalex publication_date 2019/05/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Partial Redundancy Elimination (PRE) is a compiler optimization that eliminates expressions that are redundant on some but not necessarily all paths through a program. In this project, we implemented a PRE optimization pass in LLVM and measured results on a variety of applications. We chose PRE because it is a powerful technique that subsumes Common Subexpression Elimination (CSE) and Loop Invariant Code Motion (LICM), and hence has the potential to greatly improve performance.