Write a Blog >>
Sun 18 Jun 2017 09:50 - 10:10 at Vertex WS216 - Points-to Analysis

We give a declarative model of a rich family of must-alias analyses. Our emphasis is on careful and compact modeling, while exposing the key points where the algorithm can adjust its inference power. The model is executable, in the Datalog language, and forms the basis of a full-fledged must-alias analysis of Java bytecode in the Doop framework.

Slides (soap17-must.pdf)608KiB

Conference Day
Sun 18 Jun

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

09:30 - 10:30
Points-to AnalysisSOAP at Vertex WS216
09:30
20m
Talk
Revisiting Recency Abstraction for JavaScript: Towards an Intuitive, Compositional, and Efficient Heap Abstraction
SOAP
Jihyeok ParkKAIST, South Korea, Xavier RivalINRIA/CNRS/ENS Paris, Sukyoung RyuKAIST
DOI File Attached
09:50
20m
Talk
A Datalog Model of Must-Alias Analysis
SOAP
George BalatsourasUniversity of Athens, Kostas FerlesUniversity of Texas at Austin, USA, George KastrinisUniversity of Athens, Yannis SmaragdakisUniversity of Athens
DOI File Attached
10:10
20m
Talk
An Efficient Tunable Selective Points-to Analysis for Large Codebases
SOAP
Behnaz HassanshahiOracle Labs, Australia, Raghavendra KagalavadiOracle Labs, Australia, Paddy Krishnan, Bernhard ScholzUniversity of Sydney, Australia, Yi LuOracle
DOI File Attached