SAS 2020
Wed 18 - Fri 20 November 2020 Online Conference
co-located with SPLASH 2020

Welcome to the 27th Static Analysis Symposium (SAS 2020)!

Static analysis is widely recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for the presentation of theoretical, practical, and application advances in the area.

Invited talks

Dates
Wed 18 Nov 2020
Thu 19 Nov 2020
Fri 20 Nov 2020
Tracks
DLS
SAS
SPLASH Awards
SPLASH Closing
SPLASH Keynotes
SPLASH Meet The Speakers (MTS)
SPLASH Student Research Competition
Plenary
Hide plenary sessions
You're viewing the program in a time zone which is different from your device's time zone - change time zone

Wed 18 Nov
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

Wed 18 Nov 14:00 - 15:00: 1SAS at SPLASH-III +12h
Chair(s): Patrick CousotNew York University
14:00 - 14:40
Talk
Cost Analysis of Smart Contracts via Parametric Resource AnalysisInvited Talk
SAS
I: Manuel HermenegildoIMDEA Software Institute and T.U. of Madrid
Media Attached File Attached
14:40 - 15:00
Research paper
A Library Modeling Language for the Static Analysis of C ProgramsArtifact
SAS
Abdelraouf OuadjaoutSorbonne Université, Antoine MinéSorbonne Université
Media Attached File Attached
Wed 18 Nov 18:00 - 19:20: 2SAS / DLS at SPLASH-III +12h
Chair(s): Matthew FlattUniversity of Utah, USA, David PichardieUniv Rennes, ENS Rennes, IRISA
18:00 - 18:40
Talk
Static Resource Analysis at ScaleInvited Talk
SAS
I: Ezgi ÇiçekFacebook London
File Attached
Wed 18 Nov 20:00 - 21:20: 3SAS / DLS at SPLASH-III +12h
Chair(s): Patrick CousotNew York University, Michael HomerVictoria University of Wellington
20:00 - 20:20
Research paper
Exact and Linear-Time Gas-Cost Analysis
SAS
Ankush DasCarnegie Mellon University, Shaz QadeerNovi, USA
Pre-print
20:40 - 21:00
Research paper
On Multi-Language Abstraction: Towards a Static Analysis of Multi-Language Programs
SAS
Samuele BuroUniversità degli Studi di Verona, Roy CroleUniversity of Leicester, Isabella MastroeniUniversity of Verona, Italy
File Attached
Wed 18 Nov 22:00 - 23:20: 4SAS / DLS at SPLASH-III +12h
Chair(s): Jeremy G. SiekIndiana University, USA, Antoine MinéSorbonne Université
22:00 - 22:20
Research paper
Memory-Efficient Fixpoint ComputationArtifact
SAS
Sung Kook KimUniversity of California, Davis, Arnaud J. VenetFacebook, Aditya V. ThakurUniversity of California, Davis
Pre-print Media Attached
22:40 - 23:00
Research paper
Simple and Efficient Computation of Minimal Weak Control ClosureArtifact
SAS
Abu Naser MasudMalardalen University
Media Attached File Attached
Thu 19 Nov 00:00 - 01:20: 5SAS / DLS at SPLASH-III +12h
Chair(s): Patrick CousotNew York University, Sukyoung Ryu
00:00 - 00:20
Research paper
Abstract Neural Networks
SAS
Matthew SotoudehUniversity of California, Davis, Aditya V. ThakurUniversity of California, Davis
Pre-print Media Attached
00:40 - 01:00
Research paper
Probabilistic Lipschitz Analysis of Neural NetworksArtifact
SAS
Ravi MangalGeorgia Institute of Technology, Kartik SarangmathGeorgia Institute of Technology, Aditya Nori, Alessandro OrsoGeorgia Tech
Pre-print Media Attached
Thu 19 Nov 02:00 - 03:00: 1SAS at SPLASH-III
Chair(s): Bor-Yuh Evan ChangUniversity of Colorado Boulder & Amazon
02:00 - 02:40
Talk
Cost Analysis of Smart Contracts via Parametric Resource AnalysisInvited Talk
SAS
I: Manuel HermenegildoIMDEA Software Institute and T.U. of Madrid
Media Attached File Attached
02:40 - 03:00
Research paper
A Library Modeling Language for the Static Analysis of C ProgramsArtifact
SAS
Abdelraouf OuadjaoutSorbonne Université, Antoine MinéSorbonne Université
Media Attached File Attached
Thu 19 Nov 06:00 - 07:20: 2SAS / DLS at SPLASH-III
Chair(s): Mihaela SighireanuLSV, ENS Paris-Saclay, Matthew FlattUniversity of Utah, USA
06:00 - 06:40
Talk
Static Resource Analysis at ScaleInvited Talk
SAS
I: Ezgi ÇiçekFacebook London
File Attached

