Abstract
This paper studies iterative methods for the global flow analsis of computer programs. We define a hierarchy of global flow problem classes, each solvable by an appropriate generalization of the node listing method of Kennedy. We show that each of these generalized methods is optimum, among all iterative algorithms, for solving problems within its class. We give lower bounds on the time required by iterative algorithms for each of the problem classes.
Keywords
Iterative methodGeneralizationAlgorithmHierarchyFlow (mathematics)Listing (finance)Computer scienceClass (philosophy)MathematicsMathematical optimizationArtificial intelligence
Related Publications
Preconditioning of Truncated-Newton Methods
In this paper we discuss the use of truncated-Newton methods, a flexible class of iterative methods, in the solution of large-scale unconstrained minimization problems. At each ...
GloptiPoly
GloptiPoly is a Matlab/SeDuMi add-on to build and solve convex linear matrix inequality relaxations of the (generally nonconvex) global optimization problem of minimizing a mult...
Stochastic power control for cellular radio systems
For wireless communication systems, iterative power control algorithms have been proposed to minimize the transmitter power while maintaining reliable communication between mobi...
Go-ICP: Solving 3D Registration Efficiently and Globally Optimally
Registration is a fundamental task in computer vision. The Iterative Closest Point (ICP) algorithm is one of the widely-used methods for solving the registration problem. Based ...
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation
Algorithmic, or automatic, differentiation (AD) is a growing area of theoretical research and software development concerned with the accurate and efficient evaluation of deriva...
Publication Info
- Year
- 1976
- Type
- article
- Citations
- 16
- Access
- Closed
External Links
Citation Metrics
16
OpenAlex
Cite This
Robert E. Tarjan
(1976).
Iterative algorithms for global flow analysis.
.