Filters








15,576 Hits in 3.4 sec

Alias analysis for optimization of dynamic languages

Michael Gorbovitski, Yanhong A. Liu, Scott D. Stoller, Tom Rothamel, Tuncay K. Tekle
2010 SIGPLAN notices  
The analysis is flow-sensitive; we show that this is necessary for effective optimization of dynamic languages.  ...  This paper describes the development and experimental evaluation of a may-alias analysis for a full dynamic objectoriented language, for program optimization by incrementalization and specialization.  ...  We believe that trace-sensitive analysis is especially suited for optimizations, for both dynamic languages and static languages.  ... 
doi:10.1145/1899661.1869635 fatcat:inx6qiujbfh65cx544xpl3oy44

Alias analysis for optimization of dynamic languages

Michael Gorbovitski, Yanhong A. Liu, Scott D. Stoller, Tom Rothamel, Tuncay K. Tekle
2010 Proceedings of the 6th symposium on Dynamic languages - DLS '10  
The analysis is flow-sensitive; we show that this is necessary for effective optimization of dynamic languages.  ...  This paper describes the development and experimental evaluation of a may-alias analysis for a full dynamic objectoriented language, for program optimization by incrementalization and specialization.  ...  We believe that trace-sensitive analysis is especially suited for optimizations, for both dynamic languages and static languages.  ... 
doi:10.1145/1869631.1869635 dblp:conf/dls/GorbovitskiLSRT10 fatcat:wn2qlurqgbbrvmtpvfht4qmoyq

Type-based alias analysis

Amer Diwan, Kathryn S. McKinley, J. Eliot B. Moss
1998 SIGPLAN notices  
We perform both static and dynamic evaluations of type-based alias analyses for Modula-3, a statically-typed type-safe language.  ...  This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases.  ...  We would like to know if the aliases really exist at run-time, and if any imprecision in the alias analysis causes missed opportunities for optimizations or other clients of the analysis.  ... 
doi:10.1145/277652.277670 fatcat:dlbtnkijt5crxmnuuadorxe7ye

Using types to analyze and optimize object-oriented programs

Amer Diwan, Kathryn S. McKinley, J. Eliot B. Moss
2001 ACM Transactions on Programming Languages and Systems  
Our compiler performs type-based alias analysis to disambiguate memory references.  ...  It uses the results of the type-based alias analysis to eliminate redundant memory references and to replace monomorphic method invocation sites with direct calls.  ...  ACKNOWLEDGMENTS We would like to thank Ole Agesen and Darko Stefanović for comments on drafts of this paper. We would like to thank the anonymous referees for their detailed comments.  ... 
doi:10.1145/383721.383732 fatcat:wljudy4mpnctfbhfvsmvjzhx2m

Type-based alias analysis

Amer Diwan, Kathryn S. McKinley, J. Eliot B. Moss
1998 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation - PLDI '98  
We perform both static and dynamic evaluations of type-based alias analyses for Modula-3, a statically-typed type-safe language.  ...  This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases.  ...  We would like to know if the aliases really exist at run-time, and if any imprecision in the alias analysis causes missed opportunities for optimizations or other clients of the analysis.  ... 
doi:10.1145/277650.277670 dblp:conf/pldi/DiwanMM98 fatcat:lxtr2fd2p5cqbd7wmwcuc7oiwi

Dynamically managed data for CPU-GPU architectures

Thomas B. Jablin, James A. Jablin, Prakash Prabhu, Feng Liu, David I. August
2012 Proceedings of the Tenth International Symposium on Code Generation and Optimization - CHO '12  
By replacing static analyses with a dynamic run-time system, DyManD overcomes the performance limitations of alias analysis and enables management for complex and recursive data-structures.  ...  DyManD-enabled GPU parallelization matches the performance of prior work equipped with perfectly precise alias analysis for 27 programs and demonstrates improved applicability on programs not previously  ...  The run-time dynamically optimizes communication by using memory protections to return allocation units to the CPU only when necessary.  ... 
doi:10.1145/2259016.2259038 dblp:conf/cgo/JablinJPLA12 fatcat:hzbom6p5cfa6znrca63murihru

A Formally-Verified Alias Analysis [chapter]

Valentin Robert, Xavier Leroy
2012 Lecture Notes in Computer Science  
This paper reports on the formalization and proof of soundness, using the Coq proof assistant, of an alias analysis: a static analysis that approximates the flow of pointer values.  ...  The alias analysis considered is of the points-to kind and is intraprocedural, flow-sensitive, field-sensitive, and untyped. Its soundness proof follows the general style of abstract interpretation.  ...  This paper, therefore, reports on the proof of soundness of an alias analysis for the RTL intermediate language of the CompCert compiler.  ... 
doi:10.1007/978-3-642-35308-6_5 fatcat:kbmd4sl4ebhqfdglcuc5fse6ca

Alias Analysis by Means of a Model Checker [chapter]

Vincenzo Martena, Pierluigi San Pietro
2001 Lecture Notes in Computer Science  
We show that, at least in the case of intraprocedural alias analysis, a model checking tool has a great potential for precision and efficiency.  ...  At the very least, the great flexibility allowed in defining the may-alias relation, should make it easier to experiment and to examine the connections among the accuracy of an alias analysis and the optimizations  ...  Acknowledgements We thank Marco Garatti and Giampaolo Agosta for their help and their comments and Special thanks to Stefano Crespi Reghizzi for making this research possible by providing us with ideas  ... 
doi:10.1007/3-540-45306-7_2 fatcat:h6zooluzqrgdxmmb7tr2c37nwu

