000 03977nam a22005655i 4500
001 978-3-642-12032-9
003 DE-He213
005 20240423125936.0
007 cr nn 008mamaa
008 100308s2010 gw | s |||| 0|eng d
020 _a9783642120329
_9978-3-642-12032-9
024 7 _a10.1007/978-3-642-12032-9
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aFoundations of Software Science and Computational Structures
_h[electronic resource] :
_b13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010, Proceedings /
_cedited by Luke Ong.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXV, 389 p. 47 illus.
_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 ;
_v6014
505 0 _aFoSSaCS 2010 Invited Talk -- to Decidability of Higher-Order Matching -- Semantics of Programming Languages -- A Semantic Foundation for Hidden State -- Linearly-Used Continuations in the Enriched Effect Calculus -- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience -- Completeness for Algebraic Theories of Local State -- Probabilistic and Randomised Computation -- Fair Adversaries and Randomization in Two-Player Games -- Retaining the Probabilities in Probabilistic Testing Theory -- Concurrency and Process Theory -- Forward Analysis of Depth-Bounded Processes -- Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization -- Parameterised Multiparty Session Types -- On the Relationship between Spatial Logics and Behavioral Simulations -- Modal and Temporal Logics -- An Easy Completeness Proof for the Modal ?-Calculus on Finite Trees -- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable -- Model Checking Is Static Analysis of Modal Logic -- Counting CTL -- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems -- Verification -- Toward a Compositional Theory of Leftist Grammars and Transformations -- Degrees of Lookahead in Regular Infinite Games -- Reachability Analysis of Communicating Pushdown Systems -- The Complexity of Synchronous Notions of Information Flow Security -- Categorical and Coalgebraic Methods -- Monads Need Not Be Endofunctors -- CIA Structures and the Semantics of Recursion -- Coalgebraic Correspondence Theory -- Lambda Calculus and Types -- Untyped Recursion Schemes and Infinite Intersection Types -- Solvability in Resource Lambda-Calculus -- A Hierarchy for Delimited Continuations in Call-by-Name.
650 0 _aMachine theory.
650 0 _aCompilers (Computer programs).
650 0 _aSoftware engineering.
650 0 _aComputer science.
650 1 4 _aFormal Languages and Automata Theory.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aSoftware Engineering.
650 2 4 _aTheory of Computation.
650 2 4 _aComputer Science Logic and Foundations of Programming.
700 1 _aOng, Luke.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642120312
776 0 8 _iPrinted edition:
_z9783642120336
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6014
856 4 0 _uhttps://doi.org/10.1007/978-3-642-12032-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c183336
_d183336