1452 search results - page 74 / 291 » Algorithmic Analysis of Array-Accessing Programs |
ICFP
1997
ACM
14 years 2 months ago
1997
ACM
An interprocedural flow analysis can justify inlining in higher-order languages. In principle, more inlining can be performed as analysis accuracy improves. This paper compares fo...
INFSOF
2002
13 years 10 months ago
2002
Pointer analysis is an important part of source code analysis. Many programs that manipulate source code take points-to sets as part of their input. Points-to related data collect...
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
WFLP
2009
Springer
14 years 5 months ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
LISP
2008
13 years 11 months ago
2008
Trace effects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type a...