Vai al contenuto principale della pagina
Titolo: |
Foundations of Software Science and Computational Structures [[electronic resource] ] : 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 / / edited by Roberto Amadio
![]() |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Edizione: | 1st ed. 2008. |
Descrizione fisica: | 1 online resource (XV, 508 p.) |
Disciplina: | 003 |
Soggetto topico: | Computer science |
Machine theory | |
Compilers (Computer programs) | |
Software engineering | |
Theory of Computation | |
Computer Science Logic and Foundations of Programming | |
Formal Languages and Automata Theory | |
Compilers and Interpreters | |
Software Engineering | |
Persona (resp. second.): | AmadioRoberto |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | Finding Your Way in a Forest: On Different Types of Trees and Their Properties -- Simple Stochastic Games with Few Random Vertices Are Easy to Solve -- The Complexity of Nash Equilibria in Infinite Multiplayer Games -- Stochastic Games with Lossy Channels -- Simulation Hemi-metrics between Infinite-State Stochastic Games -- Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics -- A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract) -- The ?-Regular Post Embedding Problem -- Complexity of Decision Problems for Mixed and Modal Specifications -- Classes of Tree Homomorphisms with Decidable Preservation of Regularity -- A Kleene-Schützenberger Theorem for Weighted Timed Automata -- Robust Analysis of Timed Automata Via Channel Machines -- The Common Fragment of ACTL and LTL -- The Complexity of CTL* + Linear Past -- Footprints in Local Reasoning -- A Modal Deconstruction of Access Control Logics -- Coalgebraic Logic and Synthesis of Mealy Machines -- The Microcosm Principle and Concurrency in Coalgebra -- Systems of Equations Satisfied in All Commutative Finite Semigroups -- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity -- On Decision Problems for Probabilistic Büchi Automata -- Model-Checking ?-Regular Properties of Interval Markov Chains -- Prevision Domains and Convex Powercones -- RPO, Second-Order Contexts, and ?-Calculus -- Erasure and Polymorphism in Pure Type Systems -- The Implicit Calculus of Constructions as a Programming Language with Dependent Types -- Strong Normalisation of Cut-Elimination That Simulates ?-Reduction -- Symbolic Semantics Revisited -- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions -- Structural Operational Semantics for Stochastic Process Calculi -- Compositional Methods for Information-Hiding -- Products of Message Sequence Charts -- What Else Is Decidable about Integer Arrays? -- Model Checking Freeze LTL over One-Counter Automata. |
Titolo autorizzato: | Foundations of Software Science and Computational Structures ![]() |
ISBN: | 3-540-78499-3 |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996465922003316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |