SAS 2016
24 papers
- A Parametric Abstract Domain for Lattice-Valued Regular Expressions
- Abstract Interpretation of Supermodular Games
- Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM
- Automated Verification of Linearization Policies
- Bounded Abstract Interpretation
- Cell Morphing: From Array Programs to Array-Free Horn Clauses
- Completeness in Approximate Transduction
- Enforcing Termination of Interprocedural Analysis
- Exploiting Sparsity in Difference-Bound Matrices
- Flow- and Context-Sensitive Points-To Analysis Using Generalized Points-To Graphs
- From Array Domains to Abstract Interpretation Under Store-Buffer-Based Memory Models
- Generalized Homogeneous Polynomials for Efficient Template-Based Nonlinear Invariant Synthesis
- Learning a Variable-Clustering Strategy for Octagon from Labeled Data Generated by a Static Analysis
- Loopy: Programmable and Formally Verified Loop Transformations
- Making k-Object-Sensitive Pointer Analysis More Precise with Still k-Limiting
- On the Linear Ranking Problem for Simple Floating-Point Loops
- Quantitative Monitor Automata
- Relational Verification Through Horn Clause Transformation
- Securing a Compiler Transformation
- Simulation and Invariance for Weak Consistency
- Static Analysis by Abstract Interpretation of the Functional Correctness of Matrix Manipulating Programs
- Structure-Sensitive Points-To Analysis for C and C++
- The Julia Static Analyzer for Java
- Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants