24th Static Analysis Symposium
August 30th - September 1st, 2017, New York City, NY, USA

sas symposia about topics paper submissions artifact submissions important dates accepted papers programme new proceedings registration radhia cousot award special issue invited speakers invited tutorials affiliated events organization sponsor

Accepted Papers


  1. •Ahmed Bouajjani, Constantin Enea and Shuvendu Lahiri. Abstract (Semantic) Diffing of Evolving Concurrent Programs


  1. •Abdelraouf Ouadjaout and Antoine Miné. Quantitative Static Analysis of Communication Protocols using Abstract Markov Chains


  1. •Sriram Sankaranarayanan and Mohamed Amin Ben Sassi. Template Polyhedra with a Twist


  1. •Aws Albarghouthi. Probabilistic Horn Clause Verification


  1. •Suvam Mukherjee, Oded Padon, Sharon Shoham, Deepak D'Souza and Noam Rinetzky. Thread-Local Semantics and its Efficient Sequential Abstractions for Race-Free Programs


  1. •Tushar Sharma and Thomas Reps. A new Abstraction Framework for Affine Tansformers


  1. •Sebastian Wolff, Roland Meyer, Lukas Holik and Tomas Vojnar. Effect Summaries for Thread-Modular Analysis


  1. •Marius Greitschus, Daniel Dietsch and Andreas Podelski. Loop Invariants from Counterexamples


  1. •Alexandre Maréchal, David Monniaux and Michael Perin. Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming


  1. •Colas Le Guernic. Toward a Sound Analysis of Guarded LTI Loops with Inputs by Abstract Acceleration


  1. •Hernan Ponce-De-Leon, Florian Furbach, Keijo Heljanko and Roland Meyer. Portability Analysis for Weak Memory Models. Porthos: One Tool for all Models


  1. •Isabella Mastroeni and Michele Pasqua. Hyperhierarchy of Semantics - A formal framework for Hyperproperties Verification


  1. •Sunbeom So and Hakjoo Oh. Synthesizing Imperative Programs from Examples Guided by Static Analysis


  1. •Jieyuan Zhang, Yulei Sui and Jingling Xue. Incremental Analysis for Probabilistic programs


  1. •Alexey Bakhirkin and David Monniaux. Combining Forward and Backward Abstract Interpretation of Horn Clauses


  1. •Leandro Facchinetti, Zachary Palmer and Scott Smith. Relative Store Fragments for Singleton Abstraction


  1. •Matías Toro and Éric Tanter. A Gradual Interpretation of Union Types


  1. •Marc Brockschmidt, Yuxin Chen, Pushmeet Kohli, Siddharth Krishna and Daniel Tarlow. Learning Shape Analysis


  1. •Chaoqiang Deng and Kedar Namjoshi. Securing The SSA Transform


  1. •Anna Trostanetski, Orna Grumberg and Daniel Kroening. Modular Demand-Driven Analysis of Semantic Difference for Program Versions


  1. •Divyesh Unadkat, Supratik Chakraborty and Ashutosh Gupta. Verifying Array Manipulating Programs by Tiling


  1. •Arie Gurfinkel and Jorge A. Navas. A Context-Sensitive Memory Model for Verification of C/C++ Programs