Foundations of software science and computation structures : 19th 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 /: 19th 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. (2016)

• Record Type: Book
• Other Titles: FOSSACS 2016
• Further Information: Note: Bart Jacobs, Christof Löding (eds.).
• Editors: Jacobs, Bart; Löding, Christof
• Other Names: FOSSACS (Conference), 19th; ETAPS (Conference), 19th
• Contents: Types -- 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.
• Publisher Details: Berlin : Springer
• Publication Date: 2016
• Extent: 1 online resource (xi, 550 pages), illustrations
• Subjects: 005.1; Computer software -- Congresses; Software engineering -- Congresses; Computer software; Software engineering; Electronic books; Conference papers and proceedings; Conference papers and proceedings
• Languages: English
• ISBNs: 9783662496305; 3662496305; 3662496291; 9783662496299
• Related ISBNs: 9783662496299
• Notes: Note: Includes bibliographical references and author index.; Note: Online resource; title from PDF title page (SpringerLink, viewed April 6, 2016).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.