Igor Walukiewicz
Proceedings of the Seventh International Conference on Foundations of Software Science and Computation Structures
FoSSaCS, 2004.

@proceedings{FoSSaCS-2004,
	address       = "Barcelona, Spain",
	editor        = "Igor Walukiewicz",
	isbn          = "3-540-21298-1",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Seventh International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 2987,
	year          = 2004,
}

Contents (36 items)

5 ×#calculus
5 ×#on the
4 ×#bisimulation
3 ×#process
2 ×#behaviour
2 ×#category theory
2 ×#encryption
2 ×#game studies
2 ×#infinity
2 ×#logic

FoSSaCS-2004-Comon-Lundh

Intruder Theories (Ongoing Work) (HCL), pp. 1–4.

FoSSaCS-2004-Milner #ubiquitous

Theories for the Global Ubiquitous Computer (RM), pp. 5–11.

FoSSaCS-2004-AbadiGW

Choice in Dynamic Linking (MA, GG, BW), pp. 12–26.

FoSSaCS-2004-BaillotM #polynomial #λ-calculus

Soft λ-Calculus: A Language for Polynomial Time Computation (PB, VM), pp. 27–41.

FoSSaCS-2004-BozgaEL #effectiveness #encryption #on the #protocol

On the Existence of an Effective and Complete Inference System for Cryptographic Protocols (LB, CE, YL), pp. 42–57.

FoSSaCS-2004-BucciarelliL #parallel

Hypergraphs and Degrees of Parallelism: A Completeness Result (AB, BL), pp. 58–71.

FoSSaCS-2004-Caires #behaviour #logic #π-calculus

Behavioral and Spatial Observations in a Logic for the π-Calculus (LC), pp. 72–89.

FoSSaCS-2004-ChalopinM

Election and Local Computations on Edges (JC, YM), pp. 90–104.

FoSSaCS-2004-ConfortiG #decidability

Decidability of Freshness, Undecidability of Revelation (GC, GG), pp. 105–120.

FoSSaCS-2004-Demri #constraints #integer #ltl

LTL over Integer Periodicity Constraints: (SD), pp. 121–135.

FoSSaCS-2004-GianantonioM #category theory #recursion

Unifying Recursive and Co-recursive Definitions in Sheaf Categories (PDG, MM), pp. 136–150.

FoSSaCS-2004-EhrigK #approach #bisimulation #graph grammar

Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting (HE, BK), pp. 151–166.

FoSSaCS-2004-FilinskiR #evaluation #normalisation

A Denotational Account of Untyped Normalization by Evaluation (AF, HKR), pp. 167–181.

FoSSaCS-2004-FokkinkN #finite #infinity #on the

On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds (WF, SN), pp. 182–194.

FoSSaCS-2004-GenestMMP #partial order #specification #using #verification

Specifying and Verifying Partial Order Properties Using Template MSCs (BG, MM, AM, DP), pp. 195–210.

FoSSaCS-2004-GhicaM #concurrent #fine-grained #semantics

Angelic Semantics of Fine-Grained Concurrency (DRG, ASM), pp. 211–225.

FoSSaCS-2004-GiambiagiSV #behaviour #calculus #infinity #on the #process

On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi (PG, GS, FDV), pp. 226–240.

FoSSaCS-2004-HennessyRY #mobile #named

safeDpi: A Language for Controlling Mobile Code (MH, JR, NY), pp. 241–256.

FoSSaCS-2004-Kirsten #automaton #distance #problem

Distance Desert Automata and the Star Height One Problem (DK), pp. 257–272.

FoSSaCS-2004-LackS #category theory

Adhesive Categories (SL, PS), pp. 273–288.

FoSSaCS-2004-Laird #game studies #semantics

A Game Semantics of Local Names and Good Variables (JL), pp. 289–303.

FoSSaCS-2004-Leivant #correctness #logic

Partial Correctness Assertions Provable in Dynamic Logics (DL), pp. 304–317.

FoSSaCS-2004-Lucas #proving #termination

Polynomials for Proving Termination of Context-Sensitive Rewriting (SL), pp. 318–332.

FoSSaCS-2004-LuttgenV #bisimulation #bound

Bisimulation on Speed: Lower Time Bounds (GL, WV), pp. 333–347.

FoSSaCS-2004-MalerP #on the

On Recognizable Timed Languages (OM, AP), pp. 348–362.

FoSSaCS-2004-ManethB #transducer

Tree Transducers and Tree Compressions (SM, GB), pp. 363–377.

FoSSaCS-2004-Meyer #on the #term rewriting

On Term Rewriting Systems Having a Rational Derivation (AM), pp. 378–392.

FoSSaCS-2004-MisloveOPW #markov #process

Duality for Labelled Markov Processes (MWM, JO, DP, JW), pp. 393–407.

FoSSaCS-2004-PhillipsV #calculus

Electoral Systems in Ambient Calculi (IP, MGV), pp. 408–422.

FoSSaCS-2004-Polonovski #calculus #normalisation #μ-calculus

Strong Normalization of λμμ-Calculus with Explicit Substitutions (EP), pp. 423–437.

FoSSaCS-2004-Power #canonical #modelling

Canonical Models for Computational Effects (JP), pp. 438–452.

FoSSaCS-2004-PucellaW #policy #reasoning

Reasoning about Dynamic Policies (RP, VW), pp. 453–467.

FoSSaCS-2004-RamanathanMST #analysis #bisimulation #equivalence #network #probability #protocol #security

Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols (AR, JCM, AS, VT), pp. 468–483.

FoSSaCS-2004-WischikG #bisimulation #calculus

Strong Bisimulation for the Explicit Fusion Calculus (LW, PG), pp. 484–498.

FoSSaCS-2004-Zielonka #game studies #probability

Perfect-Information Stochastic Parity Games (WZ), pp. 499–513.

FoSSaCS-2004-ZuninoD #calculus #encryption #process

A Note on the Perfect Encryption Assumption in a Process Calculus (RZ, PD), pp. 514–528.