Difference between revisions of "Speakers"
Radu iosif (Talk | contribs) (Created page with " == Invited Speakers == [http://cgi.di.uoa.gr/~smaragd/ '''Yannis Smaragdakis'''], University of Athens '''Declarative Static Program Analysis''' We discuss the benefits of...") |
Radu iosif (Talk | contribs) |
||
| Line 1: | Line 1: | ||
| − | |||
| − | |||
| − | |||
[http://cgi.di.uoa.gr/~smaragd/ '''Yannis Smaragdakis'''], University of Athens | [http://cgi.di.uoa.gr/~smaragd/ '''Yannis Smaragdakis'''], University of Athens | ||
| Line 7: | Line 4: | ||
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. | 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. | ||
| + | |||
| + | ---- | ||
| + | |||
| + | [http://www.eecs.qmul.ac.uk/~ddino/ddino_homepage/About_me.html ""Dino Distefano""], Queen Mary University of London and Facebook | ||
| + | |||
| + | TBA | ||
Revision as of 16:24, 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
