Static Analysis [electronic resource] : 30th International Symposium, SAS 2023, Cascais, Portugal, October 22–24, 2023, Proceedings /
Material type: TextSeries: 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
- computer
- online resource
- 9783031442452
- Computer science
- Computer engineering
- Computer networks
- Natural language processing (Computer science)
- Machine theory
- Compilers (Computer programs)
- Computer Science Logic and Foundations of Programming
- Computer Engineering and Networks
- Natural Language Processing (NLP)
- Formal Languages and Automata Theory
- Compilers and Interpreters
- 004.0151 23
- QA75.5-76.95
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.