Common static program analyses such as reaching-definition analysis and live-variables analysis require alias information. Two names (L-valued expressions) are said to alias each other at a particular point during program execution if both may, or must, have the same value. Landi [1] recently established that “may” and “must” alias problems are undecidable for languages that permit “if” statements, loops, dynamic storage, and recursive data structures. Ramalingam presents a simpler and very elegant proof of the same result. The approach taken is to reduce Post’s Correspondence Problem (PCP), which is undecidable, to the “may” and “must” alias problems. The proof is supported by a program example in C. If you are working in the field of static program analysis, be sure to take a look at this short and easy-to-read paper.