Presentation Schedule
|
13.07 (Wednesday) |
Location: CISPA Building (E9 1), room 0.01 |
|
9:15 — 9:20 |
Opening remarks, set-up |
|
9:20 — 10:00 |
Dynamic Program Slicing (Mitul Bipin) |
|
10:00 — 10:40 |
Precise Interprocedural Dataflow Analysis via Graph Reachability (DominicTroppmann) |
|
10:40 — 10:50 |
Break |
|
10:50 — 11:30 |
SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement (Selina Scheller) |
|
11:30 — 12:10 |
Flow-Sensitive Pointer Analysis for Millions of Lines of Code (Alaa Othman) |
|
12:10 — 12:20 |
Break |
|
12:20 — 13:00 |
Sound, Complete and Scalable Path-Sensitive Analysis (Felix Rausch) |
|
14.07 (Thursday) |
Location: CISPA Building (E9 1), room 0.01 |
|
9:15 — 9:20 |
Set-up |
|
9:20 — 10:00 |
Dynamic Partial-Order Reduction for Model Checking Software (Heyang Li) |
|
10:00 — 10:40 |
Race detection for Android Applications (Zhanpeng Huang) |
|
10:40 — 10:50 |
Break |
|
10:50 — 11:30 |
A Compositional Deadlock Detector for Android Java (Rahul Mudambi Venkatesh) |
|
11:30 — 12:10 |
Automatic Predicate Abstraction of C Programs (Tristan Hornetz) |
|
12:10 — 12:20 |
Break |
|
12:20 — 13:00 |
Horn Clause Solvers for Program Verification (Chaahat Jain) |
|
15.07 (Friday) |
Location: CISPA Building (E9 1), room 0.01 |
|
10:35 — 10:40 |
Set-up |
|
10:40 — 11:20 |
Fast and Reliable Formal Verification of Smart Contracts with the Move Prover (Joschua Loth) |
|
11:20 — 12:00 |
Scaling up Superoptimization (Abdul Rafay) |
|
12:00 — 12:10 |
Break |
|
12:10 — 12:50 |
Program Synthesis using Conflict-Driven Learning (Haya Alkhaled) |
|
12:50 — 13:00 |
Closing remarks |