Foundations of Software Science and Computational 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

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. Front Matter....Pages - On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation....Pages 1-15 A Theory for Observational Fault Tolerance....Pages 16-31 Smooth Orchestrators....Pages 32-46 On the Relative Expressive Power of Asynchronous Communication Primitives....Pages 47-62 More on Bisimulations for Higher Order π -Calculus....Pages 63-78 Register Allocation After Classical SSA Elimination is NP-Complete....Pages 79-93 A Logic of Reachable Patterns in Linked Data-Structures....Pages 94-110 Dynamic Policy Discovery with Remote Attestation....Pages 111-125 Distributed Unfolding of Petri Nets....Pages 126-141 On the μ -Calculus Augmented with Sabotage....Pages 142-156 A Finite Model Construction for Coalgebraic Modal Logic....Pages 157-171 Presenting Functors by Operations and Equations....Pages 172-186 Bigraphical Models of Context-Aware Systems....Pages 187-201 Processes for Adhesive Rewriting Systems....Pages 202-216 On Metric Temporal Logic and Faulty Turing Machines....Pages 217-230 Denotational Semantics of Hybrid Automata....Pages 231-245 Reversing Algebraic Process Calculi....Pages 246-260 Conjunction on Processes: Full–Abstraction Via Ready–Tree Semantics....Pages 261-276 Undecidability Results for Bisimilarity on Prefix Rewrite Systems....Pages 277-291 Propositional Dynamic Logic with Recursive Programs....Pages 292-306 A Semantic Approach to Interpolation....Pages 307-321 First-Order and Counting Theories of ω -Automatic Structures....Pages 322-336 Parity Games Played on Transition Graphs of One-Counter Processes....Pages 337-351 Bidomains and Full Abstraction for Countable Nondeterminism....Pages 352-366 An Operational Characterization of Strong Normalization....Pages 367-381 On the Confluence of λ -Calculus with Conditional Rewriting....Pages 382-397 Guessing Attacks and the Computational Soundness of Static Equivalence....Pages 398-412 Handling exp ,× (and Timestamps) in Protocol Analysis....Pages 413-427 Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario....Pages 428-445 Back Matter....Pages - 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 One Invited Paper Were Carefully Reviewed And Selected From 107 Submissions. The Papers Are Organized In Topical Sections. Luca Aceto, Anna Ingólfsdottir (eds.). Includes Bibliographical References And Index. Also Issued Online.