×

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. (English) Zbl 1408.68009

Lecture Notes in Computer Science 11425. Cham: Springer (ISBN 978-3-030-17126-1/pbk; 978-3-030-17127-8/ebook). xv, 542 p., open access (2019).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1386.68002].
Indexed articles:
Colcombet, Thomas; Fijalkow, Nathanaël, Universal graphs and good for games automata: new tools for infinite duration games, 1-26 [Zbl 1528.91016]
Alcolei, Aurore; Clairambault, Pierre; Laurent, Olivier, Resource-tracking concurrent games, 27-44 [Zbl 1524.68181]
Alvarez-Picallo, Mario; Ong, C.-H. Luke, Change actions: models of generalised differentiation, 45-61 [Zbl 1524.68182]
Barlocco, Simone; Kupke, Clemens; Rot, Jurriaan, Coalgebra learning via duality, 62-79 [Zbl 1524.68158]
Ben-Amram, Amir M.; Hamilton, Geoff W., Tight worst-case bounds for polynomial loop programs, 80-97 [Zbl 1524.68075]
Biernacki, Dariusz; Lenglet, Sergueï; Polesiuk, Piotr, A complete normal-form bisimilarity for state, 98-114 [Zbl 1524.68209]
Bollig, Benedikt; Bouyer, Patricia; Reiter, Fabian, Identifiers in registers. Describing network algorithms with logic, 115-132 [Zbl 1524.68211]
Cadilhac, Michaël; Pérez, Guillermo A.; van den Bogaard, Marie, The impatient may use limited optimism to minimize regret, 133-149 [Zbl 1524.68159]
Castellan, Simon; Yoshida, Nobuko, Causality in linear logic. Full completeness and injectivity (unit-free multiplicative-additive fragment), 150-168 [Zbl 1524.03054]
Corradini, Andrea; Heindel, Tobias; König, Barbara; Nolte, Dennis; Rensink, Arend, Rewriting abstract structures: materialization explained categorically, 169-188 [Zbl 1524.68163]
Dartois, Luc; Filiot, Emmanuel; Talbot, Jean-Marc, Two-way Parikh automata with a visibly pushdown stack, 189-206 [Zbl 1524.68169]
Doumane, Amina; Kuperberg, Denis; Pous, Damien; Pradic, Pierre, Kleene algebra with hypotheses, 207-223 [Zbl 1524.68201]
Dubut, Jérémy, Trees in partial higher dimensional automata, 224-241 [Zbl 1524.68202]
Echenim, Mnacho; Iosif, Radu; Peltier, Nicolas, The Bernays-Schönfinkel-Ramsey class of separation logic on arbitrary domains, 242-259 [Zbl 1524.68084]
Gupta, Utkarsh; Shah, Preey; Akshay, S.; Hofman, Piotr, Continuous reachability for unordered data Petri nets is in PTime, 260-276 [Zbl 1524.68217]
Hausmann, Daniel; Schröder, Lutz, Optimal satisfiability checking for arithmetic \(\mu\)-calculi, 277-294 [Zbl 1524.68191]
Hugunin, Jasper, Constructing inductive-inductive types in cubical type theory, 295-312 [Zbl 1524.03013]
Jacobs, Bart; Kissinger, Aleks; Zanasi, Fabio, Causal inference by string diagram surgery, 313-329 [Zbl 1524.62060]
Kerjean, Marie; Pacaud Lemay, Jean-Simon, Higher-order distributions for differential linear logic, 330-347 [Zbl 1524.03055]
Kuske, Dietrich; Zetzsche, Georg, Languages ordered by the subword order, 348-364 [Zbl 1524.68175]
Leventis, Thomas; Pagani, Michele, Strong adequacy and untyped full-abstraction for probabilistic coherence spaces, 365-381 [Zbl 1524.68059]
Matache, Cristina; Staton, Sam, A sound and complete logic for algebraic effects, 382-399 [Zbl 1524.68060]
Milius, Stefan; Urbat, Henning, Equational axiomatization of algebras with structure, 400-417 [Zbl 1524.08003]
Lucas, Christophe; Mio, Matteo, Towards a structural proof theory of probabilistic \(\mu\)-calculi, 418-435 [Zbl 1524.03017]
Piribauer, Jakob; Baier, Christel, Partial and conditional expectations in Markov decision processes with integer weights, 436-452 [Zbl 1524.90336]
Piróg, Maciej; Polesiuk, Piotr; Sieczkowski, Filip, Equational theories and monads from polynomial Cayley representations, 453-469 [Zbl 1524.68061]
Pradic, Pierre; Riba, Colin, A Dialectica-like interpretation of a linear MSO on infinite words, 470-487 [Zbl 1429.03214]
Seidl, Helmut; Palenta, Raphaela; Maneth, Sebastian, Deciding equivalence of separated non-nested attribute systems in polynomial time, 488-504 [Zbl 1524.68166]
van Glabbeek, Rob, Justness. A completeness criterion for capturing liveness properties (extended abstract), 505-522 [Zbl 1524.68223]
Wißmann, Thorsten; Dubut, Jérémy; Katsumata, Shin-ya; Hasuo, Ichiro, Path category for free. Open morphisms from coalgebras with non-deterministic branching, 523-540 [Zbl 1524.68205]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Nxx Theory of software
68Qxx Theory of computing
00B25 Proceedings of conferences of miscellaneous specific interest

Citations:

Zbl 1386.68002