000 04044nam a22006135i 4500
001 978-3-031-44245-2
003 DE-He213
005 20240730201631.0
007 cr nn 008mamaa
008 231023s2023 sz | s |||| 0|eng d
020 _a9783031442452
_9978-3-031-44245-2
024 7 _a10.1007/978-3-031-44245-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aStatic Analysis
_h[electronic resource] :
_b30th International Symposium, SAS 2023, Cascais, Portugal, October 22-24, 2023, Proceedings /
_cedited by Manuel V. Hermenegildo, José F. Morales.
250 _a1st ed. 2023.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2023.
300 _aXV, 566 p. 136 illus., 64 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14284
505 0 _aVerifying 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.
520 _aChapter 21 is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
650 0 _aComputer science.
_99832
650 0 _aComputer engineering.
_910164
650 0 _aComputer networks .
_931572
650 0 _aNatural language processing (Computer science).
_94741
650 0 _aMachine theory.
_9168082
650 0 _aCompilers (Computer programs).
_93350
650 1 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aComputer Engineering and Networks.
_9168083
650 2 4 _aNatural Language Processing (NLP).
_931587
650 2 4 _aFormal Languages and Automata Theory.
_9168084
650 2 4 _aCompilers and Interpreters.
_931853
700 1 _aHermenegildo, Manuel V.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9168085
700 1 _aMorales, José F.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9168086
710 2 _aSpringerLink (Online service)
_9168087
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031442445
776 0 8 _iPrinted edition:
_z9783031442469
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14284
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-44245-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c96634
_d96634