Static analysis : third international symposium, SAS '96, Aachen, Germany, September 24-26, 1996 : proceedings
This book constitutes the refereed proceedings of the Third International Static Analysis Symposium, SAS '96, held in Aachen, Germany, in September 1996 in conjunction with ALP and PLILP. The volume presents 22 highly-quality revised full papers selected from a total of 79 submissions; also inc...
שמור ב:
| מחבר תאגידי: | |
|---|---|
| מחברים אחרים: | , |
| פורמט: | Livre numérique |
| שפה: | Anglais |
| יצא לאור: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| סדרה: | Lecture notes in computer science
1145 |
| נושאים: | |
| גישה מקוונת: | 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, third international symposium, SAS '96, Aachen, Germany, September 24-26, 1996, proceedings, Radhia Cousot, David A. Schmidt, eds, 1996, Berlin, Springer, 1 vol. (IX-388 p.), Lecture notes in computer science, 3-540-61739-6 • Static Analysis, Texte imprimé, 9783662173763 |
תוכן הענינים:
- Constraint-based program analysis
- Semantics-directed program analysis: A tool-maker's perspective
- Property-oriented expansion
- Generalized dominators for structured programs
- Cache behavior prediction by abstract interpretation
- Termination analysis for offline partial evaluation of a higher order functional language
- Proving correctness of Constraint Logic Programs with dynamic scheduling
- Understanding mobile agents via a non-interleaving semantics for facile
- Termination analysis for partial functions
- A freeness and sharing analysis of logic programs based on a pre-interpretation
- Refinement types for program analysis
- A comparison of three occur-check analysers
- Analysis of the equality relations for the program terms
- An even faster solver for general systems of equations
- Inferring program specifications in polynomial-time
- Automated modular termination proofs for real Prolog programs
- Data-flow-based virtual function resolution
- Compiling laziness using projections
- Optimized algorithms for incremental analysis of logic programs
- Tractable constraints in finite semilattices
- Uniformity for the decidability of hybrid automata
- A backward slicing algorithm for Prolog
- Combining slicing and constraint solving for validation of measurement software
- Subtyping constrained types
- Abstract cofibered domains: Application to the alias analysis of untyped programs
- Stan: A static analyzer for CLP({ie383-01}) based on abstract interpretation
- Two applications of an incremental analysis engine for (constraint) logic programs
- PAN The Prolog analyzer.