Advertisement

Table of contents

  1. Front Matter
    Pages i-xiv
    PDF

  2. Invited Contributions

    1. Front Matter
      Pages 1-1
      PDF
    2. Rethinking Static Analysis by Combining Discrete and Continuous Reasoning
      Mayur Naik
      Pages 3-16
      PDF
    3. Static Analysis of Data Science Software
      Caterina Urban
      Pages 17-23
      PDF

  3. Pointers and Dataflow

    1. Front Matter
      Pages 25-25
      PDF
    2. Fast and Precise Handling of Positive Weight Cycles for Field-Sensitive Pointer Analysis
      Yuxiang Lei, Yulei Sui
      Pages 27-47
      PDF
    3. Per-Dereference Verification of Temporal Heap Safety via Adaptive Context-Sensitive Analysis
      Hua Yan, Shiping Chen, Yulei Sui, Yueqian Zhang, Changwei Zou, Jingling Xue
      Pages 48-72
      PDF
    4. A Change-Based Heuristic for Static Analysis with Policy Iteration
      Marcus Völker, Stefan Kowalewski
      Pages 73-95
      PDF
    5. Syntactic and Semantic Soundness of Structural Dataflow Analysis
      Patrick Cousot
      Pages 96-117
      PDF

  4. Languages and Decidability

    1. Front Matter
      Pages 119-119
      PDF
    2. Abstract Interpretation of Indexed Grammars
      Marco Campion, Mila Dalla Preda, Roberto Giacobazzi
      Pages 121-139
      PDF
    3. Language Inclusion Algorithms as Complete Abstract Interpretations
      Pierre Ganty, Francesco Ranzato, Pedro Valero
      Pages 140-161
      PDF
    4. On the Monniaux Problem in Abstract Interpretation
      Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
      Pages 162-180
      PDF

  5. Numerical

    1. Front Matter
      Pages 181-181
      PDF
    2. Revisiting Polyhedral Analysis for Hybrid Systems
      Anna Becchi, Enea Zaffanella
      Pages 183-202
      PDF
    3. An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection
      Hang Yu, David Monniaux
      Pages 203-224
      PDF
    4. Analysis of Software Patches Using Numerical Abstract Interpretation
      David Delmas, Antoine Miné
      Pages 225-246
      PDF
    5. Verifying Numerical Programs via Iterative Abstract Testing
      Banghu Yin, Liqian Chen, Jiangchao Liu, Ji Wang, Patrick Cousot
      Pages 247-267
      PDF

  6. Trends: Assuring Machine Learning

    1. Front Matter
      Pages 269-269
      PDF
    2. Robustness Verification of Support Vector Machines
      Francesco Ranzato, Marco Zanella
      Pages 271-295
      PDF
    3. Analyzing Deep Neural Networks with Symbolic Propagation: Towards Higher Precision and Faster Verification
      Jianlin Li, Jiangchao Liu, Pengfei Yang, Liqian Chen, Xiaowei Huang, Lijun Zhang
      Pages 296-319
      PDF

  7. Synthesis and Security

    1. Front Matter
      Pages 321-321
      PDF
    2. Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants
      Daniel Neider, Shambwaditya Saha, Pranav Garg, P. Madhusudan
      Pages 323-346
      PDF
    3. Direct Manipulation for Imperative Programs
      Qinheping Hu, Roopsha Samanta, Rishabh Singh, Loris D’Antoni
      Pages 347-367
      PDF
    4. Responsibility Analysis by Abstract Interpretation
      Chaoqiang Deng, Patrick Cousot
      Pages 368-388
      PDF
    5. Abstract Semantic Dependency
      Patrick Cousot
      Pages 389-410
      PDF

  8. Temporal Properties and Termination

    1. Front Matter
      Pages 411-411
      PDF
    2. Temporal Verification of Programs via First-Order Fixpoint Logic
      Naoki Kobayashi, Takeshi Nishikawa, Atsushi Igarashi, Hiroshi Unno
      Pages 413-436
      PDF
    3. A Temporal Logic for Higher-Order Functional Programs
      Yuya Okuyama, Takeshi Tsukada, Naoki Kobayashi
      Pages 437-458
      PDF
    4. Multiphase-Linear Ranking Functions and Their Relation to Recurrent Sets
      Amir M. Ben-Amram, Jesús J. Doménech, Samir Genaim
      Pages 459-480
      PDF
  9. Back Matter
    Pages 481-481
    PDF

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 26th International Symposium on Static Analysis, SAS 2019, held in Porto, Portugal, in October 2019.
The 20 regular papers presented in this book were carefully reviewed and selected from 50 submissions. 
The papers are grouped in topical sections on pointers and dataflow; languages and decidability; numerical; trends: assuring machine learning; synthesis and security; and temporal properties and termination.

Keywords

logics and meanings of programs static analysis abstract domains abstract interpretation automated deduction data flow analysis debugging deductive methods model checking program optimizations and transformations program synthesis program verification security analysis tool environments and architectures type checking

Editors and affiliations

  • Bor-Yuh Evan Chang
    • 1
  1. 1.University of ColoradoBoulderUSA

Bibliographic information