Program
Wednesday, September 14
9:00-10:00 Invited Talk 1 - Program Analysis and Machine Learning: A Win-Win Deal
Sriram Rajamani, Microsoft Research India
10:00-10:30 Coffee Break
10:30-12:30 Session 1 - Heap Analysis (Chair: Thomas Reps)
Efficient Decision Procedures for Heaps using STRAND
12:30-14:00 Lunch Break
14:00-15:00 Invited Talk 2 - Combining Algebraic Domains and Logical Theories by the Reduced Product
Patrick Cousot, Ecole normale superieure, Paris & Courant Institute of Mathematical
sciences, New York University [slides]
15:00-15:30 Coffee Break
15:30 - 17:00 Session 2 - Static Analysis with Applications (Chair: Matthieu Martel)
Thursday, September 15
9:00-10:00 Invited Talk 3 - Program Analysis for Web Security
John Mitchell, Stanford
10:00-10:30 Coffee Break
10:30-12:30 Session 3 - Concurrency (Chair: Noam Rinetzky)
A family of abstract interpretations for static analysis of concurrent higher-order programs
[slides]
12:30-14:00 Lunch Break
14:00-15:00 Invited Talk 4 - Astrée: Design and Experience
Daniel Kaestner, AbsInt, Germany
15:30-17:00 Session 4 - Numerical Domains (Chair: Antoine Mine)
Transitive Closures of Affine Integer Tuple Relations and their Overapproximations
Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs
[slides]
[slides]
17:00-17:20 Break
17:20-18:00 Concert
20:30- Conference Dinner
Friday, September 16
9:00-10:00 Invited Talk 5 - Formal Model Reduction
Jerome Feret, Ecole Normale Superieure, France [slides]
10:00-10:30 Coffee Break
10:30-12:30 Session 5 - Medley (Chair: Roberto Giacobazzi)
Invisible Invariants and Abstract Interpretation
An Abstraction-Refinement Framework for Trigger Querying
12:00-14:00 Extended Lunch Break (starts at 12:00)
14:00-15:00 Session 6 - Probabilistic Analysis (Chair: Ganesan Ramalingam)
Probabilistic Analysis of Perforated Patterns
15:00-15:30 Coffee Break
15:30-16:30 Session 7 - Bounded Model Checking (Chair: Noam Rinetzky)
Software Verification Using k-Induction