Email RIS file
Bookmark
Report an Issue

Foundations of Software Science and Computation Structures [electronic resource] : 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings / edited by Miko℗aj Bojan<U+0301>czyk, Alex Simpson

Published
Cham : Springer International Publishing : Imprint: Springer, 2019.
Edition
1st ed. 2019.
Physical Description
XV, 542 p. 2401 illus., 6 illus. in color. online resource
Additional Creators
Bojan<U+0301>czyk, Miko℗aj., Simpson, Alex, and SpringerLink (Online service)
Access Online

Availability

I Want It
I Want It

Finding items...

Series
Restrictions on Access
License restrictions may limit access.
Contents
Universal Graphs and Good for Small Games Automata: New Tools for Infinite Duration Games -- Resource-Tracking Concurrent Games -- Change Actions: Models of Generalised Differentiation -- Coalgebra Learning via Duality -- Tight Worst-Case Bounds for Polynomial Loop Programs -- A Complete Normal-Form Bisimilarity for State -- Identifiers in Registers - Describing Network Algorithms with Logic -- The Impatient May Use Limited Optimism to Minimize Regret -- Causality in Linear Logic: Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment) -- Rewriting Abstract Structures: Materialization Explained Categorically -- Two-Way Parikh Automata with a Visibly Pushdown Stack -- Kleene Algebra with Hypotheses -- Trees in Partial Higher Dimensional Automata -- The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains -- Continuous Reachability for Unordered Data Petri Nets is in PTime -- Optimal Satisfiability Checking for Arithmetic mu-Calculi -- Constructing Inductive-Inductive Types in Cubical Type Theory -- Causal Inference by String Diagram Surgery -- Higher-Order Distributions for Differential Linear Logic -- Languages Ordered by the Subword Order -- Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces -- A Sound and Complete Logic for Algebraic Effects -- Equational Axiomatization of Algebras with Structure -- Towards a Structural Proof Theory of Probabilistic <U+03BC>-Calculi -- Partial and Conditional Expectations in Markov Decision Processes with Integer Weights -- Equational Theories and Monads from Polynomial Cayley Representations -- A Dialectica-Like Interpretation of a Linear MSO on Infinite Words -- Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time -- Justness: A Completeness Criterion for Capturing Liveness Properties -- Path category for Free - Open Morphisms from Coalgebras with Non-Deterministic Branching.
Summary
This book is Open Access under a CC BY licence.
Subject(s)
Genre(s)
ISBN
9783030171278
9783030171261 (print)
9783030171285 (print)
Digital File Characteristics
text file PDF
Part Of
Springer eBooks
View MARC record | catkey: 27086288