1452 search results - page 54 / 291 » Algorithmic Analysis of Array-Accessing Programs |
PLDI
2009
ACM
14 years 4 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
LOPSTR
2004
Springer
14 years 3 months ago
2004
Springer
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
ESOP
2010
Springer
14 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...
ML
2006
ACM
13 years 10 months ago
2006
ACM
Higher-order typed languages, such as ML, provide strong support for data and type abn. While such abstraction is often viewed as costing performance, there are situations where i...
POPL
2002
ACM
14 years 10 months ago
2002
ACM
We present a new role system in which the type (or role) of each object depends on its referencing relationships with other objects, with the role changing as these relationships ...