product iamge

Foundations of Software Science and Computational Structures: 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. 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.

Download
Search on Amazon

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"

This book constitutes the refereed proceedings of the 11th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2008, held in Budapest, Hungary, in March/April 2008 as part of ETAPS 2008, the European Joint Conferences on Theory and Practice of Software.

The 33 revised full papers presented together with the abstract of 1 invited talk were carefully reviewed and selected from 124 submissions. A broad variety of theories and methods to support analysis, synthesis, transformation and verification of programs and software systems are addressed, including the following topics: algebraic models, automata and language theory, behavioural equivalences, categorical models, computation processes over discrete and continuous data, infinite state systems, computational structures, logics of programs, modal, spatial, and temporal logics, models of concurrent, reactive, distributed, and mobile systems, process algebras and calculi, semantics of programming languages, software specification and refinement, type systems and type theory, fundamentals of security, semi-structured data, program correctness and verification.

Author(s): Igor Walukiewicz (auth.), Roberto Amadio (eds.)
Series: Lecture Notes in Computer Science 4962 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2008

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

Front Matter....Pages -
Finding Your Way in a Forest: On Different Types of Trees and Their Properties....Pages 1-4
Simple Stochastic Games with Few Random Vertices Are Easy to Solve....Pages 5-19
The Complexity of Nash Equilibria in Infinite Multiplayer Games....Pages 20-34
Stochastic Games with Lossy Channels....Pages 35-49
Simulation Hemi-metrics between Infinite-State Stochastic Games....Pages 50-65
Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics....Pages 66-80
A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)....Pages 81-96
The ω -Regular Post Embedding Problem....Pages 97-111
Complexity of Decision Problems for Mixed and Modal Specifications....Pages 112-126
Classes of Tree Homomorphisms with Decidable Preservation of Regularity....Pages 127-141
A Kleene-Schützenberger Theorem for Weighted Timed Automata....Pages 142-156
Robust Analysis of Timed Automata Via Channel Machines....Pages 157-171
The Common Fragment of ACTL and LTL....Pages 172-185
The Complexity of CTL* + Linear Past....Pages 186-200
Footprints in Local Reasoning....Pages 201-215
A Modal Deconstruction of Access Control Logics....Pages 216-230
Coalgebraic Logic and Synthesis of Mealy Machines....Pages 231-245
The Microcosm Principle and Concurrency in Coalgebra....Pages 246-260
Systems of Equations Satisfied in All Commutative Finite Semigroups....Pages 261-272
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity....Pages 273-286
On Decision Problems for Probabilistic Büchi Automata....Pages 287-301
Model-Checking ω -Regular Properties of Interval Markov Chains....Pages 302-317
Prevision Domains and Convex Powercones....Pages 318-333
RPO, Second-Order Contexts, and λ -Calculus....Pages 334-349
Erasure and Polymorphism in Pure Type Systems....Pages 350-364
The Implicit Calculus of Constructions as a Programming Language with Dependent Types....Pages 365-379
Strong Normalisation of Cut-Elimination That Simulates β -Reduction....Pages 380-394
Symbolic Semantics Revisited....Pages 395-412
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions....Pages 413-427
Structural Operational Semantics for Stochastic Process Calculi....Pages 428-442
Compositional Methods for Information-Hiding....Pages 443-457
Products of Message Sequence Charts....Pages 458-473
What Else Is Decidable about Integer Arrays?....Pages 474-489
Model Checking Freeze LTL over One-Counter Automata....Pages 490-504
Back Matter....Pages -