Cantitate/Preț
Produs

Static Analysis: Lecture Notes in Computer Science, cartea 12913

Editat de Cezara Dr¿goi, Suvam Mukherjee, Kedar Namjoshi
en Limba Engleză Paperback – 14 oct 2021
This book constitutes the refereed proceedings of the 28th International Symposium on Static Analysis, SAS 2021, held in Chicago, IL, USA, in October 2021. The 18 regular and 4 short papers, carefully reviewed and selected from 48 submissions, are presented in this book  together with 1-page summaries of the three invited talks. The papers cover topics such as static program analysis, abstract domain, abstract interpretation, automated deduction, debugging techniques, deductive methods, model checking, data science, program optimizations and transformations, program synthesis, program verification, and security analysis.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 52420 lei

Preț vechi: 65524 lei
-20%

Puncte Express: 786

Preț estimativ în valută:
9269 10629$ 8011£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai


Specificații

ISBN-13: 9783030888053
ISBN-10: 3030888053
Pagini: 496
Ilustrații: XVI, 479 p. 166 illus., 97 illus. in color.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.74 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Fast and Efficient Bit-Level Precision Tuning.- Backward Symbolic Execution with Loop Folding.- Accelerating Program Analyses in Datalog by Merging Library Facts.- Abstract Interpretation.- Verified Functional Programming of an Abstract Interpreter.- Disjunctive Interval Analysis.- Static analysis of ReLU neural networks with tropical polyhedral.- Exploiting Verified Neural Networks via Floating Point Numerical Error.-Verifying Low-dimensional Input Neural Networks via Input Quantization.- Data Abstraction: A General Framework to Handle Program.- Verification of Data Structures.- Toward Neural-Network-Guided Program Synthesis and Verification.- Selective Context-Sensitivity for k-CFA with CFL-Reachability.- Selectively-Amortized Resource Bounding.- Reduced Products of Abstract Domains for Fairness Certification of Neural Networks.- A Multi-Language Static Analysis of Python Programs with Native C Extensions.- Automated Verification of the Parallel Bellman–Ford Algorithm.- Improving Thread-Modular Abstract Interpretation.- Thread-modular Analysis of Release-Acquire Concurrency.- Symbolic Automatic Relations and Their Applications to SMT and CHC Solving.- Compositional Verification of Smart Contracts Through Communication Abstraction.- Automatic Synthesis of Data-Flow Analyzer.