000 04358nam a22005655i 4500
001 978-3-540-78499-9
003 DE-He213
005 20240730194928.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540784999
_9978-3-540-78499-9
024 7 _a10.1007/978-3-540-78499-9
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aFoundations of Software Science and Computational Structures
_h[electronic resource] :
_b11th 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 /
_cedited by Roberto Amadio.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXV, 508 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4962
505 0 _aFinding 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 StochasticProcess 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.
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9158532
650 0 _aCompilers (Computer programs).
_93350
650 0 _aSoftware engineering.
_94138
650 1 4 _aTheory of Computation.
_9158533
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9158534
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aSoftware Engineering.
_94138
700 1 _aAmadio, Roberto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9158535
710 2 _aSpringerLink (Online service)
_9158536
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540784975
776 0 8 _iPrinted edition:
_z9783540849247
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4962
_9158537
856 4 0 _uhttps://doi.org/10.1007/978-3-540-78499-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95392
_d95392