SAS 2023
Sun 22 - Tue 24 October 2023 Cascais, Portugal
co-located with SPLASH 2023

Dates
Plenary
You're viewing the program in a time zone which is different from your device's time zone change time zone

Sun 22 Oct

Displayed time zone: Lisbon change

09:00 - 10:30
Session 1SAS 2023 at Room I
Chair(s): Caterina Urban Inria & École Normale Supérieure | Université PSL
09:00
5m
Opening
SAS 2023
Manuel Hermenegildo Technical University of Madrid (UPM) and IMDEA Software Institute, José Morales IMDEA Software Institute
Pre-print
09:05
60m
Keynote
Goal-Directed Abstract Interpretation and Event-Driven FrameworksKeynote
SAS 2023
I: Bor-Yuh Evan Chang University of Colorado at Boulder; Amazon
Pre-print
10:05
30m
Talk
A Product of Shape and Sequence Abstractions (Radhia Cousot Young Researcher Best Paper Award)
SAS 2023
Josselin Giet Ecole Normale Supérieure, Félix Ridoux Univ Rennes / IMDEA Software Institute, Xavier Rival Inria; ENS; CNRS; PSL University
Pre-print
10:30 - 11:00
Coffee BreakSPLASH Catering at Gallery
11:00 - 12:30
Domain precisionSAS 2023 at Room I
Chair(s): Bor-Yuh Evan Chang University of Colorado at Boulder; Amazon
11:00
30m
Talk
How fitting is your abstract domain?
SAS 2023
Roberto Giacobazzi University of Arizona, Isabella Mastroeni University of Verona, Italy, Elia Perantoni University of Verona
Pre-print
11:30
30m
Talk
Domain Precision in Galois Connection-less Abstract Interpretation
SAS 2023
Isabella Mastroeni University of Verona, Italy, Michele Pasqua University of Verona
Pre-print
12:00
30m
Talk
A Formal Framework to Measure the Incompleteness of Abstract Interpretations
SAS 2023
Marco Campion INRIA & École Normale Supérieure | Université PSL, Caterina Urban Inria & École Normale Supérieure | Université PSL, Mila Dalla Preda University of Verona, Roberto Giacobazzi University of Arizona
Pre-print
12:30 - 14:00
14:00 - 15:30
Synthesis and applicationsSAS 2023 at Room I
Chair(s): Daniel Schoepe Amazon
14:00
30m
Talk
Generalized Program Sketching by Abstract Interpretation and Logical Abduction
SAS 2023
Aleksandar S. Dimovski Mother Teresa University, Skopje
Pre-print File Attached
14:30
30m
Talk
Reverse Template Processing using Abstract Interpretation
SAS 2023
Matthieu Lemerre Université Paris-Saclay - CEA LIST
Pre-print
15:00
30m
Talk
BREWasm: A General Static Binary Rewriting Framework for WebAssemblyRemote
SAS 2023
Shangtong Cao Beijing University of Posts and Telecommunications, Ningyu He Peking University, Yao Guo Peking University, Haoyu Wang Huazhong University of Science and Technology
Pre-print
15:30 - 16:00
Coffee BreakSPLASH Catering at Gallery
16:00 - 17:30
Quantum, neuralSAS 2023 at Room I
Chair(s): Roberto Giacobazzi University of Arizona
16:00
30m
Talk
Quantum Constant Propagation
SAS 2023
Yanbin Chen TUM School of Computation, Information and Technology, Technical University of Munich, Yannick Stade TUM School of Computation, Information and Technology, Technical University of Munich
Pre-print
16:30
30m
Talk
Boosting Multi-Neuron Convex Relaxation for Neural Network Verification
SAS 2023
Xuezhou Tang ShenZhen University, Ye Zheng Shenzhen University, Jiaxiang Liu Shenzhen University
Pre-print

Mon 23 Oct

Displayed time zone: Lisbon change

