SAS 1999
23 papers
- A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives
- A New Class of Functions for Abstract Interpretation
- Abstract Animator for Temporal Specifications: Application to TLA
- Abstract Interpretation of Mobile Ambients
- Abstracting Cryptographic Protocols with Tree Automata
- Binary Decision Graphs
- Binding-Time Analysis for Both Static and Dynamic Expressions
- Decomposing Non-redundant Sharing by Complementation
- Detecting Equalities of Variables: Combining Efficiency with Precision
- Dynamic Partitioning in Analyses of Numerical Properties
- Eliminating Dead Code on Recursive Data
- Equational Semantics
- Freeness Analysis Through Linear Refinement
- Model-Checking: A Tutorial Introduction
- On the Complexity Analysis of Static Analyses
- Partial Dead Code Elimination Using Extended Value Graph
- Polyhedral Analysis for Synchronous Languages
- Safety versus Secrecy
- State Space Reduction Based on Live Variables Analysis
- Static Analyses for Eliminating Unnecessary Synchronization from Java Programs
- Static Analysis of Mega-Programs
- Translating Out of Static Single Assignment Form
- Tutorial: Techniques to Improve the Scalability and Precision of Data Flow Analysis