4. FoSSaCS 2001: Genova, Italy (Part of ETAPS 2001)

@proceedings{DBLP:conf/fossacs/2001,
  editor    = {Furio Honsell and
               Marino Miculan},
  title     = {Foundations of Software Science and Computation Structures, 4th
               International Conference, FOSSACS 2001 Held as Part of the Joint
               European Conferences on Theory and Practice of Software, ETAPS
               2001 Genova, Italy, April 2-6, 2001, Proceedings},
  booktitle = {FoSSaCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2030},
  year      = {2001},
  isbn      = {3-540-41864-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Paper

• Gordon D. Plotkin, John Power:
  Adequacy for Algebraic Effects. 1-24
  Electronic Edition (Springer LINK) BibTeX

Contributed Papers

• Martín Abadi, Bruno Blanchet:
  Secrecy Types for Asymmetric Communication. 25-41
  Electronic Edition (Springer LINK) BibTeX
• Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
  Axiomatizing Tropical Semirings. 42-56
  Electronic Edition (Springer LINK) BibTeX
• Gilles Barthe, Olivier Pons:
  Type Isomorphisms and Proof Reuse in Dependent Type Theory. 57-71
  Electronic Edition (Springer LINK) BibTeX
• Michel Bidoit, Rolf Hennicker, Alexander Kurz:
  On the Duality between Observability and Reachability. 72-87
  Electronic Edition (Springer LINK) BibTeX
• Mikolaj Bojanczyk:
  The Finite Graph Problem for Two-Way Alternating Automata. 88-103
  Electronic Edition (Springer LINK) BibTeX
• Maria Grazia Buscemi, Vladimiro Sassone:
  High-Level Petri Nets as Type Theories in the Join Calculus. 104-120
  Electronic Edition (Springer LINK) BibTeX
• Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro:
  Temporary Data in Shared Dataspace Coordination Languages. 121-136
  Electronic Edition (Springer LINK) BibTeX
• Cristiano Calcagno, Peter W. O'Hearn:
  On Garbage and Program Logic. 137-151
  Electronic Edition (Springer LINK) BibTeX
• Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot:
  The Complexity of Model Checking Mobile Ambients. 152-167
  Electronic Edition (Springer LINK) BibTeX
• Horatiu Cirstea, Claude Kirchner, Luigi Liquori:
  The Rho Cube. 168-183
  Electronic Edition (Springer LINK) BibTeX
• Mario Coppo:
  Type Inference with Recursive Type Equations. 184-198
  Electronic Edition (Springer LINK) BibTeX
• Irène Durand, Aart Middeldorp:
  On the Modularity of Deciding Call-by-Need. 199-213
  Electronic Edition (Springer LINK) BibTeX
• Valérie Gouranton, Pierre Réty, Helmut Seidl:
  Synchronized Tree Languages Revisited and New Applications. 214-229
  Electronic Edition (Springer LINK) BibTeX
• Annegret Habel, Detlef Plump:
  Computational Completeness of Programming Languages Based on Graph Transformation. 230-245
  Electronic Edition (Springer LINK) BibTeX
• Masahito Hasegawa, Yoshihiko Kakutani:
  Axioms for Recursion in Call-by-Value. 246-260
  Electronic Edition (Springer LINK) BibTeX
• Thomas P. Jensen, Fausto Spoto:
  Class Analysis of Object-Oriented Programs through Abstract Interpretation. 261-275
  Electronic Edition (Springer LINK) BibTeX
• Valerie King, Orna Kupferman, Moshe Y. Vardi:
  On the Complexity of Parity Word Automata. 276-286
  Electronic Edition (Springer LINK) BibTeX
• Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce:
  Foundations for a Graph-Based Approach to the Specification of Access Control Policies. 287-302
  Electronic Edition (Springer LINK) BibTeX
• Sava Krstic, John Launchbury, Dusko Pavlovic:
  Categories of Processes Enriched in Final Coalgebras. 303-317
  Electronic Edition (Springer LINK) BibTeX
• François Laroussinie, Nicolas Markey, Ph. Schnoebelen:
  Model Checking CTL⁺ and FCTL is Hard. 318-331
  Electronic Edition (Springer LINK) BibTeX
• Rémi Morin:
  On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. 332-346
  Electronic Edition (Springer LINK) BibTeX
• Tobias Nipkow:
  Verified Bytecode Verifiers. 347-363
  Electronic Edition (Springer LINK) BibTeX
• Christine Röckl, Daniel Hirschkoff, Stefan Berghofer:
  Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts. 364-378
  Electronic Edition (Springer LINK) BibTeX
• Colin Stirling:
  Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. 379-393
  Electronic Edition (Springer LINK) BibTeX
• Simone Tini:
  An Axiomatic Semantics for the Synchronous Language Gentzen. 394-409
  Electronic Edition (Springer LINK) BibTeX

Tool Presentation

• Dominique Ambroise, Patrick Augé, Kamel Bouchefra, Brigitte Rozoy:
  MARRELLA and the Verification of an Embedded System. 409-412
  Electronic Edition (Springer LINK) BibTeX