Filters








1,183 Hits in 4.2 sec

Automatic generation and management of interprocedural program analyses

Kwangkeun Yi, Williams Ludwell Harrison
1993 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93  
Our goal is to automate the generation and management of semantics-based interprocedural program analysis for a wide range of target languages.  ...  We have designed and implemented an interprocedural program analyzer generator, called system Z.  ...  Conclusion and Future Work In this paper we have presented system Z which automates the generation and management of interprocedural program analyses.  ... 
doi:10.1145/158511.158642 dblp:conf/popl/YiH93 fatcat:6qfsdj5norfe7e2o5zibw52qq4

Author retrospective for semantical interprocedural parallelization

Francois Irigoin, Pierre Jouvelot, Remi Triolet
2014 25th Anniversary International Conference on Supercomputing Anniversary Volume -  
The PIPS project was started in 1988 to investigate the automatic detection of medium-and large-grain parallelism in scientific programs thanks to summarization techniques based on convex array regions  ...  What were the key scientific and engineering decisions that made this possible in spite of some inevitable shortcomings?  ...  Newgen uses dynamic typing to provide automatically compact data management features, thanks to a layer of macros and functions, including higher-order generic traversal operators.  ... 
doi:10.1145/2591635.2591645 dblp:conf/ics/IrigoinJT14 fatcat:u7ixsf2uwba3xkc4e44y3plgse

Interprocedural analysis for parallelization [chapter]

Mary W. Hall, Brian R. Murphy, Saman P. Amarasinghe, Shih -Wei Liao, Monica S. Lam
1996 Lecture Notes in Computer Science  
Experimentation with this system on programs from standard benchmark suites demonstrate that an integrated combination of interprocedural analyses can substantially advance the capability of automatic  ...  The system incorporates a comprehensive and integrated collection of analyses, including privatization and reduction recognition for both array and scalar variables, and symbolic analysis of array subscripts  ...  The authors wish to thank Patrick Sathyanathan and Alex Seibulescu for their contributions to the design and implementation of this system, and the rest of the SUIF group, particularly Jennifer Anderson  ... 
doi:10.1007/bfb0014192 fatcat:xwqd4worvrhrhacytuowojxw2a

An Empirical Study of Precise Interprocedural Array Analysis

Michael Hind, Michael Burke, Paul Carini, Sam Midkiff
1994 Scientific Programming  
In this article we examine the role played by the interprocedural analysis of array accesses in the automatic parallelization of Fortran programs.  ...  We examine issues concerning the effectiveness of automatic parallelization using these methods and the efficiency of a precise summarization method.  ...  We wish to thank all members, past and present, of the PTRAN team. We would also like to thank the referees for their useful comments.  ... 
doi:10.1155/1994/487064 fatcat:ui267gfwv5gevjxw43irmfc5fm

Compiler architectures for heterogeneous systems [chapter]

Kathryn S. McKinley, Sharad K. Singhai, Glen E. Weaver, Charles C. Weems
1996 Lecture Notes in Computer Science  
We identify four goals for extending compilers to manage heterogeneity: exploiting available resources, targeting changing resources, adjusting optimization to suit a target, and allowing programming models  ...  These systems are already pervasive in industrial and academic settings and o er a wealth of underutilized resources for achieving high performance.  ...  SUIF exploits its strong interprocedural analyses to provide data privatization, reductions and parallelization.  ... 
doi:10.1007/bfb0014216 fatcat:cd7xmc5gtfagpfmohlbjonsai4

Maximizing multiprocessor performance with the SUIF compiler

M.W. Hall, J.M. Anderson, S.P. Amarasinghe, B.R. Murphy, Shih-Wei Liao, E. Bugnion, M.S Lam
1996 Computer  
But explicitly managing an application's parallelism and memory use requires a great deal of programming knowledge, and the work is tedious and error-prone.  ...  The affordability of shared memory multiprocessors offers the potential of supercomputer-class performance to the general public.  ...  Acknowledgments This research was supported in part by the Air Force Materiel Command and ARPA contracts F30602-95-C-0098, DABT63-95-C-0118, and DABT63-94-C-0054; a Digital Equipment Corporation grant;  ... 
doi:10.1109/2.546613 fatcat:6x7urb56urbrho5ycgavfdxwte

An Algebraic Framework for Compositional Program Analysis [article]

Azadeh Farzan, Zachary Kincaid
2013 arXiv   pre-print
Compositional program analyses are desirable because they can yield scalable (and easily parallelizable) program analyses.  ...  This paper presents algebraic framework for designing, implementing, and proving the correctness of compositional program analyses.  ...  Weighted pushdown-systems (WPDSs) are a generic tool for implementing interprocedural program analyses [33] .  ... 
arXiv:1310.3481v1 fatcat:42sj26xl5jbe5iasdgczyi4vpe

Calysto

