Difference between revisions of "Speakers"

From Numerical Transition Systems
Jump to: navigation, search
Line 7: Line 7:
 
----
 
----
  
[http://www.eecs.qmul.ac.uk/~ddino/ddino_homepage/About_me.html ""Dino Distefano""], Queen Mary University of London and Facebook
+
[http://www.eecs.qmul.ac.uk/~ddino/ddino_homepage/About_me.html '''Dino Distefano'''], Queen Mary University of London and Facebook
  
 
TBA
 
TBA

Revision as of 15:25, 5 March 2014

Yannis Smaragdakis, University of Athens

Declarative Static Program Analysis

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.


Dino Distefano, Queen Mary University of London and Facebook

TBA