scientific article; zbMATH DE number 3885296

From MaRDI portal
Publication:3219097





For the purposes of code improvement, program verification or error diagnosis, data flow analysis problems are studied. One problem of this analysis, called reaching definitions, is the following: for a given use, what definitions of data items can potentially supply values for it, that is, what definitions can possibly reach each node of a flow graph. In this paper we propose an algorithm of time complexity \(O(n^ 2)\) for this problem (where n is the number of nodes in a flow graph) based on the concept of region of a reducible flow graph.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219097)