371
click to vote
POPL
16 years 8 months ago
2004 ACM 
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
361
click to vote
POPL
16 years 8 months ago
2004 ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
357
click to vote
POPL
16 years 8 months ago
2004 ACM 
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. Much previous work has focused on det...
356
Voted
POPL
16 years 8 months ago
2004 ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
354
click to vote
POPL
16 years 8 months ago
2004 ACM
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
|
Programming Languages