000 05433nam a22006375i 4500
001 978-3-662-49630-5
003 DE-He213
005 20210120143420.0
007 cr nn 008mamaa
008 160330s2016 gw | s |||| 0|eng d
020 _a9783662496305
_9978-3-662-49630-5
024 7 _a10.1007/978-3-662-49630-5
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
072 7 _aUYF
_2thema
082 0 4 _a005.1015113
_223
245 1 0 _aFoundations of Software Science and Computation Structures
_h[electronic resource] :
_b19th 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 /
_cedited by Bart Jacobs, Christof Löding.
250 _a1st ed. 2016.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2016.
300 _aXI, 550 p. 78 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 ;
_v9634
_aLecture Notes in Computer Science
_v9634
505 0 _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.
520 _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.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aProgramming languages (Electronic computers).
650 0 _aSoftware engineering.
650 0 _aComputers.
650 1 4 _aLogics and Meanings of Programs.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
650 2 4 _aMathematical Logic and Formal Languages.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16048
650 2 4 _aProgramming Languages, Compilers, Interpreters.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I14037
650 2 4 _aSoftware Engineering.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I14029
650 2 4 _aComputation by Abstract Devices.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16013
700 1 _aJacobs, Bart.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLöding, Christof.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662496299
776 0 8 _iPrinted edition:
_z9783662496312
830 0 _aTheoretical Computer Science and General Issues ;
_v9634
830 0 _aLecture Notes in Computer Science ;
_v9634
856 4 0 _uhttps://doi.org/10.1007/978-3-662-49630-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c58376
_d58376