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 partiallyordered 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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Farzan, A., & Madhusudan, P. (2007). Causal dataflow analysis for concurrent programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4424 LNCS, pp. 102–116). Springer Verlag. https://doi.org/10.1007/978-3-540-71209-1_10
Mendeley helps you to discover research relevant for your work.