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

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

ETAPS 2005 was the eighth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was est- lished in 1998 by combining a number of existing and new conferences. This year it comprised ?ve conferences (CC, ESOP, FASE, FOSSACS, TACAS), 17 satellite wo- shops (AVIS, BYTECODE, CEES, CLASE, CMSB, COCV, FAC, FESCA, FINCO, GCW-DSE, GLPL, LDTA, QAPL, SC, SLAP, TGC, UITP), seven invited lectures (not including those that were speci?c to the satellite events), and several tutorials. We - ceived over 550 submissions to the ?ve conferences this year, giving acceptance rates below 30% for each one. Congratulations to all the authors who made it to the ?nal program! 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 devel- ment process, including speci?cation, design, implementation, analysis and impro- ment. The languages, methodologies and tools which support these activities are all well within its scope. Di?erent 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.

Author(s): Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto (auth.), Vladimiro Sassone (eds.)
Series: Lecture Notes in Computer Science 3441 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005

Language: English
Pages: 530
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Computation by Abstract Devices; Programming Languages, Compilers, Interpreters; Software Engineering

Front Matter....Pages -
Model Checking for Nominal Calculi....Pages 1-24
Mathematical Models of Computational and Combinatorial Structures....Pages 25-46
Congruence for Structural Congruences....Pages 47-62
Probabilistic Congruence for Semistochastic Generative Processes....Pages 63-78
Bisimulation on Speed: A Unified Approach....Pages 79-94
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications....Pages 95-109
Axiomatizations for Probabilistic Finite-State Behaviors....Pages 110-124
Stochastic Transition Systems for Continuous State Spaces and Non-determinism....Pages 125-139
Model Checking Durational Probabilistic Systems....Pages 140-154
Free-Algebra Models for the π -Calculus....Pages 155-169
A Unifying Model of Variables and Names....Pages 170-186
A Category of Higher-Dimensional Automata....Pages 187-201
Third-Order Idealized Algol with Iteration Is Decidable....Pages 202-218
Fault Diagnosis Using Timed Automata....Pages 219-233
Optimal Conditional Reachability for Multi-priced Timed Automata....Pages 234-249
Alternating Timed Automata....Pages 250-265
Full Abstraction for Polymorphic Pi-Calculus....Pages 266-281
Foundations of Web Transactions....Pages 282-298
Bridging Language-Based and Process Calculi Security....Pages 299-315
History-Based Access Control with Local Policies....Pages 316-332
Composition and Decomposition in True-Concurrency....Pages 333-347
Component Refinement and CSC Solving for STG Decomposition....Pages 348-363
The Complexity of Live Sequence Charts....Pages 364-378
A Simpler Proof Theory for Nominal Logic....Pages 379-394
From Separation Logic to First-Order Logic....Pages 395-409
Justifying Algorithms for βη -Conversion....Pages 410-424
On Decidability Within the Arithmetic of Addition and Divisibility....Pages 425-439
Expressivity of Coalgebraic Modal Logic: The Limits and Beyond....Pages 440-454
Duality for Logics of Transition Systems....Pages 455-469
Confluence of Right Ground Term Rewriting Systems Is Decidable....Pages 470-489
Safety Is not a Restriction at Level 2 for String Languages....Pages 490-504
A Computational Model for Multi-variable Differential Calculus....Pages 505-519
Back Matter....Pages -