Filters








3,553 Hits in 4.1 sec

Evaluating the effectiveness of pointer alias analyses

Michael Hind, Anthony Pioli
2001 Science of Computer Programming  
This paper describes an empirical comparison of the e ectiveness of six context-insensitive pointer analysis algorithms that use varying degrees of ow-sensitivity.  ...  The results of this paper will help implementors determine which pointer analysis is appropriate for their application.  ...  testing of the system.  ... 
doi:10.1016/s0167-6423(00)00014-9 fatcat:bnt3hzwwfbea7dcn7wyvewc65q

Effective dynamic detection of alias analysis errors

Jingyue Wu, Gang Hu, Yang Tang, Junfeng Yang
2013 Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2013  
Alias analysis is perhaps one of the most crucial and widely used analyses, and has attracted tremendous research efforts over the years.  ...  Evaluation on three popular alias analyses and real-world programs Apache and MySQL shows that NEONGOBY effectively finds 29 alias analysis bugs with only 2 false positives and reasonable overhead.  ...  effectively detecting alias analysis errors.  ... 
doi:10.1145/2491411.2491439 dblp:conf/sigsoft/WuHTY13 fatcat:2cnrd5yprjg7heg73uxk3ufrci

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  
Using limit, static, and running time evaluation, we demonstrate that these techniques are effective, and sometimes perfect for a set of Modula-3 benchmarks.  ...  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

An Empirical Study on the Granularity of Pointer Analysis in C Programs [chapter]

Tong Chen, Jin Lin, Wei-Chung Hsu, Pen-Chung Yew
2005 Lecture Notes in Computer Science  
The collected target sets are then fed back to the ORC compiler to evaluate the effectiveness of different granularity in pointer analyses.  ...  The change of the alias queries in the compiler analyses and the change of performance of the output code at different granularity levels are observed.  ...  Evaluate naming schemes The effectiveness of naming schemes is evaluated by feeding the target sets collected at runtime back to the ORC compiler, and observing the changes in the alias queries and in  ... 
doi:10.1007/11596110_11 fatcat:6xnthihkhrfwtdwuf7nvmo5xaq

Type-based alias analysis

Amer Diwan, Kathryn S. McKinley, J. Eliot B. Moss
1998 SIGPLAN notices  
This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases.  ...  These results illustrate that to explore thoroughly the effectiveness of alias analyses, researchers need static, dynamic, and upper-bound analysis.  ...  the effectiveness of any alias analysis.  ... 
doi:10.1145/277652.277670 fatcat:dlbtnkijt5crxmnuuadorxe7ye

The Limits of Alias Analysis for Scalar Optimizations [chapter]

Rezaul A. Chowdhury, Peter Djeu, Brendon Cahoon, James H. Burrill, Kathryn S. McKinley
2004 Lecture Notes in Computer Science  
In practice, the optimizations are rarely inhibited due to the precision of the alias analyses.  ...  Previous work finds similarly that the increased precision of specific alias algorithms provide little benefit for scalar optimizations, and that simple static alias algorithms find almost all dynamically  ...  The most important contribution of this paper, however, is obviating the need for evaluating all pointer analyses.  ... 
doi:10.1007/978-3-540-24723-4_3 fatcat:xk6nxaj4xjgkdnj6e5hoaqc24e

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  
This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases.  ...  These results illustrate that to explore thoroughly the effectiveness of alias analyses, researchers need static, dynamic, and upper-bound analysis.  ...  the effectiveness of any alias analysis.  ... 
doi:10.1145/277650.277670 dblp:conf/pldi/DiwanMM98 fatcat:lxtr2fd2p5cqbd7wmwcuc7oiwi

Pointer disambiguation via strict inequalities

Maroua Maalej, Vitor Paisante, Pedro Ramos, Laure Gonnord, Fernando Magno Quintao Pereira
2017 2017 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)  
The design and implementation of static analyses that disambiguate pointers has been a focus of research since the early days of compiler construction.  ...  We start from an obvious, yet unexplored, observation: if a pointer is strictly less than another, they cannot alias.  ...  Applicability: can our pointer disambiguation method increase the effectiveness of existing program analyses? In the rest of his section we provide answers to these questions.  ... 
doi:10.1109/cgo.2017.7863735 fatcat:t5tjdttlkrfkhfxocb3wejr43e

