SAS 2004
27 papers
- A Polynomial-Time Algorithm for Global Value Numbering
- A Relational Approach to Interprocedural Shape Analysis
- A Scalable Nonuniform Pointer Analysis for Embedded Programs
- Abstract Interpretation of Combinational Asynchronous Circuits
- An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants
- Approximating the Algebraic Relational Semantics of Imperative Programs
- Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer Analysis
- Closed and Logical Relations for Over- and Under-Approximation of Powersets
- Completeness Refinement in Abstract Symbolic Trajectory Evaluation
- Constraint-Based Linear-Relations Analysis
- Generalized Records and Spatial Conjunction in Role Logic
- Information Flow Analysis in Logical Form
- Injecting Life with Computers
- Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language
- Non-termination Inference for Constraint Logic Programs
- On Logics of Aliasing
- Partially Disjunctive Heap Abstraction
- Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
- Pointer-Range Analysis
- Program Generators and the Tools to Make Them
- Shape Analysis Quantitative Shape Analysis
- Spatial Analysis of BioAmbients
- Static Analysis of Gated Data Dependence Graphs
- The Blast Query Language for Software Verification
- The Octahedron Abstract Domain
- Towards Declarative Programming for Web Services
- Type Inference Against Races