SAS 2006
27 papers
- Abstract Interpretation with Specialized Definitions
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Analysis of Low-Level Code Using Cooperating Decompilers
- Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm
- Beyond Iteration Vectors: Instancewise Relational Abstract Domains
- Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic
- Catching and Identifying Bugs in Register Allocation
- Certificate Translation for Optimizing Compilers
- Combining Widening and Acceleration in Linear Relation Analysis
- Cryptographically-Masked Flows
- Existential Label Flow Inference Via CFL Reachability
- Interprocedural Shape Analysis with Separated Heap Abstractions
- Memory Leak Analysis by Contradiction
- Parametric and Termination-Sensitive Control Dependence
- Path-Sensitive Dataflow Analysis with Iterative Refinement
- Proving the Properties of Communicating Imperfectly-Clocked Synchronous Systems
- Recency-Abstraction for Heap-Allocated Storage
- Separation Logic and Program Analysis
- Shape Analysis for Low-Level Code
- Specialized 3-Valued Logic Shape Analysis Using Structure-Based Refinement and Loose Embedding
- Static Analysis for Java Servlets and JSP
- Static Analysis in Disjunctive Numerical Domains
- Static Analysis of Numerical Algorithms
- Static Analysis of String Manipulations in Critical Embedded C Programs
- Structural Invariants
- Underapproximating Predicate Transformers
- Unleashing the Power of Static Analysis