Sun 23 Jun 2019 10:00 - 10:30 at 212B - Session I Chair(s): Neville Grech

In the past 15 years, Datalog has found increasing use in declarative program analyses. While Datalog itself is small and accessible, the tooling required to extract the analysis facts from a program remains complex and requires specialized knowledge in compilers or intermediate representations.In our MetaDL framework (SOAP’19) we have extended Datalog to allow source-level analysis of Datalog within Datalog. To that end, we have introduced syntactic patterns and a relational representation of the program’s AST. Our approach has the potential to facilitate the quick prototyping and development of custom program analyses by general software practitioners. The only requirements are a good command of the object language and first order logic, which many developers already possess.In this talk we describe our MetaDL system, give examples of its usage, and sketch how our approach can be adapted to other programming languages whose frontend is implemented on top of a (reference) attribute grammar system.

Sun 23 Jun

Displayed time zone: Tijuana, Baja California change

09:30 - 11:00
Session IDPA at 212B
Chair(s): Neville Grech University of Athens
09:30
30m
Talk
The K Framework
DPA
Sandeep Dasgupta University of Illinois at Urbana-Champaign, USA
10:00
30m
Talk
MetaDL and Beyond: Custom Program Analyses in Datalog
DPA
Christoph Reichenbach Lund University
10:30
30m
Talk
Datafun: A higher-order functional Datalog
DPA
Michael Arntzenius University of Birmingham, UK