Abstract Semantic Dependency
Abstract elided by the publisher.
783 papers · page 7 of 40
Analysis of Software Patches Using Numerical Abstract Interpretation
Abstract elided by the publisher.
Responsibility Analysis by Abstract Interpretation
Given a behavior of interest in the program, statically determining the corresponding responsible entity is a task of critical importance, especially in program security. Classical static analysis techniques (e.g. dependency analysis, taint analysis, slicing, etc.) assist program…
On the Monniaux Problem in Abstract Interpretation
Abstract elided by the publisher.
Language Inclusion Algorithms as Complete Abstract Interpretations
We study the language inclusion problem \(L_1 \subseteq L_2\) where \(L_1\) is regular. Our approach relies on abstract interpretation and checks whether an overapproximating abstraction of \(L_1\), obtained by successively overapproximating the Kleene iterates of its least fixpo…
Direct Manipulation for Imperative Programs
Abstract elided by the publisher.
Fast and Precise Handling of Positive Weight Cycles for Field-Sensitive Pointer Analysis
Abstract elided by the publisher.
Analyzing Deep Neural Networks with Symbolic Propagation: Towards Higher Precision and Faster Verification
Deep neural networks (DNNs) have been shown lack of robustness for the vulnerability of their classification to small perturbations on the inputs. This has led to safety concerns of applying DNNs to safety-critical domains. Several verification approaches have been developed to a…
Rethinking Static Analysis by Combining Discrete and Continuous Reasoning
Abstract elided by the publisher.
Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants
Abstract elided by the publisher.
A Temporal Logic for Higher-Order Functional Programs
Abstract elided by the publisher.
Robustness Verification of Support Vector Machines
We study the problem of formally verifying the robustness to adversarial examples of support vector machines (SVMs), a major machine learning model for classification and regression tasks. Following a recent stream of works on formal robustness verification of (deep) neural netwo…
Static Analysis of Data Science Software
Abstract elided by the publisher.
A Change-Based Heuristic for Static Analysis with Policy Iteration
Abstract elided by the publisher.
Per-Dereference Verification of Temporal Heap Safety via Adaptive Context-Sensitive Analysis
Abstract elided by the publisher.
Verifying Numerical Programs via Iterative Abstract Testing
Abstract elided by the publisher.
An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection
Polyhedral projection is a main operation of the polyhedron abstract domain. It can be computed via parametric linear programming (PLP), which is more efficient than the classic Fourier-Motzkin elimination method.
Fairness: A Formal-Methods Perspective
Abstract elided by the publisher.
Abstract Interpretation of Stateful Networks
Abstract elided by the publisher.
Block-Size Independence for GPU Programs
Abstract elided by the publisher.