Campus Event Calendar
Event Entry
What and Who
Dataflow Analysis for Asynchronous Programs
Rupak Majumdar
University of California, L.A.
SWS Distinguished Lecture Series - Spring
Rupak Majumdar is an Assistant Professor in the Department of Computer Science
at the University of California, Los Angeles.
His research interests are in the verification and control of reactive
systems, software verification and programming languages,
logic, and automata theory.
He received the President's Gold Medal from IIT Kanpur, the
Leon O. Chua award from UC Berkeley, and an NSF CAREER award.
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, RG2
Expert Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 28 April 2008
16:00
90 Minutes
G26
57/210
Kaiserslautern
Abstract
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 at the core of many server programs, embedded
systems, and popular programming models for the web (Javascript and AJAX).
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.)
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 at the core of many server programs, embedded
systems, and popular programming models for the web (Javascript and AJAX).
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.)
Contact
Claudia Richter
9325 688
--email hidden
Video Broadcast
Yes
Saarbrücken
E1 5
019
passcode not visible
logged in users only
Brigitta Hansen, 04/16/2008 18:42
Carina Schmitt, 04/16/2008 16:01
Claudia Richter, 04/15/2008 15:36
Claudia Richter, 04/15/2008 15:27 -- Created document.
Carina Schmitt, 04/16/2008 16:01
Claudia Richter, 04/15/2008 15:36
Claudia Richter, 04/15/2008 15:27 -- Created document.