13 search results - page 2 / 3 » Termination analysis and call graph construction for higher-... |
CSMR
1999
IEEE
13 years 9 months ago
1999
IEEE
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
FUIN
2006
13 years 5 months ago
2006
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...
ITP
2010
13 years 7 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...
ICLP
1997
Springer
13 years 9 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
LCPC
1999
Springer
13 years 9 months ago
1999
Springer
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...