Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation最新文献_第3页

Fast, effective code generation in a just-in-time Java compiler 在即时Java编译器中快速、有效地生成代码

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277740

Ali-Reza Adl-Tabatabai, Michal Cierniak, Guei-Yuan Lueh, Vishesh M. Parikh, J. Stichnoth

引用次数: 206

Using static single assignment form to improve flow-insensitive pointer analysis 使用静态单赋值形式改进对流量不敏感的指针分析

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277668

Rebecca Hasti, Susan Horwitz

引用次数: 103

Simplification of array access patterns for compiler optimizations 简化数组访问模式以优化编译器

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277664

Y. Paek, J. Hoeflinger, D. Padua

引用次数: 65

Quality and speed in linear-scan register allocation 线性扫描寄存器分配的质量和速度

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277714

Omri Traub, G. Holloway, Michael D. Smith

引用次数: 125

Units: cool modules for HOT languages 单元:用于HOT语言的酷模块

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277730

M. Flatt, M. Felleisen

引用次数: 263

An implementation of complete, asynchronous, distributed garbage collection 一个完整的、异步的、分布式垃圾收集的实现

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277715

Fabrice Le Fessant, Ian Piumarta, M. Shapiro

引用次数: 28

Memory management with explicit regions 带有显式区域的内存管理

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277748

David E. Gay, A. Aiken

引用次数: 217

Type-based alias analysis 基于类型的别名分析

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277670

Amer Diwan, K. McKinley, J. Moss

{"title":"Type-based alias analysis","authors":"Amer Diwan, K. McKinley, J. Moss","doi":"10.1145/277650.277670","DOIUrl":"https://doi.org/10.1145/277650.277670","url":null,"abstract":"This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases. The second extends the first by using additional high-level information such as field names. The third extends the second with a flow-insensitive analysis. Although other researchers suggests using types to disambiguate memory references, none evaluates its effectiveness. We perform both static and dynamic evaluations of type-based alias analyses for Modula-3, a statically-typed type-safe language. The static analysis reveals that type compatibility alone yields a very imprecise alias analysis, but the other two analyses significantly improve alias precision. We use redundant load elimination (RLE) to demonstrate the effectiveness of the three alias algorithms in terms of the opportunities for optimization, the impact on simulated execution times, and to compute an upper bound on what a perfect alias analysis would yield. We show modest dynamic improvements for (RLE), and more surprisingly, that on average our alias analysis is within 2.5% of a perfect alias analysis with respect to RLE on 8 Modula-3 programs. These results illustrate that to explore thoroughly the effectiveness of alias analyses, researchers need static, dynamic, and upper-bound analysis. In addition, we show that for type-safe languages like Modula-3 and Java, a fast and simple alias analysis may be sufficient for many applications.","PeriodicalId":365404,"journal":{"name":"Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134510793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 182

Run-time code generation and modal-ML 运行时代码生成和模态ml

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277727

P. Wickline, Peter Lee, F. Pfenning

{"title":"Run-time code generation and modal-ML","authors":"P. Wickline, Peter Lee, F. Pfenning","doi":"10.1145/277650.277727","DOIUrl":"https://doi.org/10.1145/277650.277727","url":null,"abstract":"This paper presents a typed programming language and compiler for run-time code generation. The language, called ML', extends ML with modal operators in the style of the Mini-ML'e language of Davies and Pfenning. ML' allows programmers to use types to specify precisely the stages of computation in a program. The types also guide the compiler in generating target code that exploits the staging information through the use of run-time code generation. The target machine is currently a version of the Categorical Abstract Machine, called the CCAM, which we have extended with facilities for run-time code generation.This approach allows the programmer to express the staging that he wants directly to the compiler. It also provides a typed framework in which to verify the correctness of his staging intentions, and to discuss his staging decisions with other programmers. Finally, it supports in a natural way multiple stages of run-time specialization, so that dynamically generated code can be used in the generation of yet further specialized code.This paper presents an overview of the language, with several examples of programs that illustrate key concepts and programming techniques. Then, it discusses the CCAM and the compilation of ML' programs into CCAM code. Finally, the results of some experiments are shown, to demonstrate the benefits of this style of run-time code generation for some applications.","PeriodicalId":365404,"journal":{"name":"Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation","volume":"2021 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115685188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 54

Proper tail recursion and space efficiency 适当的尾部递归和空间效率

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277719

William D. Clinger

引用次数: 123