Cantitate/Preț
Produs

Static Analysis: 29th International Symposium, SAS 2022, Auckland, New Zealand, December 5–7, 2022, Proceedings: Lecture Notes in Computer Science, cartea 13790

Editat de Gagandeep Singh, Caterina Urban
en Limba Engleză Paperback – 2 dec 2022
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. 

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 46584 lei

Preț vechi: 58230 lei
-20% Nou

Puncte Express: 699

Preț estimativ în valută:
8916 9405$ 7430£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031223075
ISBN-10: 3031223071
Pagini: 475
Ilustrații: X, 475 p. 119 illus., 61 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.68 kg
Ediția:1st ed. 2022
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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