SAS 2003
27 papers
- A Logic for Analyzing Abstractions of Graph Transformation Systems
- Abstract Interpretation of Programs as Markov Decision Processes
- Cartesian Factoring of Polyhedra in Linear Relation Analysis
- Checking Interference with Fractional Permissions
- Class-Level Modular Analysis for Object Oriented Languages
- Client-Driven Pointer Analysis
- Code Compaction of Matching Single-Entry Multiple-Exit Regions
- Computer-Assisted Verification of a Protocol for Certified Email
- Continuation-Based Partial Evaluation without Continuations
- Craig Interpolation and Reachability Analysis
- Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory Management
- Existential Heap Abstraction Entailment Is Undecidable
- Inserting Safe Memory Reuse Commands into ML-Like Programs
- Instantaneous Termination in Pure Esterel
- Loop Transformations for Reducing Data Space Requirements of Resource-Constrained Applications
- Message Analysis for Concurrent Languages
- Modular Class Analysis with DATALOG
- Precise Analysis of String Expressions
- Precise Widening Operators for Convex Polyhedra
- Program Development Using Abstract Interpretation (And The Ciao System Preprocessor)
- Selective Tail Call Elimination
- Stack Size Analysis for Interrupt-Driven Programs
- Static Analysis of Accessed Regions in Recursive Data Structures
- Type Systems for Distributed Data Sharing
- Typestate Verification: Abstraction Techniques and Complexity Results
- Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis
- Z-Ranking: Using Statistical Analysis to Counter the Impact of Static Analysis Approximations