Filters








1,947 Hits in 2.6 sec

Interprocedural analyses: a comparison

Helmut Seidl, Christian Fecht
2000 The Journal of Logic Programming  
We present a framework for program analysis of languages with procedures which is general enough to allow for a comparison of various approaches to interprocedural analysis.  ...  Concerning the relative precision of relational analyses and corresponding functional analyses, we exhibit scenarios where functional analysis does not lose precision.  ...  Acknowledgements We thank Reinhold Heckmann for semantic advice and Martin Alt, Jens Knoop, Florian Martin, Tom Reps and Reinhard Wilhelm for valuable discussions about the mysteries of interprocedural  ... 
doi:10.1016/s0743-1066(99)00058-8 fatcat:dr53bgkxmfa6zdzmatu7hkyaoq

Interprocedural analyses of Fortran programs

B Creusillet, F Irigoin
1998 Parallel Computing  
analyses and allows a quick prototyping of new interprocedural analyses.  ...  Interprocedural analyses (IPA) are becoming more and more common in commercial compilers.  ...  Finally, the fth section is devoted to an informal comparison with similar interprocedural tools. PIPS Interprocedural Framework pips uses an implicit call graph.  ... 
doi:10.1016/s0167-8191(98)00028-3 fatcat:7nyfazdbivalxhorcl57cxd5ky

Parallelizing top-down interprocedural analyses

Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sriram K. Rajamani
2012 SIGPLAN notices  
In such analyses, each intraprocedural analysis happens in the context of a reachability query.  ...  In this paper, we propose a generic framework, BOLT, which uses MapReduce style parallelism to scale top-down analyses.  ...  In this paper, we have presented BOLT: a parameterized framework for parallelizing top-down interprocedural analyses.  ... 
doi:10.1145/2345156.2254091 fatcat:ixse7e3vtfe3dfsnbpwushdvni

Parallelizing top-down interprocedural analyses

Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sriram K. Rajamani
2012 Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12  
In such analyses, each intraprocedural analysis happens in the context of a reachability query.  ...  In this paper, we propose a generic framework, BOLT, which uses MapReduce style parallelism to scale top-down analyses.  ...  In this paper, we have presented BOLT: a parameterized framework for parallelizing top-down interprocedural analyses.  ... 
doi:10.1145/2254064.2254091 dblp:conf/pldi/AlbarghouthiKNR12 fatcat:55ubht4xtna73m6nr55f4oz74q

Interprocedurally Analysing Linear Inequality Relations [chapter]

Helmut Seidl, Andrea Flexeder, Michael Petter
2007 Lecture Notes in Computer Science  
In this paper we present an alternative approach to interprocedurally inferring linear inequality relations.  ...  In the absence of conditional branching, this abstraction can be characterised precisely by means of the least solution of a constraint system.  ...  A first comparison between the two alternatives is shown in section 6.  ... 
doi:10.1007/978-3-540-71316-6_20 fatcat:zrv2qwo2araptfqfcjc4l7r6t4

Efficient Computation of Parameterized Pointer Information for Interprocedural Analyses [chapter]

Donglin Liang, Mary Jean Harrold
2001 Lecture Notes in Computer Science  
information in program analyses.  ...  The studies show that using parameterized pointer information may significantly improve the precision and the efficiency of many program analyses.  ...  Acknowledgments This work was supported in part by NSF under NYI Award CCR-0096321 and ESS Award CCR-9707792 to Ohio State University, by funds from to Georgia Tech through the Yamacraw Mission, and by a  ... 
doi:10.1007/3-540-47764-0_16 fatcat:sl4evo36azgr7ojicgdykpza4q

Interprocedural Control Flow Reconstruction [chapter]

Andrea Flexeder, Bogdan Mihaila, Michael Petter, Helmut Seidl
2010 Lecture Notes in Computer Science  
In case that the underlying assembly code is the output of a compiler, indirect jumps primarily originate from high-level switch statements.  ...  In this paper we provide an interprocedural algorithm for reconstructing the control flow of assembly code in presence of indirect jumps, call instructions and returns.  ...  Then, in Section 3 we describe a general interprocedural framework to overapproximate the control flow and call graph of an executable.  ... 
doi:10.1007/978-3-642-17164-2_14 fatcat:k66xlbpj75cbvfnfesrde2452y

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  
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  ...  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  ...  Conclusions This paper has described the analyses in a fully interprocedural automatic parallelization system.  ... 
doi:10.1007/bfb0014192 fatcat:xwqd4worvrhrhacytuowojxw2a

