- 2019
- Aurore Alcolei, Pierre Clairambault, Olivier Laurent:
Resource-Tracking Concurrent Games. FoSSaCS 2019: 27-44 - Mario Alvarez-Picallo, C.-H. Luke Ong:
Change Actions: Models of Generalised Differentiation. FoSSaCS 2019: 45-61 - Simone Barlocco, Clemens Kupke
, Jurriaan Rot:
Coalgebra Learning via Duality. FoSSaCS 2019: 62-79 - Amir M. Ben-Amram, Geoff W. Hamilton:
Tight Worst-Case Bounds for Polynomial Loop Programs. FoSSaCS 2019: 80-97 - Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
A Complete Normal-Form Bisimilarity for State. FoSSaCS 2019: 98-114 - Benedikt Bollig, Patricia Bouyer, Fabian Reiter:
Identifiers in Registers - Describing Network Algorithms with Logic. FoSSaCS 2019: 115-132 - Michaël Cadilhac, Guillermo A. Pérez, Marie van den Bogaard:
The Impatient May Use Limited Optimism to Minimize Regret. FoSSaCS 2019: 133-149 - Simon Castellan, Nobuko Yoshida:
Causality in Linear Logic - Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment). FoSSaCS 2019: 150-168 - Thomas Colcombet, Nathanaël Fijalkow:
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. FoSSaCS 2019: 1-26 - Andrea Corradini, Tobias Heindel, Barbara König, Dennis Nolte, Arend Rensink:
Rewriting Abstract Structures: Materialization Explained Categorically. FoSSaCS 2019: 169-188 - Luc Dartois, Emmanuel Filiot, Jean-Marc Talbot:
Two-Way Parikh Automata with a Visibly Pushdown Stack. FoSSaCS 2019: 189-206 - Amina Doumane, Denis Kuperberg, Damien Pous, Cécilia Pradic:
Kleene Algebra with Hypotheses. FoSSaCS 2019: 207-223 - Jérémy Dubut:
Trees in Partial Higher Dimensional Automata. FoSSaCS 2019: 224-241 - Mnacho Echenim, Radu Iosif, Nicolas Peltier:
The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains. FoSSaCS 2019: 242-259 - Rob van Glabbeek:
Justness - A Completeness Criterion for Capturing Liveness Properties (Extended Abstract). FoSSaCS 2019: 505-522 - Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman:
Continuous Reachability for Unordered Data Petri Nets is in PTime. FoSSaCS 2019: 260-276 - Daniel Hausmann, Lutz Schröder:
Optimal Satisfiability Checking for Arithmetic \mu -Calculi. FoSSaCS 2019: 277-294 - Jasper Hugunin:
Constructing Inductive-Inductive Types in Cubical Type Theory. FoSSaCS 2019: 295-312 - Bart Jacobs, Aleks Kissinger, Fabio Zanasi:
Causal Inference by String Diagram Surgery. FoSSaCS 2019: 313-329 - Marie Kerjean, Jean-Simon Pacaud Lemay:
Higher-Order Distributions for Differential Linear Logic. FoSSaCS 2019: 330-347 - Dietrich Kuske, Georg Zetzsche:
Languages Ordered by the Subword Order. FoSSaCS 2019: 348-364 - Thomas Leventis, Michele Pagani:
Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces. FoSSaCS 2019: 365-381 - Christophe Lucas, Matteo Mio:
Towards a Structural Proof Theory of Probabilistic \mu -Calculi. FoSSaCS 2019: 418-435 - Cristina Matache, Sam Staton:
A Sound and Complete Logic for Algebraic Effects. FoSSaCS 2019: 382-399 - Stefan Milius, Henning Urbat:
Equational Axiomatization of Algebras with Structure. FoSSaCS 2019: 400-417 - Jakob Piribauer, Christel Baier:
Partial and Conditional Expectations in Markov Decision Processes with Integer Weights. FoSSaCS 2019: 436-452 - Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski:
Equational Theories and Monads from Polynomial Cayley Representations. FoSSaCS 2019: 453-469 - Cécilia Pradic, Colin Riba:
A Dialectica-Like Interpretation of a Linear MSO on Infinite Words. FoSSaCS 2019: 470-487 - Helmut Seidl, Raphaela Palenta, Sebastian Maneth:
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time. FoSSaCS 2019: 488-504 - Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata, Ichiro Hasuo:
Path Category for Free - Open Morphisms from Coalgebras with Non-deterministic Branching. FoSSaCS 2019: 523-540
