default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 21
Volume 21, Number 1, 2025
- Thomas Ehrhard, Guillaume Geoffroy:
Integration in Cones. - Claudio Antares Mezzina, Francesco Tiezzi, Nobuko Yoshida
:
Checkpoint-based rollback recovery in session programming. 2 - Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann:
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder. 3 - Javier Esparza, Michael Raskin, Christoph Welzel-Mohr:
Regular Model Checking Upside-Down: An Invariant-Based Approach. 4 - Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Complete and tractable machine-independent characterizations of second-order polytime. 5 - Andrea Esposito, Alessandro Aldini, Marco Bernardo, Sabina Rossi:
Noninterference Analysis of Reversible Systems: An Approach Based on Branching Bisimilarity. 6 - Francesco Dagnino, Fabio Pasquali:
Quantitative Equality in Substructural Logic via Lipschitz Doctrines. - Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. - Timo Camillo Merkl, Reinhard Pichler, Sebastian Skritek:
Diversity of Answers to Conjunctive Queries. - Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas:
Multi-Structural Games and Number of Quantifiers. - Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud:
Random Deterministic Automata With One Added Transition. - Aleksandar Milosavljevic, Robin Piedeleu, Fabio Zanasi:
Rewriting for Symmetric Monoidal Categories with Commutative (Co)Monoid Structure. - Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos:
Bisimilarity in fresh-register automata. - Benedikt Ahrens, Jacopo Emmenegger, Paige Randall North, Egbert Rijke:
Algebraic Presentations of Type Dependency. - Davide Trotta, Manlio Valenti, Valeria de Paiva:
Categorifying computable reducibilities. - Niels van der Weide:
The Formal Theory of Monads, Univalently. - Martin Muñoz, Cristian Riveros:
Constant-delay enumeration for SLP-compressed documents. - Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo:
A Simple Algorithm for Consistent Query Answering under Primary Keys. - Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Playing Stochastically in Weighted Timed Games to Emulate Memory. - Dohan Kim:
Congruence Closure Modulo Groups. - Diego Figueira, Rémi Morvan:
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries. - Davide Castelnovo, Marino Miculan:
On The Axioms Of $\mathcal{M},\mathcal{N}$-Adhesive Categories. - Anupam Das, Avgerinos Delkos:
Proof complexity of positive branching programs. - Martin Fränzle, Paul Kröger, Sarah Winter, Martin Zimmermann:
On the Existence of Reactive Strategies Resilient to Delay. - Oskar Fiuk, Emanuel Kieronski:
Alternating Quantifiers in Uniform One-Dimensional Fragments with an Excursion into Three-Variable Logic. - Petra van den Bos, Mariëlle Stoelinga:
With a little help from your friends: semi-cooperative games via Joker moves. - Wojciech Czerwinski, Piotr Hofman:
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable. - Antonio Casares, Pierre Ohlmann:
Characterising memory in infinite games. - Karl Bringmann, Nofar Carmeli:
Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries. - Bartosz Bednarczyk, Julien Grange:
About the Expressive Power and Complexity of Order-Invariance with Two Variables.
Volume 21, Number 2, 2025
- Nils Köpp, Iosif Petrakis:
Strong negation in the theory of computable functionals TCF. - Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç:
Safety and Liveness of Quantitative Properties and Automata. - Guy Avni, Pranav Ghorpade, Shibashis Guha:
A Game of Pawns. - Hans-Jörg Kreowski, Aaron Lye, Aljoscha Windhorst:
Moving a Derivation Along a Derivation Preserves the Spine in Adhesive Categories. - Adam D. Barwell, Ping Hou, Nobuko Yoshida, Fangyi Zhou:
Crash-Stop Failures in Asynchronous Multiparty Session Types. - Valentin Promies, Jasper Nalbach, Erika Ábrahám, Paul Kobialka:
FMplex: Exploring a Bridge between Fourier-Motzkin and Simplex. - Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph:
Decidability of Querying First-Order Theories via Countermodels of Finite Width. - Dan R. Ghica, Koko Muroya, Todd Waugh Ambridge:
A robust graph-based approach to observational equivalence. - Mario Román, Pawel Sobocinski:
String Diagrams for Premonoidal Categories. - Johannes Niederhauser, Nao Hirokawa, Aart Middeldorp:
Left-Linear Completion with AC Axioms. - Bart Jacobs:
Drawing with Distance. - Paul-André Melliès, Noam Zeilberger:
The categorical contours of the Chomsky-Sch\"utzenberger representation theorem. - Kostia Chardonnet, Marc de Visme, Benoît Valiron, Renaud Vilmart:
The Many-Worlds Calculus. - Shaleen Deep, Paraschos Koutris:
Ranked Enumeration of Conjunctive Query Results. - Emmanuel Paviot-Adet, Denis Poitrenaud, Etienne Renault, Yann Thierry-Mieg:
Structural Reductions and Stutter Sensitive Properties. - Stéphane Demri, Karin Quaas:
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures. - Sebastiaan A. Terwijn:
Completions of Kleene's second model. - Udi Boker, Guy Hefetz:
Discounted-Sum Automata with Multiple Discount Factors. - Laurent Doyen, Pranshu Gaba, Shibashis Guha:
Stochastic Window Mean-Payoff Games. - Hernán C. Melgratti, Claudio Antares Mezzina, G. Michele Pinna:
Relating Reversible Petri Nets and Reversible Event Structures, categorically. - Ruiwen Dong:
The Identity Problem in the special affine group of $\mathbb{Z}^2$. - Kenneth Gill:
Indivisibility and uniform computational strength. - Ahmet Kara, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Conjunctive Queries with Free Access Patterns under Updates. - Zhuan Khye Koh, Georg Loho:
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees. - Todd Schmid, Victoria Noquez, Lawrence S. Moss:
Fractals from Regular Behaviours. - Samuel Braunfeld, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
On first-order transductions of classes of graphs. - Benjamin Aminof, Sasha Rubin, Francesco Spegni, Florian Zuleger:
Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems. - Alejandro Alarcón Gonzalez, Niel Hens, Tim Leys, Guillermo A. Pérez:
Algorithms for Markov Binomial Chains. - Nao Hirokawa, Aart Middeldorp:
Hydra Battles and AC Termination.
Volume 21, Number 3, 2025
- Giovanni Fabbretti, Ivan Lanese, Jean-Bernard Stefani:
A Behavioral Theory for Distributed Systems with Weak Recovery.
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-08-10 21:20 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:
