A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Filters
A program data flow analysis procedure
1976
Communications of the ACM
Preserved Fulltext
for the data-flow equations Definitions • Interval: an interval I(h) in a control-flow graph is a maximal, single entry subgraph in which h is the only entry to I(h) and all closed paths in I(h) contain ...
While strong arguments favor iterative data-flow analysis, you should be aware of the other methods proposed in the literature, in part because they offer insight into the problems and techniques of analysis ...
The same interval graphs can be used to solve many data-flow problems For interval analysis, we need to reformulate the equations in a straight-forward way In the iterative framework, we used a single ...
doi:10.1145/360018.360025
fatcat:mp25v7lqwjgp3iz37ii7embvau
Data flow analysis of applicative programs
[chapter]
1981
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 2018; you can also visit the original URL.
The file type is application/pdf.
A precise and efficient data-flow analysis algorithm, for analysis of programs involving procedures with call-by-value parameter passing, is presented and analyzed. ...
The bulk of data-flow analysis theory deals with intraprocedural analysis, i.e. it analyzes each procedure in the program to be analyzed in separation from the other procedures, and so concerns itself ...
data-flow analysis technique for a relatively strong model of procedural and applicative programs, using a new notion of second-order da%a-flow frameworks. ...
doi:10.1007/3-540-10843-2_9
fatcat:2hrd32ezizhspafwd2wkw7cwbi
The design of a data flow analyzer
1982
Proceedings of the 1982 SIGPLAN symposium on Compiler construction - SIGPLAN '82
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.
This paper presents an efficient interprocedural data flow analysis algorithm for precisely determining aliases in programs that employ a rich set of parameter passing mechanisms and pointer data types ...
In the last step of this approach, the alias information is used to compute data flow information that is required for optimization. ...
Each procedure is subjected to global data flow analysis and data flow information is associated with each statement. ...
doi:10.1145/800230.806985
dblp:conf/sigplan/ChowR82
fatcat:jbhvn6zgvbhvfgkc5u4pzrqvyi
Program Comprehension and Analysis
2016
International Journal of Engineering and Applied 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 2018; you can also visit the original URL.
The file type is application/pdf.
Program comprehension is a process of program understanding and reverse engineering, which supports the analyst to easily undertake the program for further reengineering. ...
Due to continuous change in business requirements and to implement proactive, adaptive maintenance procedures in application program; it is required to evolve application program time to time. ...
MAJOR PROGRAM ELEMENTS In the abstract level program analysis procedure focuses on the following three major elements of application structure. a) Program presentation b) Program logic c) Program data ...
doi:10.24032/ijeacs/0101/04
fatcat:gbs4zgogtramfhalc54v5qq2zy
Equivalence analysis
1999
Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering - PASTE '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.
Thus, a data-flow analysis needs to compute the data-flow information only for a representative memory location in an equivalence class. ...
This paper presents equivalence analysis, a general technique to improve the efficiency of data-flow analyses in the presence of pointers. ...
These studies show that equivalence analysis can effectively reduce the sizes of sets of data facts and data-flow information for a procedure. ...
doi:10.1145/316158.316175
dblp:conf/paste/LiangH99
fatcat:afi52zplofdfpge6be4vsvdzpq
Equivalence analysis
1999
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 2003; you can also visit the original URL.
The file type is application/pdf.
Thus, a data-flow analysis needs to compute the data-flow information only for a representative memory location in an equivalence class. ...
This paper presents equivalence analysis, a general technique to improve the efficiency of data-flow analyses in the presence of pointers. ...
These studies show that equivalence analysis can effectively reduce the sizes of sets of data facts and data-flow information for a procedure. ...
doi:10.1145/381788.316175
fatcat:oedfwnjohfcsbjk72neju3e7m4
An information-leak analysis system based on program slicing
2002
Information and Software Technology
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.
In this paper, we propose an implementation method for information-leak analysis, and show a system we have implemented based on program slicing. We have applied this system to a credit card program. ...
Our results show that information-leak analysis before practical use of the program is important. ...
The information-leak analysis implementation method in this paper uses the similarity of data flow and information flow, and is realized by converting the PDG-creation technique used in a program slice ...
doi:10.1016/s0950-5849(02)00127-1
fatcat:dte3xi7cxjbgvdnihcztofmpoq
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. ...
The dependencies that exist among definitions and uses of variables in a program are required by many language-processing tools. ...
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
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. ...
In our framework, a demand for data flow information is modeled as a set of data flow queries. ...
If the program under analysis consists of only a single procedure (the intraprocedural case), Query provides a complete procedure for demand-driven data flow analysis. ...
doi:10.1145/199448.199461
dblp:conf/popl/DuesterwaldGS95
fatcat:hkdu2kkfpbbihfcviiu3cxpohq
Incremental data flow analysis
1983
Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '83
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.
A Program
Data Flow Analysis
Procedure.
Communications
of the ACM
19(3)137-147,
1977.
Allen, F. E.
private
communication.
Babich, W. A. and Jazayeri,
M. ...
Determining
the Data Relationships
in a
Collection
of Procedures.
1973.
Interprocedural
Data Flow Analysis.
In Proceedings
of 1974 IF I P Congress,
pages 398-402. ...
doi:10.1145/567067.567084
dblp:conf/popl/Ryder83
fatcat:wxiszi2fqnhhrfvifzxzhk6riu
Data-Flow Analysis of Program Fragments
[chapter]
1999
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 2017; you can also visit the original URL.
The file type is application/pdf.
We propose fragment data-flow analysis as an alternative approach which computes data-flow information for a specific program fragment. ...
Traditional interprocedural data-flow analysis is performed on whole programs; however, such whole-program analysis is not feasible for large or incomplete programs. ...
Whole-Program Data-Flow Analysis This section presents two well-known frameworks for whole-program interprocedural flow-sensitive data-flow analysis. ...
doi:10.1007/3-540-48166-4_15
fatcat:zy56zc7mfbcqtbapgxy2ojvyie
Data-flow analysis of program fragments
1999
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.
We propose fragment data-flow analysis as an alternative approach which computes data-flow information for a specific program fragment. ...
Traditional interprocedural data-flow analysis is performed on whole programs; however, such whole-program analysis is not feasible for large or incomplete programs. ...
Whole-Program Data-Flow Analysis This section presents two well-known frameworks for whole-program interprocedural flow-sensitive data-flow analysis. ...
doi:10.1145/318774.318945
fatcat:kxhx3pjphrhw5nxp4pacuwezyy
The Complexity of Copy Constant Detection in Parallel Programs
[chapter]
2001
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 2008; you can also visit the original URL.
The file type is application/pdf.
(x ∧ a) ∨ b, where a, b are constants from the underlying lattice of data-flow facts. ...
Despite of the well-known state-explosion problem, certain simple but important data-flow analysis problems known as gen/kill problems can be solved efficiently and completely for parallel programs with ...
I thank Helmut Seidl for a number of discussions that stimulated the research reported here and Jens Knoop, Oliver Rüthing, and Bernhard Steffen for sharing their knowledge of data-flow analysis with me ...
doi:10.1007/3-540-44693-1_43
fatcat:35x4aaeuxjbincrud4iemih26m
Flow grammars — a flow analysis methodology
[chapter]
1994
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 2003; you can also visit the original URL.
The file type is application/pdf.
Flow grammars overcome these deficiencies and are well-suited to the specification and solution of data flow analysis problems. ...
Flow grammars provide a new mechanism for modelling control flow in flow analyzers and code optimizers. ...
Interprocedural data flow analysis: an example Within a flow grammar, each non-terminal represents an execution point in the program. ...
doi:10.1007/3-540-57877-3_14
fatcat:jtpscr45tjguvkf4xanxxvzswu
Intermodular slicing of object-oriented programs
[chapter]
1998
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 2018; you can also visit the original URL.
The file type is application/pdf.
To cope with the problem of alias analysis in the presence of function pointers (which is NP-hard [ZhR94]), we decided to first use a conservative approach leading to less precise data flow information ...
Program slicing [Wei84] uses control flow and data flow information to visualise dependences and assist the programmer in debugging and in program understanding. ...
Data Flow Analysis The computation of data flow information is much more complicated than the computation of control flow information. ...
doi:10.1007/bfb0026437
fatcat:jsojf23xyfbanl2rsxnlynwtzm
« Previous
Showing results 1 — 15 out of 1,061,478 results