4716 search results - page 126 / 944 » Iterative-free program analysis |
CACM
2010
14 years 10 months ago
2010
Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis time. While such unknown values need to be treated as ...
100
click to vote
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
SAC
2008
ACM
14 years 9 months ago
2008
ACM
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
101
click to vote
WORDS
2003
IEEE
15 years 3 months ago
2003
IEEE
Bounding the Worst Case Execution Time (WCET) of programs is essential for real-time systems. To be able to do WCET calculations, the iteration bounds for loops and recursion must...
ESOP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...