9. FoSSaCS 2006: Vienna, Austria (Part of ETAPS 2006)

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. Lecture Notes in Computer Science 3921 Springer 2006, ISBN 3-540-33045-3

Invited Talk

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

Mobile Processes

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

Software Science

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

Distributed Computation

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

Categorical Models

Lutz Schröder:
A Finite Model Construction for Coalgebraic Modal Logic. 157-171
Marcello M. Bonsangue, Alexander Kurz:
Presenting Functors by Operations and Equations. 172-186
Lars Birkedal, Søren Debois, Ebbe Elsborg, Thomas T. Hildebrandt, Henning Niss:
Bigraphical Models of Context-Aware Systems. 187-201
Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, Pawel Sobocinski:
Processes for Adhesive Rewriting Systems. 202-216

Real Time and Hybrid Systems

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

Process Calculi

Iain C. C. Phillips, Irek Ulidowski:
Reversing Algebraic Process Calculi. 246-260
Gerald Lüttgen, Walter Vogler:
Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics. 261-276
Petr Jancar, Jirí Srba:
Undecidability Results for Bisimilarity on Prefix Rewrite Systems. 277-291

Automata and Logic

Christof Löding, Olivier Serre:
Propositional Dynamic Logic with Recursive Programs. 292-306
Andrei Popescu, Traian Serbanuta, Grigore Rosu:
A Semantic Approach to Interpolation. 307-321
Dietrich Kuske, Markus Lohrey:
First-Order and Counting Theories of omega-Automatic Structures. 322-336
Olivier Serre:
Parity Games Played on Transition Graphs of One-Counter Processes. 337-351

Automata and Logic

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

Security

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

Last update Mon May 20 14:42:07 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page