Filters








934 Hits in 4.7 sec

Solving demand versions of interprocedural analysis problems [chapter]

Thomas Reps
1994 Lecture Notes in Computer Science  
This paper concems the solution of demand versions of interprocedural analysis problems.  ...  There are several reasons why it is desirable to solve the demand versions of interprocedural analysis problems (and, in particular, to solve them using the approach presented in this paper). 9 Narrowing  ...  Section 3 summarizes our methodology for obtaining algorithms that solve the demand versions of interprocedural analysis problems.  ... 
doi:10.1007/3-540-57877-3_26 fatcat:ddwqxs67hna5vp6djr26y745aq

Demand Interprocedural Program Analysis Using Logic Databases [chapter]

Thomas W. Reps
1995 Applications of Logic Databases  
Genevieve Rosay furnished the performance figures for the C implementation of the Horwitz-Reps-Binkleya lgorithm. Raghu Ramakrishnan, Divesh Srivastava,P raveen Seshadri, and S.  ...  This connection can be summarized as follows: Methods for solving demand versions of interprocedural analysis problems-and in particular interprocedural analysis problems of interest to the community that  ...  This paper has described howt oo btain algorithms for solving demand versions of interprocedural gen-kill dataflow-analysis problems from their exhaustive counterparts.  ... 
doi:10.1007/978-1-4615-2207-2_8 fatcat:iy6obcgrp5bqpp2sfel67jk4cm

Demand interprocedural dataflow analysis

Susan Horwitz, Thomas Reps, Mooly Sagiv
1995 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering - SIGSOFT '95  
This paper presents a new demand algorithm for interprocedural dataflow analysis.  ...  The new algorithm has three important properties: q It provides precise (meet over all interprocedurally valid paths) solutions to a large class of problems. q It has a polynomial worst-case cost for both  ...  Reps presented a way in which algorithms that solve demand versions of interprocedural analysis problems can be obtained automatically from their exhaus- tive counterparts (expressed as logic programs)  ... 
doi:10.1145/222124.222146 dblp:conf/sigsoft/HorwitzRS95 fatcat:3vq67x6w2ve3xe27g7nay7symy

Program analysis via graph reachability

Thomas Reps
1998 Information and Software Technology  
. − 2 − Interprocedural program slicing Interprocedural versions of a large class of dataflow-analysis problems A method for approximating the possible "shapes" that heap-allocated structures can take  ...  Section 5 concerns demand versions of program-analysis problems. Section 6 describes some techniques that go beyond pure graph reachability. Section 7 discusses related work.  ...  Kleinberg pointed out the use of CFLreachability in reference [28] .  ... 
doi:10.1016/s0950-5849(98)00093-7 fatcat:jjmzbhmogfcnnbycwmttruel6i

Weighted pushdown systems and their application to interprocedural dataflow analysis

Thomas Reps, Stefan Schwoon, Somesh Jha, David Melski
2005 Science of Computer Programming  
The algorithms described in the paper have been implemented: We have created an extended version of MOPED [22] (a model checker for pushdown systems) that solves reachability problems for weighted PDSs  ...  by conventional interprocedural dataflow-analysis algorithms. ¢ Because the algorithm for solving path problems in weighted PDSs can provide a witness set of paths, it is possible to provide an explanation  ...  demand versions of interprocedural dataflow-analysis algorithms was investigated by Duesterwald, Gupta, and Soffa [6] .  ... 
doi:10.1016/j.scico.2005.02.009 fatcat:5r7gez6ibbfuhadnbjtigsavy4

Interprocedural optimizations for improving data cache performance of array-intensive embedded applications

W. Zhang, G. Chen, M. Kandemir, M. Karakoy
2003 Proceedings of the 40th conference on Design automation - DAC '03  
In this paper, we look at loop and data transformations from a different angle and use them in an interprocedural optimization framework.  ...  A major limitation of most of the cache locality optimization techniques proposed by previous research is that they handle a single procedure at a time.  ...  Cloning generates a new version of a procedure for specific interprocedural information (see [3] for more information on cloning).  ... 
doi:10.1145/775832.776054 dblp:conf/dac/ZhangCKK03 fatcat:w6fp6un5hzarbnia26xriydgou

Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis [chapter]

Thomas Reps, Stefan Schwoon, Somesh Jha
2003 Lecture Notes in Computer Science  
The algorithms described in the paper have been implemented: We have created an extended version of MOPED [22] (a model checker for pushdown systems) that solves reachability problems for weighted PDSs  ...  by conventional interprocedural dataflow-analysis algorithms. ¢ Because the algorithm for solving path problems in weighted PDSs can provide a witness set of paths, it is possible to provide an explanation  ...  demand versions of interprocedural dataflow-analysis algorithms was investigated by Duesterwald, Gupta, and Soffa [6] .  ... 
doi:10.1007/3-540-44898-5_11 fatcat:tbbjhcimsjcv3kqb4bsvo66imi

Interprocedural optimizations for improving data cache performance of array-intensive embedded applications

