Andrew D. Gordon
Proceedings of the Sixth International Conference on Foundations of Software Science and Computation Structures
FoSSaCS, 2003.

@proceedings{FoSSaCS-2003,
	address       = "Warsaw, Poland",
	editor        = "Andrew D. Gordon",
	isbn          = "3-540-00897-7",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Sixth International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 2620,
	year          = 2003,
}

Contents (27 items)

4 ×#probability
4 ×#verification
3 ×#calculus
3 ×#game studies
3 ×#higher-order
3 ×#multi
2 ×#abstraction
2 ×#protocol
2 ×#reasoning
2 ×#semantics

FoSSaCS-2003-AbramskyJ #game studies #morphism #polymorphism #semantics

A Game Semantics for Generic Polymorphism (SA, RJ), pp. 1–22.

FoSSaCS-2003-AbbottAG #category theory

Categories of Containers (MA, TA, NG), pp. 23–38.

FoSSaCS-2003-AbdullaR #communication #probability #verification

Verification of Probabilistic Systems with Faulty Communication (PAA, AMR), pp. 39–53.

FoSSaCS-2003-AbelMU #data type #higher-order

Generalized Iteration and Coiteration for Higher-Order Nested Datatypes (AA, RM, TU), pp. 54–69.

FoSSaCS-2003-ArnoldS #ambiguity #calculus #game studies #μ-calculus

Ambiguous Classes in the Games μ-Calculus Hierarchy (AA, LS), pp. 70–86.

FoSSaCS-2003-AronsPZ #abstraction #probability #verification

Parameterized Verification by Probabilistic Abstraction (TA, AP, LDZ), pp. 87–102.

FoSSaCS-2003-BergerHY #π-calculus

Genericity and the π-Calculus (MB, KH, NY), pp. 103–119.

FoSSaCS-2003-BertrandS #decidability #model checking

Model Checking Lossy Channels Systems Is Probably Decidable (NB, PS), pp. 120–135.

FoSSaCS-2003-BlanchetP #encryption #protocol #termination #verification

Verification of Cryptographic Protocols: Tagging Enforces Termination (BB, AP), pp. 136–152.

FoSSaCS-2003-Bonelli #calculus #higher-order #normalisation

A Normalisation Result for Higher-Order Calculi with Explicit Substitutions (EB), pp. 153–168.

FoSSaCS-2003-BonevaT

When Ambients Cannot Be Opened (IB, JMT), pp. 169–184.

FoSSaCS-2003-BournezCNM #parallel #polynomial

Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time (OB, FC, PJdN, JYM), pp. 185–199.

FoSSaCS-2003-BreugelMOW #approximate #probability #similarity

An Intrinsic Characterization of Approximate Probabilistic Bisimilarity (FvB, MWM, JO, JW), pp. 200–215.

FoSSaCS-2003-CardelliGG

Manipulating Trees with Hidden Labels (LC, PG, GG), pp. 216–232.

FoSSaCS-2003-Doberkat #probability

The Converse of a Stochastic Relation (EED), pp. 233–249.

FoSSaCS-2003-DunfieldP #call-by

Type Assignment for Intersections and Unions in Call-by-Value Languages (JD, FP), pp. 250–266.

FoSSaCS-2003-FokkinkP #protocol #revisited #verification

Cones and Foci for Protocol Verification Revisited (WF, JP), pp. 267–281.

FoSSaCS-2003-HennessyMR #behaviour #distributed #towards

Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems (MH, MM, JR), pp. 282–298.

FoSSaCS-2003-Kieronski #transitive

The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard (EK), pp. 299–312.

FoSSaCS-2003-Laird #continuation #game studies #semantics

A Game Semantics of Linearly Used Continuations (JL), pp. 313–327.

FoSSaCS-2003-Lugiez #automaton #constraints #multi #similarity

Counting and Equality Constraints for Multitree Automata (DL), pp. 328–342.

FoSSaCS-2003-Maier #composition

Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete (PM), pp. 343–357.

FoSSaCS-2003-MoggiF #metalanguage #monad #multi

A Monadic Multi-stage Metalanguage (EM, SF), pp. 358–374.

FoSSaCS-2003-MomiglianoA #higher-order #multi #syntax

Multi-level Meta-reasoning with Higher-Order Abstract Syntax (AM, SA), pp. 375–391.

FoSSaCS-2003-PowerT #abstraction #reasoning

Abstraction in Reasoning about Higraph-Based Systems (JP, KT), pp. 392–408.

FoSSaCS-2003-SassoneS #bisimulation

Deriving Bisimulation Congruences: 2-Categories Vs Precategories (VS, PS), pp. 409–424.

FoSSaCS-2003-SprengerD #calculus #induction #on the #proving #reasoning #μ-calculus

On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μ-Calculus (CS, MD), pp. 425–440.