SAS 2009
23 papers
- A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
- Abstract Interpretation from a Topological Perspective
- Abstract Interpretation of FIFO Replacement
- Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology
- Abstraction Refinement for Quantified Array Assertions
- Algorithmic Program Synthesis with Partial Programs and Decision Procedures
- Algorithmic Verification of Systems Software Using SMT Solvers
- Automatic Parallelization and Optimization of Programs by Proof Rewriting
- Bottom-Up Shape Analysis
- Creating Transformations for Matrix Obfuscation
- Increasing the Scope and Resolution of Interprocedural Static Single Assignment
- Inferring Dataflow Properties of User Defined Table Processors
- Inter-program Properties
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- Invariant Checking for Programs with Procedure Calls
- Optimizing Pointer Analysis Using Bisimilarity
- Polymorphic Fractional Capabilities
- Proving the Correctness of the Implementation of a Control-Command Algorithm
- Refinement of Trace Abstraction
- Region Analysis for Race Detection
- The Causal Graph Revisited for Directed Model Checking
- The Complexity of Andersen's Analysis in Practice
- Type Analysis for JavaScript