1 option
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 / edited by Roberto Amadio.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 4962.
- Theoretical Computer Science and General Issues ; 4962
- Language:
- English
- Subjects (All):
- Computers.
- Computer logic.
- Logic, Symbolic and mathematical.
- Programming languages (Electronic computers).
- Software engineering.
- Theory of Computation.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Computation by Abstract Devices.
- Programming Languages, Compilers, Interpreters.
- Software Engineering.
- Local Subjects:
- Theory of Computation.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Computation by Abstract Devices.
- Programming Languages, Compilers, Interpreters.
- Software Engineering.
- Physical Description:
- 1 online resource (XV, 508 pages).
- Edition:
- First edition 2008.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-78499-9
- 9783540784999
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.