Foundations of Software Science and Computation Structures

1. Front Matter

   PDF

2. Invited Contributions

   1. Intruder Theories (Ongoing Work)

      • Hubert Comon-Lundh

      Pages 1-4

   2. Theories for the Global Ubiquitous Computer

      • Robin Milner

      Pages 5-11

3. Contributed Papers

   1. Choice in Dynamic Linking

      • Martín Abadi, Georges Gonthier, Benjamin Werner

      Pages 12-26

   2. Soft lambda-Calculus: A Language for Polynomial Time Computation

      • Patrick Baillot, Virgile Mogbil

      Pages 27-41

   3. On the Existence of an Effective and Complete Inference System for Cryptographic Protocols

      • Liana Bozga, Cristian Ene, Yassine Lakhnech

      Pages 42-57

   4. Hypergraphs and Degrees of Parallelism: A Completeness Result

      • Antonio Bucciarelli, Benjamin Leperchey

      Pages 58-71

   5. Behavioral and Spatial Observations in a Logic for the π-Calculus

      • Luís Caires

      Pages 72-89

   6. Election and Local Computations on Edges

      • Jérémie Chalopin, Yves Métivier

      Pages 90-104

   7. Decidability of Freshness, Undecidability of Revelation

      • Giovanni Conforti, Giorgio Ghelli

      Pages 105-120

   8. LTL over Integer Periodicity Constraints

      • Stéphane Demri

      Pages 121-135

   9. Unifying Recursive and Co-recursive Definitions in Sheaf Categories

      • Pietro Di Gianantonio, Marino Miculan

      Pages 136-150

   10. Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting

       • Hartmut Ehrig, Barbara König

       Pages 151-166

   11. A Denotational Account of Untyped Normalization by Evaluation

       • Andrzej Filinski, Henning Korsholm Rohde

       Pages 167-181

   12. On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds

       • Wan Fokkink, Sumit Nain

       Pages 182-194

   13. Specifying and Verifying Partial Order Properties Using Template MSCs

       • Blaise Genest, Marius Minea, Anca Muscholl, Doron Peled

       Pages 195-210

   14. Angelic Semantics of Fine-Grained Concurrency

       • Dan R. Ghica, Andrzej S. Murawski

       Pages 211-225

   15. On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi

       • Pablo Giambiagi, Gerardo Schneider, Frank D. Valencia

       Pages 226-240

   16. safeDpi: A Language for Controlling Mobile Code

       • Matthew Hennessy, Julian Rathke, Nobuko Yoshida

       Pages 241-256

   17. Distance Desert Automata and the Star Height One Problem

       • Daniel Kirsten

       Pages 257-272

ETAPS 2004 was the seventh instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ?ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), 23 satellite workshops, 1 tutorial, and 7 invited lectures (not including those that are speci?c to the satellite events). The events that comprise ETAPS address various aspects of the system - velopment process, including speci?cation, design, implementation, analysis and improvement. The languages, methodologies and tools that support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on the one hand and soundly based practice on the other. Many of the issues inv- ved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.

• Automat
• Bisimulation
• automata
• lambda calculus
• simulation
• structured analysis
• verification

• Université de Bordeaux-1, LaBRI, Talence cedex, France

  Igor Walukiewicz

Policies and ethics