Sciweavers

Share
340 search results - page 1 / 68
» Relating complexity and precision in control flow analysis
Sort
View
ICFP
2007
ACM
10 years 6 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
ISSTA
1998
ACM
9 years 11 months ago
On the Limit of Control Flow Analysis for Regression Test Selection
Automated analyses for regression test selection (RTS) attempt to determine if a modified program, when run on a test t, will have the same behavior as an old version of the prog...
Thomas Ball
DAGSTUHL
1996
9 years 8 months ago
Specialization of Imperative Programs Through Analysis of Relational Expressions
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
Alexander Sakharov
CORR
2006
Springer
91views Education» more  CORR 2006»
9 years 6 months ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
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 ...
Bageshri Karkare, Uday P. Khedker
RTCSA
2000
IEEE
9 years 11 months ago
Extracting safe and precise control flow from binaries
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
Henrik Theiling
books