Blogs (28) >>
ECOOP 2016
Sun 17 - Fri 22 July 2016 Rome, Italy
Wed 20 Jul 2016 10:30 - 10:55 at Auditorium Loyola - Session 1 Chair(s): Camil Demetrescu
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

10:30 - 12:00: Session 1Research Track at Auditorium Loyola
Chair(s): Camil DemetrescuSapienza University of Rome
10:30 - 10:55
Higher-Order Demand-Driven Program Analysis[AEC approved]
Research Track
Zachary PalmerSwarthmore College, Scott F. SmithThe Johns Hopkins University
Link to publication DOI Media Attached
10:55 - 11:20
Interprocedural Type Specialization of JavaScript Programs Without Type Analysis
Research Track
Maxime Chevalier-BoisvertUniversity of Montreal, Marc FeeleyUniversité de Montréal
Link to publication DOI Media Attached
11:20 - 11:45
Magic with Dynamo – Flexible Cross-Component Linking for Java with Invokedynamic[AEC approved]
Research Track
Kamil JezekUniversity of West Bohemia, Pilsen, CZ, Jens DietrichMassey University, New Zealand
Link to publication DOI Pre-print Media Attached
11:45 - 12:00
Research Track