3. FoSSaCS 2000: Berlin, Germany (Part of ETAPS 2000)

@proceedings{DBLP:conf/fossacs/2000,
  editor    = {Jerzy Tiuryn},
  title     = {Foundations of Software Science and Computation Structures, Third
               International Conference, FOSSACS 2000, Held as Part of the Joint
               European Conferences on Theory and Practice of Software,ETAPS
               2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings},
  booktitle = {FoSSaCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1784},
  year      = {2000},
  isbn      = {3-540-67257-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Christel Baier, Mariëlle Stoelinga:
  Norm Functions for Probabilistic Bisimulations with Delays. 1-16
  
• Gilles Barthe, Femke van Raamsdonk:
  Constructor Subtyping in the Calculus of Inductive Constructions. 17-34
  
• Béatrice Bérard, Anne Labroue, Ph. Schnoebelen:
  Verifying Performance Equivalence for Timed Basic Parallel Processes. 35-47
  
• Didier Caucal:
  On Word Rewriting Systems Having a Rational Derivation. 48-62
  
• Roberto Di Cosmo, Delia Kesner, Emmanuel Polonowski:
  Proof Nets and Explicit Substitutions. 63-81
  
• Ferruccio Damiani:
  Typing Local Definitions and Conditional Expressions with Rank 2 Intersection. 82-97
  
• Frank Drewes, Berthold Hoffmann, Detlef Plump:
  Hierarchical Graph Transformation. 98-113
  
• Kai Engelhardt, Ron van der Meyden, Yoram Moses:
  A Program Refinement Framework Supporting Reasoning about Knowledge and Time. 114-129
  
• Jo Erskine Hannay:
  A Higher-Order Simulation Relation for System F. 130-145
  
• Oltea Mihaela Herescu, Catuscia Palamidessi:
  Probabilistic Asynchronous pi-Calculus. 146-160
  
• Furio Honsell, John Longley, Donald Sannella, Andrzej Tarlecki:
  Constructive Data Refinement in Typed Lambda Calculus. 161-176
  
• Jean-François Husson, Rémi Morin:
  On Recognizable Stable Trace Languages. 177-191
  
• François Laroussinie, Ph. Schnoebelen:
  The State Explosion Problem from Trace to Bisimulation Equivalence. 192-207
  
• Huimin Lin, Wang Yi:
  A Proof System for Timed Automata. 208-222
  
• Maria Emilia Maietti, Valeria de Paiva, Eike Ritter:
  Categorical Models for Intuitionistic and Linear Type Theory. 223-237
  
• Massimo Merro:
  Locality and Polyadicity in Asynchronous Name-Passing Calculi. 238-251
  
• Christophe Morvan:
  On Rational Graphs. 252-266
  
• Jorge Sousa Pinto:
  Sequential and Concurrent Abstract Machines for Interaction Nets. 267-282
  
• Paola Quaglia, David Walker:
  On Synchronous and Asynchronous Mobile Processes. 283-296
  
• Aleksy Schubert:
  Type Inference for First-Order Logic. 297-313
  
• Peter Thiemann:
  An Algebraic Foundation for Adaptive Programming. 314-328
  
• Ralf Treinen:
  Predicate Logic and Tree Automata with Tests. 329-343
  
• Yih-Kuen Tsay:
  Compositional Verification in Linear-Time Temporal Logic. 344-358
  
• Hongseok Yang, Uday S. Reddy:
  On the Semantics of Refinement Calculi. 359-374
  
• Pascal Zimmer:
  Subtyping and Typing Algorithms for Mobile Ambients. 375-390