LEADER 03961nam  2200625Ia 450 
001 9910483822903321
005 20200520144314.0
010   $a1-280-38588-X
010   $a9786613563804
010   $a3-642-12032-6
024 7 $a10.1007/978-3-642-12032-9
035   $a(CKB)2670000000010120
035   $a(SSID)ssj0000399480
035   $a(PQKBManifestationID)11245775
035   $a(PQKBTitleCode)TC0000399480
035   $a(PQKBWorkID)10376185
035   $a(PQKB)10535011
035   $a(DE-He213)978-3-642-12032-9
035   $a(MiAaPQ)EBC3065137
035   $a(PPN)149059809
035   $a(EXLCZ)992670000000010120
100   $a20100315d2010      uy         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aFoundations of software science and computational structures $e13th International Conference, FOSSACS 2010, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 22-28, 2010 : proceedings /$fLuke Ong (ed.)
205   $a1st ed. 2010.
210   $aBerlin ;$aHeidelberg $cSpringer$dc2010
215   $a1 online resource (XV, 389 p. 47 illus.) 
225 1 $aLecture notes in computer science,$x0302-9743 ;$v6014
225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-12031-8 
320   $aIncludes bibliographical references and index.
327   $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.
410  0$aLecture notes in computer science ;$v6014.
410  0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues.
517 3 $aETAPS 2010
517 3 $aFOSSACS 2010
606   $aSystem analysis$vCongresses
606   $aComputer software$vCongresses
615  0$aSystem analysis
615  0$aComputer software
676   $a005.131
701   $aOng$b Luke$01752473
712 12$aETAPS 2010$f(2010 :$ePaphos, Cyprus)
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910483822903321
996   $aFoundations of software science and computational structures$94187858
997   $aUNINA