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

ISBN-13: 9783540253884 / Angielski / Miękka / 2005 / 530 str.

Vladimiro Sassone

Opis

This book constitutes the refereed proceedings of the 8th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2005, held in Edinburgh, UK in April 2005 as part of ETAPS.

The 30 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 108 submissions. The papers are organized in topical sections on rule formats and bisimulation, probabilistic models, algebraic models, games and automata, language analysis, partial order models, logics, coalgebraic modal logics, and computational models.

Spis treści

Invited Talks.- Model Checking for Nominal Calculi.- Mathematical Models of Computational and Combinatorial Structures.- Rule Formats and Bisimulation.- Congruence for Structural Congruences.- Probabilistic Congruence for Semistochastic Generative Processes.- Bisimulation on Speed: A Unified Approach.- Probabilistic Models.- Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications.- Axiomatizations for Probabilistic Finite-State Behaviors.- Stochastic Transition Systems for Continuous State Spaces and Non-determinism.- Model Checking Durational Probabilistic Systems.- Algebraic Models.- Free-Algebra Models for the ?-Calculus.- A Unifying Model of Variables and Names.- A Category of Higher-Dimensional Automata.- Games and Automata.- Third-Order Idealized Algol with Iteration Is Decidable.- Fault Diagnosis Using Timed Automata.- Optimal Conditional Reachability for Multi-priced Timed Automata.- Alternating Timed Automata.- Language Analysis.- Full Abstraction for Polymorphic Pi-Calculus.- Foundations of Web Transactions.- Bridging Language-Based and Process Calculi Security.- History-Based Access Control with Local Policies.- Partial Order Models.- Composition and Decomposition in True-Concurrency.- Component Refinement and CSC Solving for STG Decomposition.- The Complexity of Live Sequence Charts.- Logics.- A Simpler Proof Theory for Nominal Logic.- From Separation Logic to First-Order Logic.- Justifying Algorithms for ??-Conversion.- On Decidability Within the Arithmetic of Addition and Divisibility.- Coalgebraic Modal Logics.- Expressivity of Coalgebraic Modal Logic: The Limits and Beyond.- Duality for Logics of Transition Systems.- Computational Models.- Confluence of Right Ground Term Rewriting Systems Is Decidable.- Safety Is not a Restriction at Level 2 for String Languages.- A Computational Model for Multi-variable Differential Calculus.