(University of California)
"Dataflow Analysis for Asynchronous Programs"
(Vortrag im Rahmen
der "Distinguished Lecture Series Spring 2008"
des Max Planck Instituts für Software-Systeme)
An asynchronous or event-driven program is one that contains procedure calls which are not directly executed from the callsite, but stored and ``dispatched" in a non-deterministic order by an external scheduler at a later point.
Asynchronous programs are hard to analyze statically as both the program stack and the number of outstanding asynchronous requests may be unbounded.
We describe an algorithm for precise static analysis for asynchronous programs.
Our algorithm is a generalization of the interprocedural dataflow analysis framework for sequential programs.
Though the problem is theoretically hard, we find that in practice our technique can efficiently analyze programs by exploiting standard optimizations of interprocedural dataflow analyses.
(Joint work with Ranjit Jhala and Pierre Ganty.)
||Freitag, 28. April 2008, 16:00 Uhr
||TU Kaiserslautern, Gebäude 57, Raum 210, (Rotunde)
||Der Vortrag wird live an die Universität des Saarlandes
MPI-Gebäude E1.4 Raum 019 übertragen.