624 search results - page 95 / 125 » The Complexity of Type Analysis of Object Oriented Programs |
VLDB
1994
ACM
14 years 1 months ago
1994
ACM
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...
DLS
2005
13 years 11 months ago
2005
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
ECOOP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. The effectiveness of garbage collectors and leak detectors in identifying dead objects depends on the “accuracy” of their reachability traversal. Accuracy has two ort...
GPCE
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We define a basic calculus for name management, which is obtained by an appropriate combination of three ingredients: extensible records (in a simplified form), names (...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...