000 04077nam a22005655i 4500
001 978-3-642-03237-0
003 DE-He213
005 20160624102132.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642032370
_9978-3-642-03237-0
024 7 _a10.1007/978-3-642-03237-0
_2doi
050 4 _aQA76.7-76.73
050 4 _aQA76.76.C65
072 7 _aUMX
_2bicssc
072 7 _aUMC
_2bicssc
072 7 _aCOM051010
_2bisacsh
072 7 _aCOM010000
_2bisacsh
082 0 4 _a005.13
_223
245 1 0 _aStatic Analysis
_h[electronic resource] :
_b16th International Symposium, SAS 2009, Los Angeles, CA, USA, August 9-11, 2009. Proceedings /
_cedited by Jens Palsberg, Zhendong Su.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2009.
300 _aX, 362 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5673
505 0 _aInvited 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aSoftware Engineering.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aProgramming Techniques.
700 1 _aPalsberg, Jens.
_eeditor.
700 1 _aSu, Zhendong.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642032363
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5673
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-03237-0
942 _2EBK8640
_cEBK
999 _c37934
_d37934