38 search results - page 1 / 8 » Termination Analysis with Calling Context Graphs |
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...
ITP
2010
13 years 6 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
ICFP
2007
ACM
14 years 4 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...
SCAM
2002
IEEE
13 years 9 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...
COMSWARE
2008
IEEE
13 years 6 months ago
2008
IEEE
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...