000 04143nam a22006135i 4500
001 978-3-031-22308-2
003 DE-He213
005 20240423125143.0
007 cr nn 008mamaa
008 221201s2022 sz | s |||| 0|eng d
020 _a9783031223082
_9978-3-031-22308-2
024 7 _a10.1007/978-3-031-22308-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aStatic Analysis
_h[electronic resource] :
_b29th International Symposium, SAS 2022, Auckland, New Zealand, December 5–7, 2022, Proceedings /
_cedited by Gagandeep Singh, Caterina Urban.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2022.
300 _aX, 475 p. 119 illus., 61 illus. in color.
_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,
_x1611-3349 ;
_v13790
505 0 _aInvited Talks -- Specification-Guided Reinforcement Learning -- Towards Efficient Reasoning of Quantum Programs -- Regular Papers -- Solving Invariant Generation for Unsolvable Loops -- Principles of Staged Static+Dynamic Partial Analysis -- SecWasm: Information Flow Control for WebAssembly -- Lifting Numeric Relational Domains to Algebraic Data Types -- Automated Synthesis of Asynchronizations -- Case Study on Veri cation-Witness Validators: Where We Are and Where We Go -- Deciding program properties via complete abstractions on bounded domains -- Invariant Inference With Provable Complexity From the Monotone Theory -- Efficient Modular SMT-Based Model Checking of Pointer Programs -- Property-driven code obfuscations - Reinterpreting Jones-optimality in Abstract Interpretation -- Bootstrapping Library-Based Synthesis -- Boosting Robustness Veri cation of Semantic Feature Neighborhoods -- Fast and incremental computation of weak control closure -- Local Completeness Logic on Kleene Algebra with Tests -- Semantic Foundations for Cost Analysis of Pipeline-Optimized Programs -- Parameterized Recursive Re nement Types for Automated Program Verification -- Adversarial Logic -- CLEVEREST: Accelerating CEGAR-based Neural Network Verification via Adversarial Attacks.
520 _aThis book constitutes the refereed proceedings of the 29th International Symposium on Static Analysis, SAS 2022, held in Auckland, New Zealand, in December 2022. The 18 full papers included in this book were carefully reviewed and selected from 43 submissions. Static analysis is widely recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The papers deal with theoretical, practical and application advances in the area. .
650 0 _aComputer science.
650 0 _aComputer engineering.
650 0 _aComputer networks .
650 0 _aNatural language processing (Computer science).
650 0 _aMachine theory.
650 0 _aCompilers (Computer programs).
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aComputer Engineering and Networks.
650 2 4 _aNatural Language Processing (NLP).
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aCompilers and Interpreters.
700 1 _aSingh, Gagandeep.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aUrban, Caterina.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031223075
776 0 8 _iPrinted edition:
_z9783031223099
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13790
856 4 0 _uhttps://doi.org/10.1007/978-3-031-22308-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c174838
_d174838