LEADER 05191nam 22006855 450 001 996466034303316 005 20230406060427.0 010 $a3-642-00596-9 024 7 $a10.1007/978-3-642-00596-1 035 $a(CKB)1000000000718123 035 $a(SSID)ssj0000317777 035 $a(PQKBManifestationID)11923553 035 $a(PQKBTitleCode)TC0000317777 035 $a(PQKBWorkID)10295539 035 $a(PQKB)10000720 035 $a(DE-He213)978-3-642-00596-1 035 $a(MiAaPQ)EBC3064050 035 $a(PPN)134126424 035 $a(EXLCZ)991000000000718123 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFoundations of Software Science and Computational Structures$b[electronic resource] $e12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009, Proceedings /$fedited by Luca de Alfaro 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XV, 471 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5504 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-00595-0 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Facets of Synthesis: Revisiting Church?s Problem -- Temporal Reasoning about Program Executions -- Semantics -- Least and Greatest Fixpoints in Game Semantics -- Full Abstraction for Reduced ML -- Logics and Bisimulation Games for Concurrency, Causality and Conflict -- Logics and Automata -- Separating Graph Logic from MSO -- On the Completeness of Dynamic Logic -- Dependency Tree Automata -- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes -- Algebras -- A Kleene Theorem for Polynomial Coalgebras -- Coalgebraic Hybrid Logic -- A Description of Iterative Reflections of Monads (Extended Abstract) -- Automata Theory -- Tighter Bounds for the Determinisation of Büchi Automata -- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata -- Interrupt Timed Automata -- Parameter Reduction in Grammar-Compressed Trees -- Processes and Models -- The Calculus of Handshake Configurations -- On the Expressive Power of Restriction and Priorities in CCS with Replication -- Normal Bisimulations in Calculi with Passivation -- Reactive Systems, Barbed Semantics, and the Mobile Ambients -- Security -- On the Foundations of Quantitative Information Flow -- Cryptographic Protocol Composition via the Authentication Tests -- Bisimulation for Demonic Schedulers -- Probabilistic and Quantitative Models -- On Omega-Languages Defined by Mean-Payoff Conditions -- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets -- Delayed Nondeterminism in Continuous-Time Markov Decision Processes -- Concurrency, ?-Algebras, and Probabilistic Fairness -- Synthesis -- Synthesis from Component Libraries -- Realizability of Concurrent Recursive Programs -- Program Analysis and Semantics -- Beyond Shapes: Lists with Ordered Data -- Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains -- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types. 330 $aThis book constitutes the refereed proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2009, held in York, UK, in March 2009, as part of ETAPS 2009, the European Joint Conferences on Theory and Practice of Software. The 30 revised full papers presented together with two invited talks were carefully reviewed and selected from 102 full paper submissions. The topics addressed are semantics, logics and automata, algebras, automata theory, processes and models, security, probabilistic and quantitative models, synthesis, and program analysis and semantics. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5504 606 $aCompilers (Computer programs) 606 $aSoftware engineering 606 $aComputer science 606 $aMachine theory 606 $aCompilers and Interpreters 606 $aSoftware Engineering 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 615 0$aCompilers (Computer programs). 615 0$aSoftware engineering. 615 0$aComputer science. 615 0$aMachine theory. 615 14$aCompilers and Interpreters. 615 24$aSoftware Engineering. 615 24$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 676 $a005.13 702 $ade Alfaro$b Luca$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466034303316 996 $aFoundations of Software Science and Computational Structures$9772755 997 $aUNISA