10. ESOP 2001: Genova, Italy (Part of ETAPS 2001)

• Luca Cardelli, Giorgio Ghelli:
  A Query Language Based on the Ambient Logic. 1-22
  
• John C. Mitchell:
  Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis. 23-29
  
• François Pottier, Christian Skalka, Scott F. Smith:
  A Systematic Approach to Static Access Control. 30-45
  
• Steve Zdancewic, Andrew C. Myers:
  Secure Information Flow and CPS. 46-61
  
• Peter Thiemann:
  Enforcing Safety Properties Using Type Specialization. 62-76
  
• Peeter Laud:
  Semantics and Program Analysis of Computationally Secure Information Flow. 77-91
  
• Stephanie Weirich:
  Encoding Intensional Type Analysis. 92-106
  
• Roland Carl Backhouse:
  Fusion on Languages. 107-121
  
• Paul T. Graunke, Shriram Krishnamurthi, Steve Van Der Hoeven, Matthias Felleisen:
  Programming the Web with High-Level Programming Languages. 122-136
  
• Francesco Ranzato:
  On the Completeness of Model Checking. 137-154
  
• Michael Huth, Radha Jagadeesan, David A. Schmidt:
  Modal Transition Systems: A Foundation for Three-Valued Program Analysis. 155-169
  
• Zhendong Su, Alexander Aiken:
  Entailment with Conditional Equality Constraints. 170-189
  
• Markus Müller-Olm, Oliver Rüthing:
  On the Complexity of Constant Propagation. 190-205
  
• Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen:
  What Are Polymorphically-Typed Ambients? 206-220
  
• Sylvain Conchon, François Pottier:
  JOIN(X): Constraint-Based Type Inference for the Join-Calculus. 221-236
  
• Pascal Cuoq, Marc Pouzet:
  Modular Causality in a Synchronous Stream Language. 237-251
  
• Flemming Nielson, Helmut Seidl:
  Control-Flow Analysis in Cubic Time. 252-268
  
• Gérard Boudol:
  The Recursive Record Semantics of Objects Revisited. 269-283
  
• Bart Jacobs:
  A Formalisation of Java's Exception Mechanism. 284-301
  
• Gilles Barthe, Guillaume Dufay, Line Jakubiec, Bernard P. Serpette, Simão Melo de Sousa:
  A Formal Executable Semantics of the JavaCard Platform. 302-319
  
• John Clements, Matthew Flatt, Matthias Felleisen:
  Modeling an Algebraic Stepper. 320-334
  
• Zhichen Xu, Thomas W. Reps, Barton P. Miller:
  Typestate Checking of Machine Code. 335-351
  
• Shin-ya Katsumata, Atsushi Ohori:
  Proof-Directed De-compilation of Low-Level Code. 352-366
  
• David Monniaux:
  Backwards Abstract Interpretation of Probabilistic Programs. 367-382
  
• Raghavan Komondoor, Susan Horwitz:
  Tool Demonstration: Finding Duplicated Code Using Program Dependences. 383-386
  
• Marco Cadoli, Andrea Schaerf:
  Compiling Problem Specifications into SAT. 387-401
  
• Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus:
  Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. 402-416
  
• Samir Genaim, Michael Codish:
  The Def-inite Approach to Dependency Analysis. 417-432