4719 search results - page 75 / 944 » Newtonian program analysis |
SAS
2005
Springer
14 years 1 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
ICLP
2007
Springer
13 years 11 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
ECLIPSE
2005
ACM
13 years 9 months ago
2005
ACM
Sharing mutable data (via aliasing) is a powerful programming technique. To facilitate sharing, object-oriented programming languages permit the programmer to selectively break en...
PLDI
2003
ACM
14 years 29 days ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...