A Formal Framework to Measure the Incompleteness of Abstract Interpretations
Abstract elided by the publisher.
26,098 papers · page 191 of 1,305
BREWasm: A General Static Binary Rewriting Framework for WebAssembly
Abstract elided by the publisher.
Quantum Constant Propagation
Abstract A quantum circuit is often executed on the initial state where each qubit is in the zero state. Therefore, we propose to perform a symbolic execution of the circuit. Our approach simulates groups of entangled qubits exactly up to a given complexity. Here, the complexity …
Verifying Infinitely Many Programs at Once
Abstract elided by the publisher.
Error Invariants for Fault Localization via Abstract Interpretation
Abstract elided by the publisher.
Generalized Program Sketching by Abstract Interpretation and Logical Abduction
Abstract elided by the publisher.
Mutual Refinements of Context-Free Language Reachability
Abstract elided by the publisher.
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses
Abstract elided by the publisher.
How Fitting is Your Abstract Domain?
Abstract elided by the publisher.
A Product of Shape and Sequence Abstractions
Abstract elided by the publisher.
Error Localization for Sequential Effect Systems
Abstract elided by the publisher.
Scaling up Roundoff Analysis of Functional Data Structure Programs
Abstract Floating-point arithmetic is counter-intuitive due to inherent rounding errors that potentially occur at every arithmetic operation. A selection of automated tools now exists to ensure correctness of floating-point programs by computing guaranteed bounds on rounding erro…
Abstract Interpretation in Industry - Experience and Lessons Learned
Abstract elided by the publisher.
Reverse Template Processing Using Abstract Interpretation
Abstract elided by the publisher.
Domain Precision in Galois Connection-Less Abstract Interpretation
Abstract elided by the publisher.
Lifting On-Demand Analysis to Higher-Order Languages
Abstract elided by the publisher.
Octagons Revisited - Elegant Proofs and Simplified Algorithms
. Weakly relational domains have enjoyed tremendous success in the area of program analysis, since they offer a decent compromise between precision and efficiency. Octagons , in particular, have widely been studied to obtain efficient algorithms which, however, come with intricate cor…
Polynomial Analysis of Modular Arithmetic
Abstract elided by the publisher.
Building Trust and Safety in Artificial Intelligence with Abstract Interpretation
Abstract elided by the publisher.
Boosting Multi-neuron Convex Relaxation for Neural Network Verification
Abstract elided by the publisher.