1. Path Algebra for Data Flow Analysis

	Data Flow Analysis involves traversing paths in a
	control flow graph. There are many ways of traversing these
	paths. The goal of this seminar is to study the path
	algebra proposed by Tarjan and contruct suitable examples
	to highlight the basic insights.

2. Control Flow Optimizations

	Most control flow optimizations performed by a compiler are 
	either too simple or are based on adhoc methods. This seminar
	studies the common control flow optimizations with a view of
	identifying common abstractions used in them.

3. Interprocedural Data Analysis

	All practical compilers perform intra-procedural data flow analysis
	with very little analysis being directed at interprocedural information
	since such an analysis has not been found to be practical either in 
	terms of feasibility, or in terms of precision. This seminar is aimed
	at studying the past interprocedural analysis methods.