Static Analysis: 16th International Symposium, SAS 2009, Los Angeles, CA, USA, August 9-11, 2009. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 16th International Symposium on Static Analysis, SAS 2009, held in Los Angeles, CA, USA in August 2009 - co-located with LICS 2009, the 24th IEEE Symposium on Logic in Computer Science.

The 21 revised full papers presented together with two invited lectures were carefully reviewed and selected from 52 submissions. The papers address all aspects of static analysis including abstract domains, abstract interpretation, abstract testing, compiler optimizations, control flow analysis, data flow analysis, model checking, program specialization, security analysis, theoretical analysis frameworks, type based analysis, and verification systems.

Author(s): Rastislav Bodik (auth.), Jens Palsberg, Zhendong Su (eds.)
Series: Lecture Notes in Computer Science 5673 : Programming and Software Engineering
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2009

Language: English
Pages: 362
Tags: Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Software Engineering; Mathematical Logic and Formal Languages; Programming Techniques

Front Matter....Pages -
Algorithmic Program Synthesis with Partial Programs and Decision Procedures....Pages 1-1
Algorithmic Verification of Systems Software Using SMT Solvers....Pages 2-2
Abstraction Refinement for Quantified Array Assertions....Pages 3-18
Inferring Dataflow Properties of User Defined Table Processors....Pages 19-35
Polymorphic Fractional Capabilities....Pages 36-51
Automatic Parallelization and Optimization of Programs by Proof Rewriting....Pages 52-68
Refinement of Trace Abstraction....Pages 69-85
The Causal Graph Revisited for Directed Model Checking....Pages 86-101
Proving the Correctness of the Implementation of a Control-Command Algorithm....Pages 102-119
Abstract Interpretation of FIFO Replacement....Pages 120-136
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination....Pages 137-153
Increasing the Scope and Resolution of Interprocedural Static Single Assignment....Pages 154-170
Region Analysis for Race Detection....Pages 171-187
Bottom-Up Shape Analysis....Pages 188-204
The Complexity of Andersen’s Analysis in Practice....Pages 205-221
Optimizing Pointer Analysis Using Bisimilarity....Pages 222-237
Type Analysis for JavaScript....Pages 238-255
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology....Pages 256-272
Creating Transformations for Matrix Obfuscation....Pages 273-292
Abstract Interpretation from a Topological Perspective....Pages 293-308
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships....Pages 309-325
Invariant Checking for Programs with Procedure Calls....Pages 326-342
Inter-program Properties....Pages 343-359
Back Matter....Pages -