default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th FoSSaCS@ETAPS 2023: Paris, France
- Orna Kupferman
, Pawel Sobocinski:
Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings. Lecture Notes in Computer Science 13992, Springer 2023, ISBN 978-3-031-30828-4 - Danel Ahman:
When Programs Have to Watch Paint Dry. 1-23 - Daniel Hirschkoff, Guilhem Jaber, Enguerrand Prebet:
Deciding Contextual Equivalence of ν-Calculus with Effectful Contexts. 24-45 - Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Kantorovich Functors and Characteristic Logics for Behavioural Distances. 46-67 - Zhibo Chen, Frank Pfenning:
A Logical Framework with Higher-Order Rational (Circular) Terms. 68-88 - Pedro H. Azevedo de Amorim:
A Higher-Order Language for Markov Kernels and Linear Operators. 89-112 - Max S. New, Daniel R. Licata:
A Formal Logic for Formal Category Theory. 113-134 - Rachid Echahed, Mnacho Echenim, Mehdi Mhalla, Nicolas Peltier:
A Strict Constrained Superposition Calculus for Graphs. 135-155 - Emmanuel Hainry, Romain Péchoux, Mário Silva:
A Programming Language Characterizing Quantum Polynomial Time. 156-175 - Mikhail R. Starchak:
On the Existential Arithmetics with Addition and Bitwise Minimum. 176-195 - Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki:
Coverability in 2-VASS with One Unary Counter is in NP. 196-217 - Aditya Prakash, K. S. Thejaswini:
On History-Deterministic One-Counter Nets. 218-239 - Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche:
Unboundedness Problems for Machines with Reversal-Bounded Counters. 240-264 - Marco Bernardo, Sabina Rossi:
Reverse Bisimilarity vs. Forward Bisimilarity. 265-284 - Amgad Rady, Franck van Breugel:
Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains. 285-307 - Jérémy Dubut, Thorsten Wißmann:
Weighted and Branching Bisimilarities from Generalized Open Maps. 308-327 - Ruben Turkenburg, Clemens Kupke, Jurriaan Rot, Ezra Schoen:
Preservation and Reflection of Bisimilarity via Invertible Steps. 328-348 - Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç:
Quantitative Safety and Liveness. 349-370 - Udi Boker, Guy Hefetz:
On the Comparison of Discounted-Sum Automata with Multiple Discount Factors. 371-391 - Lukás Holík, Juraj Síc, Lenka Turonová, Tomás Vojnar:
Fast Matching of Regular Patterns with Synchronizing Counting. 392-412 - Faezeh Labbaf, Jan Friso Groote, Hossein Hojjat, Mohammad Reza Mousavi:
Compositional Learning for Interleaving Parallel Automata. 413-435 - Gaëtan Douéneau-Tabot:
Pebble minimization: the last theorems. 436-455 - Aliaume Lopez:
Fixed Points and Noetherian Topologies. 456-476 - Quang Loc Le, Xuan-Bach Dinh Le:
An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic. 477-497 - Rob van Glabbeek:
Just Testing. 498-519 - Paul C. Attie, William Cocke:
Model and Program Repair via Group Actions. 520-540 - Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives. 541-560
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-01-23 20:36 CET 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:
