Newtonian Program Analysis via Tensor Product
Abstract
Recently, Esparza et al. generalized Newton’s method—a numerical-analysis algorithm for finding roots of real-valued functions—to a method for finding fixed-points of systems of equations over semirings. Their method provides a new way to solve interprocedural dataflow-analysis problems. As in its real-valued counterpart, each iteration of their method solves a simpler “linearized” problem.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Mar 21, 2017
- Source ID
- 10.1145/3024084
Entities
People
- Emma Turetsky
- Prathmesh Prabhu
- Thomas Reps
Organizations
- Air Force Research Laboratory
- Australian RL Commission
- Defense Advanced Research Projects Agency
- National Science Foundation
- Office of Naval Research
- University of Wisconsin–Madison
- Wisconsin Alumni Research Foundation