Lecture Notes in Computer Science 3921 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos New York University, NY, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany
Luca Aceto Anna Ingólfsdóttir (Eds.) Foundations of Software Science and Computation Structures 9th International Conference, FOSSACS 2006 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006 Vienna, Austria, March 25-31, 2006 Proceedings 13
Volume Editors Luca Aceto Anna Ingólfsdóttir Reykjavík University, Department of Computer Science Ofanleiti 2, 103 Reykjavík, Iceland E-mail:{luca,annai}@ru.is Library of Congress Control Number: 2006922023 CR Subject Classification (1998): F.3, F.4.2, F.1.1, D.3.3-4, D.2.1 LNCS Sublibrary: SL 2 Programming and Software Engineering ISSN 0302-9743 ISBN-10 3-540-33045-3 Springer Berlin Heidelberg New York ISBN-13 978-3-540-33045-5 Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com Springer-Verlag Berlin Heidelberg 2006 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 11690634 06/3142 543210
Foreword ETAPS 2006 was the ninth 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 five conferences (CC, ESOP, FASE, FOSSACS, TACAS), 18 satellite workshops (AC- CAT, AVIS, CMCS, COCV, DCC, EAAI, FESCA, FRCSS, GT-VMT, LDTA, MBT, QAPL, SC, SLAP, SPIN, TERMGRAPH, WITS and WRLA), two tutorials, and seven invited lectures (not including those that were specific to the satellite events). We received over 550 submissions to the five conferences this year, giving an overall acceptance rate of 23%, with acceptance rates below 30% for each conference. Congratulations to all the authors who made it to the final programme! I hope that most of the other authors still found a way of participating in this exciting event and I hope you will continue submitting. The events that comprise ETAPS address various aspects of the system development process, including specification, design, implementation, analysis and improvement. The languages, methodologies and tools which support these activities are all well within its scope. Different 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 involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive. ETAPS is a loose confederation in which each event retains its own identity, with a separate Program Committee and proceedings. Its format is open-ended, allowing it to grow and evolve as time goes by. Contributed talks and system demonstrations are in synchronized parallel sessions, with invited lectures in plenary sessions. Two of the invited lectures are reserved for unifying talks on topics of interest to the whole range of ETAPS attendees. The aim of cramming all this activity into a single one-week meeting is to create a strong magnet for academic and industrial researchers working on topics within its scope, giving them the opportunity to learn about research in related areas, and thereby to foster new and existing links between work in areas that were formerly addressed in separate meetings. ETAPS 2006 was organized by the Vienna University of Technology, in cooperation with: - European Association for Theoretical Computer Science (EATCS); - European Association for Programming Languages and Systems (EAPLS); - European Association of Software Science and Technology (EASST); - Institute for Computer Languages, Vienna; - Austrian Computing Society; -TheBürgermeister der Bundeshauptstadt Wien; - Vienna Convention Bureau; -Intel.
VI Foreword The organizing team comprised: Chair: Local Arrangements: Publicity: Satellite Events: Industrial Liaison: Liaison with City of Vienna: Tutorials Chair, Website: Website: Local Organization, Workshops Proceedings: Jens Knoop Anton Ertl Joost-Pieter Katoen Andreas Krall Eva Kühn Ulrich Neumerkel Franz Puntigam Fabian Schmied Markus Schordan Overall planning for ETAPS conferences is the responsibility of its Steering Committee, whose current membership is: Perdita Stevens (Edinburgh,Chair), Luca Aceto (Aalborg and Reykjavík), Rastislav Bodík (Berkeley), Maura Cerioli (Genova), Matt Dwyer (Nebraska), Hartmut Ehrig (Berlin), José Fiadeiro (Leicester), Marie-Claude Gaudel (Paris), Roberto Gorrieri (Bologna), Reiko Heckel (Leicester), Michael Huth (London), Joost-Pieter Katoen (Aachen), Paul Klint (Amsterdam), Jens Knoop (Vienna), Shriram Krishnamurthi (Brown), Kim Larsen (Aalborg), Tiziana Margaria (Göttingen), Ugo Montanari (Pisa), Rocco de Nicola (Florence), Hanne Riis Nielson (Copenhagen), Jens Palsberg (UCLA), Mooly Sagiv (Tel-Aviv), João Saraiva (Minho), Don Sannella (Edinburgh), Vladimiro Sassone (Southampton), Helmut Seidl (Munich), Peter Sestoft (Copenhagen), Andreas Zeller (Saarbrücken). I would like to express my sincere gratitude to all of these people and organizations, the Program Committee chairs and PC members of the ETAPS conferences, the organizers of the satellite events, the speakers themselves, the many reviewers, and Springer for agreeing to publish the ETAPS proceedings. Finally, I would like to thank the Organizing Chair of ETAPS 2006, Jens Knoop, for arranging for us to have ETAPS in the beautiful city of Vienna. Edinburgh January 2006 Perdita Stevens ETAPS Steering Committee Chair
Preface This volume collects the proceedings of Foundations of Software Science and Computation Structures, FOSSACS 2006. FOSSACS is a member conference of ETAPS, the European Joint Conferences on Theory and Practice of Software, dedicated to foundational research for software science. It invites submissions on theories and methods to underpin the analysis, integration, synthesis, transformation, and verification of programs and software systems. Topics covered usually include: algebraic models; automata and language theory; behavioral equivalences; categorical models; computation processes over discrete and continuous data; computation structures; logics of programs; modal, spatial, and temporal logics; models of concurrent, reactive, distributed, and mobile systems; models of security and trust; language-based security; process algebras and calculi; semantics of programming languages; software specification and refinement; type systems and type theory. FOSSACS 2006 consisted of one invited and 28 contributed papers, selected out of 107 submissions, yielding an acceptance rate of roughly 26%. The quality of the submitted papers was very high indeed, and several good manuscripts could not be selected for presentation at the conference by the Program Committee. This indicates that FOSSACS is by now an established conference on theoretical computer science to which the authors are submitting some of their best work. Besides the contributed papers, this volume includes an article by Wan Fokkink, the FOSSACS invited speaker. Wan s contribution, entitled On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation, is coauthored with Taolue Chen and Sumit Nain two young, up-and-coming researchers and presents new results on the equational theory of simulation-based preordering relations between concurrent processes. The order of presentation of the contributed papers in this volume follows the structure of the program for the conference. We owe a huge debt of gratitude to the Program Committee for their sterling effort during the difficult process of selecting a program for the conference; to the referees, for carrying out the reviewing tasks with outstandingcompetence, care, and timeliness; and ultimately to the authors for making our selection very hard by submitting their best work to FOSSACS. Thanks to Jens Knoop for the local organization, and to Martin Karusseit for his support with the conference electronic management system. We hope that you will enjoy reading this volume. Reykjavík January 2006 Luca Aceto and Anna Ingólfsdóttir Program Chairs FOSSACS 2006
Organization Program Committee Luca Aceto (Reykjavík, Iceland) Bruno Blanchet (ENS Paris, France) Nadia Busi (Bologna, Italy) Flavio Corradini (Camerino, Italy) Zoltan Ésik (Szeged, Hungary) Anna Ingólfsdóttir (Reykjavík, Iceland) Dexter Kozen (Cornell, USA) Orna Kupferman (Jerusalem, Israel) Catuscia Palamidessi (INRIA/Futurs, France) Alban Ponse (Amsterdam, The Netherlands) Vladimiro Sassone (Sussex, UK) Igor Walukiewicz (Labri, France) Roberto Amadio (Paris VII, France) Gerard Boudol (INRIA Sophia Antipolis, France) Luca Cardelli (Microsoft Research, UK) Luca de Alfaro (Santa Cruz, USA) Thomas Henzinger (EPFL, Switzerland) Bengt Jonsson (Uppsala, Sweden) Antonin Kucera (Brno, Czech Republic) Marta Kwiatkowska (Birmingham, UK) Erik Poll (Nijmegen, The Netherlands) Edmund Robinson (Queen Mary College, UK) Steve Schneider (Surrey, UK) Thomas Wilke (Kiel, Germany) Referees Rezine Ahmed Carlos Areces Vincent Balat Michael Baldamus Paolo Baldan Vince Barany Franco Barbanera Massimo Bartoletti Emmanuel Beffara Nick Benton Joshua Berdine Martin Berger Rudolf Berghammer Marco Bernardo Yves Bertot Dietmar Berwanger Inge Bethke Dirk Beyer Karthik Bhargavan Gavin Bierman Andreas Blass Stefan Blom Achim Blumensath Frank de Boer Johannes Borgstroem Julian Bradfield Tomas Bradzil Mario Bravetti Diletta R. Cacciagrano Cristiano Calcagno Marco Carbone Ilaria Castellani Dario Catalano Rohit Chadha Krishnendu Chatterjee Alessandra Cherubini Yannick Chevalier Tom Chothia Corina Cirstea
X Organization Giovanni Conforti Byron Cook Martin Cooper Andrea Corradini Veronique Cortier Jean-Michel Couvreur Silvia Crafa Rosario Culmone Frederic Dabrowski Silvano Dal Zilio Giorgio Delzanno Jolie de Miranda Moshe Deutsch Razvan Diaconescu Maria Rita Di Berardini Bob Diertens Pietro Di Gianantonio Marie Duflot-Kremer Jan van Eijck Neil Evans Maribel Fernandes Riccardo Focardi Cedric Fournet Adrian Francalanza Sibylle Froeschle Maurizio Gabbrielli Fabio Gadducci David Galindo Blaise Genest Georges Gonthier Andrew D. Gordon Clemens Grabmayer Stefano Guerrini Christian Haack Magnus M. Halldórsson James Heather Frederic Herbreteau Thomas Hildebrandt Thai Son Hoang Jan Holecek Engelbert Hubbers Marieke Huisman Hans Hüttel Samuel Hym Lucian Ilie Bart Jacobs Radha Jagadeesan Petr Jancar David Janin Ole H. Jensen Thierry Joly Christine Julien Jarkko Kari Felix Klaedtke Bartek Klin Naoki Kobayashi Simon Kramer Tomas Kratochvila Steve Kremer Hans-Joerg Kreowski Ralf Kuesters Alexander Kurz Anna Labella Cosimo Laneve Martin Lange James Leifer Daniel Leivant Giacomo Lenzi Jerome Leroux Martin Leucker Jean-Jacques Levy Paul Levy Huimin Lin Etienne Lozes Denis Lugiez Yoad Lustig Bas Luttik Carsten Lutz Parthasarathy Madhusudan Henning Makholm Claude Marche Ralph Matthes Guy McCusker Alistair McEwan Paul-Andre Mellies Emanuela Merelli Massimo Merro Marino Miculan Dale Miller Anders Moeller Eugenio Moggi Sotiris Moschoyiannis Larry Moss Wojciech Mostowski MohammadReza Mousavi Andrzej Murawski Anca Muscholl Gopalan Nadathur Damian Niwinski Gethin Norman Peter O Hearn Martijn Oostdijk Vincent van Oostrom Friederich Otto Luca Padovani David Parker Augusto Parma Joachim Parrow Dirk Pattison Romain Pechoux Giovanni Michele Pinna Adolfo Piperno Nir Piterman David Pitt Francois Pottier Damien Pous John Power Rosario Pugliese Femke van Raamsdonk Anders P. Ravn Vojtech Rehak Michel Reniers Eike Ritter Piet Rodenburg Michael Rusinowitch Peter Ryan Claudio Sacerdoti Coen Mayank Saksena Davide Sangiorgi Alan Schmitt Roberto Segala Olivier Serre Mike Shields Alex Simpson Christian Skalka
Organization XI Jeremy Sproston Jiří Srba Oldrich Strazovsky Jan Strejcek Grégoire Sutre Andrzej Tarlecki David Teller Luca Tesei Hendrik Tews Sophie Tison Nikola Trcka Helen Treharne Mathieu Turuani Sandor Vagvolgyi Frank D. Valencia Vasco T. Vasconcelos Gerard Verfaillie Björn Victor Maria Grazia Vigliotti Aymeric Vincent Fer-Jan de Vries Wang Xu Daria Walukiewicz Andrzej Wasowski Muck van Weerdenburg Graham White Kidane Yemane Tsai Yih-Kuen Mark van der Zwaag
Table of Contents Invited Talk On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation Taolue Chen, Wan Fokkink, Sumit Nain... 1 Mobile Processes A Theory for Observational Fault Tolerance Adrian Francalanza, Matthew Hennessy... 16 Smooth Orchestrators Cosimo Laneve, Luca Padovani... 32 On the Relative Expressive Power of Asynchronous Communication Primitives Daniele Gorla... 47 More on Bisimulations for Higher Order π-calculus Zining Cao... 63 Software Science Register Allocation After Classical SSA Elimination is NP-Complete Fernando Magno Quintão Pereira, Jens Palsberg... 79 A Logic of Reachable Patterns in Linked Data-Structures Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani... 94 Distributed Computation Dynamic Policy Discovery with Remote Attestation Corin Pitcher, James Riely... 111 Distributed Unfolding of Petri Nets Paolo Baldan, Stefan Haar, Barbara König... 126
XIV Table of Contents On the µ-calculus Augmented with Sabotage Philipp Rohde... 142 Categorical Models A Finite Model Construction for Coalgebraic Modal Logic Lutz Schröder... 157 Presenting Functors by Operations and Equations Marcello M. Bonsangue, Alexander Kurz... 172 Bigraphical Models of Context-Aware Systems L. Birkedal, S. Debois, E. Elsborg, T. Hildebrandt, H. Niss... 187 Processes for Adhesive Rewriting Systems Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, Pawe l Sobociński... 202 Real Time and Hybrid Systems On Metric Temporal Logic and Faulty Turing Machines Joël Ouaknine, James Worrell... 217 Denotational Semantics of Hybrid Automata Abbas Edalat, Dirk Pattinson... 231 Process Calculi Reversing Algebraic Process Calculi Iain Phillips, Irek Ulidowski... 246 Conjunction on Processes: Full Abstraction Via Ready Tree Semantics Gerald Lüttgen, Walter Vogler... 261 Undecidability Results for Bisimilarity on Prefix Rewrite Systems Petr Jančar, JiříSrba... 277 Automata and Logic Propositional Dynamic Logic with Recursive Programs Christof Löding, Olivier Serre... 292
Table of Contents XV A Semantic Approach to Interpolation Andrei Popescu, Traian Florin Şerbănuţă, Grigore Roşu... 307 First-Order and Counting Theories of ω-automatic Structures Dietrich Kuske, Markus Lohrey... 322 Parity Games Played on Transition Graphs of One-Counter Processes Olivier Serre... 337 Domains, Lambda Calculus, Types Bidomains and Full Abstraction for Countable Nondeterminism James Laird... 352 An Operational Characterization of Strong Normalization Luca Paolini, Elaine Pimentel, Simona Ronchi Della Rocca... 367 On the Confluence of λ-calculus with Conditional Rewriting Frédéric Blanqui, Claude Kirchner, Colin Riba... 382 Security Guessing Attacks and the Computational Soundness of Static Equivalence Martín Abadi, Mathieu Baudet, Bogdan Warinschi... 398 Handling exp, (and Timestamps) in Protocol Analysis Roberto Zunino, Pierpaolo Degano... 413 Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario Michael Backes, Sebastian Mödersheim, Birgit Pfitzmann, Luca Viganò... 428 Author Index... 447