Abstract is missing.
- Associated types with classManuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones, Simon Marlow. 1-13 [doi]
- Environmental acquisition revisitedRichard Cobbe, Matthias Felleisen. 14-25 [doi]
- Polymorphic bytecode: compositional compilation for Java-like languagesDavide Ancona, Ferruccio Damiani, Sophia Drossopoulou, Elena Zucca. 26-37 [doi]
- A simple typed intermediate language for object-oriented languagesJuan Chen, David Tarditi. 38-49 [doi]
- Parametric polymorphism for XMLHaruo Hosoya, Alain Frisch, Giuseppe Castagna. 50-62 [doi]
- A bisimulation for type abstraction and recursionEijiro Sumii, Benjamin C. Pierce. 63-74 [doi]
- A syntactic approach to eta equality in type theoryHealfdene Goguen. 75-84 [doi]
- Slot games: a quantitative model of computationDan R. Ghica. 85-97 [doi]
- Synthesis of interface specifications for Java classesRajeev Alur, Pavol Cerný, P. Madhusudan, Wonhong Nam. 98-109 [doi]
- Dynamic partial-order reduction for model checking softwareCormac Flanagan, Patrice Godefroid. 110-121 [doi]
- Proof-guided underapproximation-widening for multi-process systemsOrna Grumberg, Flavio Lerda, Ofer Strichman, Michael Theobald. 122-131 [doi]
- Transition predicate abstraction and fair terminationAndreas Podelski, Andrey Rybalchenko. 132-144 [doi]
- Communicating quantum processesSimon J. Gay, Rajagopal Nagarajan. 145-157 [doi]
- Downgrading policies and relaxed noninterferencePeng Li, Steve Zdancewic. 158-170 [doi]
- A probabilistic language based upon sampling functionsSungwoo Park, Frank Pfenning, Sebastian Thrun. 171-182 [doi]
- Mutatis mutandis: safe and predictable dynamic software updatingGareth Stoyle, Michael W. Hicks, Gavin M. Bierman, Peter Sewell, Iulian Neamtiu. 183-194 [doi]
- Transactors: a programming model for maintaining globally consistent distributed state in unreliable environmentsJohn Field, Carlos A. Varela. 195-208 [doi]
- Theoretical foundations for compensations in flow composition languagesRoberto Bruni, Hernán C. Melgratti, Ugo Montanari. 209-220 [doi]
- From sequential programs to multi-tier applications by program transformationMatthias Neubauer, Peter Thiemann. 221-232 [doi]
- Combinators for bi-directional tree transformations: a linguistic approach to the view update problemJ. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, Alan Schmitt. 233-246 [doi]
- Separation logic and abstractionMatthew J. Parkinson, Gavin M. Bierman. 247-258 [doi]
- Permission accounting in separation logicRichard Bornat, Cristiano Calcagno, Peter W. O Hearn, Matthew J. Parkinson. 259-270 [doi]
- Context logic and tree updateCristiano Calcagno, Philippa Gardner, Uri Zarfaty. 271-282 [doi]
- Connecting effects and uniqueness with adoptionJohn Tang Boyland, William Retert. 283-295 [doi]
- A semantics for procedure local heaps and its abstractionsNoam Rinetzky, Jörg Bauer, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm. 296-309 [doi]
- Region-based shape analysis with tracked locationsBrian Hackett, Radu Rugina. 310-323 [doi]
- Precise interprocedural analysis using random interpretationSumit Gulwani, George C. Necula. 324-337 [doi]
- A framework for numeric analysis of array operationsDenis Gopan, Thomas W. Reps, Shmuel Sagiv. 338-350 [doi]
- Scalable error detection using boolean satisfiabilityYichen Xie, Alexander Aiken. 351-363 [doi]
- Automated soundness proofs for dataflow analyses and transformations via local rulesSorin Lerner, Todd D. Millstein, Erika Rice, Craig Chambers. 364-377 [doi]
- The Java memory modelJeremy Manson, William Pugh, Sarita V. Adve. 378-391 [doi]