default search action
27th FoSSaCS@ETAPS 2024: Luxembourg City, Luxembourg - Part I
- Naoki Kobayashi, James Worrell:
Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14574, Springer 2024, ISBN 978-3-031-57227-2
Invited Talk
- Jérôme Leroux:
Ackermannian Completion of Separators. 3-10
Infinite Games
- Daniel Hausmann, Nir Piterman, Irmak Saglam, Anne-Kathrin Schmuck:
Fair ømega-Regular Games. 13-33 - Laurent Doyen, Pranshu Gaba, Shibashis Guha:
Stochastic Window Mean-Payoff Games. 34-54 - Daniel Hausmann, Mathieu Lehaut, Nir Piterman:
Symbolic Solution of Emerson-Lei Games for Reactive Synthesis. 55-78 - Pete Austin, Sougata Bose, Patrick Totzke:
Parity Games on Temporal Graphs. 79-98
Categorical Semantics
- Bart Jacobs:
Drawing from an Urn is Isometric. 101-120 - Alejandro Villoria, Henning Basold, Alfons Laarman:
Enriching Diagrams with Algebraic Operations. 121-143 - Fabian Birkmann, Henning Urbat, Stefan Milius:
Monoidal Extended Stone Duality. 144-165 - Dario Stein, Richard Samuelson:
Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory). 166-187
Automata and Synthesis
- Shaull Almagor, Neta Dafni:
Determinization of Integral Discounted-Sum Automata is Decidable. 191-211 - Aditya Prakash:
Checking History-Determinism is NP-hard for Parity Automata. 212-233 - Marek Jankola, Jan Strejcek:
Tighter Construction of Tight Büchi Automata. 234-255 - Orna Kupferman, Ofer Leshkowitz, Naama Shamash Halevy:
Synthesis with Privacy Against an Observer. 256-277
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.