Static Analysis 30th International Symposium, SAS 2023, Cascais, Portugal, October 22–24, 2023, Proceedings /

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

Saved in:
Bibliografiske detaljer
Institution som forfatter: SpringerLink (Online service)
Andre forfattere: Hermenegildo, Manuel V. (Editor), Morales, José F. (Editor)
Format: Electronisk eBog
Sprog:engelsk
Udgivet: Cham : Springer Nature Switzerland : Imprint: Springer, 2023.
Udgivelse:1st ed. 2023.
Serier:Lecture Notes in Computer Science, 14284
Fag:
Online adgang:https://doi.org/10.1007/978-3-031-44245-2
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
Indholdsfortegnelse:
  • 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.