LEADER 05184nam 22007215 450 001 9910484306303321 005 20251226195817.0 010 $a3-662-49630-5 024 7 $a10.1007/978-3-662-49630-5 035 $a(CKB)3710000000627383 035 $a(SSID)ssj0001658345 035 $a(PQKBManifestationID)16442044 035 $a(PQKBTitleCode)TC0001658345 035 $a(PQKBWorkID)14989792 035 $a(PQKB)11306273 035 $a(DE-He213)978-3-662-49630-5 035 $a(MiAaPQ)EBC5585253 035 $a(PPN)19277185X 035 $a(EXLCZ)993710000000627383 100 $a20160330d2016 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFoundations of Software Science and Computation Structures $e19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings /$fedited by Bart Jacobs, Christof Löding 205 $a1st ed. 2016. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2016. 215 $a1 online resource (XI, 550 p. 78 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9634 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-662-49629-1 327 $aTypes -- Comprehensive parametric polymorphism: categorical models and type theory -- Guarded Dependent Type Theory with Coinductive Types -- Dependent Types and Fibred Computational Effects -- Game Semantics for Bounded Polymorphism -- Recursion and Fixed-Points Join Inverse Categories as Models of Reversible Recursion -- A Coalgebraic View of Bar Recursion and Bar Induction -- A New Foundation for Finitary Corecursion -- Fixed-point elimination in the Intuitionistic Propositional Calculus -- Verification and Program Analysis. A Theory of Monitors -- Contextual approximation and higher-order procedures -- A Theory of Slicing for Probabilistic Control Flow Graphs -- Verification of parameterized communicating automata via split-width -- Automata, Logic, Games - Robust Equilibria in Mean-Payoff Games -- Quantifier Alternation for Infinite Words.-Synchronizing automata over nested words -- On Freeze LTL with Ordered Attributes -- Regular transformations of data words through origin information -- Probabilistic and Timed Systems - Trace Refinement in Labelled Markov Decision Processes -- Qualitative Analysis of VASS-Induced MDPs -- Metric Temporal Logic with Counting -- Distributed Synthesis in Continuous Time -- Proof Theory and Lambda Calculus Unary Resolution: Characterizing Ptime -- Focused and Synthetic Nested Sequents -- Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda-terms -- Reasoning about call-by-need by means of types -- Algorithms for Infinite Systems Coverability Trees for Petri Nets with Unordered Data -- Shortest paths in one-counter systems -- The Invariance Problem for Matrix Semigroups -- Order-Sorted Rewriting and Congruence Closure -- Monads -- Towards a formal theory of graded monads -- Profinite Monads, Profinite Equations, and Reiterman?s Theorem. 330 $aThis book constitutes the proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2016, which took place in Eindhoven, The Netherlands, in April 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016. The 31 full papers presented in this volume were carefully reviewed and selected from 85 submissions. They were organized in topical sections named: types; recursion and fixed-points; verification and program analysis; automata, logic, games; probabilistic and timed systems; proof theory and lambda calculus; algorithms for infinite systems; and monads. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9634 606 $aComputer science 606 $aMachine theory 606 $aCompilers (Computer programs) 606 $aSoftware engineering 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aCompilers and Interpreters 606 $aSoftware Engineering 606 $aTheory of Computation 615 0$aComputer science. 615 0$aMachine theory. 615 0$aCompilers (Computer programs). 615 0$aSoftware engineering. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aCompilers and Interpreters. 615 24$aSoftware Engineering. 615 24$aTheory of Computation. 676 $a004 702 $aJacobs$b Bart$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLöding$b Christof$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484306303321 996 $aFoundations of Software Science and Computation Structures$9772187 997 $aUNINA