Welcome to the course homepage. Your instructor is Uday Khedker and TAs are Mradul Maheshwari and Soumya Prasad Ukil. We will meet in SIC 205 (KR Building) every Wednesday and Friday from 9:30 to 10:55. You can see the proposed schedule for the course. We will use the book Data Flow Analysis: Theory and Practice as our text book.
Announcements
(24 Sep 2010). Corrected and updated slides and handouts of general data flow
frameworks that we are covering. Note that these slides may undergo a
change as the lectures progress.
(2 Sep 2010). When we estimate complexity of round robin
iterative algorithm, the measure d(G,T)+1 does not include the
initialization. There was a misleading statement in slides to this
effect in slide 74/107. The first iteration is required to compute
In/Out values and then d(G,T) iterations are required to refine the
values to converge on a fixed point assignment. Detecting the fixed
point assignment requires one additional iteration. I have corrected
the slide (it is now 74/109) and have also included a detailed PRE
example (slides 77/109 and 78/109). The updated slides on theroretical
abstractions
in
data flow analysis and their handout
version are available.
(30 Aug 2010). We will have a make up quiz for bit vector
frameworks on Friday 3 Sept. Our scheduled quiz for the second module
(theoretical abstractions in data flow analyais) will be held on Wed 8
Sept.
(30 Aug 2010). Updated slides on theroretical
abstractions
in
data flow analysis and their handout
version.
(20 Aug 2010). Answers of first quiz have been made available on
moodle.
(18 Aug 2010). The slides on theroretical
abstractions
in data flow analysis and their handout
version are available. Note that
these are initial slides and there may be some changes/corrections as
the course progresses.
(11 Aug 2010). Final slides
on bit vector frameworks and their handout versions are
now available.
(11 Aug 2010). All our quizzes and exams will be open notes and
open books.
(06 Aug 2010). I have corrected the typos that we discovered in
the lecture on 4 Aug and have also enhanced the tutorial problem that
we discussed. The updated
slides
are here. They also include the material for today's lecture.
(30 July 2010). Office Timings. Some students have requested for regular office timings for meeting me without any appointment.
I will be available from 11:00 to 12:00 tomorrow (Saturday, 31 July) in my office (basement of Maths building) for discussions related to the course.
Beginning next week, I will be available in my office as per following schedule:
Thursdays 
11:00 to 13:00 
Friday 
12:00 to 14:00 
(30 July 2010). Corrected
slides
for
todays
lectures.
(29 July 2010). Slides
for
tomorrow's
lecture
(30
July
2010). These slides are cumulative
(i.e. they contain the earlier slides on bit vector framework also).
(28 July 2010). Slides
updated
after
today's
lectures.
(27 July 2010). Slides
for tomorrow's lecture on liveness analysis and program execution
semantics(28 July). These slides will be updated after each
lecture
on bit vector frameworks. Handouts will be made available after I
manage to finish the slides on soundness of data flow analysis.
(23 July 2010). Slides for the
introductory lecture and their handout
version are available.
(21 July 2010). Here is the proposed
schedule
for
the
course. We will use the book Data Flow
Analysis: Theory and Practice as our text book. We have some copies
of
the book in the department library as well as the central library.
(21 July 2010). As you can see from the schedule, we will have four quizzes through the semester. We will also have some prolog based programming assignments. I propose to use the following evaluation scheme for the course:
Assessment

Weightage 
Midsemester Examination 
30% 
End Semester Examination 
40% 
Quizzes (best three out of four) 
15% 
Programming assignments 
15% 
Total 
100% 