POPL 2009

39 papers

1. A calculus of atomic actions · Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
2. A combination framework for tracking partition sizes · Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv
3. A cost semantics for self-adjusting computation · Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
4. A foundation for flow-based program matching: using temporal logic and model checking · Julien Brunel, Damien Doligez, René Rydhof Hansen, Julia L. Lawall, Gilles Muller
5. A model of cooperative threads · Martín Abadi, Gordon D. Plotkin
6. Automated verification of practical garbage collectors · Chris Hawblitzel, Erez Petrank
7. Automatic modular abstractions for linear constraints · David Monniaux
8. Bidirectionalization for free! (Pearl) · Janis Voigtländer
9. Classical BI: a logic for reasoning about dualising resources · James Brotherston, Cristiano Calcagno
10. Compositional shape analysis by means of bi-abduction · Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang
11. Copy-on-write in the PHP language · Akihiko Tozawa, Michiaki Tatsubori, Tamiya Onodera, Yasuhiko Minamide
12. Equality saturation: a new approach to optimization · Ross Tate, Michael Stepp, Zachary Tatlock, Sorin Lerner
13. Feedback-directed barrier optimization in a strongly isolated STM · Nathan Grasso Bronson, Christos Kozyrakis, Kunle Olukotun
14. Flexible types: robust type inference for first-class polymorphism · Daan Leijen
15. Focusing on pattern matching · Neelakantan R. Krishnaswami
16. Formal certification of code-based cryptographic proofs · Gilles Barthe, Benjamin Grégoire, Santiago Zanella-Béguelin
17. Language constructs for transactional memory · Tim Harris
18. Lazy evaluation and delimited control · Ronald Garcia, Andrew Lumsdaine, Amr Sabry
19. Linear types for computational effects · Alex Simpson
20. Local rely-guarantee reasoning · Xinyu Feng
21. Masked types for sound object initialization · Xin Qi, Andrew C. Myers
22. Modeling abstract types in modules with open existential types · Benoît Montagu, Didier Rémy
23. Modular code generation from synchronous block diagrams: modularity vs. code size · Roberto Lublinerman, Christian Szegedy, Stavros Tripakis
24. Positive supercompilation for a higher order call-by-value language · Peter A. Jonsson, Johan Nordlander
25. Proving that non-blocking algorithms don't block · Alexey Gotsman, Byron Cook, Matthew J. Parkinson, Viktor Vafeiadis
26. Relaxed memory models: an operational approach · Gérard Boudol, Gustavo Petri
27. SPEED: precise and efficient static estimation of program computational complexity · Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilimbi
28. Semi-sparse flow-sensitive pointer analysis · Ben Hardekopf, Calvin Lin
29. State-dependent representation independence · Amal Ahmed, Derek Dreyer, Andreas Rossberg
30. Static contract checking for Haskell · Dana N. Xu, Simon L. Peyton Jones, Koen Claessen
31. The semantics of progress in lock-based transactional memory · Rachid Guerraoui, Michal Kapalka
32. The semantics of x86-CC multiprocessor machine code · Susmit Sarkar, Peter Sewell, Francesco Zappa Nardelli, Scott Owens, Tom Ridge, Thomas Braibant + 2 more
33. The theory of deadlock avoidance via discrete control · Yin Wang, Stéphane Lafortune, Terence Kelly, Manjunath Kudlur, Scott A. Mahlke
34. The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer · Akimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
35. Types and higher-order recursion schemes for verification of higher-order programs · Naoki Kobayashi
36. Unifying type checking and property checking for low-level code · Jeremy Condit, Brian Hackett, Shuvendu K. Lahiri, Shaz Qadeer
37. Verifying distributed systems: the operational approach · Tom Ridge
38. Verifying liveness for asynchronous programs · Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
39. Wild control operators · Chris Barker