7. FoSSaCS 2004: Barcelona, Spain (Part of ETAPS 2004)

Igor Walukiewicz (Ed.): Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings. Lecture Notes in Computer Science 2987 Springer 2004, ISBN 3-540-21298-1 BibTeX

@proceedings{DBLP:conf/fossacs/2004,
  editor    = {Igor Walukiewicz},
  title     = {Foundations of Software Science and Computation Structures, 7th
               International Conference, FOSSACS 2004, Held as Part of the Joint
               European Conferences on Theory and Practice of Software, ETAPS
               2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings},
  booktitle = {FoSSaCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2987},
  year      = {2004},
  isbn      = {3-540-21298-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Constributions

Hubert Comon-Lundh:
Intruder Theories (Ongoing Work). 1-4
Electronic Edition (link) BibTeX
Robin Milner:
Theories for the Global Ubiquitous Computer. 5-11
Electronic Edition (link) BibTeX

Constributed Papers

Martín Abadi, Georges Gonthier, Benjamin Werner:
Choice in Dynamic Linking. 12-26
Electronic Edition (link) BibTeX
Patrick Baillot, Virgile Mogbil:
Soft lambda-Calculus: A Language for Polynomial Time Computation. 27-41
Electronic Edition (link) BibTeX
Liana Bozga, Cristian Ene, Yassine Lakhnech:
On the Existence of an Effective and Complete Inference System for Cryptographic Protocols. 42-57
Electronic Edition (link) BibTeX
Antonio Bucciarelli, Benjamin Leperchey:
Hypergraphs and Degrees of Parallelism: A Completeness Result. 58-71
Electronic Edition (link) BibTeX
Luís Caires:
Behavioral and Spatial Observations in a Logic for the pi-Calculus. 72-89
Electronic Edition (link) BibTeX
Jérémie Chalopin, Yves Métivier:
Election and Local Computations on Edges. 90-104
Electronic Edition (link) BibTeX
Giovanni Conforti, Giorgio Ghelli:
Decidability of Freshness, Undecidability of Revelation. 105-120
Electronic Edition (link) BibTeX
Stéphane Demri:
LTL over Integer Periodicity Constraints: (Extended Abstract). 121-135
Electronic Edition (link) BibTeX
Pietro Di Gianantonio, Marino Miculan:
Unifying Recursive and Co-recursive Definitions in Sheaf Categories. 136-150
Electronic Edition (link) BibTeX
Hartmut Ehrig, Barbara König:
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting. 151-166
Electronic Edition (link) BibTeX
Andrzej Filinski, Henning Korsholm Rohde:
A Denotational Account of Untyped Normalization by Evaluation. 167-181
Electronic Edition (link) BibTeX
Wan Fokkink, Sumit Nain:
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds. 182-194
Electronic Edition (link) BibTeX
Blaise Genest, Marius Minea, Anca Muscholl, Doron Peled:
Specifying and Verifying Partial Order Properties Using Template MSCs. 195-210
Electronic Edition (link) BibTeX
Dan R. Ghica, Andrzej S. Murawski:
Angelic Semantics of Fine-Grained Concurrency. 211-225
Electronic Edition (link) BibTeX
Pablo Giambiagi, Gerardo Schneider, Frank D. Valencia:
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi. 226-240
Electronic Edition (link) BibTeX
Matthew Hennessy, Julian Rathke, Nobuko Yoshida:
safeDpi: A Language for Controlling Mobile Code. 241-256
Electronic Edition (link) BibTeX
Daniel Kirsten:
Distance Desert Automata and the Star Height One Problem. 257-272
Electronic Edition (link) BibTeX
Stephen Lack, Pawel Sobocinski:
Adhesive Categories. 273-288
Electronic Edition (link) BibTeX
James Laird:
A Game Semantics of Local Names and Good Variables. 289-303
Electronic Edition (link) BibTeX
Daniel Leivant:
Partial Correctness Assertions Provable in Dynamic Logics. 304-317
Electronic Edition (link) BibTeX
Salvador Lucas:
Polynomials for Proving Termination of Context-Sensitive Rewriting. 318-332
Electronic Edition (link) BibTeX
Gerald Lüttgen, Walter Vogler:
Bisimulation on Speed: Lower Time Bounds. 333-347
Electronic Edition (link) BibTeX
Oded Maler, Amir Pnueli:
On Recognizable Timed Languages. 348-362
Electronic Edition (link) BibTeX
Sebastian Maneth, Giorgio Busatto:
Tree Transducers and Tree Compressions. 363-377
Electronic Edition (link) BibTeX
Antoine Meyer:
On Term Rewriting Systems Having a Rational Derivation. 378-392
Electronic Edition (link) BibTeX
Michael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell:
Duality for Labelled Markov Processes. 393-407
Electronic Edition (link) BibTeX
Iain Phillips, Maria Grazia Vigliotti:
Electoral Systems in Ambient Calculi. 408-422
Electronic Edition (link) BibTeX
Emmanuel Polonovski:
Strong Normalization of lambda-mu-mu/tilde-Calculus with Explicit Substitutions. 423-437
Electronic Edition (link) BibTeX
John Power:
Canonical Models for Computational Effects. 438-452
Electronic Edition (link) BibTeX
Riccardo Pucella, Vicky Weissman:
Reasoning about Dynamic Policies. 453-467
Electronic Edition (link) BibTeX
Ajith Ramanathan, John C. Mitchell, Andre Scedrov, Vanessa Teague:
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols. 468-483
Electronic Edition (link) BibTeX
Lucian Wischik, Philippa Gardner:
Strong Bisimulation for the Explicit Fusion Calculus. 484-498
Electronic Edition (link) BibTeX
Wieslaw Zielonka:
Perfect-Information Stochastic Parity Games. 499-513
Electronic Edition (link) BibTeX
Roberto Zunino, Pierpaolo Degano:
A Note on the Perfect Encryption Assumption in a Process Calculus. 514-528
Electronic Edition (link) BibTeX