3889 search results - page 575 / 778 » The Use of Program Dependence Graphs in Software Engineering |
189
click to vote
CBSE
2004
Springer
15 years 12 months ago
2004
Springer
According to Szyperski, “a software component is a unit of composition with contractually specified interfaces and explicit context dependencies only”. But it is well known tha...
186
click to vote
COCOA
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
155
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
200
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
196
click to vote
CGO
2010
IEEE
16 years 1 months ago
2010
IEEE
We present a practical and scalable method for flow- and contextsensitive (FSCS) pointer analysis for C programs. Our method analyzes the pointers in a program level by level in ...