國立虎尾科技大學 |

Static Analysis = 23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Static Analysis/ edited by Xavier Rival.
其他題名:	23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings /
其他作者:	Rival, Xavier.
面頁冊數:	X, 511 p. 175 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-662-53413-7
ISBN:	9783662534137

Static Analysis = 23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings /
Static Analysis23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings /[electronic resource] :edited by Xavier Rival. - 1st ed. 2016. - X, 511 p. 175 illus.online resource. - Programming and Software Engineering ;9837. - Programming and Software Engineering ;8987.

Quantitative 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. .

This 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.

ISBN: 9783662534137

Standard No.: 10.1007/978-3-662-53413-7doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Static Analysis = 23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings /
LDR:03480nam a22004095i 4500 001 981101
003 DE-He213
005 20200705085157.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783662534137 $9 978-3-662-53413-7
024 7 $a 10.1007/978-3-662-53413-7 $2 doi
035 $a 978-3-662-53413-7
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Static Analysis $h [electronic resource] : $b 23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings / $c edited by Xavier Rival.
250 $a 1st ed. 2016.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2016.
300 $a X, 511 p. 175 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Programming and Software Engineering ; $v 9837
505 0 $a Quantitative 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 $a This 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 $a Algorithms. $3 527865
650 0 $a Computer logic. $3 786340
650 0 $a Software engineering. $3 562952
650 0 $a Programming languages (Electronic computers). $3 1127615
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Software Engineering. $3 669632
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 669782
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
700 1 $a Rival, Xavier. $e author. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1023610
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662534120
776 0 8 $i Printed edition: $z 9783662534144
830 0 $a Programming and Software Engineering ; $v 8987 $3 1253476
856 4 0 $u https://doi.org/10.1007/978-3-662-53413-7
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)