09:00 - 10:30
Session 5SAS 2023 at Room I
Chair(s): Enea Zaffanella University of Parma, Italy
09:00
60m
Keynote
Abstract Interpretation in Industry - Experience and Lessons LearnedKeynote
SAS 2023
I: Daniel Kaestner AbsInt
Pre-print
10:00
30m
Talk
Lifting On-Demand Analysis to Higher-Order Languages
SAS 2023
Daniel Schoepe Amazon, David Seekatz Unaffiliated, Ilina Stoilkovska Amazon, Sandro Stucki Amazon, Daniel Tattersall Amazon, Pauline Bolignano Amazon, Franco Raimondi Amazon, Bor-Yuh Evan Chang University of Colorado at Boulder; Amazon
Link to publication Pre-print
10:30 - 11:00
Coffee BreakSPLASH Catering at Gallery
11:00 - 12:30
Modular arithmetic and numeric analysisSAS 2023 at Room I
Chair(s): Daniel Kaestner AbsInt
11:00
30m
Talk
Symbolic transformation of expressions in modular arithmetic
SAS 2023
Jérôme Boillot École Normale Supérieure, PSL University & INRIA, Jerome Feret INRIA Paris
Pre-print
11:30
30m
Talk
Polynomial Analysis of Modular Arithmetic
SAS 2023
Thomas Seed University of Kent, Andy King Kent, Neil Evans AWE, Chris Coppins University of Kent
Pre-print
12:00
30m
Talk
Octagons Revisited - Elegant Proofs and Simplified Algorithms
SAS 2023
Michael Schwarz Technische Universität München, Helmut Seidl Technische Universität München
Pre-print
12:30 - 14:00
14:00 - 15:30
Error location and scalingSAS 2023 at Room I
Chair(s): Andy King Kent
14:00
30m
Talk
Error Invariants for Fault Localization via Abstract Interpretation
SAS 2023
Aleksandar S. Dimovski Mother Teresa University, Skopje
Pre-print File Attached
14:30
30m
Talk
Error Localization for Sequential Effect Systems
SAS 2023
Colin Gordon Drexel University, Chaewon Yun Drexel University
Link to publication Pre-print
15:00
30m
Talk
Scaling up Roundoff Analysis of Functional Data Structure Programs
SAS 2023
Anastasia Isychev Technical University of Vienna, Eva Darulova Uppsala University
Pre-print
15:30 - 16:00
Coffee BreakSPLASH Catering at Gallery
16:00 - 17:30
Session 8SAS 2023 at Room I
Chair(s): José Morales IMDEA Software Institute, Manuel Hermenegildo Technical University of Madrid (UPM) and IMDEA Software Institute
16:00
60m
Keynote
Building Trust and Safety in Artificial Intelligence with Abstract InterpretationRemoteKeynote
SAS 2023
I: Gagandeep Singh University of Illinois at Urbana-Champaign; VMware Research
Pre-print
17:00
30m
Awards
Radhia Cousot Award and PC report
SAS 2023
C: Manuel Hermenegildo Technical University of Madrid (UPM) and IMDEA Software Institute, C: José Morales IMDEA Software Institute

Tue 24 Oct

Displayed time zone: Lisbon change

09:00 - 10:30
Cost/precision trade-offs and accelerationSAS 2023 at Room I
Chair(s): Xavier Rival Inria; ENS; CNRS; PSL University
09:00
30m
Talk
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses
SAS 2023
Florian Frohn RWTH Aachen University, Jürgen Giesl RWTH Aachen University
Pre-print
09:30
30m
Talk
Unconstrained Variable Oracles for Faster Static Analyses
SAS 2023
Vincenzo Arceri University of Parma, Italy, Greta Dolcetti University of Parma - Department of Mathematical, Physical, and Computer Sciences, Enea Zaffanella University of Parma, Italy
Pre-print
10:00
30m
Talk
Modular Optimization-Based Roundoff Error Analysis of Floating-Point Programs
SAS 2023
Rosa Abbasi Boroujeni Max Planck Institute for Software Systems, Eva Darulova Uppsala University
Pre-print
10:30 - 11:00
Coffee BreakSPLASH Catering at Gallery
11:00 - 12:30
Session 10SAS 2023 at Room I
Chair(s): Jerome Feret INRIA Paris
11:00
60m
Keynote
Verifying Infinitely Many Programs at OnceKeynote
SAS 2023
I: Loris D'Antoni University of Wisconsin-Madison
Pre-print
12:00
30m
Talk
Mutual Refinements of Context-Free Language Reachability
SAS 2023
Shuo Ding Georgia Institute of Technology, Qirun Zhang Georgia Institute of Technology
Pre-print
12:30 - 14:00

Accepted Papers

