Foundations of Software Science and Computation Structures : 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 Bojańczyk, Alex Simpson

Mitwirkende(r):

Resource type: Ressourcentyp: Buch (Online)Buch (Online)Sprache: Englisch Reihen: Theoretical Computer Science and General Issues ; 11425 | Springer eBooks Computer ScienceVerlag: Cham : Springer, 2019Beschreibung: 1 Online-Ressource (XV, 542 p. 2401 illus., 6 illus. in color)ISBN:

9783030171278

Schlagwörter:

Andere physische Formen: 9783030171261 | Erscheint auch als: 978-3-030-17126-1 Druck-AusgabeDDC-Klassifikation:

005.131 23

MSC: MSC: *68-06 | 68Nxx | 68Qxx | 00B25LOC-Klassifikation:

QA8.9-QA10.3

DOI: DOI: 10.1007/978-3-030-17127-8Online-Ressourcen:

Zusammenfassung: 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 μ-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 BranchingZusammenfassung: This book is Open Access under a CC BY licencePPN: PPN: 1666720151Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SOB | ZDB-2-SXCS | ZDB-2-SEB

Exemplare ( 0 )
Titelinformationen ( 1 )

Dieser Titel hat keine Exemplare

Open Access