Computation of Alias Sets from Shape Graphs for Comparison of Shape Analysis Precision

V. Pavlu, M. Schordan, A. Krall
2011 2011 IEEE 11th International Working Conference on Source Code Analysis and Manipulation  
To a compiler, this information is crucial for deciding wether two expressions refer to the same memory location, as a great number of analyses depend on this aliasing information.  ...  The aim of this work is to make the precision of shape analysis results comparable. Our solution is based on extracting alias information from shape analysis results.  ...  The rationale behind comparing alias sets is that the effectiveness of many compiler optimizations depends on the quality of aliasing information.  ... 
doi:10.1109/scam.2011.11 dblp:conf/scam/PavluSK11 fatcat:oxlibommsncz5phkfdwurmmvb4

Computation of alias sets from shape graphs for comparison of shape analysis precision

Viktor Pavlu, Andreas Krall, Markus Schordan
2014 IET Software  
To a compiler, this information is crucial for deciding wether two expressions refer to the same memory location, as a great number of analyses depend on this aliasing information.  ...  The aim of this work is to make the precision of shape analysis results comparable. Our solution is based on extracting alias information from shape analysis results.  ...  The rationale behind comparing alias sets is that the effectiveness of many compiler optimizations depends on the quality of aliasing information.  ... 
doi:10.1049/iet-sen.2012.0049 fatcat:oqcivzeh6rag5onkup27ezecqm

Equivalence analysis

Donglin Liang, Mary Jean Harrold
1999 Software engineering notes  
Our empirical studies indicate that equivalence analysis may effectively improve the efficiency of many data-flow analyses.  ...  This paper presents equivalence analysis, a general technique to improve the efficiency of data-flow analyses in the presence of pointers.  ...  Researchers have studied the effects of the alias information computed by different alias analysis algorithms, with varying levels of precision, on the precision and efficiency of data-flow analyses when  ... 
doi:10.1145/381788.316175 fatcat:oedfwnjohfcsbjk72neju3e7m4

Equivalence analysis

Donglin Liang, Mary Jean Harrold
1999 Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering - PASTE '99  
Our empirical studies indicate that equivalence analysis may effectively improve the efficiency of many data-flow analyses.  ...  This paper presents equivalence analysis, a general technique to improve the efficiency of data-flow analyses in the presence of pointers.  ...  Researchers have studied the effects of the alias information computed by different alias analysis algorithms, with varying levels of precision, on the precision and efficiency of data-flow analyses when  ... 
doi:10.1145/316158.316175 dblp:conf/paste/LiangH99 fatcat:afi52zplofdfpge6be4vsvdzpq

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  ...  Dy-ManD outperforms CGCM equipped with production-quality and research grade alias analyses, achieving a whole program geomean speedup of 4.21x over best sequential execution versus geomean speedups of  ... 
doi:10.1145/2259016.2259038 dblp:conf/cgo/JablinJPLA12 fatcat:hzbom6p5cfa6znrca63murihru

Estimating the Impact of Scalable Pointer Analysis on Optimization [chapter]

Manuvir Das, Ben Liblit, Manuel Fähndrich, Jakob Rehof
2001 Lecture Notes in Computer Science  
Flow-insensitive pointer analyses are accurate on at least 95% of the weighted alias queries as well.  ...  We first describe alias frequency, a metric that measures the ability of a pointer analysis to determine that pairs of memory accesses in C programs cannot be aliases.  ...  Acknowledgements We would like to thank Tom Reps and Rakesh Ghiya for helpful discussions, and Jim Larus and the anonymous referees for suggestions on the paper.  ... 
doi:10.1007/3-540-47764-0_15 fatcat:zfoofsjv25gttkx2zstj6p2ncu

Representation-independent program analysis

Michelle Mills Strout, John Mellor-Crummey, Paul Hovland
2005 The 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering - PASTE '05  
Analysis-specific IR interfaces for alias/pointer analysis algorithms and reaching constants illustrate that an IR interface designed for language dependence is capable of providing enough information  ...  in the area of program analysis.  ...  This work was supported in part by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, Office of Science, U.S.  ... 
doi:10.1145/1108792.1108810 dblp:conf/paste/StroutMH05 fatcat:qvaocgwzg5g5np5ztapwoxp2fe
« Previous Showing results 1 — 15 out of 3,553 results