W. Zhang, G. Chen, M. Kandemir, M. Karakoy
2003 Proceedings of the 40th conference on Design automation - DAC '03  
In this paper, we look at loop and data transformations from a different angle and use them in an interprocedural optimization framework.  ...  A major limitation of most of the cache locality optimization techniques proposed by previous research is that they handle a single procedure at a time.  ...  Cloning generates a new version of a procedure for specific interprocedural information (see [3] for more information on cloning).  ... 
doi:10.1145/776050.776054 fatcat:relpkcpgg5a25ka5bzzs5f4dwq

Demand interprocedural dataflow analysis

Susan Horwitz, Thomas Reps, Mooly Sagiv
1995 Software engineering notes  
This paper presents a new demand algorithm for interprocedural dataflow analysis.  ...  The new algorithm has three important properties: q It provides precise (meet over all interprocedurally valid paths) solutions to a large class of problems. q It has a polynomial worst-case cost for both  ...  A different approach to obtaining demand versions of dataflow-analysis algorithms has been investigated by Duesterwald, Gupta, and Soffa, first for intraprocedural problems [9] and subsequently for interprocedural  ... 
doi:10.1145/222132.222146 fatcat:vu2itg6pgzfbbnxt7nnarw2gea

Interprocedural analyses of Fortran programs

B Creusillet, F Irigoin
1998 Parallel Computing  
But research on the analysis of Fortran programs is still going on, as a number of problems are not yet satisfactorily solved and others are emerging with new language dialects.  ...  This paper presents a survey of the main interprocedural analysis techniques, with an emphasis on the suitability of the analysis framework for the characteristics of the original semantic problem.  ...  Characteristics of Interprocedural Problems Some interprocedural problems are intrinsically much more di cult to solve than other ones.  ... 
doi:10.1016/s0167-8191(98)00028-3 fatcat:7nyfazdbivalxhorcl57cxd5ky

Demand-driven computation of interprocedural data flow

Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa
1995 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95  
The goal of demand-driven analysis is to reduce the time and/or space overhead of conventional exhaustive analysis by avoiding the collection of information that is not needed.  ...  Our framework is applicable to interprocedural data flow problems with a finite domain set.  ...  Acknowledgements We thank Tom Reps and the referees for their comments on an earlier draft of this paper.  ... 
doi:10.1145/199448.199461 dblp:conf/popl/DuesterwaldGS95 fatcat:hkdu2kkfpbbihfcviiu3cxpohq

Interprocedural analysis of asynchronous programs

Ranjit Jhala, Rupak Majumdar
2007 SIGPLAN notices  
We formalize the problem of interprocedural dataflow analysis for asynchronous programs as AIFDS problems, a generalization of the IFDS problems for interprocedural dataflow analysis.  ...  Though the problem of solving AIFDS instances is EXPSPACE-hard, we find that in practice our technique can efficiently analyze programs by exploiting standard optimizations of interprocedural dataflow  ...  Algorithm There are two problems that any precise interprocedural analysis for asynchronous programs must solve.  ... 
doi:10.1145/1190215.1190266 fatcat:ojvy5ae765b57gxx6ie4chxm2i

On interprocedural data flow analysis for object oriented languages [chapter]

Mario Südholt, Christoph Steigner
1992 Lecture Notes in Computer Science  
We present solutions to these problems and exemplify them by extending a fast interprocedural data flow analysis algorithm.  ...  To combine the advantages of object oriented programming with the power of parallel processing two major problems have to be solved: the virtual function and the class scope problem.  ...  Object oriented languages place a still higher demand on the interprocedural data flow analysis phase of a (parallelizing) compiler, because encapsulation of the internal state of an object trades off  ... 
doi:10.1007/3-540-55984-1_15 fatcat:zs5b5j2b2rhfld33bdyccd7imu

Refining data flow information using infeasible paths [chapter]

Rastislav Bodík, Rajiv Gupta, Mary Lou Soffa
1997 Lecture Notes in Computer Science  
The efficiency of our technique is achieved through demand-driven formulation of both the infeasible paths detection and the defuse pair analysis.  ...  We present an algorithm for identifying infeasible program paths and a data flow analysis technique that improves the precision of traditional def-use pair analysis by incorporating the information about  ...  Intraprocedural demand-driven def-use analysis. Fig. 5 . 5 Interprocedural demand-driven def-use analysis.  ... 
doi:10.1007/3-540-63531-9_25 fatcat:bt6fxt4rabgn7ghajlawuwggae

Refining data flow information using infeasible paths

Rastislav Bodík, Rajiv Gupta, Mary Lou Soffa
1997 Software engineering notes  
The efficiency of our technique is achieved through demand-driven formulation of both the infeasible paths detection and the defuse pair analysis.  ...  We present an algorithm for identifying infeasible program paths and a data flow analysis technique that improves the precision of traditional def-use pair analysis by incorporating the information about  ...  Intraprocedural demand-driven def-use analysis. Fig. 5 . 5 Interprocedural demand-driven def-use analysis.  ... 
doi:10.1145/267896.267921 fatcat:v6zgfxhefvhqfna4tdj5licsva
« Previous Showing results 1 — 15 out of 934 results