Advertisement

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

  • Luca Aceto
  • Anna Ingólfsdóttir
Conference proceedings FoSSaCS 2006

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3921)

Table of contents

  1. Front Matter
    PDF

  2. Invited Talk

    1. On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation
      Taolue Chen, Wan Fokkink, Sumit Nain
      Pages 1-15
      PDF

  3. Mobile Processes

    1. A Theory for Observational Fault Tolerance
      Adrian Francalanza, Matthew Hennessy
      Pages 16-31
      PDF
    2. Smooth Orchestrators
      Cosimo Laneve, Luca Padovani
      Pages 32-46
      PDF
    3. On the Relative Expressive Power of Asynchronous Communication Primitives
      Daniele Gorla
      Pages 47-62
      PDF
    4. More on Bisimulations for Higher Order π-Calculus
      Zining Cao
      Pages 63-78
      PDF

  4. Software Science

    1. Register Allocation After Classical SSA Elimination is NP-Complete
      Fernando Magno Quintão Pereira, Jens Palsberg
      Pages 79-93
      PDF
    2. A Logic of Reachable Patterns in Linked Data-Structures
      Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
      Pages 94-110
      PDF

  5. Distributed Computation

    1. Dynamic Policy Discovery with Remote Attestation
      Corin Pitcher, James Riely
      Pages 111-125
      PDF
    2. Distributed Unfolding of Petri Nets
      Paolo Baldan, Stefan Haar, Barbara König
      Pages 126-141
      PDF
    3. On the μ-Calculus Augmented with Sabotage
      Philipp Rohde
      Pages 142-156
      PDF

  6. Categorical Models

    1. A Finite Model Construction for Coalgebraic Modal Logic
      Lutz Schröder
      Pages 157-171
      PDF
    2. Presenting Functors by Operations and Equations
      Marcello M. Bonsangue, Alexander Kurz
      Pages 172-186
      PDF
    3. Bigraphical Models of Context-Aware Systems
      L. Birkedal, S. Debois, E. Elsborg, T. Hildebrandt, H. Niss
      Pages 187-201
      PDF
    4. Processes for Adhesive Rewriting Systems
      Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, Paweł Sobociński
      Pages 202-216
      PDF

  7. Real Time and Hybrid Systems

    1. On Metric Temporal Logic and Faulty Turing Machines
      Joël Ouaknine, James Worrell
      Pages 217-230
      PDF
    2. Denotational Semantics of Hybrid Automata
      Abbas Edalat, Dirk Pattinson
      Pages 231-245
      PDF

  8. Process Calculi

    1. Reversing Algebraic Process Calculi
      Iain Phillips, Irek Ulidowski
      Pages 246-260
      PDF
    2. Conjunction on Processes: Full–Abstraction Via Ready–Tree Semantics
      Gerald Lüttgen, Walter Vogler
      Pages 261-276
      PDF
    3. Undecidability Results for Bisimilarity on Prefix Rewrite Systems
      Petr Jančar, Jiří Srba
      Pages 277-291
      PDF

  9. Automata and Logic

    1. Propositional Dynamic Logic with Recursive Programs
      Christof Löding, Olivier Serre
      Pages 292-306
      PDF
    2. A Semantic Approach to Interpolation
      Andrei Popescu, Traian Florin Şerbănuţă, Grigore Roşu
      Pages 307-321
      PDF
    3. First-Order and Counting Theories of ω-Automatic Structures
      Dietrich Kuske, Markus Lohrey
      Pages 322-336
      PDF
    4. Parity Games Played on Transition Graphs of One-Counter Processes
      Olivier Serre
      Pages 337-351
      PDF

  10. Domains, Lambda Calculus, Types

    1. Bidomains and Full Abstraction for Countable Nondeterminism
      James Laird
      Pages 352-366
      PDF
    2. An Operational Characterization of Strong Normalization
      Luca Paolini, Elaine Pimentel, Simona Ronchi Della Rocca
      Pages 367-381
      PDF
    3. On the Confluence of λ-Calculus with Conditional Rewriting
      Frédéric Blanqui, Claude Kirchner, Colin Riba
      Pages 382-397
      PDF

  11. Security

    1. Guessing Attacks and the Computational Soundness of Static Equivalence
      Martín Abadi, Mathieu Baudet, Bogdan Warinschi
      Pages 398-412
      PDF
    2. Handling exp,× (and Timestamps) in Protocol Analysis
      Roberto Zunino, Pierpaolo Degano
      Pages 413-427
      PDF
    3. Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario
      Michael Backes, Sebastian Mödersheim, Birgit Pfitzmann, Luca Viganò
      Pages 428-445
      PDF
  12. Back Matter
    PDF

About these proceedings

Introduction


This book constitutes the refereed proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2006, held in Vienna, Austria in March 2006 as part of ETAPS.

The 28 revised full papers presented together with 1 invited paper were carefully reviewed and selected from 107 submissions. The papers are organized in topical sections on mobile processes, software science, distributed computation, categorical models, real time and hybrid systems, process calculi, automata and logic, domains, lambda calculus, types, and security.

Keywords

Automat automata computational structures formal methods formal verification lambda calculus logic logical foundations mathematical foundations modal logics model checking program analysis program logics programming calculi programming theory

Editors and affiliations

  • Luca Aceto
    • 1
  • Anna Ingólfsdóttir
    • 2
  1. 1.School of Computer ScienceReykjavik UniversityReykjavíkIceland
  2. 2.Department of Computer ScienceReykjavík UniversityReykjavíkIceland

Bibliographic information

  • DOI https://doi.org/10.1007/11690634
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-33045-5
  • Online ISBN 978-3-540-33046-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site