Speakers - Revision history

Radu iosif at 18:21, 10 March 2014

2014-03-10T18:21:41Z

Radu iosif at 13:05, 6 March 2014

2014-03-06T13:05:03Z

Radu iosif at 14:27, 5 March 2014

2014-03-05T14:27:19Z

Radu iosif at 14:27, 5 March 2014

2014-03-05T14:27:06Z

Radu iosif at 14:25, 5 March 2014

2014-03-05T14:25:00Z

Radu iosif at 14:24, 5 March 2014

2014-03-05T14:24:10Z

Radu iosif: 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..."

2014-03-05T14:22:19Z

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..."

New page

== Invited Speakers ==

[http://cgi.di.uoa.gr/~smaragd/ '''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.

← Older revision		Revision as of 18:21, 10 March 2014
Line 11:		Line 11:
	[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~~	+	'''Separation Logic Static Analysis @ Facebook'''
		+
		+	In this tech talk I'll present the current activities of the Static Analysis Tool team for integrating separation logic based program analysis at Facebook. I will present the challenges we have encountered and some technical details of the solutions we have found.

@@ 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''
 '''Declarative Static Program Analysis'''
@@ Line 9: / Line 9: @@
-[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

← Older revision		Revision as of 14:27, 5 March 2014
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 6: / Line 6: @@
 ----
 [http://www.eecs.qmul.ac.uk/~ddino/ddino_homepage/About_me.html '''Dino Distefano'''], Queen Mary University of London and Facebook
 TBA

@@ 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

← Older revision		Revision as of 14:24, 5 March 2014
Line 1:		Line 1:
−
−	~~== Invited Speakers ==~~
−
	[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