The SCEAS System
Navigation Menu

Conferences in DBLP

Foundations of Software Science and Computation Structure (FoSSaCS) (fossacs)
2003 (conf/fossacs/2003)

  1. Samson Abramsky, Radha Jagadeesan
    A Game Semantics for Generic Polymorphism. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:1-22 [Conf]
  2. Michael Abbott, Thorsten Altenkirch, Neil Ghani
    Categories of Containers. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:23-38 [Conf]
  3. Parosh Aziz Abdulla, Alexander Moshe Rabinovich
    Verification of Probabilistic Systems with Faulty Communication. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:39-53 [Conf]
  4. Andreas Abel, Ralph Matthes, Tarmo Uustalu
    Generalized Iteration and Coiteration for Higher-Order Nested Datatypes. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:54-69 [Conf]
  5. André Arnold, Luigi Santocanale
    Ambiguous Classes in the Games µ-Calculus Hierarchy. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:70-86 [Conf]
  6. Tamarah Arons, Amir Pnueli, Lenore D. Zuck
    Parameterized Verification by Probabilistic Abstraction. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:87-102 [Conf]
  7. Martin Berger, Kohei Honda, Nobuko Yoshida
    Genericity and the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:103-119 [Conf]
  8. Nathalie Bertrand, Ph. Schnoebelen
    Model Checking Lossy Channels Systems Is Probably Decidable. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:120-135 [Conf]
  9. Bruno Blanchet, Andreas Podelski
    Verification of Cryptographic Protocols: Tagging Enforces Termination. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:136-152 [Conf]
  10. Eduardo Bonelli
    A Normalisation Result for Higher-Order Calculi with Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:153-168 [Conf]
  11. Iovka Boneva, Jean-Marc Talbot
    When Ambients Cannot Be Opened. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:169-184 [Conf]
  12. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
    Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:185-199 [Conf]
  13. Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell
    An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:200-215 [Conf]
  14. Luca Cardelli, Philippa Gardner, Giorgio Ghelli
    Manipulating Trees with Hidden Labels. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:216-232 [Conf]
  15. Ernst-Erich Doberkat
    The Converse of a Stochastic Relation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:233-249 [Conf]
  16. Joshua Dunfield, Frank Pfenning
    Type Assignment for Intersections and Unions in Call-by-Value Languages. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:250-266 [Conf]
  17. Wan Fokkink, Jun Pang
    Cones and Foci for Protocol Verification Revisited. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:267-281 [Conf]
  18. Matthew Hennessy, Massimo Merro, Julian Rathke
    Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:282-298 [Conf]
  19. Emanuel Kieronski
    The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:299-312 [Conf]
  20. James Laird
    A Game Semantics of Linearly Used Continuations. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:313-327 [Conf]
  21. Denis Lugiez
    Counting and Equality Constraints for Multitree Automata. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:328-342 [Conf]
  22. Patrick Maier
    Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:343-357 [Conf]
  23. Eugenio Moggi, Sonia Fagorzi
    A Monadic Multi-stage Metalanguage. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:358-374 [Conf]
  24. Alberto Momigliano, Simon Ambler
    Multi-level Meta-reasoning with Higher-Order Abstract Syntax. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:375-391 [Conf]
  25. John Power, Konstantinos Tourlas
    Abstraction in Reasoning about Higraph-Based Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:392-408 [Conf]
  26. Vladimiro Sassone, Pawel Sobocinski
    Deriving Bisimulation Congruences: 2-Categories Vs Precategories. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:409-424 [Conf]
  27. Christoph Sprenger, Mads Dam
    On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:425-440 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002