Download now Free registration required
The authors present the Doop framework for points-to analysis of Java programs. Doop builds on the idea of specifying pointer analysis algorithms declaratively, using Datalog: a logic-based language for defining (recursive) relations. They carry the declarative approach further than past work by describing the full end-to-end analysis in Datalog and optimizing aggressively using a novel technique that takes into account Datalog incremental evaluation. As a result, Doop achieves several benefits, including full order-of-magnitude improvements in run-time. They compare Doop with Lhotak and Hendren's Paddle, which defines the state of the art for context-sensitive analyses.
- Format: PDF
- Size: 253 KB