Static analysis : First International Static Analysis Symposium, SAS '94, Namur, Belgium, September 28 30, 1994 : proceedings
This volume presents the proceedings of the First International Static Analysis Symposium (SAS '94), held in Namur, Belgium in September 1994. The proceedings comprise 25 full refereed papers selected from 70 submissions as well as four invited contributions by Charles Consel, Saumya K. Debray,...
Сохранить в:
| Соавтор: | |
|---|---|
| Другие авторы: | |
| Формат: | Livre numérique |
| Язык: | Anglais |
| Опубликовано: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Серии: | Lecture notes in computer science
864 |
| Предметы: | |
| Online-ссылка: | 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, First International Symposium, SAS '94, Namur, Belgium, September 28-30, 1994, proceedings, Baudouin Le Charlier, ed, 1994, Berlin, Springer-Verlag, 1 vol. (XII-463 p.), Lecture notes in computer science, 0-387-58485-4 • Static Analysis, Texte imprimé, 9783662200087 |
Оглавление:
- The costs and benefits of abstract interpretation-driven Prolog optimization
- Mode analysis of functional logic programs
- Directional type checking of logic programs
- A systematic construction of abstract domains
- Constraint-based type inference and parametric polymorphism
- Efficient on-the-fly analysis of program behavior and static cache simulation
- From processor timing specifications to static instruction scheduling
- Stackability in the simply-typed call-by-value lambda calculus
- Generalized boxings, congruences and partial inlining
- Selective thunkification
- About synchronous programming and abstract interpretation
- Uniqueness and completeness analysis of array comprehensions
- Extent analysis of data fields
- Verification of linear hybrid systems by means of convex approximations
- Compile-time detection of uncaught exceptions in Standard ML programs
- Estimating the computational cost of logic programs
- Boolean functions for dependency analysis: Algebraic properties and efficient representation
- Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop
- Extracting Non-strict independent and-parallelism using sharing and freeness information
- Efficient fixpoint computation
- Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration
- Efficient strictness analysis of Haskell
- Abstract interpretation using TDGs
- A type-based framework for program analysis
- Iterative fixed point computation for type-based strictness analysis
- Strictness and totality analysis
- Fast strictness analysis via symbolic fixpoint iteration
- Generating transformers for deforestation and supercompilation
- Mechanical elimination of commutative redundancy.