Complexity of Data Flow Analysis for Non-Separable Frameworks

Simple item page
dc.creatorKarkare, Bageshri
dc.creatorKhedker, Uday
dc.date2006-10-30
dc.date2006-10-31
dc.date.accessioned2026-07-07T07:27:56Z
dc.date.available2026-07-07T07:27:56Z
dc.descriptionThe 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.
dc.descriptionPublished in the International Conference on Programming Languages and Compilers (PLC) 2006, Las Vegas, U.S.A
dc.identifierhttps://arxiv.org/abs/cs/0610164
dc.identifierhttp://arxiv.org/abs/cs/0610164
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117552
dc.subjectProgramming Languages
dc.titleComplexity of Data Flow Analysis for Non-Separable Frameworks
dc.typetext

Files

Collections

arXiv