default search action
22nd FoSSaCS@ETAPS 2019: Prague, Czech Republic
- Mikolaj Bojanczyk, Alex Simpson:
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. Lecture Notes in Computer Science 11425, Springer 2019, ISBN 978-3-030-17126-1 - Thomas Colcombet, Nathanaël Fijalkow:
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. 1-26 - Aurore Alcolei, Pierre Clairambault, Olivier Laurent:
Resource-Tracking Concurrent Games. 27-44 - Mario Alvarez-Picallo, C.-H. Luke Ong:
Change Actions: Models of Generalised Differentiation. 45-61 - Simone Barlocco, Clemens Kupke
, Jurriaan Rot:
Coalgebra Learning via Duality. 62-79 - Amir M. Ben-Amram, Geoff W. Hamilton
Tight Worst-Case Bounds for Polynomial Loop Programs. 80-97 - Dariusz Biernacki
A Complete Normal-Form Bisimilarity for State. 98-114 - Benedikt Bollig, Patricia Bouyer, Fabian Reiter:
Identifiers in Registers - Describing Network Algorithms with Logic. 115-132 - Michaël Cadilhac, Guillermo A. Pérez
The Impatient May Use Limited Optimism to Minimize Regret. 133-149 - Simon Castellan, Nobuko Yoshida
Causality in Linear Logic - Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment). 150-168 - Andrea Corradini, Tobias Heindel, Barbara König, Dennis Nolte, Arend Rensink
Rewriting Abstract Structures: Materialization Explained Categorically. 169-188 - Luc Dartois
Two-Way Parikh Automata with a Visibly Pushdown Stack. 189-206 - Amina Doumane, Denis Kuperberg, Damien Pous, Cécilia Pradic:
Kleene Algebra with Hypotheses. 207-223 - Jérémy Dubut
Trees in Partial Higher Dimensional Automata. 224-241 - Mnacho Echenim, Radu Iosif, Nicolas Peltier:
The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains. 242-259 - Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman:
Continuous Reachability for Unordered Data Petri Nets is in PTime. 260-276 - Daniel Hausmann
Optimal Satisfiability Checking for Arithmetic \mu -Calculi. 277-294 - Jasper Hugunin
Constructing Inductive-Inductive Types in Cubical Type Theory. 295-312 - Bart Jacobs, Aleks Kissinger, Fabio Zanasi
Causal Inference by String Diagram Surgery. 313-329 - Marie Kerjean
Higher-Order Distributions for Differential Linear Logic. 330-347 - Dietrich Kuske, Georg Zetzsche:
Languages Ordered by the Subword Order. 348-364 - Thomas Leventis, Michele Pagani:
Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces. 365-381 - Cristina Matache, Sam Staton:
A Sound and Complete Logic for Algebraic Effects. 382-399 - Stefan Milius, Henning Urbat:
Equational Axiomatization of Algebras with Structure. 400-417 - Christophe Lucas, Matteo Mio:
Towards a Structural Proof Theory of Probabilistic \mu -Calculi. 418-435 - Jakob Piribauer
Partial and Conditional Expectations in Markov Decision Processes with Integer Weights. 436-452 - Maciej Piróg
Equational Theories and Monads from Polynomial Cayley Representations. 453-469 - Cécilia Pradic, Colin Riba:
A Dialectica-Like Interpretation of a Linear MSO on Infinite Words. 470-487 - Helmut Seidl, Raphaela Palenta, Sebastian Maneth:
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time. 488-504 - Rob van Glabbeek:
Justness - A Completeness Criterion for Capturing Liveness Properties (Extended Abstract). 505-522 - Thorsten Wißmann
Path Category for Free - Open Morphisms from Coalgebras with Non-deterministic Branching. 523-540
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-07-17 01:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: