177
click to vote
POPL
15 years 9 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...
170
click to vote
POPL
15 years 9 months ago
2004 ACM 
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
170
click to vote
POPL
15 years 9 months ago
2004 ACM 
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
169
click to vote
POPL
15 years 9 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...
169
click to vote
POPL
15 years 9 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...
|
Programming Languages