Detection of Redundant Expressions: A Complete and Polynomial-Time Algorithm in SSA
No abstract available.
Related papers
- Partial redundancy elimination in SSA form TOPLAS 1999
- Beyond Induction Variables: Detecting and Classifying Sequences Using a Demand-Driven SSA TOPLAS 1995
- A New Algorithm for Partial Redundancy Elimination based on SSA Form PLDI 1997
- Fast, sound, and effectively complete dynamic race prediction POPL 2020
- An Efficient SSA-Based Algorithm for Complete Global Value Numbering APLAS 2007
- An SSA-based algorithm for optimal speculative code motion under an execution profile PLDI 2011
- Program termination analysis in polynomial time TOPLAS 2007
- Redundant Array Computation Elimination PLDI 2026