A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis
[chapter]
2020
Lecture Notes in Computer Science
Interprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointers analysis. The most widely-used framework for interprocedural data-flow analysis is IFDS, which encompasses distributive data-flow functions over a finite domain. On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts. This setting provides a natural split between
doi:10.1007/978-3-030-44914-8_5
fatcat:a5jbi3gbordb3pxgpddbtr34ba