A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
An interprocedural data flow analysis algorithm
1977
Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77
Preserved Fulltext
The use of interprocedural
data
flow
analysis
in
an
optimizing
compiler
at
these
costs
seems
practical. ...
Implementation:
One of the major
advantages
claimed
for
the
interprocedural
data
flow
analysis
algorithm
described
in this
paper
is its
strictly
one ,pass
nature. ...
doi:10.1145/512950.512962
dblp:conf/popl/Barth77
fatcat:65rmgpb3brfsvkyor7hsuyrxfq
Flow-sensitive interprocedural constant propagation
1995
Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation - PLDI '95
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
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. ...
This algorithm is similar to ones previously described for interprocedural data-flow analysis[2] and interprocedural alias analysis [ 11, 8] . ...
doi:10.1145/207110.207113
dblp:conf/pldi/CariniH95
fatcat:dfqianqnlfbcrorqgz5ob64dqe
Interprocedural side-effect analysis in linear time
2004
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
He suggested using standard data-flow algorithms for the solution, but did not provide a complexity analysis. ...
He also formulated the solution of flow-insensitive problems as a data flow analysis problem on the call graph. ...
doi:10.1145/989393.989418
fatcat:rz5nf5gn75e7be4ac6t3n2lumy
Interprocedual data flow testing
1989
Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification - TAV3
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An interprocedural data flow analysis algorithm is first presented that enables the efficient computation of information detailing the locations of definitions and uses needed by an interprocedural data ...
The resulting interprocedural data flow tester handles global variables, reference parameters and recursive procedure calls, and is compatible with the current intraprocedural data flow testing techniques ...
This paper extends data flow testing to include interprocedural data frow testing by developing both an efficient interprocedural data flow analysis technique that gathers the necessary information about ...
doi:10.1145/75308.75327
dblp:conf/issta/HarroldS89
fatcat:ynpgk76ogfdohmy3sjoxd7uptu
Interprocedual data flow testing
1989
Software engineering notes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An interprocedural data flow analysis algorithm is first presented that enables the efficient computation of information detailing the locations of definitions and uses needed by an interprocedural data ...
The resulting interprocedural data flow tester handles global variables, reference parameters and recursive procedure calls, and is compatible with the current intraprocedural data flow testing techniques ...
This paper extends data flow testing to include interprocedural data frow testing by developing both an efficient interprocedural data flow analysis technique that gathers the necessary information about ...
doi:10.1145/75309.75327
fatcat:ewsclvvnxjefrcnepckmvw5uri
System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow
1999
Proceedings of the 21st international conference on Software engineering - ICSE '99
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
This paper presents an approach to constructing SDGs, and computing slices on SDGs, that accommodates programs with arbitrary interprocedural control flow. ...
Many algorithms for automating software engineering tasks require program slices. To be applicable to large software systems, these slices must be computed interprocedurally. ...
That algorithm uses data-flow analysis to compute interprocedural slices, correctly considering programs that contain halt statements. ...
doi:10.1145/302405.302675
dblp:conf/icse/SinhaHR99
fatcat:c24dmpymdrgo7lma5a5rqiojwa
The Interprocedural Express-Lane Transformation
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The express-lane transformation isolates and duplicates frequently executed program paths, aiming for better data-flow facts along the duplicated paths. An express-lane ...
We perform code transformation before performing data-flow analysis. This allows us to use classic data-flow analyses. 3. We guide path duplication using interprocedural path profiles. ...
Classical data-flow analysis is likely to find sharper data-flow facts along the express lanes, since there are no join points. This may create opportunities for program optimization. ...
doi:10.1007/3-540-36579-6_15
fatcat:jgii6ott3nf2ld4lpsekcwodiy
Efficient computation of interprocedural definition-use chains
1994
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The technique has been implemented using a Sun-4 Workstation and incorporated into an interprocedural data-flow tester. ...
Intraprocedural definition and use information is abstracted for each procedure and is used to construct an interprocedural flow graph. ...
INTRODUCTION An important component of compilation is data-flow analysis that computes information about the potential flow of data throughout a program. ...
doi:10.1145/174662.174663
fatcat:6k4cc4pzkvdbbgposi64tm77wa
Interprocedural pointer alias analysis
1999
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
; (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 ...
algorithm that incorporates kill information to improve precision; (5) empirical measurements of the efficiency and precision of the three interprocedural alias analysis algorithms. ...
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
PCA: memory leak detection using partial call-path analysis
2020
Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We present PCA, a static interprocedural data dependence analyzer for real-world C programs. PCA performs interprocedural points-to and data-flow analyses with a lightweight design. ...
value flow analysis. ...
With such information, it then computes data flow facts (e.g., reaching definitions) using a classical fixed-point iterative data-flow analysis algorithm [3] . ...
doi:10.1145/3368089.3417923
dblp:conf/sigsoft/LiCSM20
fatcat:tl3awh7jxrhhtbp2ro3uyfdo7u
Demand-driven computation of interprocedural data flow
1995
Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents a general framework for deriving demanddriven algorithms for interprocedural data flow analysis of imperative programs. ...
The derived demand-driven algorithms find responses to these queries through a partial reversal of the respective data flow analysis. ...
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
Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysis. ...
Our algorithm works particularly well for interprocedural analyses. ...
This work is supported by NSF grant ACI-0313263, DARPA Contract #F30602-97-1-0150, and an IBM Faculty Partnership Award. ...
doi:10.1007/11688839_3
fatcat:hrquucl42vbdpdmnembyglftl4
Interprocedural Optimization for Dynamic Hardware Configurations
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an interprocedural optimization that minimizes the number of executed hardware configuration instructions taking into account constraints such as the "FPGA-area placement conflicts ...
The proposed algorithm allows the anticipation of hardware configuration instructions up to the application's main procedure. ...
Conclusions In this paper, we have proposed an interprocedural optimization algorithm for hardware configuration instructions. ...
doi:10.1007/11512622_2
fatcat:xmtscbmyvbfdpm5bgbuecriwu4
Efficient construction of program dependence graphs
1993
Proceedings of the 1993 international symposium on Software testing and analysis - ISSTA '93
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We also use the in-
dividual
PDG's
to construct
a unified
interprocedural
graph[14]
on which
we perform
interprocedural
data
flow analysis,
program
slicing
and data flow testing. ...
The implementation
then
per-
forms data flow analysis
to obtain
the DDS for P. ...
doi:10.1145/154183.154268
dblp:conf/issta/HarroldMR93
fatcat:ektcl7wk7fevlj6keosqvcukei
Pointer-induced aliasing: a problem taxonomy
1991
Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '91
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present our problem classification, give an overview of our proof that finding interprocedural aliases in the presence of single level pointers is in 7, and present a represent tive proof for the NP-hard ...
An efficient hybrid algorithm for incremental data flow analysis. W. E. Weihl. Interprocedural data flow analysis in the presence of pointers, procedure variables and label variables. ...
Interprocedural data flow analysis in the presence of pointers, procedure variables and label variables. ...
doi:10.1145/99583.99599
dblp:conf/popl/LandiR91
fatcat:oor3baq7kfg7xnk7tz5kqiplh4
« Previous
Showing results 1 — 15 out of 3,729 results