Interprocedural pointer alias analysis

Michael Hind, Michael Burke, Paul Carini, Jong-Deok Choi
1999 ACM Transactions on Programming Languages and Systems  
; (2) a flow-sensitive interprocedural pointer alias analysis algorithm; (3) a flow-insensitive interprocedural pointer alias analysis algorithm; (4) a flow-insensitive interprocedural pointer alias analysis  ...  We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion.  ...  Anthony Pioli played a significant role in the design, implementation, and testing of the algorithms described in this ar-  ... 
doi:10.1145/325478.325519 fatcat:tpykmvjhhnen5e4ey6o4g23zq4

Fast interprocedural class analysis

Greg DeFouw, David Grove, Craig Chambers
1998 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98  
Analysis Framework This section describes the general interprocedural analysis algorithm that allows us to explore a range of fast interprocedural class analyses.  ...  We implemented our algorithm framework in the Vortex optimizing compiler, and we measured the cost and benefit of these interprocedural analysis algorithms in practice on a collection of substantial Cecil  ...  Acknowledgments We thank Bjarne Steensgaard for several discussions on the topic of near-linear-time interprocedural analysis.  ... 
doi:10.1145/268946.268965 dblp:conf/popl/DeFouwGC98 fatcat:kvznwfzz7nh2paq5j6c2osbjoe

The interprocedural coincidence theorem [chapter]

Jens Knoop, Bernhard Steffen
1992 Lecture Notes in Computer Science  
We present an interprocedural generalization of the well-known (intraprocedural) Coincidence Theorem of Kam and Ullman, which provides a su cient condition for the equivalence of the meet over all paths  ...  (MOP ) solution and the maximal xed point (MFP ) solution to a data ow analysis problem.  ...  data ow analyses is given in KS3].  ... 
doi:10.1007/3-540-55984-1_13 fatcat:htfy4ei7pfhy5a6y4exydxyyxa

Interprocedural control dependence

Saurabh Sinha, Mary Jean Harrold, Gregg Rothermel
2001 ACM Transactions on Software Engineering and Methodology  
This paper presents a de nition of interprocedural control dependence that supports the relationship of control and data dependence to semantic dependence.  ...  Program-dependence information is useful for a variety of applications, such as software testing and maintenance tasks and code optimization.  ...  A comparison of these dependences with those computed intraprocedurally see Table 1 reveals extensive di erences.  ... 
doi:10.1145/367008.367022 fatcat:mvxnbceyvvcu3aamk3vnhnbnhe

Flow-sensitive interprocedural constant propagation

Paul R. Carini, Michael Hind
1995 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation - PLDI '95  
We present a flow-sensitive interprocedural constant propagation algorithm, which sttpports recursion while only performing one flow-sensitive analysis of each procedure.  ...  Reintroduce new metrics for evaluating interprocedural constant propagation algorithms which measure the number of interprocedural constant values that are propagated.  ...  Compilation Model In addition to intraprocedural analyses, our compiler performs a number of interprocedural analyses.  ... 
doi:10.1145/207110.207113 dblp:conf/pldi/CariniH95 fatcat:dfqianqnlfbcrorqgz5ob64dqe

Interprocedural conditional branch elimination

Rastislav Bodík, Rajiv Gupta, Mary Lou Soffa
1997 Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation - PLDI '97  
The technique consists of a demand driven interprocedural analysis that determines whether a specific branch outcome is correlated with prior statements or branch outcomes.  ...  This paper presents techniques to determine whether an interprocedural execution path leading to a conditional branch exists along which the branch outcome is known at compile time, and then to eliminate  ...  The analysis cost can be reduced by caching at all nodes the results of all queries resolved in previous analyses.  ... 
doi:10.1145/258915.258929 dblp:conf/pldi/BodikGS97 fatcat:grrq4u5upfeevhmcrt5x4zt4la

A practical interprocedural dominance algorithm

Bjorn De Sutter, Ludo Van Put, Koen De Bosschere
2007 ACM Transactions on Programming Languages and Systems  
With the rise of computing power, and the viability of whole-program analyses and optimizations, there is a growing need to extend the dominator computation algorithms to context-sensitive interprocedural  ...  In this article, we propose a new algorithm for computing interprocedural dominators.  ...  By comparison, we will evaluate our interprocedural dominator computation algorithm on real-life programs of up to several hundred thousand blocks.  ... 
doi:10.1145/1255450.1255452 fatcat:dqed6hrs2raepihe66mqbnkyia
« Previous Showing results 1 — 15 out of 1,947 results