Static analysis : second international symposium, SAS '95, Glasgow, UK, September 25 27, 1995 : proceedings
This book constitutes the refereed proceedings of the Second International Symposium on Static Analysis, SAS '95, held in Glasgow, UK, in September 1995. Static Analysis is increasingly recognized as a foundation for high-performance implementations and verification systems of high-level progra...
Tallennettuna:
| Yhteisötekijä: | |
|---|---|
| Muut tekijät: | |
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sarja: | Lecture notes in computer science
983 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
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, second international symposium, SAS '95, Glasgow, UK, September 1995, proceedings, Alan Mycroft, ed, Berlin, Springer, 1995, 1 vol. (VIII-421 p.), Lecture notes in computer science, 3-540-60360-3 • Static Analysis, Texte imprimé, 9783662190111 |
Sisällysluettelo:
- Natural-semantics-based abstract interpretation (preliminary version)
- Region inference for higher-order functional languages
- An automata-theoretic approach to Presburger arithmetic constraints
- Generation of efficient interprocedural analyzers with PAG
- Optimality in abstractions of model checking
- Determining storage properties of sequential and concurrent programs with assignment and structured data
- Partitioning non-strict functional languages for multi-threaded code generation
- Complementation in abstract interpretation
- Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time
- Optimizing lazy functional programs using flow inference
- Termination analysis for functional programs using term orderings
- A type-based analysis for stack allocation in functional languages
- Control-flow analysis and type systems
- Effective flow analysis for avoiding run-time checks
- Static analysis of communication for asynchronous concurrent programming languages
- Unification-free execution of well-moded and well-typed Prolog programs
- Efficient closure utilisation by higher-order inheritance analysis
- System F and abstract interpretation
- Call-by-name CPS-translation as a binding-time improvement
- Trust in the ?-calculus
- LSign reordered
- Strictness analysis by abstract reduction using a tableau calculus
- Bigloo: a portable and optimizing compiler for strict functional languages
- Beyond prototype implementations: Polymorphic projection analysis for Glasgow Haskell
- Binding-time analysis and strictness analysis by abstract interpretation
- GENA A tool for generating Prolog analyzers from specifications
- IGOR: A tool for developing Prolog dataflow analyzers.