SAS 2014
20 papers
- A Decision Tree Abstract Domain for Proving Conditional Termination
- A Progress Bar for Static Analyzers
- An Abstract Domain Combinator for Separately Conjoining Memory Abstractions
- An Abstract Domain to Infer Octagonal Constraints with Absolute Value
- Automatic Analysis of Open Objects in Dynamic Language Programs
- Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction
- Block Me If You Can! - Context-Sensitive Parameterized Verification
- Cost-Aware Automatic Program Repair
- Cyclic Abduction of Inductively Defined Safety and Termination Preconditions
- Expectation Invariants for Probabilistic Program Loops as Fixed Points
- Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations
- On Program Equivalence with Reductions
- Peak Cost Analysis of Distributed Systems
- Reactivity of Cooperative Systems - Application to ReactiveML
- Region-Based Selective Flow-Sensitive Pointer Analysis
- SawjaCard: A Static Analysis Tool for Certifying Java Card Applications
- Sparse Dataflow Analysis with Pointers and Reachability
- Speeding Up Logico-Numerical Strategy Iteration
- Synthesis of Memory Fences via Refinement Propagation
- Verifying Recursive Programs Using Intraprocedural Analyzers