000 04165nam a22005895i 4500
001 978-3-662-53413-7
003 DE-He213
005 20240423130015.0
007 cr nn 008mamaa
008 160830s2016 gw | s |||| 0|eng d
020 _a9783662534137
_9978-3-662-53413-7
024 7 _a10.1007/978-3-662-53413-7
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aStatic Analysis
_h[electronic resource] :
_b23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings /
_cedited by Xavier Rival.
250 _a1st ed. 2016.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2016.
300 _aX, 511 p. 175 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aProgramming and Software Engineering,
_x2945-9168 ;
_v9837
505 0 _aQuantitative Monitor Automata -- The Julia Static Analyzer for Java -- Automated Verification of Linearization Policies -- Structure-Sensitive Points-To Analysis for C and C -- Bounded Abstract Interpretation -- Completeness in Approximate Transduction -- Relational Verification through Horn clause transformation -- Securing A Compiler Transformation -- Exploiting sparsity in difference-bound matrices -- Flow- and Context-Sensitive Points-to Analysis using Generalized Points-to Graphs -- Learning a Variable-Clustering Strategy for Octagon From Labeled Data Generated by a Static Analysis -- Static Analysis by Abstract Interpretation of the Functional Correctness of Matrix Manipulating Program -- Generalized Homogeneous Polynomials for Efficient Template-Based Nonlinear Invariant -- On the linear ranking problem for simple floating-point loops -- Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM -- A Parametric Abstract Domain for Lattice-Valued Regular Expressions -- Cell morphing: from array programs to array-free Horn clauses -- Loopy: Programmable and Formally Verified Loop Transformations -- Abstract Interpretation of Supermodular Games -- Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants -- Enforcing Termination of Interprocedural Analysis -- From Array Domains to Abstract Interpretation under Store-Buffer-Based Memory Models -- Making k-Object-Sensitive Pointer Analysis More Precise with Still k-Limiting. .
520 _aThis book constitutes the refereed proceedings of the 23rd International Static Analysis Symposium, SAS 2016, held in Edinburgh, UK, in September 2016. The 21 papers presented in this volume were carefully reviewed and selected from 55 submissions. The contributions cover a variety of multi-disciplinary topics in abstract domains; abstract interpretation; abstract testing; bug detection; data flow analysis; model checking; new applications; program transformation; program verification; security analysis; theoretical frameworks; and type checking.
650 0 _aAlgorithms.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aCompilers (Computer programs).
650 0 _aMachine theory.
650 1 4 _aAlgorithms.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aSoftware Engineering.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aRival, Xavier.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662534120
776 0 8 _iPrinted edition:
_z9783662534144
830 0 _aProgramming and Software Engineering,
_x2945-9168 ;
_v9837
856 4 0 _uhttps://doi.org/10.1007/978-3-662-53413-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c184029
_d184029