Interprocedural Analysis of Asynchronous Programs

Interprocedural Analysis of Asynchronous Programs (2007)

by Ranjit Jhala, et al.

Citations:

18 - 1 self

User correction supplied by mph

Datum	Value	Source
TITLE	Interprocedural Analysis of Asynchronous Programs	user correction
AUTHOR NAME	Ranjit Jhala, et al.	user correction
AUTHOR AFFIL	UC San Diego	user correction
ABSTRACT	An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and “dispatched” in a non-deterministic order by an external scheduler at a later point. We formalize the problem of interprocedural dataflow analysis for asynchronous programs as AIFDS problems, a generalization of the IFDS problems for interprocedural dataflow analysis. We give an algorithm for computing the precise meet-over-valid-paths solution for any AIFDS instance, as well as a demand-driven algorithm for solving the corresponding demand AIFDS instances. Our algorithm can be easily implemented on top of any existing interprocedural dataflow analysis framework. We have implemented the algorithm on top of BLAST, thereby obtaining the first safety verification tool for unbounded asynchronous programs. Though the problem of solving AIFDS instances is EXPSPACE-hard, we find that in practice our technique can efficiently analyze programs by exploiting standard optimizations of interprocedural dataflow analyses.	user correction
YEAR	2007	user correction
CITATIONS	30 found	ParsCit 1.0