Title
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses
SAS 2023
Pre-print
A Formal Framework to Measure the Incompleteness of Abstract Interpretations
SAS 2023
Pre-print
A Product of Shape and Sequence Abstractions (Radhia Cousot Young Researcher Best Paper Award)
SAS 2023
Pre-print
Boosting Multi-Neuron Convex Relaxation for Neural Network Verification
SAS 2023
Pre-print
BREWasm: A General Static Binary Rewriting Framework for WebAssemblyRemote
SAS 2023
Pre-print
Domain Precision in Galois Connection-less Abstract Interpretation
SAS 2023
Pre-print
Error Invariants for Fault Localization via Abstract Interpretation
SAS 2023
Pre-print File Attached
Error Localization for Sequential Effect Systems
SAS 2023
Link to publication Pre-print
Generalized Program Sketching by Abstract Interpretation and Logical Abduction
SAS 2023
Pre-print File Attached
How fitting is your abstract domain?
SAS 2023
Pre-print
Lifting On-Demand Analysis to Higher-Order Languages
SAS 2023
Link to publication Pre-print
Modular Optimization-Based Roundoff Error Analysis of Floating-Point Programs
SAS 2023
Pre-print
Mutual Refinements of Context-Free Language Reachability
SAS 2023
Pre-print
Octagons Revisited - Elegant Proofs and Simplified Algorithms
SAS 2023
Pre-print
Opening
SAS 2023
Pre-print
Polynomial Analysis of Modular Arithmetic
SAS 2023
Pre-print
Quantum Constant Propagation
SAS 2023
Pre-print
Reverse Template Processing using Abstract Interpretation
SAS 2023
Pre-print
Scaling up Roundoff Analysis of Functional Data Structure Programs
SAS 2023
Pre-print
Symbolic transformation of expressions in modular arithmetic
SAS 2023
Pre-print
Unconstrained Variable Oracles for Faster Static Analyses
SAS 2023
Pre-print

Call for Papers

Are you running late in preparing your SAS paper? No worries! Due to popular demand we are continuing to accept papers (not just updates) until the May 1 full paper deadline!"

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.

Important Dates

All deadlines are AoE (Anywhere on Earth)

  • Full paper submission: April 24, 2023 abstracts Papers accepted (not just updates) until May 1
  • Artifact submission: May 6, 2023
  • Author response period: June 11-14, 2023
  • Notification: June 29, 2023
  • Final version due: August 3, 2023
  • Conference: Part of SPLASH, Oct 22-24, 2023

Topics

The technical program for SAS 2023 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 interpretation
  • Automated deduction
  • Data flow analysis
  • Debugging techniques
  • Deductive methods
  • Emerging applications
  • Model-checking
  • Data science
  • Program optimizations and transformations
  • Program synthesis
  • Program verification
  • Machine learning and verification
  • Security analysis
  • Tool environments and architectures
  • Theoretical frameworks
  • Type checking
  • Distributed or networked systems

Paper Submission

All paper submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity.

Submission link: https://easychair.org/conferences/?conf=sas2023

We welcome regular papers as well as papers focusing on any of the following in the NEAT (New questions/areas, Experience, Announcement, Tool) category:

  • Well-motivated discussion of new questions or new areas.
  • Experience with static analysis tools, Industrial Reports, and Case Studies
  • Brief announcements of work in progress
  • Tool papers

We do not impose a page limit for submitted papers but we encourage brevity as reviewers have a limited time that they can spend on each paper. With the exception of experience papers, all other papers will follow a lightweight double-blind reviewing process. The identity of the authors for the remaining papers will be known to the reviewers.

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

Papers must be written and presented in English. A submitted paper must describe original work 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.

All submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. The review process will include a rebuttal period where authors have the opportunity to respond to preliminary reviews on the paper.

Radhia Cousot Award

The program committee will select an accepted regular 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.

Artifacts

As in previous years, we encourage authors to submit a virtual machine image containing any artifacts and evaluations presented in the paper. Artifact submission is optional. Artifact evaluation will be concurrent with paper review.

Submission Details

Lightweight Double-Blind Requirement

All regular papers will follow a double-blind process, where author names and affiliations are hidden for initial review. Author names will be revealed to a reviewer only after their review has been submitted.

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

(1) Author names and affiliations must be omitted and (2) 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 papers as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.

NEAT Papers Content

New problems papers are an opportunity to discuss visions, challenges, experiences, problems, and impactful solutions in the field of static analysis from both a research and applications perspective. Such papers are encouraged to take assertive positions and be forward-looking and aim for lively and insightful discussions that are influential to future research directions in static analysis.

User experience & Industrial reports & Case studies papers describe the use of static analysis in industrial settings or in any chosen application domains. Papers in this category do not necessarily need to present original research results but are expected to contain applications of static analysis as well as a comprehensive evaluation in the chosen application domain. Such papers are encouraged to discuss the unique challenges of transferring research ideas to a real-world setting, reflect on any lessons learned from this technology transfer experience, and compare experiences with different analyzers highlighting their strengths and weaknesses.

Brief announcements of work in progress papers may describe work in progress. A submission that is not selected for regular presentation may be invited for a brief announcement.

Submission Guidelines

The SAS 2023 proceedings will be published by Springer in their LNCS series. Authors should consult Springer’s authors’ guidelines and use their proceedings templates, for LaTeX, Overleaf, or Word, for the preparation of their papers.

The corresponding author of each accepted 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.

Filter
Role Type
Country
Search

Results (72)

