8. FoSSaCS 2005: Edinburgh, UK (Part of ETAPS 2005)

Vladimiro Sassone (Ed.): Foundations of Software Science and Computational Structures, 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings. Lecture Notes in Computer Science 3441 Springer 2005, ISBN 3-540-25388-2

Invited Talks

Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto:
Model Checking for Nominal Calculi. 1-24
Marcelo P. Fiore:
Mathematical Models of Computational and Combinatorial Structures. 25-46

Rule Formats and Bisimulation

Mohammad Reza Mousavi, Michel A. Reniers:
Congruence for Structural Congruences. 47-62
Ruggero Lanotte, Simone Tini:
Probabilistic Congruence for Semistochastic Generative Processes. 63-78
Gerald Lüttgen, Walter Vogler:
Bisimulation on Speed: A Unified Approach. 79-94

Probabilistic Models

Samy Abbes, Albert Benveniste:
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications. 95-109
Yuxin Deng, Catuscia Palamidessi:
Axiomatizations for Probabilistic Finite-State Behaviors. 110-124
Stefano Cattani, Roberto Segala, Marta Z. Kwiatkowska, Gethin Norman:
Stochastic Transition Systems for Continuous State Spaces and Non-determinism. 125-139
François Laroussinie, Jeremy Sproston:
Model Checking Durational Probabilistic Systems. 140-154

Algebraic Models

Ian Stark:
Free-Algebra Models for the pi-Calculus. 155-169
Marino Miculan, Kidane Yemane:
A Unifying Model of Variables and Names. 170-186
Ulrich Fahrenberg:
A Category of Higher-Dimensional Automata. 187-201

Games and Automata

Andrzej S. Murawski, Igor Walukiewicz:
Third-Order Idealized Algol with Iteration Is Decidable. 202-218
Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza:
Fault Diagnosis Using Timed Automata. 219-233
Kim Guldstrand Larsen, Jacob Illum Rasmussen:
Optimal Conditional Reachability for Multi-priced Timed Automata. 234-249
Slawomir Lasota, Igor Walukiewicz:
Alternating Timed Automata. 250-265

Language Analysis

Alan Jeffrey, Julian Rathke:
Full Abstraction for Polymorphic Pi-Calculus. 266-281
Cosimo Laneve, Gianluigi Zavattaro:
Foundations of Web Transactions. 282-298
Riccardo Focardi, Sabina Rossi, Andrei Sabelfeld:
Bridging Language-Based and Process Calculi Security. 299-315
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari:
History-Based Access Control with Local Policies. 316-332

Partial Order Models

Sibylle B. Fröschle:
Composition and Decomposition in True-Concurrency. 333-347
Mark Schäfer, Walter Vogler:
Component Refinement and CSC Solving for STG Decomposition. 348-363
Yves Bontemps, Pierre-Yves Schobbens:
The Complexity of Live Sequence Charts. 364-378

Logics

James Cheney:
A Simpler Proof Theory for Nominal Logic. 379-394
Cristiano Calcagno, Philippa Gardner, Matthew Hague:
From Separation Logic to First-Order Logic. 395-409
Healfdene Goguen:
Justifying Algorithms for beta-eta-Conversion. 410-424
Marius Bozga, Radu Iosif:
On Decidability Within the Arithmetic of Addition and Divisibility. 425-439

Coalgebraic Modal Logics

Lutz Schröder:
Expressivity of Coalgebraic Modal Logic: The Limits and Beyond. 440-454
Marcello M. Bonsangue, Alexander Kurz:
Duality for Logics of Transition Systems. 455-469

Computational Models

Lukasz Kaiser:
Confluence of Right Ground Term Rewriting Systems Is Decidable. 470-489
Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong:
Safety Is not a Restriction at Level 2 for String Languages. 490-504
Abbas Edalat, André Lieutier, Dirk Pattinson:
A Computational Model for Multi-variable Differential Calculus. 505-519

Last update Mon May 20 22:59:31 2013 CET by the DBLP Team —

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