Muutke küpsiste eelistusi

Static Analysis: 29th International Symposium, SAS 2022, Auckland, New Zealand, December 57, 2022, Proceedings 1st ed. 2022 [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 475 pages, kõrgus x laius: 235x155 mm, kaal: 741 g, 61 Illustrations, color; 58 Illustrations, black and white; X, 475 p. 119 illus., 61 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13790
  • Ilmumisaeg: 02-Dec-2022
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031223071
  • ISBN-13: 9783031223075
  • Pehme köide
  • Hind: 67,23 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 79,09 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 475 pages, kõrgus x laius: 235x155 mm, kaal: 741 g, 61 Illustrations, color; 58 Illustrations, black and white; X, 475 p. 119 illus., 61 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13790
  • Ilmumisaeg: 02-Dec-2022
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031223071
  • ISBN-13: 9783031223075
This 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. 


Invited 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 boundeddomains.- 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.