Static Analysis 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11-13, 2003. Proceedings /
Συγγραφή απο Οργανισμό/Αρχή: | |
---|---|
Άλλοι συγγραφείς: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2003.
|
Έκδοση: | 1st ed. 2003. |
Σειρά: | Lecture Notes in Computer Science,
2694 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Static Analysis of Object-Oriented Languages
- Precise Analysis of String Expressions
- Modular Class Analysis with DATALOG
- Class-Level Modular Analysis for Object Oriented Languages
- Static Analysis of Concurrent Languages
- Checking Interference with Fractional Permissions
- Message Analysis for Concurrent Languages
- Instantaneous Termination in Pure Esterel
- Stack Size Analysis for Interrupt-Driven Programs
- Invited Paper
- Program Development Using Abstract Interpretation (And the Ciao System Preprocessor)
- Static Analysis of Functional Languages
- Selective Tail Call Elimination
- Inserting Safe Memory Reuse Commands into ML-Like Programs
- Static Analysis of Procedural Languages
- Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis
- Client-Driven Pointer Analysis
- Abstract Interpretation of Programs as Markov Decision Processes
- Static Data Analysis
- A Logic for Analyzing Abstractions of Graph Transformation Systems
- Type Systems for Distributed Data Sharing
- Z-Ranking: Using Statistical Analysis to Counter the Impact of Static Analysis Approximations
- Computer-Assisted Verification of a Protocol for Certified Email
- Invited Talk
- Craig Interpolation and Reachability Analysis
- Static Linear Relation Analysis
- Precise Widening Operators for Convex Polyhedra
- Cartesian Factoring of Polyhedra in Linear Relation Analysis
- Static Analysis Based Program Transformation
- Continuation-Based Partial Evaluation without Continuations
- Loop Transformations for Reducing Data Space Requirements of Resource-Constrained Applications
- Code Compaction of Matching Single-Entry Multiple-Exit Regions
- Static Heap Analysis
- Existential Heap Abstraction Entailment Is Undecidable
- Typestate Verification: Abstraction Techniques and Complexity Results
- Static Analysis of Accessed Regions in Recursive Data Structures
- Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory Management.