FoSSaCS B

28 papers

YearTitle / Authors
2003A Game Semantics for Generic Polymorphism.
Samson Abramsky, Radha Jagadeesan
2003A Game Semantics of Linearly Used Continuations.
James Laird
2003A Monadic Multi-stage Metalanguage.
Eugenio Moggi, Sonia Fagorzi
2003A Normalisation Result for Higher-Order Calculi with Explicit Substitutions.
Eduardo Bonelli
2003Abstraction in Reasoning about Higraph-Based Systems.
John Power, Konstantinos Tourlas
2003Ambiguous Classes in the Games µ-Calculus Hierarchy.
André Arnold, Luigi Santocanale
2003An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.
Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell
2003Categories of Containers.
Michael Gordon Abbott, Thorsten Altenkirch, Neil Ghani
2003Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete.
Patrick Maier
2003Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2003Cones and Foci for Protocol Verification Revisited.
Wan J. Fokkink, Jun Pang
2003Counting and Equality Constraints for Multitree Automata.
Denis Lugiez
2003Deriving Bisimulation Congruences: 2-Categories Vs Precategories.
Vladimiro Sassone, Pawel Sobocinski
2003Foundations of Software Science and Computational Structures, 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings
Andrew D. Gordon
2003Generalized Iteration and Coiteration for Higher-Order Nested Datatypes.
Andreas Abel, Ralph Matthes, Tarmo Uustalu
2003Genericity and the pi-Calculus.
Martin Berger, Kohei Honda, Nobuko Yoshida
2003Manipulating Trees with Hidden Labels.
Luca Cardelli, Philippa Gardner, Giorgio Ghelli
2003Model Checking Lossy Channels Systems Is Probably Decidable.
Nathalie Bertrand, Philippe Schnoebelen
2003Multi-level Meta-reasoning with Higher-Order Abstract Syntax.
Alberto Momigliano, Simon Ambler
2003On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus.
Christoph Sprenger, Mads Dam
2003Parameterized Verification by Probabilistic Abstraction.
Tamarah Arons, Amir Pnueli, Lenore D. Zuck
2003The Converse of a Stochastic Relation.
Ernst-Erich Doberkat
2003The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard.
Emanuel Kieronski
2003Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems.
Matthew Hennessy, Massimo Merro, Julian Rathke
2003Type Assignment for Intersections and Unions in Call-by-Value Languages.
Jana Dunfield, Frank Pfenning
2003Verification of Cryptographic Protocols: Tagging Enforces Termination.
Bruno Blanchet, Andreas Podelski
2003Verification of Probabilistic Systems with Faulty Communication.
Parosh Aziz Abdulla, Alexander Moshe Rabinovich
2003When Ambients Cannot Be Opened.
Iovka Boneva, Jean-Marc Talbot