SAS 2019: 26TH INTERNATIONAL STATIC ANALYSIS SYMPOSIUM
PROGRAM

Days: Wednesday, October 9th Thursday, October 10th Friday, October 11th

Wednesday, October 9th

View this program: with abstractssession overviewtalk overview

09:00-10:00 Session 1: Keynote
09:00
Rethinking Static Analysis by Combining Discrete and Continuous Reasoning (abstract)
10:30-12:30 Session 2: Pointers and Dataflow
10:30
Fast and Precise Handling of Positive Weight Cycles for Field-sensitive Pointer Analysis (abstract)
11:00
Per-Dereference Verification of Temporal Heap Safety via Adaptive Context-Sensitive Analysis (abstract)
11:30
A Change-based Heuristic for Static Analysis with Policy Iteration (abstract)
12:00
Syntactic and Semantic Soundness of Structural Dataflow Analysis (abstract)
14:00-15:00 Session 3: Keynote
14:00
Static Analysis of Data Science Software (abstract)
15:30-17:00 Session 4: Languages and Decidability
15:30
Abstract Interpretation of Indexed Grammars (abstract)
16:00
Language Inclusion Algorithms as Complete Abstract Interpretations (abstract)
16:30
On the Monniaux Problem in Abstract Interpretation (abstract)
Thursday, October 10th

View this program: with abstractssession overviewtalk overview

09:00-10:00 Session 5: Keynote
09:00
Towards Semantic Adversarial Examples (abstract)
10:30-12:30 Session 6: Numerical
10:30
Revisiting Polyhedral Analysis for Hybrid Systems (abstract)
11:00
An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection (abstract)
11:30
Analysis of Software Patches using Numerical Abstract Interpretation (abstract)
12:00
Verifying Numerical Programs via Iterative Abstract Testing (abstract)
14:00-15:00 Session 7: Trends: Assuring Machine Learning
14:00
Robustness Verification of Support Vector Machines (abstract)
14:30
Analyzing Deep Neural Networks with Symbolic Propagation: Towards Higher Precision and Faster Verification (abstract)
Friday, October 11th

View this program: with abstractssession overviewtalk overview

09:00-10:00 Session 8: Keynote
09:00
Learning Verifiers and Verifying Learners (abstract)
10:30-12:30 Session 9: Synthesis and Security
10:30
Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants (abstract)
11:00
Direct Manipulation for Imperative Programs (abstract)
11:30
Abstract Semantic Dependency (abstract)
12:00
Responsibility Analysis by Abstract Interpretation (abstract)
14:00-15:30 Session 10: Temporal Properties and Termination
14:00
Temporal Verification of Programs via First-Order Fixpoint Logic (abstract)
14:30
A Temporal Logic for Higher-Order Functional Programs (abstract)
15:00
Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets (abstract)