Thu 19 Nov
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

Thu 19 Nov 08:00 - 09:20: 3SAS / DLS at SPLASH-III
Chair(s): Francesco RanzatoUniversity of Padova, Michael HomerVictoria University of Wellington
08:00 - 08:20
Research paper
Exact and Linear-Time Gas-Cost Analysis
SAS
Ankush DasCarnegie Mellon University, Shaz QadeerNovi, USA
Pre-print
08:40 - 09:00
Research paper
On Multi-Language Abstraction: Towards a Static Analysis of Multi-Language Programs
SAS
Samuele BuroUniversità degli Studi di Verona, Roy CroleUniversity of Leicester, Isabella MastroeniUniversity of Verona, Italy
File Attached
Thu 19 Nov 10:00 - 11:20: 4SAS / DLS at SPLASH-III
Chair(s): Caterina UrbanÉcole normale supérieure, Shigeru ChibaThe University of Tokyo
10:00 - 10:20
Research paper
Memory-Efficient Fixpoint ComputationArtifact
SAS
Sung Kook KimUniversity of California, Davis, Arnaud J. VenetFacebook, Aditya V. ThakurUniversity of California, Davis
Pre-print Media Attached
10:40 - 11:00
Research paper
Simple and Efficient Computation of Minimal Weak Control ClosureArtifact
SAS
Abu Naser MasudMalardalen University
Media Attached File Attached
Thu 19 Nov 12:00 - 13:20: 5SAS / DLS at SPLASH-III
Chair(s): Xavier RivalINRIA/CNRS/ENS Paris, Sukyoung Ryu
12:00 - 12:20
Research paper
Abstract Neural Networks
SAS
Matthew SotoudehUniversity of California, Davis, Aditya V. ThakurUniversity of California, Davis
Pre-print Media Attached
12:40 - 13:00
Research paper
Probabilistic Lipschitz Analysis of Neural NetworksArtifact
SAS
Ravi MangalGeorgia Institute of Technology, Kartik SarangmathGeorgia Institute of Technology, Aditya Nori, Alessandro OrsoGeorgia Tech
Pre-print Media Attached
Thu 19 Nov 16:00 - 17:00: 6SAS at SPLASH-III +12h
Chair(s): Mihaela SighireanuLSV, ENS Paris-Saclay
16:00 - 16:40
Talk
Polynomial Invariants for Affine ProgramsInvited Talk
SAS
I: James WorrellUniversity of Oxford
File Attached
16:40 - 17:00
Research paper
Termination of Polynomial Loops
SAS
Florian FrohnMax Planck Institute for Informatics, Marcel HarkRWTH Aachen University, Germany, Jürgen GieslRWTH Aachen University
Pre-print Media Attached File Attached
Thu 19 Nov 18:00 - 19:20: 7SAS / DLS at SPLASH-III +12h
Chair(s): Kedar NamjoshiNokia Bell Labs, Tim FelgentreffOracle Labs, Potsdam
18:00 - 18:20
Research paper
Interprocedural Shape Analysis Using Separation Logic-based Transformer Summaries
SAS
Hugo IllousCEA & INRIA / ENS Paris, Matthieu LemerreCEA LIST, France, Xavier RivalINRIA/CNRS/ENS Paris
File Attached
18:40 - 19:00
Research paper
Stratified Guarded First-order Transition Systems
SAS
Christian MüllerTechnische Universität München, Saarland University, Helmut SeidlTechnische Universität München
File Attached
Thu 19 Nov 20:00 - 21:20: 8SAS / DLS at SPLASH-III +12h
Chair(s): Samir Genaim Universidad Complutense de Madrid, Tim FelgentreffOracle Labs, Potsdam
20:00 - 20:20
Research paper
Formal framework for reasoning about the precision of dynamic analysis
SAS
Mila Dalla PredaUniversity of Verona, Italy, Roberto GiacobazziUniversity of Verona and IMDEA Software Institute, Niccolò MarastoniUniversity of Verona
File Attached
20:20 - 20:40
Research paper
Farkas-Based Tree Interpolation
SAS
Sepideh AsadiPhD Student, Martin Blicha, Antti Hyvärinen, Grigory FedyukovichFlorida State University, Natasha SharyginaUSI Lugano, Switzerland
Pre-print
Thu 19 Nov 22:00 - 23:20: 9SAS at SPLASH-III +12h
Chair(s): Kwangkeun YiSeoul National University, South Korea
22:00 - 22:20
Research paper
Counterexample- and Simulation-Guided Floating-Point Loop Invariant SynthesisArtifact
SAS
Anastasiia IzychevaTechnical University of Munich, Eva DarulovaMPI-SWS, Helmut SeidlTechnische Universität München
Pre-print Media Attached
22:40 - 23:00
Research paper
Predicate Abstraction and CEGAR for nuHFL(Z) Validity Checking
SAS
Naoki IwayamaUniversity of Tokyo, Japan, Naoki KobayashiUniversity of Tokyo, Japan, Ryota Suzuki, Takeshi TsukadaChiba University, Japan
File Attached
Fri 20 Nov 00:00 - 01:20: 10SAS at SPLASH-III +12h
Chair(s): David PichardieUniv Rennes, ENS Rennes, IRISA
00:00 - 00:40
Talk
Static analysis for privacy-preserving artificial intelligenceInvited Talk
SAS
Fri 20 Nov 04:00 - 05:00: 6SAS at SPLASH-III
Chair(s): Mihaela SighireanuLSV, ENS Paris-Saclay
04:00 - 04:40
Talk
Polynomial Invariants for Affine ProgramsInvited Talk
SAS
I: James WorrellUniversity of Oxford
File Attached
04:40 - 05:00
Research paper
Termination of Polynomial Loops
SAS
Florian FrohnMax Planck Institute for Informatics, Marcel HarkRWTH Aachen University, Germany, Jürgen GieslRWTH Aachen University
Pre-print Media Attached File Attached
Fri 20 Nov 06:00 - 07:20: 7SAS / DLS at SPLASH-III
Chair(s): Mihaela SighireanuLSV, ENS Paris-Saclay
06:00 - 06:20
Research paper
Interprocedural Shape Analysis Using Separation Logic-based Transformer Summaries
SAS
Hugo IllousCEA & INRIA / ENS Paris, Matthieu LemerreCEA LIST, France, Xavier RivalINRIA/CNRS/ENS Paris
File Attached
06:40 - 07:00
Research paper
Stratified Guarded First-order Transition Systems
SAS
Christian MüllerTechnische Universität München, Saarland University, Helmut SeidlTechnische Universität München
File Attached

