Causal Dataflow Analysis for Concurrent Programs

Farzan, Azadeh; Madhusudan, P.

Permalink

https://hdl.handle.net/2142/11347 Copy

Description

Title

Causal Dataflow Analysis for Concurrent Programs

Author(s)

• Farzan, Azadeh
• Madhusudan, P.

Issue Date

2007-01

Keyword(s)

• dataflow analysis
• computer science

Abstract

We define a novel formulation of dataflow analysis for concurrent programs, where the flow of facts is along the causal dependencies of events. We capture the control flow of concurrent programs using a Petri net (called the control net), develop algorithms based on partially-ordered unfoldings, and report experimental results for solving causal dataflow analysis problems. For the subclass of distributive problems, we prove that complexity of checking data flow is linear in the number of facts and in the unfolding of the control net.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11347

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections