[PRL] Bored?

[Matt Might]

I could use some help proofreading POPL submissions.  (Listed below.)

If you have some time tomorrow, feedback ranging from spelling/grammar
to show-stopping bugs in proofs would be greatly appreciated.

Thanks,

Matt




* Abstract Interpretation of Imperative Programs using
Garbage-Collectable Pointer Arithmetic

http://matt.might.net/tmp/popl2008/imp-gc.pdf

 - Applies Gamma-CFA-esque technology to C for alias analysis.
 - Develops Peano model of pointer arithmetic in the process.
 - Actually implemented and working.  (Thanks to Ben and Stevie.)


* The Polyvariance Completeness Theorem

http://matt.might.net/tmp/popl2008/completeness.pdf

 - Proves the soundness of non-deterministic CFA.


* Abstract Ignorance is Bliss

http://matt.might.net/tmp/popl2008/ignorance.pdf

 - Builds a very simple LFA.
 - Develops an alternate correctness criterion to soundness--soundness
modulo congruence--to support it.


* Reconciling Recency and Reachability via Anodizing Semantics

http://matt.might.net/tmp/popl2008/anodizing.pdf

 - Develops unifying framework for abstractions like recency, golden
contours, counting.
 - Proves soundness of integrating recency abstraction and abstract GC.