Liveness Analysis is classified as which type of Data-Flow Analysis problem?
Liveness analysis propagates information backwards from program exit towards entry using set union (May / Any-Path).
Available Expressions Analysis is classified as which type of Data-Flow Analysis problem?
An expression x + y is available at point p if every path from entry to p evaluates x + y without modifying x or y (Forward Must problem).
Which optimization technique utilizes Available Expressions Analysis to eliminate repeated calculations of identical values?
Available expression data-flow info identifies expressions computed previously along all paths, enabling Common Subexpression Elimination.
What is 'Dead Code' in compiler terminology?
Dead code includes unreachable code and statements whose computed results are never referenced.
Which automatic memory management technique tracks the number of references/pointers directed to each heap-allocated object?
Reference counting maintains a count of active references for each heap block; when the counter drops to 0, the memory is immediately reclaimed.