University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Declarative Static Program Analysis

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Declarative Static Program Analysis

Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins .

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

We discuss the benefits of using logic-based declarative languages as a means to specify static program analysis algorithms. The main focus will be on the Doop framework for pointer analysis of Java programs. Doop encodes multiple analysis algorithms for Java declaratively, using Datalog: a logic-based language for defining (recursive) relations. The algorithms are elegantly specified and easy to understand and adapt. With an aggressive optimization methodology, Doop also achieves very high performance—often a factor of 10 faster than other comparable frameworks. With the help of Doop’s concise algorithm representation we have explored several new analysis algorithms and developed important insights on existing algorithm variations.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Purple Penguin in person & via zoom Online, please register at https://tinyurl.com/24FebPoetry

Other talks

Discussion II continued Title to be confirmed: The Ghost Collider Discussion I Title to be confirmed The elephant in the room: Machine Learning directly into physical models How Far Can Good Go Without God? The Limits of a Naturalistic Ethic
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity