19 search results - page 1 / 4 » Constraint Systems for Useless Variable Elimination |
POPL
1999
ACM
13 years 9 months ago
1999
ACM
Superfluous variables are often produced as the byproducts of program transformations, compilation, and poorly written code. These variables are irrelevant to the computational o...
PADO
2001
Springer
13 years 9 months ago
2001
Springer
nt Abstractions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 J¨orgen Gustavsson, Josef Svenningsson Implementing Circularity Using Pa...
SAC
2008
ACM
13 years 4 months ago
2008
ACM
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
TCS
2008
13 years 4 months ago
2008
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...
SAS
2009
Springer
14 years 5 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...