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 /: 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. (2019)

• Record Type: Book
• Other Titles: FOSSACS 2019
• Further Information: Note: Mikołaj Bojańczyk, Alex Simpson (eds.).
• Editors: Bojańczyk, Mikołaj; Simpson, Alex
• Other Names: FOSSACS (Conference), 22nd; ETAPS (Conference), 22nd
• 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 μ-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.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2019
• Extent: 1 online resource (xv, 542 pages), illustrations (some color)
• Subjects: 005.1; Computer software -- Congresses; Software engineering -- Congresses; Electronic books
• Languages: English
• ISBNs: 9783030171278; 3030171272
• Related ISBNs: 9783030171261
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed April 10, 2019).
• 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.