The advent of modern declarative logical specification languages such as Flix, QL and Soufflé has facilitated the implementation of many rich program analysis tools. Declaratively specified program analysis tools have proven to be flexible enough to faithfully model real world languages, scalable, and less burdensome to extend and maintain. The goal of this workshop is to be the first venue truly dedicated to declaratively specified program analyses, bringing together the key practitioners that are driving this exciting field.

The themes of this workshop form a “vertical integration” in a supply chain of platforms and tools for declarative program analysis, and are as follows:

  • Program analysis frameworks We solicit work on declarative program analysis toolchains and frameworks for analysing various languages, e.g. low/high level languages, or domain-specific languages such as smart contracts.
  • Declarative language infrastructure In addition, we also solicit work on the infrastructure behind the declarative language environments that enable these program analysis frameworks, including datalog compilers/transpilers, databases and runtime environments.
  • Applications Lastly, we solicit talks from practitioners that use these program analysis frameworks to implement practical analysis tools.

Accepted Papers

Title
Assertion-based Guidance of Top-down Horn Clause-based Analysis in CiaoPP
DPA
Datafun: A higher-order functional Datalog
DPA
Fast and Precise Disassembly using Datalog
DPA
Gigahorse: Thorough Smart Contract Decompilation and Security Analyses
DPA
MetaDL and Beyond: Custom Program Analyses in Datalog
DPA
Now You See Me, Now You Don't: Querying with Hybrid Temporal Logic
DPA
Precise Program Reasoning using Probabilistic Methods
DPA
The K Framework
DPA
Tunable abstract abstract machines
DPA
Variant analysis with QL
DPA

Call for Contributions

If you would like to contribute a talk to this workshop, please submit a title and an abstract using the contact form. Talks slots will be 30 minutes, but speakers are encouraged to allow 5-10 minutes for Q&A. We will not publish any proceedings, but slides from talks can be put online on the workshop web site if desired.

Plenary
You're viewing the program in a time zone which is different from your device's time zone - change time zone

Sun 23 Jun
Times are displayed in time zone: Tijuana, Baja California change

08:00 - 09:00
BreakfastCatering at 301 Foyer
09:30 - 11:00
Session IDPA at 212B
Chair(s): Neville GrechUniversity of Athens
09:30
30m
Talk
The K Framework
DPA
Sandeep DasguptaUniversity of Illinois at Urbana-Champaign, USA
10:00
30m
Talk
MetaDL and Beyond: Custom Program Analyses in Datalog
DPA
Christoph ReichenbachLund University
10:30
30m
Talk
Datafun: A higher-order functional Datalog
DPA
Michael ArntzeniusUniversity of Birmingham, UK
11:00 - 11:20
Coffee BreakCatering at 301 Foyer
11:30 - 12:30
Session IIDPA at 212B
Chair(s): Max SchaeferGitHub
11:30
30m
Talk
Fast and Precise Disassembly using Datalog
DPA
Vineeth KashyapGrammaTech, Inc.
12:00
30m
Talk
Gigahorse: Thorough Smart Contract Decompilation and Security Analyses
DPA
Neville GrechUniversity of Athens
12:30 - 14:00
LunchCatering at 301A
14:00 - 15:30
Session IIIDPA at 212B
Chair(s): Max SchaeferGitHub
14:00
30m
Talk
Now You See Me, Now You Don't: Querying with Hybrid Temporal Logic
DPA
Mistral ContrastinUniversity of Cambridge, UK
14:30
30m
Talk
Assertion-based Guidance of Top-down Horn Clause-based Analysis in CiaoPP
DPA
Manuel HermenegildoIMDEA Software Institute and T.U. of Madrid (UPM)
15:00
30m
Talk
Tunable abstract abstract machines
DPA
Thomas GilrayThe University of Alabama at Birmingham
15:30 - 16:00
Coffee BreakCatering at 301 Foyer
16:00 - 17:00
Session IVDPA at 212B
Chair(s): Neville GrechUniversity of Athens
16:00
30m
Talk
Precise Program Reasoning using Probabilistic Methods
DPA
Mukund RaghothamanUniversity of Pennsylvania, USA
16:30
30m
Talk
Variant analysis with QL
DPA
Questions? Use the DPA contact form.