Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1145/3088515.3088517 | SOAP@PLDI |
Field | DocType | ISBN |
Programming language,Inference,Computer science,Java bytecode,Alias analysis,Datalog,Executable | Conference | 978-1-4503-5072-3 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
George Balatsouras | 1 | 84 | 4.43 |
Kostas Ferles | 2 | 3 | 2.40 |
George Kastrinis | 3 | 122 | 6.95 |
Yannis Smaragdakis | 4 | 2247 | 147.50 |