753 search results - page 60 / 151 » Completing a (k - 1)-Assignment |
TAPSOFT
1997
Springer
15 years 2 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
PLDI
1989
ACM
15 years 1 months ago
1989
ACM
We present the rst type reconstruction system which combines the implicit typing of ML with the full power of the explicitly typed second-order polymorphic lambda calculus. The sy...
ESOP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
CLOUDCOM
2009
Springer
15 years 1 months ago
2009
Springer
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...