POPL 2005

31 papers

1. A bisimulation for type abstraction and recursion · Eijiro Sumii, Benjamin C. Pierce
2. A framework for numeric analysis of array operations · Denis Gopan, Thomas W. Reps, Shmuel Sagiv
3. A probabilistic language based upon sampling functions · Sungwoo Park, Frank Pfenning, Sebastian Thrun
4. A semantics for procedure local heaps and its abstractions · Noam Rinetzky, Jörg Bauer, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm
5. A simple typed intermediate language for object-oriented languages · Juan Chen, David Tarditi
6. A syntactic approach to eta equality in type theory · Healfdene Goguen
7. Associated types with class · Manuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones, Simon Marlow
8. Automated soundness proofs for dataflow analyses and transformations via local rules · Sorin Lerner, Todd D. Millstein, Erika Rice, Craig Chambers
9. Combinators for bi-directional tree transformations: a linguistic approach to the view update problem · J. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, Alan Schmitt
10. Communicating quantum processes · Simon J. Gay, Rajagopal Nagarajan
11. Connecting effects and uniqueness with adoption · John Tang Boyland, William Retert
12. Context logic and tree update · Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
13. Downgrading policies and relaxed noninterference · Peng Li, Steve Zdancewic
14. Dynamic partial-order reduction for model checking software · Cormac Flanagan, Patrice Godefroid
15. Environmental acquisition revisited · Richard Cobbe, Matthias Felleisen
16. From sequential programs to multi-tier applications by program transformation · Matthias Neubauer, Peter Thiemann
17. Mutatis mutandis: safe and predictable dynamic software updating · Gareth Paul Stoyle, Michael W. Hicks, Gavin M. Bierman, Peter Sewell, Iulian Neamtiu
18. Parametric polymorphism for XML · Haruo Hosoya, Alain Frisch, Giuseppe Castagna
19. Permission accounting in separation logic · Richard Bornat, Cristiano Calcagno, Peter W. O'Hearn, Matthew J. Parkinson
20. Polymorphic bytecode: compositional compilation for Java-like languages · Davide Ancona, Ferruccio Damiani, Sophia Drossopoulou, Elena Zucca
21. Precise interprocedural analysis using random interpretation · Sumit Gulwani, George C. Necula
22. Proof-guided underapproximation-widening for multi-process systems · Orna Grumberg, Flavio Lerda, Ofer Strichman, Michael Theobald
23. Region-based shape analysis with tracked locations · Brian Hackett, Radu Rugina
24. Scalable error detection using boolean satisfiability · Yichen Xie, Alex Aiken
25. Separation logic and abstraction · Matthew J. Parkinson, Gavin M. Bierman
26. Slot games: a quantitative model of computation · Dan R. Ghica
27. Synthesis of interface specifications for Java classes · Rajeev Alur, Pavol Cerný, P. Madhusudan, Wonhong Nam
28. The Java memory model · Jeremy Manson, William W. Pugh, Sarita V. Adve
29. Theoretical foundations for compensations in flow composition languages · Roberto Bruni, Hernán C. Melgratti, Ugo Montanari
30. Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments · John Field, Carlos A. Varela
31. Transition predicate abstraction and fair termination · Andreas Podelski, Andrey Rybalchenko