Alias verification for Fortran code optimization

Thi Viet Nga Nguyen, François Irigoin
2002 Electronical Notes in Theoretical Computer Science  
Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a common variable that is aliased  ...  Modifications on the dependence graph created by aliasing are also studied to show the impact of aliases on the correctness of some program optimizing transformations.  ...  On the other hand, a program can be guaranteed to be free of dynamic alias errors by our static analysis.  ... 
doi:10.1016/s1571-0661(04)80396-7 fatcat:wqjgayt6nrfgbnqpfh4slb54ai

Runtime pointer disambiguation

Péricles Alves, Fabian Gruber, Johannes Doerfert, Alexandros Lamprineas, Tobias Grosser, Fabrice Rastello, Fernando Magno Quintão Pereira
2015 Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015  
We then produce two versions of a code region: one that is aliasing-free -hence, easy to optimize -and another that is not. Our checks let us safely branch to the optimizable region.  ...  The goal of this paper is to solve this conundrum through dynamic disambiguation of pointers. We provide different ways to determine at runtime when two memory locations can overlap.  ...  Acknowledgements We thank the OOPSLA referees for many constructive comments and suggestions. The Brazilian side of this cooperation has been sponsored by CNPq, FAPEMIG, CAPES and LG Electronics.  ... 
doi:10.1145/2814270.2814285 dblp:conf/oopsla/AlvesGDLGRP15 fatcat:uaqqeartwjhirmyvwy2sg7rbuq

Runtime pointer disambiguation

Péricles Alves, Fabian Gruber, Johannes Doerfert, Alexandros Lamprineas, Tobias Grosser, Fabrice Rastello, Fernando Magno Quintão Pereira
2015 SIGPLAN notices  
We then produce two versions of a code region: one that is aliasing-free -hence, easy to optimize -and another that is not. Our checks let us safely branch to the optimizable region.  ...  The goal of this paper is to solve this conundrum through dynamic disambiguation of pointers. We provide different ways to determine at runtime when two memory locations can overlap.  ...  Acknowledgements We thank the OOPSLA referees for many constructive comments and suggestions. The Brazilian side of this cooperation has been sponsored by CNPq, FAPEMIG, CAPES and LG Electronics.  ... 
doi:10.1145/2858965.2814285 fatcat:2xsekwcm4rbcdlnta62w4bxl4i

Alias Analysis in Java with Reference-Set Representation for High-Performance Computing

Jongwook Woo, Jean-Luc Gaudiot, Andrew L. Wendelborn
2004 International journal of parallel programming  
As one optimization technique used in the static analysis of compilers, alias analysis has been developed to detect aliased variables in a code and to be used in reordering instructions to enhance performance  ...  In high-performance computing, alias analysis is even more useful for instruction-level parallelism and distributed and cluster computing, because the possibility of aliasing adversely affects factors  ...  For the computation of the aliases, CFGs can be used for intraprocedural alias analysis.  ... 
doi:10.1023/b:ijpp.0000015564.82048.f3 fatcat:reumc2kab5e3dcj52xbkoaa7ca

IDE support to facilitate the transition from rapid prototyping to robust software production

Francisco Ortin, Anton Morant
2011 Proceeding of the 1st workshop on Developing tools as plug-ins - TOPI '11  
The benefits of dynamic languages are, however, counteracted by many limitations produced by the lack of static typing.  ...  Dynamic languages are becoming increasingly popular for different software development scenarios such as rapid prototyping because of the flexibility and agile interactive development they offer.  ...  Although alias analysis is mainly used for optimizations, we have used it to know the concrete types of the objects a reference may point to.  ... 
doi:10.1145/1984708.1984720 dblp:conf/icse/OrtinM11 fatcat:ovqw43pipvfwxhaitrpiqcvcym

Automatic loop transformations and parallelization for Java

Pedro V. Artigas, Manish Gupta, Samuel P. Midkiff, José E. Moreira
2000 Proceedings of the 14th international conference on Supercomputing - ICS '00  
From a software engineering perspective, the Java programming language provides an attractive platform for writing numerically intensive applications.  ...  We describe a new transformation called alias versioning that takes advantage of the simplicity of pointers in Java.  ...  Acknowledgments The technique of creating new symbols to provide more precise alias information was jointly developed with the TPO group of the IBM Toronto Lab.  ... 
doi:10.1145/335231.335232 dblp:conf/ics/ArtigasGMM00 fatcat:pxsttcbmkrgnjgz7ijukipiks4

Automatic Loop Transformations and Parallelization for Java

P Artigas
2001 Parallel Processing Letters  
From a software engineering perspective, the Java programming language provides an attractive platform for writing numerically intensive applications.  ...  We describe a new transformation called alias versioning that takes advantage of the simplicity of pointers in Java.  ...  Acknowledgments The technique of creating new symbols to provide more precise alias information was jointly developed with the TPO group of the IBM Toronto Lab.  ... 
doi:10.1016/s0129-6264(00)00016-0 fatcat:rvxbu4qu2jfizg6e6u2qpwuoga
« Previous Showing results 1 — 15 out of 15,576 results