Amazon cover image
Image from Amazon.com

Static Analysis [electronic resource] : 30th International Symposium, SAS 2023, Cascais, Portugal, October 22–24, 2023, Proceedings /

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 14284Publisher: Cham : Springer Nature Switzerland : Imprint: Springer, 2023Edition: 1st ed. 2023Description: XV, 566 p. 136 illus., 64 illus. in color. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783031442452
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 004.0151 23
LOC classification:
  • QA75.5-76.95
Online resources:
Contents:
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.
In: Springer Nature eBookSummary: Chapter 21 is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

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

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in