LEADER 04422nam 22007575 450 001 9910633937403321 005 20251225171918.0 010 $a3-031-22308-X 024 7 $a10.1007/978-3-031-22308-2 035 $a(MiAaPQ)EBC7151154 035 $a(Au-PeEL)EBL7151154 035 $a(CKB)25510415900041 035 $a(PPN)268639175 035 $a(BIP)86564114 035 $a(BIP)86147216 035 $a(DE-He213)978-3-031-22308-2 035 $a(EXLCZ)9925510415900041 100 $a20221201d2022 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aStatic Analysis $e29th International Symposium, SAS 2022, Auckland, New Zealand, December 5?7, 2022, Proceedings /$fedited by Gagandeep Singh, Caterina Urban 205 $a1st ed. 2022. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2022. 215 $a1 online resource (482 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13790 311 08$aPrint version: Singh, Gagandeep Static Analysis Cham : Springer,c2023 9783031223075 320 $aIncludes bibliographical references and index. 327 $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. 330 $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. . 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13790 606 $aComputer science 606 $aComputer engineering 606 $aComputer networks 606 $aNatural language processing (Computer science) 606 $aMachine theory 606 $aCompilers (Computer programs) 606 $aComputer Science Logic and Foundations of Programming 606 $aComputer Engineering and Networks 606 $aNatural Language Processing (NLP) 606 $aFormal Languages and Automata Theory 606 $aCompilers and Interpreters 615 0$aComputer science. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aNatural language processing (Computer science) 615 0$aMachine theory. 615 0$aCompilers (Computer programs) 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aComputer Engineering and Networks. 615 24$aNatural Language Processing (NLP). 615 24$aFormal Languages and Automata Theory. 615 24$aCompilers and Interpreters. 676 $a005.1 676 $a005.13 702 $aSingh$b Gagandeep 702 $aUrban$b Caterina 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910633937403321 996 $aStatic Analysis$92995248 997 $aUNINA