16. SAS 2009: Los Angeles, CA, USA

Invited Talks

• Rastislav Bodík:
  Algorithmic Program Synthesis with Partial Programs and Decision Procedures. 1
  
• Shaz Qadeer:
  Algorithmic Verification of Systems Software Using SMT Solvers. 2
  

Contributed Papers

• Mohamed Nassim Seghir, Andreas Podelski, Thomas Wies:
  Abstraction Refinement for Quantified Array Assertions. 3-18
  
• Songtao Xia, Manuel Fähndrich, Francesco Logozzo:
  Inferring Dataflow Properties of User Defined Table Processors. 19-35
  
• Hirotoshi Yasuoka, Tachio Terauchi:
  Polymorphic Fractional Capabilities. 36-51
  
• Clément Hurlin:
  Automatic Parallelization and Optimization of Programs by Proof Rewriting. 52-68
  
• Matthias Heizmann, Jochen Hoenicke, Andreas Podelski:
  Refinement of Trace Abstraction. 69-85
  
• Martin Wehrle, Malte Helmert:
  The Causal Graph Revisited for Directed Model Checking. 86-101
  
• Olivier Bouissou:
  Proving the Correctness of the Implementation of a Control-Command Algorithm. 102-119
  
• Daniel Grund, Jan Reineke:
  Abstract Interpretation of FIFO Replacement. 120-136
  
• David Niedzielski, Jeffery von Ronne, Andreas Gampe, Kleanthis Psarris:
  A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination. 137-153
  
• Silvian Calman, Jianwen Zhu:
  Increasing the Scope and Resolution of Interprocedural Static Single Assignment. 154-170
  
• Helmut Seidl, Vesal Vojdani:
  Region Analysis for Race Detection. 171-187
  
• Bhargav S. Gulavani, Supratik Chakraborty, Ganesan Ramalingam, Aditya V. Nori:
  Bottom-Up Shape Analysis. 188-204
  
• Manu Sridharan, Stephen J. Fink:
  The Complexity of Andersen's Analysis in Practice. 205-221
  
• Luke Simon:
  Optimizing Pointer Analysis Using Bisimilarity. 222-237
  
• Simon Holm Jensen, Anders Møller, Peter Thiemann:
  Type Analysis for JavaScript. 238-255
  
• Kyung-Goo Doh, Hyunha Kim, David A. Schmidt:
  Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology. 256-272
  
• Stephen Drape, Irina Voiculescu:
  Creating Transformations for Matrix Obfuscation. 273-292
  
• David A. Schmidt:
  Abstract Interpretation from a Topological Perspective. 293-308
  
• Liqian Chen, Antoine Miné, Ji Wang, Patrick Cousot:
  Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships. 309-325
  
• Guillem Godoy, Ashish Tiwari:
  Invariant Checking for Programs with Procedure Calls. 326-342
  
• Andrei Voronkov, Iman Narasamdya:
  Inter-program Properties. 343-359