POPL 2008

38 papers

1. A logical account of pspace · Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca
2. A theory of contracts for web services · Giuseppe Castagna, Nils Gesbert, Luca Padovani
3. A theory of platform-dependent low-level software · Marius Nita, Dan Grossman, Craig Chambers
4. A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions · Brigitte Pientka
5. An approach to call-by-name delimited continuations · Hugo Herbelin, Silvia Ghilezan
6. Automatic inference of stationary fields: a generalization of java's final fields · Christopher Unkel, Monica S. Lam
7. Back to the future: revisiting precise program verification using SMT solvers · Shuvendu K. Lahiri, Shaz Qadeer
8. Boomerang: resourceful lenses for string data · Aaron Bohannon, J. Nathan Foster, Benjamin C. Pierce, Alexandre Pilkiewicz, Alan Schmitt
9. Caml trading · Yaron Minsky
10. Clowns to the left of me, jokers to the right (pearl): dissecting data structures · Conor McBride
11. Contextual effects for version-consistent dynamic software updatingalland safe concurrent programming · Iulian Neamtiu, Michael Hicks, Jeffrey S. Foster, Polyvios Pratikakis
12. Cryptographically sound implementations for typed information-flow security · Cédric Fournet, Tamara Rezk
13. Cyclic proofs of program termination in separation logic · James Brotherston, Richard Bornat, Cristiano Calcagno
14. Demand-driven alias analysis for C · Xin Zheng, Radu Rugina
15. Engineering formal metatheory · Brian E. Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack, Stephanie Weirich
16. Enhancing modular OO verification with separation logic · Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, Shengchao Qin
17. Extensible encoding of type hierarchies · Hamed S. Alavi, Seth Gilbert, Rachid Guerraoui
18. Focusing and higher-order abstract syntax · Noam Zeilberger
19. Formal verification of translation validators: a case study on instruction scheduling optimizations · Jean-Baptiste Tristan, Xavier Leroy
20. Foundations for structured programming with GADTs · Patricia Johann, Neil Ghani
21. From dirt to shovels: fully automatic tool generation from ad hoc data · Kathleen Fisher, David Walker, Kenny Qili Zhu, Peter White
22. Generating precise and concise procedure summaries · Greta Yorsh, Eran Yahav, Satish Chandra
23. High-level small-step operational semantics for transactions · Katherine F. Moore, Dan Grossman
24. Imperative self-adjusting computation · Umut A. Acar, Amal Ahmed, Matthias Blume
25. Lifting abstract interpreters to quantified logical domains · Sumit Gulwani, Bill McCloskey, Ashish Tiwari
26. Lightweight semiformal time complexity analysis for purely functional data structures · Nils Anders Danielsson
27. Much ado about two (pearl): a pearl on parallel prefix computation · Janis Voigtländer
28. Multiparty asynchronous session types · Kohei Honda, Nobuko Yoshida, Marco Carbone
29. On the computational soundness of cryptographically masked flows · Peeter Laud
30. Proving non-termination · Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko, Ru-Gang Xu
31. Relational inductive shape analysis · Bor-Yuh Evan Chang, Xavier Rival
32. Relevance heuristics for program analysis · Kenneth L. McMillan
33. Semantics of transactional memory and automatic mutual exclusion · Martín Abadi, Andrew Birrell, Tim Harris, Michael Isard
34. Separation logic, abstraction and inheritance · Matthew J. Parkinson, Gavin M. Bierman
35. Subcubic algorithms for recursive state machines · Swarat Chaudhuri
36. Systems biology, models, and concurrency · Walter Fontana
37. The design and implementation of typed scheme · Sam Tobin-Hochstadt, Matthias Felleisen
38. The intensional content of Rice's theorem · Andrea Asperti