Foundations of Software Science and Computation Structures

6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003 Proceedings

  • Andrew D. Gordon
Conference proceedings FoSSaCS 2003

DOI: 10.1007/3-540-36576-1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2620)

Table of contents (27 papers)

  1. Front Matter
    Pages I-XII
  2. Invited Paper

    1. A Game Semantics for Generic Polymorphism
      Samson Abramsky, Radha Jagadeesan
      Pages 1-22
  3. Contributed Papers

    1. Categories of Containers
      Michael Abbott, Thorsten Altenkirch, Neil Ghani
      Pages 23-38
    2. Verification of Probabilistic Systems with Faulty Communication
      Parosh Aziz Abdulla, Alexander Rabinovich
      Pages 39-53
    3. Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
      Andreas Abel, Ralph Matthes, Tarmo Uustalu
      Pages 54-69
    4. Ambiguous Classes in the Games μ-Calculus Hierarchy
      André Arnold, Luigi Santocanale
      Pages 70-86
    5. Parameterized Verification by Probabilistic Abstraction
      Amir Pnueli, Lenore Zuck
      Pages 87-102
    6. Genericity and the π-Calculus
      Martin Berger, Kohei Honda, Nobuko Yoshida
      Pages 103-119
    7. Model Checking Lossy Channels Systems Is Probably Decidable
      Nathalie Bertrand, Philippe Schnoebelen
      Pages 120-135
    8. Verification of Cryptographic Protocols: Tagging Enforces Termination
      Bruno Blanchet, Andreas Podelski
      Pages 136-152
    9. When Ambients Cannot Be Opened
      Iovka Boneva, Jean-Marc Talbot
      Pages 169-184
    10. Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
      Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
      Pages 185-199
    11. An Intrinsic Characterization of Approximate Probabilistic Bisimilarity
      Franck van Breugel, Michael Mislove, Joël Ouaknine, James Worrell
      Pages 200-215
    12. Manipulating Trees with Hidden Labels
      Luca Cardelli, Philippa Gardner, Giorgio Ghelli
      Pages 216-230
    13. The Converse of a Stochastic Relation
      Ernst-Erich Doberkat
      Pages 233-249
    14. Type Assignment for Intersections and Unions in Call-by-Value Languages
      Joshua Dunfield, Frank Pfenning
      Pages 250-266
    15. Cones and Foci for Protocol Verification Revisited
      Wan Fokkink, Jun Pang
      Pages 267-281
    16. Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems
      Matthew Hennessy, Massimo Merro, Julian Rathke
      Pages 282-298

About these proceedings

Keywords

Automat automata computational structures formal methods formal verification logical foundations mathematical foundations model checking program analysis program logics programming theory software engineering software science

Editors and affiliations

  • Andrew D. Gordon
    • 1
  1. 1.Microsoft ResearchCambridgeUK

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-00897-2
  • Online ISBN 978-3-540-36576-1
  • Series Print ISSN 0302-9743