12. ESOP 2003: Warsaw, Poland (Part of ETAPS 2003)

Invited Talks

• Xavier Leroy:
  Computer Security from a Programming Language and Static Analysis Perspective. 1-9
  
• Catherine Meadows:
  What Makes a Cryptographic Protocol Secure? The Evolution of Requirements Specification in Formal Cryptographic Protocol Analysis. 10-21
  

Contributed Papers

• John Clements, Matthias Felleisen:
  A Tail-Recursive Semantics for Stack Inspections. 22-37
  
• Sophia Drossopoulou, Giovanni Lagorio, Susan Eisenbach:
  Flexible Models for Dynamic Linking. 38-53
  
• María Alpuente, Demis Ballis, Francisco J. Correa, Moreno Falaschi:
  Correction of Functional Logic Programs. 54-68
  
• Luís Fernando Castro, David Scott Warren:
  Approximate Pruning in Tabled Logic Programming. 69-83
  
• Samir Genaim, Andy King:
  Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. 84-98
  
• Hubert Comon-Lundh, Véronique Cortier:
  Security Properties: Two Agents Are Sufficient. 99-113
  
• Roberto Gorrieri, Enrico Locatelli, Fabio Martinelli:
  A Simple Language for Real-Time Cryptographic Protocol Analysis. 114-128
  
• Simone Tini:
  Rule Formats for Non Interference. 129-143
  
• Pablo Giambiagi, Mads Dam:
  On the Secure Implementation of Security Protocols. 144-158
  
• Peeter Laud:
  Handling Encryption in an Analysis for Secure Information Flow. 159-173
  
• Karine Altisen, Aurélie Clodic, Florence Maraninchi, Éric Rutten:
  Using Controller-Synthesis Techniques to Build Property-Enforcing Layers. 174-188
  
• Cormac Flanagan:
  Automatic Software Model Checking Using CLP. 189-203
  
• Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm:
  Verifying Temporal Heap Properties Specified via Evolution Logic. 204-222
  
• Uday S. Reddy, Hongseok Yang:
  Correctness of Data Representations Involving Heap Data Structures. 223-237
  
• Paul T. Graunke, Robert Bruce Findler, Shriram Krishnamurthi, Matthias Felleisen:
  Modeling Web Interactions. 238-252
  
• Cédric Lhoussaine:
  Type Inference for a Distributed pi-Calculus. 253-268
  
• Martin Erwig, Deling Ren:
  Programming Type-Safe Program Updates. 269-283
  
• Christian Haack, J. B. Wells:
  Type Error Slicing in Implicitly Typed Higher-Order Languages. 284-301
  
• Vincent Danos, Cosimo Laneve:
  Core Formal Molecular Biology. 302-318
  
• Marc Geilen, Twan Basten:
  Requirements on the Execution of Kahn Process Networks. 319-334
  
• Olivier Danvy, Pablo E. Martínez López:
  Tagging, Encoding, and Jones Optimality. 335-347
  
• Leonor Prensa Nieto:
  The Rely-Guarantee Method in Isabelle/HOL. 348-362
  
• Dachuan Yu, Nadeem Abdul Hamid, Zhong Shao:
  Building Certified Libraries for PCC: Dynamic Storage Allocation. 363-379
  
• Thomas W. Reps, Shmuel Sagiv, Alexey Loginov:
  Finite Differencing of Logical Formulas for Static Analysis. 380-398
  
• Atsushi Ohori:
  Register Allocation by Proof Transformation. 399-413