LEADER 06289nam 22007695 450 001 9910483822903321 005 20251226203133.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(BIP)29190102 035 $a(EXLCZ)992670000000010120 100 $a20100308d2010 u| 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 20-28, 2010, Proceedings /$fedited by Luke Ong 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XV, 389 p. 47 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6014 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$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. 330 $aETAPS 2010 was the 13th instance of the European Joint Conferences on T- oryand Practiceof Software. ETAPS is anannual federatedconference that was establishedin1998bycombininganumberofexistingandnewconferences. This yearitcomprisedtheusual'vesisterconferences(CC,ESOP,FASE,FOSSACS, TACAS), 19 satellite workshops (ACCAT, ARSPA-WITS, Bytecode, CMCS, COCV, DCC, DICE, FBTC, FESCA, FOSS-AMA, GaLoP, GT-VMT, LDTA, MBT, PLACES, QAPL, SafeCert, WGT, and WRLA) and seven invited l- tures (excluding those that were speci'c to the satellite events). The ?ve main conferences this year received 497 submissions (including 31 tool demonstration papers), 130 of which were accepted (10 tool demos), giving an overall acc- tance rate of 26%, with most of the conferences at around 24%. Congratulations thereforetoalltheauthorswhomadeittothe'nalprogramme!Ihopethatmost of the other authors will still have found a way of participating in this exciting event, and that you will all continue submitting to ETAPS and contributing to make of it the best conference on software science and engineering. The events that comprise ETAPS address various aspects of the system - velopment process, including speci'cation, design, implementation, analysis and improvement. The languages, methodologies and tools which support these - tivities are all well within its scope. Di'erent blends of theory and practice are represented,withaninclinationtowardtheorywithapracticalmotivationonthe one hand and soundly based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive. ETAPS is a confederation in which each event retains its own identity, with a separate Programme Committee and proceedings. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6014 606 $aMachine theory 606 $aCompilers (Computer programs) 606 $aSoftware engineering 606 $aComputer science 606 $aFormal Languages and Automata Theory 606 $aCompilers and Interpreters 606 $aSoftware Engineering 606 $aTheory of Computation 606 $aComputer Science Logic and Foundations of Programming 615 0$aMachine theory. 615 0$aCompilers (Computer programs). 615 0$aSoftware engineering. 615 0$aComputer science. 615 14$aFormal Languages and Automata Theory. 615 24$aCompilers and Interpreters. 615 24$aSoftware Engineering. 615 24$aTheory of Computation. 615 24$aComputer Science Logic and Foundations of Programming. 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