A Datalog Model of Must-Alias 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.
Sun 18 Jun
|09:30 - 09:50|
|09:50 - 10:10|
George BalatsourasUniversity of Athens, Kostas FerlesUniversity of Texas at Austin, USA, George KastrinisUniversity of Athens, Yannis SmaragdakisUniversity of AthensDOI File Attached
|10:10 - 10:30|
Behnaz HassanshahiOracle Labs, Australia, Raghavendra KagalavadiOracle Labs, Australia, Paddy Krishnan, Bernhard ScholzUniversity of Sydney, Australia, Yi LuOracleDOI File Attached