Static analysis : 6th international symposium, SAS'99, Venice, Italy, September 22-24, 1999 : proceedings
Static analysis is increasingly recognized as a fundamental reasearch area aimed at studying and developing tools for high performance implementations and v- i cation systems for all programming language paradigms. The last two decades have witnessed substantial developments in this eld, ranging fro...
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
1694 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Static analysis, 6th international symposium, SAS'99, Venice, Italy, September 22-24, 1999, proceedings, Agostino Cortesi, Gilberto File eds, 1999, New York, Springer, 1 vol. (VIII-356 p.), Lecture notes in computer science, 3-540-66459-9 • Static Analysis, Texte imprimé, 9783662201237 |
جدول المحتويات:
- Synchronization in JAVA Programs
- A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives
- Static Analyses for Eliminating Unnecessary Synchronization from Java Programs
- Synchronous Languages
- Dynamic Partitioning in Analyses of Numerical Properties
- Polyhedral Analysis for Synchronous Languages
- Abstract Domains
- Decomposing Non-redundant Sharing by Complementation
- Freeness Analysis Through Linear Refinement
- Binary Decision Graphs
- Binding-Time Analysis for Both Static and Dynamic Expressions
- Concurrency
- Abstract Interpretation of Mobile Ambients
- Abstracting Cryptographic Protocols with Tree Automata
- State Space Reduction Based on Live Variables Analysis
- Static Single Assignment
- Partial Dead Code Elimination Using Extended Value Graph
- Translating Out of Static Single Assignment Form
- Optimizations
- Eliminating Dead Code on Recursive Data
- Detecting Equalities of Variables: Combining Efficiency with Precision
- Foundations
- A New Class of Functions for Abstract Interpretation
- Equational Semantics
- Abstract Animator for Temporal Specifications: Application to TLA
- Invited Talks and Tutorials
- Static Analysis of Mega-Programs
- Safety versus Secrecy
- On the Complexity Analysis of Static Analyses
- Model-Checking
- Tutorial: Techniques to Improve the Scalability and Precision of Data Flow Analysis.