We explore a novel approach to higher-order program analysis which brings ideas of on-demand lookup from first-order CFL-reachability program analyses to higher-order programs. The analysis needs to produce only a control-flow graph; it can derive all other information including values of variables directly from the graph. Several challenges had to be overcome, including how to build the control-flow graph on-the-fly and how to deal with nonlocal variables in functions. The resulting analysis is flow- and context-sensitive with a provable polynomial-time bound. The analysis is formalized and proved correct and terminating, and an initial implementation is described.
Wed 20 Jul Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
Wed 20 Jul
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
10:30 - 12:00: Session 1Research Track at Auditorium Loyola Chair(s): Camil DemetrescuSapienza University of Rome | |||
| 10:30 - 10:55 Talk | Higher-Order Demand-Driven Program Analysis Research Track Link to publication DOI Media Attached | ||
| 10:55 - 11:20 Talk | Interprocedural Type Specialization of JavaScript Programs Without Type Analysis Research Track Link to publication DOI Media Attached | ||
| 11:20 - 11:45 Talk | Magic with Dynamo – Flexible Cross-Component Linking for Java with Invokedynamic Research Track Link to publication DOI Pre-print Media Attached | ||
| 11:45 - 12:00 | Awards Research Track | ||