Cantitate/Preț
Produs
Total produse
Vezi coșul
Static Analysis de Manuel V. Hermenegildo

Static Analysis: Lecture Notes in Computer Science

Editat de Manuel V. Hermenegildo, José F. Morales
en Limba Engleză Paperback – 24 oct 2023
This book constitutes the refereed proceedings of the 30th International Symposium on Static Analysis, SAS 2023, held in Lisbon, Portugal, in October 2023. The 20 full papers included in this book were carefully reviewed and selected from 40 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.
Chapter 21 is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.



Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 45617 lei

Preț vechi: 62380 lei
-27%

Puncte Express: 684
Preț estimativ în valută:
8068€ • 9432$ • 7014£

Carte indisponibilă temporar

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783031442445
ISBN-10: 303144244X
Pagini: 584
Ilustrații: XV, 566 p. 136 illus., 64 illus. in color.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.87 kg
Ediția:2023
Editura: Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Verifying Infinitely Many Programs at Once.- Abstract Interpretation in Industry - Experience and Lessons Learned.- Building Trust and Safety in Artificial Intelligence with Abstract Interpretation.- Modular Optimization-Based Roundo Error Analysis of Floating-Point Programs.- Unconstrained Variable Oracles for Faster Numeric Static Analyses.- Symbolic transformation of expressions in modular arithmetic.- A Formal Framework to Measure the Incompleteness of Abstract Interpretations.- BREWasm: A General Static Binary Rewriting Framework for WebAssembly.- Quantum Constant Propagation.- Error Invariants for Fault Localization via Abstract Interpretation.- Generalized Program Sketching by Abstract Interpretation and Logical Abduction.- Mutual Refinements of Context-Free Language Reachability.- ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses.- How fitting is your abstract domain? .- A Product of Shape and Sequence Abstractions.- Error Localization for Sequential EffectSystems.- Scaling up Roundo Analysis of Functional Data Structure Programs.- Reverse Template Processing using Abstract Interpretation.-  Domain Precision in Galois Connection-less Abstract Interpretation.- Lifting On-Demand Analysis to Highe-Order Languages.- Octagons Revisited - Elegant Proofs and Simplified Algorithms.- Polynomial Analysis of Modular Arithmetic.- Boosting Multi-Neuron Convex Relaxation for Neural Network Verification.

Textul de pe ultima copertă

Chapter 21 is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.