SAS 2019: 26TH INTERNATIONAL STATIC ANALYSIS SYMPOSIUM

This page contains an index consisting of author-provided keywords.

A
Abstract domain	Robustness Verification of Support Vector Machines
Abstract interpretation	Analyzing Deep Neural Networks with Symbolic Propagation: Towards Higher Precision and Faster Verification Language Inclusion Algorithms as Complete Abstract Interpretations On the Monniaux Problem in Abstract Interpretation Verifying Numerical Programs via Iterative Abstract Testing Abstract Interpretation of Indexed Grammars Responsibility Analysis by Abstract Interpretation Analysis of Software Patches using Numerical Abstract Interpretation Abstract Semantic Dependency Syntactic and Semantic Soundness of Structural Dataflow Analysis
Automata	Language Inclusion Algorithms as Complete Abstract Interpretations
C
Convex Polyhedra	Revisiting Polyhedral Analysis for Hybrid Systems
D
Dataflow analysis	Syntactic and Semantic Soundness of Structural Dataflow Analysis
deep neural network	Analyzing Deep Neural Networks with Symbolic Propagation: Towards Higher Precision and Faster Verification
Dependency	Responsibility Analysis by Abstract Interpretation
F
field-sensitive	Fast and Precise Handling of Positive Weight Cycles for Field-sensitive Pointer Analysis
fixpoint logic	Temporal Verification of Programs via First-Order Fixpoint Logic
Floating-point arithmetic	An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection
Formal Languages	Abstract Interpretation of Indexed Grammars
Formal verification	Robustness Verification of Support Vector Machines
H
Heuristic	A Change-based Heuristic for Static Analysis with Policy Iteration
higher-order model checking	A Temporal Logic for Higher-Order Functional Programs
higher-order programs	A Temporal Logic for Higher-Order Functional Programs
Hybrid Systems	Revisiting Polyhedral Analysis for Hybrid Systems
I
Invariant synthesis	On the Monniaux Problem in Abstract Interpretation Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants
L
Language inclusion	Language Inclusion Algorithms as Complete Abstract Interpretations
learning	Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants
linear temporal logic	A Temporal Logic for Higher-Order Functional Programs
M
memory safety	Per-Dereference Verification of Temporal Heap Safety via Adaptive Context-Sensitive Analysis
N
numeric domains	Analysis of Software Patches using Numerical Abstract Interpretation
P
pointer analysis	Per-Dereference Verification of Temporal Heap Safety via Adaptive Context-Sensitive Analysis
Policy iteration	A Change-based Heuristic for Static Analysis with Policy Iteration
Polyhedral projection	An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection
Powerset Domain	Revisiting Polyhedral Analysis for Hybrid Systems
program repair	Direct Manipulation for Imperative Programs
Program Security	Responsibility Analysis by Abstract Interpretation
program synthesis	Direct Manipulation for Imperative Programs
program verification	Verifying Numerical Programs via Iterative Abstract Testing Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants Temporal Verification of Programs via First-Order Fixpoint Logic Analysis of Software Patches using Numerical Abstract Interpretation
R
Ranking Functions	Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets
Reachability Analysis	Revisiting Polyhedral Analysis for Hybrid Systems
Recurrent Sets	Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets
Reduced affine form	Robustness Verification of Support Vector Machines
Robustness verification	Robustness Verification of Support Vector Machines
S
semantic difference analysis	Analysis of Software Patches using Numerical Abstract Interpretation
software patch	Analysis of Software Patches using Numerical Abstract Interpretation
Soundness	Syntactic and Semantic Soundness of Structural Dataflow Analysis
static analysis	Fast and Precise Handling of Positive Weight Cycles for Field-sensitive Pointer Analysis Responsibility Analysis by Abstract Interpretation Analysis of Software Patches using Numerical Abstract Interpretation Per-Dereference Verification of Temporal Heap Safety via Adaptive Context-Sensitive Analysis Abstract Semantic Dependency
Support vector machine	Robustness Verification of Support Vector Machines
symbolic propagation	Analyzing Deep Neural Networks with Symbolic Propagation: Towards Higher Precision and Faster Verification
T
temporal properties	Temporal Verification of Programs via First-Order Fixpoint Logic
Termination and Nontermination Analysis	Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets
V
Value set analysis	A Change-based Heuristic for Static Analysis with Policy Iteration
Verification	On the Monniaux Problem in Abstract Interpretation A Temporal Logic for Higher-Order Functional Programs
W
Well-quasiorders	Language Inclusion Algorithms as Complete Abstract Interpretations

Disclaimer | Powered by EasyChair Smart Program