A
Abbasi Boroujeni, Rosa
Max Planck Institute for Software SystemsGermany
Arceri, Vincenzo
University of Parma, ItalyItaly
B
Balakrishnan, Gogul
GoogleUnited States
Boillot, Jérôme
École Normale Supérieure, PSL University & INRIAFrance
Bolignano, Pauline
AmazonUnited Kingdom
C
Campion, Marco
INRIA & École Normale Supérieure | Université PSLFrance
Cao, Shangtong
Beijing University of Posts and TelecommunicationsChina
Chang, Bor-Yuh Evan
University of Colorado at Boulder; AmazonUnited States
Chen, Liqian
National University of Defense Technology, ChinaChina
Chen, Yanbin
TUM School of Computation, Information and Technology, Technical University of MunichGermany
Chen, Yu-Fang
Academia SinicaTaiwan
Coppins, Chris
University of KentUnited Kingdom
Cousot, Patrick
D
D'Antoni, Loris
University of Wisconsin-MadisonUnited States
Dalla Preda, Mila
University of VeronaItaly
Darulova, Eva
Uppsala UniversitySweden
Ding, Shuo
Georgia Institute of TechnologyUnited States
Dolcetti, Greta
University of Parma - Department of Mathematical, Physical, and Computer SciencesItaly
E
Emmi, Michael
Amazon Web ServicesUnited States
Evans, Neil
AWEUnited Kingdom
F
Feret, Jerome
INRIA ParisFrance
Ferrara, Pietro
Università Ca' Foscari, Venezia, ItalyItaly
Frohn, Florian
RWTH Aachen UniversityGermany
G
Giacobazzi, Roberto
University of ArizonaUnited States
Giesl, Jürgen
RWTH Aachen UniversityGermany
Giet, Josselin
Ecole Normale SupérieureFrance
Gordon, Colin
Drexel UniversityUnited States
Gori, Roberta
University of PisaItaly
Guo, Yao
Peking UniversityChina
H
He, Ningyu
Peking UniversityChina
Hermenegildo, Manuel
Technical University of Madrid (UPM) and IMDEA Software InstituteSpain
I
Isychev, Anastasia
Technical University of ViennaAustria
K
Kaestner, Daniel
AbsIntGermany
King, Andy
KentUnited Kingdom
L
Lemerre, Matthieu
Université Paris-Saclay - CEA LISTFrance
Liu, Jiaxiang
Shenzhen UniversityChina
Logozzo, Francesco
FacebookUnited States
M
Mastroeni, Isabella
University of Verona, ItalyItaly
Miné, Antoine
Sorbonne UniversitéFrance
Morales, José
IMDEA Software InstituteSpain
N
Namjoshi, Kedar
Nokia Bell LabsUnited States
Navas, Jorge A.
CertoraUnited States
P
Pasqua, Michele
University of VeronaItaly
Perantoni, Elia
University of VeronaItaly
R
Raimondi, Franco
AmazonUnited Kingdom
Ridoux, Félix
Univ Rennes / IMDEA Software InstituteFrance
Rinard, Martin C.
Massachusetts Institute of TechnologyUnited States
Rival, Xavier
Inria; ENS; CNRS; PSL UniversityFrance
S
S. Dimovski, Aleksandar
Mother Teresa University, SkopjeMacedonia
Schoepe, Daniel
AmazonUnited Kingdom
Schwarz, Michael
Technische Universität MünchenGermany
Seed, Thomas
University of KentUnited Kingdom
Seekatz, David
UnaffiliatedCanada
Seidl, Helmut
Technische Universität MünchenGermany
Sighireanu, Mihaela
IRIF, Université Paris Diderot, FranceFrance
Singh, Gagandeep
University of Illinois at Urbana-Champaign; VMware ResearchUnited States
Song, Fu
State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, and University of Chinese Academy of Sciences Beijing, ChinaChina
Stade, Yannick
TUM School of Computation, Information and Technology, Technical University of MunichGermany
Stoilkovska, Ilina
AmazonUnited Kingdom
Stucki, Sandro
AmazonSweden
Sui, Yulei
UNSWAustralia
T
Tang, Xuezhou
ShenZhen UniversityChina
Tattersall, Daniel
AmazonUnited States
Titolo, Laura
NIA/NASA LaRCUnited States
U
Urban, Caterina
Inria & École Normale Supérieure | Université PSLFrance
W
Wang, Haoyu
Huazhong University of Science and TechnologyChina
X
Xue, Jingling
UNSWAustralia
Y
Yun, Chaewon
Drexel UniversityUnited States
Z
Zaffanella, Enea
University of Parma, ItalyItaly
Zhang, Qirun
Georgia Institute of TechnologyUnited States
Zhang, Xin
Peking UniversityChina
Zheng, Ye
Shenzhen UniversityChina
Questions? Use the SAS contact form.