Domagoj Babic, Alan J. Hu
2008 Proceedings of the 13th international conference on Software engineering - ICSE '08  
CALYSTO is interprocedurally path-sensitive, fully context-sensitive, and bit-accurate in modeling data operations -comparable coverage and precision to very expensive formal analyses -yet scales comparably  ...  Automatically detecting bugs in programs has been a long-held goal in software engineering.  ...  Holzmann (Spin), Jesse Smith (Bftpd), and Harlan Stenn (ISC, Ntp) for providing us with prompt feedback both on bug reports and CALYSTO in general.  ... 
doi:10.1145/1368088.1368118 dblp:conf/icse/BabicH08 fatcat:k7qsybu4dbavnmwskxlyiyhybm

Automatic pool allocation for disjoint data structures

Chris Lattner, Vikram Adve
2002 Proceedings of the workshop on Memory system performance - MSP '02  
We present preliminary experimental results showing that the data structure analysis and pool allocation are effective for a set of pointer intensive programs in the Olden benchmark suite.  ...  The fully automatic transformation converts ordinary programs to use pool (aka region) allocation for heap-based data structures.  ...  We believe that the automatic pool allocation transformation proposed here is the first such algorithm for programs containing explicit uses of malloc and free to manage heap memory.  ... 
doi:10.1145/773146.773041 fatcat:5vk6yqmglvahzlzfnp3y3q5b7a

Static Program Analysis for Java Card Applets [chapter]

Vasilios Almaliotis, Alexandros Loizidis, Panagiotis Katsaros, Panagiotis Louridas, Diomidis Spinellis
2008 Lecture Notes in Computer Science  
Our work introduces automatic static program analysis as a means for the early detection of misused and therefore dangerous API calls.  ...  Several characteristics of the Java Card applets and their multiple-entry-point program structure make it possible for a potentially unhandled exception to reach the invoked entry point.  ...  Acknowledgments This work was supported by the funds of the bilateral research programme between Greece and Cyprus, Greek General Research Secretariat, 2006-2008.  ... 
doi:10.1007/978-3-540-85893-5_2 fatcat:qj4tvdigfjd57cslh5qwbdmzme

Automatic pool allocation for disjoint data structures

Chris Lattner, Vikram Adve
2003 SIGPLAN notices  
We present preliminary experimental results showing that the data structure analysis and pool allocation are effective for a set of pointer intensive programs in the Olden benchmark suite.  ...  The fully automatic transformation converts ordinary programs to use pool (aka region) allocation for heap-based data structures.  ...  We believe that the automatic pool allocation transformation proposed here is the first such algorithm for programs containing explicit uses of malloc and free to manage heap memory.  ... 
doi:10.1145/773039.773041 fatcat:5meru3jnwjgdncin2ij2ws25yu

Evaluating automatic parallelization for efficient execution on shared-memory multiprocessors

Kathryn S. McKinley
1994 Proceedings of the 8th international conference on Supercomputing - ICS '94  
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach.  ...  The algorithm optimizes for data locality and parallelism, reducing or eliminating false sharing. It also uses interprocedural analysis and transformations to improve the granularity of parallelism.  ...  I thank Mary Hall, Chau-Wen Tseng, Preston Briggs, Paul Havlak, and Nat McIntosh for their comments and support throughout the development of this work.  ... 
doi:10.1145/181181.181265 dblp:conf/ics/McKinley94 fatcat:4eulalgo3rc5naym2lhb2wjl6i

Automated soundness proofs for dataflow analyses and transformations via local rules

Sorin Lerner, Todd Millstein, Erika Rice, Craig Chambers
2005 Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages - POPL '05  
We have implemented a soundness checker for Rhodium and have specified and automatically proven the soundness of all of Cobalt's optimizations plus a variety of optimizations not expressible in Cobalt,  ...  This new style allows Rhodium optimizations to be mutually recursively defined, to be automatically composed, to be interpreted in both flow-sensitive and -insensitive ways, and to be applied interprocedurally  ...  Acknowledgments This research is supported in part by NSF grants CCR-0073379, ACI-0203908 and ITR-0326590, a Microsoft Graduate Fellowship, an IBM Faculty Development Award, and by gifts from Sun Microsystems  ... 
doi:10.1145/1040305.1040335 dblp:conf/popl/LernerMRC05 fatcat:kbghd4yafzctpog6zp6qnq5xgq

Write barrier removal by static analysis

Karen Zee, Martin Rinard
2002 SIGPLAN notices  
This mechanism enables the application of our technique to virtually any memory management system that uses write barriers to enable generational garbage collection.  ...  We present a new analysis for removing unnecessary write barriers in programs that use generational garbage collection. To our knowledge, this is the first static program analysis for this purpose.  ...  Scott Ananian, who designed and built the Flex compiler infrastructure on which the analyses were implemented.  ... 
doi:10.1145/510857.510866 fatcat:pm27tok2yfayxm5rbcqytzaq6m

Write barrier removal by static analysis

Karen Zee, Martin Rinard
2002 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02  
This mechanism enables the application of our technique to virtually any memory management system that uses write barriers to enable generational garbage collection.  ...  We present a new analysis for removing unnecessary write barriers in programs that use generational garbage collection. To our knowledge, this is the first static program analysis for this purpose.  ...  Scott Ananian, who designed and built the Flex compiler infrastructure on which the analyses were implemented.  ... 
doi:10.1145/582438.582439 fatcat:utsbonwfgncczbghz622hynbcq
« Previous Showing results 1 — 15 out of 1,183 results