32. POPL 2005: Long Beach, California, USA

• Manuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones, Simon Marlow:
  Associated types with class. 1-13
  
• Richard Cobbe, Matthias Felleisen:
  Environmental acquisition revisited. 14-25
  
• Davide Ancona, Ferruccio Damiani, Sophia Drossopoulou, Elena Zucca:
  Polymorphic bytecode: compositional compilation for Java-like languages. 26-37
  
• Juan Chen, David Tarditi:
  A simple typed intermediate language for object-oriented languages. 38-49
  
• Haruo Hosoya, Alain Frisch, Giuseppe Castagna:
  Parametric polymorphism for XML. 50-62
  
• Eijiro Sumii, Benjamin C. Pierce:
  A bisimulation for type abstraction and recursion. 63-74
  
• Healfdene Goguen:
  A syntactic approach to eta equality in type theory. 75-84
  
• Dan R. Ghica:
  Slot games: a quantitative model of computation. 85-97
  
• Rajeev Alur, Pavol Cerný, P. Madhusudan, Wonhong Nam:
  Synthesis of interface specifications for Java classes. 98-109
  
• Cormac Flanagan, Patrice Godefroid:
  Dynamic partial-order reduction for model checking software. 110-121
  
• Orna Grumberg, Flavio Lerda, Ofer Strichman, Michael Theobald:
  Proof-guided underapproximation-widening for multi-process systems. 122-131
  
• Andreas Podelski, Andrey Rybalchenko:
  Transition predicate abstraction and fair termination. 132-144
  
• Simon J. Gay, Rajagopal Nagarajan:
  Communicating quantum processes. 145-157
  
• Peng Li, Steve Zdancewic:
  Downgrading policies and relaxed noninterference. 158-170
  
• Sungwoo Park, Frank Pfenning, Sebastian Thrun:
  A probabilistic language based upon sampling functions. 171-182
  
• Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman, Peter Sewell, Iulian Neamtiu:
  Mutatis mutandis: safe and predictable dynamic software updating. 183-194
  
• John Field, Carlos A. Varela:
  Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments. 195-208
  
• Roberto Bruni, Hernán C. Melgratti, Ugo Montanari:
  Theoretical foundations for compensations in flow composition languages. 209-220
  
• Matthias Neubauer, Peter Thiemann:
  From sequential programs to multi-tier applications by program transformation. 221-232
  
• J. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, Alan Schmitt:
  Combinators for bi-directional tree transformations: a linguistic approach to the view update problem. 233-246
  
• Matthew J. Parkinson, Gavin M. Bierman:
  Separation logic and abstraction. 247-258
  
• Richard Bornat, Cristiano Calcagno, Peter W. O'Hearn, Matthew J. Parkinson:
  Permission accounting in separation logic. 259-270
  
• Cristiano Calcagno, Philippa Gardner, Uri Zarfaty:
  Context logic and tree update. 271-282
  
• John Tang Boyland, William Retert:
  Connecting effects and uniqueness with adoption. 283-295
  
• Noam Rinetzky, Jörg Bauer, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm:
  A semantics for procedure local heaps and its abstractions. 296-309
  
• Brian Hackett, Radu Rugina:
  Region-based shape analysis with tracked locations. 310-323
  
• Sumit Gulwani, George C. Necula:
  Precise interprocedural analysis using random interpretation. 324-337
  
• Denis Gopan, Thomas W. Reps, Shmuel Sagiv:
  A framework for numeric analysis of array operations. 338-350
  
• Yichen Xie, Alexander Aiken:
  Scalable error detection using boolean satisfiability. 351-363
  
• Sorin Lerner, Todd D. Millstein, Erika Rice, Craig Chambers:
  Automated soundness proofs for dataflow analyses and transformations via local rules. 364-377
  
• Jeremy Manson, William Pugh, Sarita V. Adve:
  The Java memory model. 378-391