Results 1  10
of
70,686
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 1003 (8 self)
 Add to MetaCart
assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive
Empirical Studies of Control Dependence Graph Size for C Programs
, 1998
"... Many tools and techniques for performing software engineering tasks require control dependence information, represented in the form of control dependence graphs. Worstcase analysis of these graphs has shown that their size may be quadratic in the number of statements in the procedure that they r ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Many tools and techniques for performing software engineering tasks require control dependence information, represented in the form of control dependence graphs. Worstcase analysis of these graphs has shown that their size may be quadratic in the number of statements in the procedure
Composed Control Dependence Graph Generator By:
"... I would like to thank the following people for their help in bringing this project to fulfillment: Judith Stafford, Tufts University. While not only the author of the algorithm described in this paper, she has also helped me to understand it and given me the tools to implement this project. She has ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
I would like to thank the following people for their help in bringing this project to fulfillment: Judith Stafford, Tufts University. While not only the author of the algorithm described in this paper, she has also helped me to understand it and given me the tools to implement this project. She has provided ample amounts of her time to aiding my development, and she has been very supportive and understanding when I have not been true to my deadlines. Glenn Holloway, Harvard University. Glenn has been my single largest source of help in all things related to MachSUIF. While under no obligation to do so, he has examined my code many times and has helped me to debug numerous issues related to MachSUIF. He has been instrumental in my progress, and I may never have achieved what I did with my project were it not for him. SERG, Tufts University. The Software Engineering Research Group at Tufts University, composed of (in alphabetical order) Shuanghong He, Srikanth Ravi, Matt Salter, Kevin Simons, Judith Stafford, and myself. They have lent me their
The program dependence graph and its use in optimization
 ACM Transactions on Programming Languages and Systems
, 1987
"... In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program. ..."
Abstract

Cited by 996 (3 self)
 Add to MetaCart
In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program
Interprocedural Slicing Using Dependence Graphs
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1990
"... ... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previou ..."
Abstract

Cited by 837 (84 self)
 Add to MetaCart
... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends
High dimensional graphs and variable selection with the Lasso
 ANNALS OF STATISTICS
, 2006
"... The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a ..."
Abstract

Cited by 736 (22 self)
 Add to MetaCart
show that the proposed neighborhood selection scheme is consistent for sparse highdimensional graphs. Consistency hinges on the choice of the penalty parameter. The oracle value for optimal prediction does not lead to a consistent neighborhood estimate. Controlling instead the probability of falsely
The geometry of graphs and some of its algorithmic applications
 COMBINATORICA
, 1995
"... In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graphtheoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that res ..."
Abstract

Cited by 524 (19 self)
 Add to MetaCart
tensions. 0 For graphs embeddable in lowdimensional spaces with a small distortion, we can find lowdiameter decompositions (in the sense of [4] and [34]). The parameters of the decomposition depend only on the dimension and the distortion and not on the size of the graph. 0 In graphs embedded this way
The control of the false discovery rate in multiple testing under dependency
 Annals of Statistics
, 2001
"... Benjamini and Hochberg suggest that the false discovery rate may be the appropriate error rate to control in many applied multiple testing problems. A simple procedure was given there as an FDR controlling procedure for independent test statistics and was shown to be much more powerful than comparab ..."
Abstract

Cited by 1093 (16 self)
 Add to MetaCart
comparable procedures which control the traditional familywise error rate. We prove that this same procedure also controls the false discovery rate when the test statistics have positive regression dependency on each of the test statistics corresponding to the true null hypotheses. This condition
Information flow and cooperative control of vehicle formations.
 In Proceeings of 15th IFAC Conference,
, 2002
"... Abstract We consider the problem of cooperation among a collection of vehicles performing a shared task using intervehicle communication to coordinate their actions. We apply tools from graph theory to relate the topology of the communication network to formation stability. We prove a Nyquist crite ..."
Abstract

Cited by 551 (11 self)
 Add to MetaCart
to be used for cooperative motion. We prove a separation principle that states that formation stability is achieved if the information flow is stable for the given graph and if the local controller stabilizes the vehicle. The information flow can be rendered highly robust to changes in the graph, thus
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
, 2002
"... Matching elements of two data schemas or two data instances plays a key role in data warehousing, ebusiness, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs (sch ..."
Abstract

Cited by 592 (12 self)
 Add to MetaCart
(schemas, catalogs, or other data structures) as input, and produces as output a mapping between corresponding nodes of the graphs. Depending on the matching goal, a subset of the mapping is chosen using filters. After our algorithm runs, we expect a human to check and if necessary adjust the results. As a
Results 1  10
of
70,686