Complexity of Data Flow Analysis for Non-Separable Frameworks
Bageshri Karkare (Sathe), Uday Khedker
TL;DR
This paper investigates the complexity of data flow analysis in non-separable frameworks, introducing a new measure based on interdependencies among program entities using an Entity Dependence Graph.
Contribution
It defines complexity bounds for non-separable frameworks, extending beyond the existing bounds limited to separable Bit-vector frameworks.
Findings
Introduces Entity Dependence Graph to quantify interdependencies
Provides new complexity bounds for non-separable frameworks
Extends analysis beyond traditional Bit-vector frameworks
Abstract
The complexity of round robin method of intraprocedural data flow analysis is measured in number of iterations over the control flow graph. Existing complexity bounds realistically explain the complexity of only Bit-vector frameworks which are separable. In this paper we define the complexity bounds for non-separable frameworks by quantifying the interdependences among the data flow information of program entities using an Entity Dependence Graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Parallel Computing and Optimization Techniques · Security and Verification in Computing