[PL-sem-jr] Talk Monday, 2/23: Dimitris on CFA2
turon at ccs.neu.edu
Sun Feb 22 12:00:09 EST 2009
Tomorrow, Monday 2/23, Dimitris will give a talk about his recent work
with Olin on an analysis called CFA2. As usual, the talk will be held
in WVH166 from 2:30-4:30. Please join us!
kCFA approximates a program by a control-flow graph. Executions are
paths from the start to the end node of this graph, therefore they are
strings in a regular language. This is a rough approximation: in
programs with procedures we would like to express the invariant that
call states have corresponding return states. This call/return
matching requires executions to be strings in a context-free language.
In this talk, I will show some examples of the limitations of kCFA.
Then I will present CFA2, a new control-flow analysis that is able to
match an unbounded number of calls and returns.
3/2 Spring break
3/9 Stephen - calculus of communicating systems
3/16 Dan - (co)monads
3/23 Feng - pi calculus
More information about the Pl-sem-jr