Fri 20 Nov
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

Fri 20 Nov 08:00 - 09:20: 8SAS / DLS at SPLASH-III
Chair(s): Helmut SeidlTechnische Universität München
08:00 - 08:20
Research paper
Formal framework for reasoning about the precision of dynamic analysis
SAS
Mila Dalla PredaUniversity of Verona, Italy, Roberto GiacobazziUniversity of Verona and IMDEA Software Institute, Niccolò MarastoniUniversity of Verona
File Attached
08:20 - 08:40
Research paper
Farkas-Based Tree Interpolation
SAS
Sepideh AsadiPhD Student, Martin Blicha, Antti Hyvärinen, Grigory FedyukovichFlorida State University, Natasha SharyginaUSI Lugano, Switzerland
Pre-print
Fri 20 Nov 10:00 - 11:20: 9SAS at SPLASH-III
Chair(s): Jerome FeretINRIA Paris
10:00 - 10:20
Research paper
Counterexample- and Simulation-Guided Floating-Point Loop Invariant SynthesisArtifact
SAS
Anastasiia IzychevaTechnical University of Munich, Eva DarulovaMPI-SWS, Helmut SeidlTechnische Universität München
Pre-print Media Attached
10:40 - 11:00
Research paper
Predicate Abstraction and CEGAR for nuHFL(Z) Validity Checking
SAS
Naoki IwayamaUniversity of Tokyo, Japan, Naoki KobayashiUniversity of Tokyo, Japan, Ryota Suzuki, Takeshi TsukadaChiba University, Japan
File Attached
Fri 20 Nov 12:00 - 13:20: 10SAS at SPLASH-III
Chair(s): Mihaela SighireanuLSV, ENS Paris-Saclay
12:00 - 12:40
Talk
Static analysis for privacy-preserving artificial intelligenceInvited Talk
SAS

Call for Papers

The 27th Static Analysis Symposium, SAS 2020, will be held from November 18th to November 20th in Chicago, Illinois, United States.

Static analysis is widely recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The series of Static Analysis Symposia has served as the primary venue for the presentation of theoretical, practical, and application advances in the area.

Topics

The technical program for SAS 2020 will consist of invited lectures and presentations of refereed papers. Contributions are welcomed on all aspects of static analysis, including, but not limited to:

Abstract domains Abstract interpretation Automated deduction
Data flow analysis Debugging Deductive methods
Emerging applications Model checking Program optimizations and transformations
Program synthesis Program verification Security analysis
Tool environments and architectures Theoretical frameworks Type checking

Submission

Submit electronically via the EasyChair submission page.

