54 search results - page 7 / 11 » Precise Interprocedural Chopping |
SCAM
2007
IEEE
14 years 4 months ago
2007
IEEE
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...
ESEC
1999
Springer
14 years 2 months ago
1999
Springer
Traditional interprocedural data-flow analysis is performed on whole programs; however, such whole-program analysis is not feasible for large or incomplete programs. We propose fr...
DCC
2008
IEEE
14 years 9 months ago
2008
IEEE
At ASIACRYPT 2006, Chang et al. analyzed the indifferentiability of some popular hash functions based on block ciphers, namely, the twenty collision resistant PGV, the MDC2 and th...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...
JSA
2006
13 years 9 months ago
2006
Interprocedural data flow analyses of executable programs suffer from the conservative assumptions that need to be made because no precise control flow graph is available and beca...