UID:
almahu_9947364155702882
Format:
X, 362 p.
,
online resource.
ISBN:
9783642032370
Series Statement:
Lecture Notes in Computer Science, 5673
Content:
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.
Note:
Invited Talks -- Algorithmic Program Synthesis with Partial Programs and Decision Procedures -- Algorithmic Verification of Systems Software Using SMT Solvers -- Contributed Papers -- Abstraction Refinement for Quantified Array Assertions -- Inferring Dataflow Properties of User Defined Table Processors -- Polymorphic Fractional Capabilities -- Automatic Parallelization and Optimization of Programs by Proof Rewriting -- Refinement of Trace Abstraction -- The Causal Graph Revisited for Directed Model Checking -- Proving the Correctness of the Implementation of a Control-Command Algorithm -- Abstract Interpretation of FIFO Replacement -- A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination -- Increasing the Scope and Resolution of Interprocedural Static Single Assignment -- Region Analysis for Race Detection -- Bottom-Up Shape Analysis -- The Complexity of Andersen’s Analysis in Practice -- Optimizing Pointer Analysis Using Bisimilarity -- Type Analysis for JavaScript -- Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology -- Creating Transformations for Matrix Obfuscation -- Abstract Interpretation from a Topological Perspective -- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships -- Invariant Checking for Programs with Procedure Calls -- Inter-program Properties.
In:
Springer eBooks
Additional Edition:
Printed edition: ISBN 9783642032363
Language:
English
DOI:
10.1007/978-3-642-03237-0
URL:
http://dx.doi.org/10.1007/978-3-642-03237-0
Bookmarklink