Papers

Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic, object-oriented, aspect, multi-core, distributed, and GPU programming.

  • Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings.
  • Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity.
  • They should clearly identify what has been accomplished and why it is significant.
  • Paper submissions should not exceed 18 pages in Springer’s Lecture Notes in Computer Science (LNCS) format, excluding bibliography and well-marked appendices. Program Committee members are not required to read the appendices, and thus papers must be intelligible without them.

Authors should consult Springer’s authors’ guidelines and use their proceedings templates, either for LaTeX or for Word, for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. In addition, the corresponding author of each paper, acting on behalf of all of the authors of that paper, must complete and sign a Consent-to-Publish form. The corresponding author signing the copyright form should match the corresponding author marked on the paper. Once the files have been sent to Springer, changes relating to the authorship of the papers cannot be made.

Artifacts

As in previous years, we encourage authors to submit a virtual machine image containing any artifacts and evaluations presented in the paper. The goal of the artifact submissions is to strengthen our field’s scientific approach to evaluations and reproducibility of results. The virtual machines will be archived on a permanent Static Analysis Symposium website to provide a record of past experiments and tools, allowing future research to better evaluate and contrast existing work.

Artifact submission is optional. More information can be found on the Call for Artifacts.

Review Process

SAS 2020 will use a lightweight double-blind reviewing process. Following this process means that reviewers will not see the authors’ names or affiliations as they initially review a paper. The authors’ names will then be revealed to the reviewers only once their reviews have been submitted.

To facilitate this process, submitted papers must adhere to the following:

  • Author names and institutions must be omitted and
  • References to the authors’ own related work should be in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”). The purpose of this process is to help the reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission, makes the job of reviewing the paper more difficult, or interferes with the process of disseminating new ideas. For example, important background references should not be omitted or anonymized, even if they are written by the same authors and share common ideas, techniques, or infrastructure. Authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.

Authors will be able to read reviews and respond to them as appropriate during the author response period.

Radhia Cousot Award

The program committee will select a paper for the Radhia Cousot Young Researcher Best Paper Award, in memory of Radhia Cousot, and her fundamental contributions to static analysis, as well as being one of the main promoters and organizers of the SAS series of conferences.

Accepted Papers

Title
A Library Modeling Language for the Static Analysis of C ProgramsArtifact
SAS
Media Attached File Attached
Abstract Neural Networks
SAS
Pre-print Media Attached
Counterexample- and Simulation-Guided Floating-Point Loop Invariant SynthesisArtifact
SAS
Pre-print Media Attached
Exact and Linear-Time Gas-Cost Analysis
SAS
Pre-print
Farkas-Based Tree Interpolation
SAS
Pre-print
Formal framework for reasoning about the precision of dynamic analysis
SAS
File Attached
Interprocedural Shape Analysis Using Separation Logic-based Transformer Summaries
SAS
File Attached
Memory-Efficient Fixpoint ComputationArtifact
SAS
Pre-print Media Attached
On Multi-Language Abstraction: Towards a Static Analysis of Multi-Language Programs
SAS
File Attached
Predicate Abstraction and CEGAR for nuHFL(Z) Validity Checking
SAS
File Attached
Probabilistic Lipschitz Analysis of Neural NetworksArtifact
SAS
Pre-print Media Attached
Simple and Efficient Computation of Minimal Weak Control ClosureArtifact
SAS
Media Attached File Attached
Stratified Guarded First-order Transition Systems
SAS
File Attached
Termination of Polynomial Loops
SAS
Pre-print Media Attached File Attached

As in previous years, we encourage authors to submit a virtual machine image containing any artifacts and evaluations presented in the paper. The goal of the artifact submissions is to strengthen our field’s scientific approach to evaluations and reproducibility of results. The virtual machines will be archived on a permanent Static Analysis Symposium website to provide a record of past experiments and tools, allowing future research to better evaluate and contrast existing work.

Artifact submission is optional. We accept only virtual machine images that can be processed with VirtualBox. The artifact should come with a virtual machine (VM) image and step-by-step instructions:

  • Virtual machine image: The VM image must be bootable and contain all the necessary libraries installed. Please ensure that the VM image can be processed with VirtualBox. When preparing your artifact, please make it light as possible.
  • Step-by-step instructions: It should clearly explain how to reproduce the results that support your paper’s conclusions. We encourage the authors to have easy-to-run scripts. Also, you should explain how to interpret the output of the artifact. Please provide an estimated execution time for each instruction.

The artifact submission is handled via Easychair. Please follow the instructions below to submit your artifact:

  • Make the VM image and the instruction document into single compressed archive file using zip or gzip. Use your paper number for the name of the archive file.
  • Upload the archive file to well-known storage service such as Dropbox or Google Drive and get the sharable link of it.
  • Run a checksum function with the archive file and make a text file that contains the link to the archive file and the checksum the result.
  • Submit the file via the specific submission page.

The artifact submission is handled via Easychair.

:
: