13 search results - page 1 / 3 » Termination analysis and call graph construction for higher-... |
ICFP
2007
ACM
14 years 5 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
IFL
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
SCAM
2002
IEEE
13 years 10 months ago
2002
IEEE
The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory accesses thro...
ASE
2004
13 years 4 months ago
2004
Abstract. The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory acce...