![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Logical Methods in Computer Science, Volume 19
Volume 19, Number 1, 2023
- Rocco De Nicola
, Hernán C. Melgratti
:
Multiparty testing preorders. - Richard Garner:
Stream processors and comodels. - Francesco Dagnino, Paola Giannini, Mariangiola Dezani-Ciancaglini
:
Deconfined Global Types for Asynchronous Sessions. - Purandar Bhaduri:
Coalgebras for Bisimulation of Weighted Automata over Semirings. - Igor Konnov, Marijana Lazic, Ilina Stoilkovska
, Josef Widder:
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker. - Giorgio Audrito, Roberto Casadei
, Ferruccio Damiani, Mirko Viroli:
Computation Against a Neighbour: Addressing Large-Scale Distribution and Adaptivity with Functional Programming and Scala. - Chad Nester:
Concurrent Process Histories and Resource Transducers. - Samuel Balco, Alexander Kurz:
Completeness of Nominal PROPs. - Milan Bankovic, Ivan Drecun, Filip Maric:
A proof system for graph (non)-isomorphism verification. - Dana Fisman, Dolav Nitay, Michal Ziv-Ukelson:
Learning of Structurally Unambiguous Probabilistic Grammars. - Petr Jancar
, Petr Osicka, Zdenek Sawa:
Countdown games, and simulation on (succinct) one-counter nets. - Frédéric Blanqui, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, François Thiré:
A modular construction of type theories. - Robin Piedeleu, Fabio Zanasi
:
A Finite Axiomatisation of Finite-State Automata Using String Diagrams. - Luca Aceto, Ian Cassar, Adrian Francalanza, Anna Ingólfsdóttir:
Bidirectional Runtime Enforcement of First-Order Branching-Time Properties. - Jos C. M. Baeten, Cesare Carissimo, Bas Luttik:
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. - Richard Mayr, Eric Munday:
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs. - Thanh-Hai Tran, Igor Konnov, Josef Widder:
A case study on parametric verification of failure detectors. - Mário S. Alvim, Bernardo Amorim, Sophia Knight, Santiago Quintero, Frank Valencia:
A Formal Model for Polarization under Confirmation Bias in Social Networks. - Deepak Kapur:
Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties. - Damien Busatto-Gaston
, Benjamin Monmege, Pierre-Alain Reynier:
Optimal controller synthesis for timed systems. - Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond:
A strong call-by-need calculus. - Massimo Bartoletti, Maurizio Murgia
, Roberto Zunino:
Sound approximate and asymptotic probabilistic bisimulations for PCTL.
Volume 19, Number 2, 2023
- Michael Shulman:
LNL polycategories and doctrines of linear logic. - Olaf Beyersdorff, Benjamin Böhm:
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution. - Martín Abadi, Gordon D. Plotkin:
Smart Choices and the Selection Monad. - Marc de Visme, Glynn Winskel:
Causal Unfoldings and Disjunctive Causes. - Dana Fisman, Hadar Frenkel, Sandra Zilles:
Inferring Symbolic Automata. - Marco Bernardo, Claudio Antares Mezzina:
Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach. - Bruno Dinis
, Étienne Miquey:
Stateful Realizers for Nonstandard Analysis. - Tom de Jong
, Martín Hötzel Escardó:
On Small Types in Univalent Foundations. - Jasmin Blanchette, Petar Vukmirovic:
SAT-Inspired Higher-Order Eliminations. - Jan Friso Groote
, Jan Martens
, Erik P. de Vink:
Lowerbounds for Bisimulation by Partition Refinement. - Anupam Das, Alex A. Rice:
Enumerating Independent Linear Inferences. - Steffen van Bakel:
Adding Negation to Lambda Mu. - Raven Beutner, Bernd Finkbeiner:
HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems. - Jan Dreier
:
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes. - Paolo Baldan, Richard Eggert, Barbara König, Tommaso Padoan:
Fixpoint Theory - Upside Down. - Tobias Runge, Tabea Bordis, Alex Potanin
, Thomas Thüm, Ina Schaefer:
Flexible Correct-by-Construction Programming. - Clemens Grabmayer:
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity.
Volume 19, Number 3, 2023
- Dieter Spreen, Ulrich Berger:
Computing with Infinite Objects: the Gray Code Case. - Valentina Castiglioni
, Michele Loreti, Simone Tini:
A framework to measure the robustness of programs in the unpredictable environment. - Simon Fowler
, Wen Kokke, Ornela Dardha, Sam Lindley
, J. Garrett Morris:
Separating Sessions Smoothly. - Peter Habermehl, Dietrich Kuske:
On Presburger arithmetic extended with non-unary counting quantifiers. - Thierry Coquand:
Reduction Free Normalisation for a proof irrelevant type of propositions. - Kexu Wang
, Shiguang Feng, Xishun Zhao:
Capturing the polynomial hierarchy by second-order revised Krom logic. - Denis Kuperberg:
Positive First-order Logic on Words and Graphs. - Michele Loreti, Michela Quadrini:
A Spatial Logic for Simplicial Models. - Franco Barbanera, Ivan Lanese, Emilio Tuosto:
A Theory of Formal Choreographic Languages. - Alexander Kozachinskiy:
Continuous Positional Payoffs. - Ahmet Kara
, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries. - Johannes Doleschal, Benny Kimelfeld, Wim Martens:
The Complexity of Aggregates over Extractions by Regular Expressions. - Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
A first-order logic characterization of safety and co-safety languages. - Samson Abramsky
, Luca Reggio
:
Arboreal Categories: An Axiomatic Theory of Resources. - Elena Di Lavore, Pawel Sobocinski:
Monoidal Width. - Cristina Feier, Carsten Lutz, Marcin Przybylko:
Answer Counting under Guarded TGDs.
Volume 19, Number 4, 2023
- Joseph W. N. Paulus
, Daniele Nantes-Sobrinho, Jorge A. Pérez:
Non-Deterministic Functions as Non-Deterministic Processes (Extended Version). - A. R. Balasubramanian
, Javier Esparza, Mikhail A. Raskin:
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. - Rojo Fanamperana Randrianomentsoa
, Hans van Ditmarsch
, Roman Kuznets
:
Impure Simplicial Complexes: Complete Axiomatization. - Antoine Amarilli, Charles Paperman:
Locality and Centrality: The Variety ZG. - Paulo Emílio de Vilhena, François Pottier:
Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library. - Léonard Brice, Marie van den Bogaard, Jean-François Raskin:
Subgame-perfect Equilibria in Mean-payoff Games (journal version). - Thomas Ehrhard:
A coherent differential PCF. - Udi Boker, Karoliina Lehtinen:
Token Games and History-Deterministic Quantitative-Automata. - Achim Blumensath:
The Power-Set Construction for Tree Algebras. - Nicolas Gagné, Prakash Panangaden:
A categorical characterization of relative entropy on standard Borel spaces. - Sergey Slavnov:
Making first order linear logic a generating grammar. - Dino Mandrioli, Matteo Pradella, Stefano Crespi-Reghizzi:
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages. - Laura Bocchi, Julien Lange
, Simon Thompson, A. Laura Voinea:
A model of actors and grey failures. - Kirstin Peters, Uwe Nestmann, Christoph Wagner:
FTMPST: Fault-Tolerant Multiparty Session Types. - Katrin Casel, Markus L. Schmid:
Fine-Grained Complexity of Regular Path Queries. - Edon Kelmendi:
Computing the Density of the Positivity Set for Linear Recurrence Sequences. - Gaetano Geck, Jens Keppeler, Thomas Schwentick, Christopher Spinrath:
Rewriting with Acyclic Queries: Mind Your Head. - Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Arena-Independent Finite-Memory Determinacy in Stochastic Games. - Antonio Abu Nassar, Shaull Almagor:
Simulation by Rounds of Letter-to-Letter Transducers. - Wim Martens, Matthias Niewerth, Tina Popp:
A Trichotomy for Regular Trail Queries. - Francesco Ciraulo:
Overlap Algebras as Almost Discrete Locales. - Andrej Dudenhefner
:
Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version). - Beniamino Accattoli:
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic. - Tobias Winkler, Christina Gehnen, Joost-Pieter Katoen:
Model Checking Temporal Properties of Recursive Probabilistic Programs. - Lê Thành Dung Nguyên, Lutz Straßburger:
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic. - David Fernández-Duque
, Yoàv Montacute
:
Dynamic Cantor Derivative Logic. - Gustav Grabolle
:
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings. - Wen Kokke, Ornela Dardha:
Prioritise the Best Variation. - Roberto Casadei, Stefano Mariani, Danilo Pianini
, Mirko Viroli, Franco Zambonelli:
Space-Fluid Adaptive Sampling by Self-Organisation. - Anne Broadbent, Martti Karvonen
:
Categorical composable cryptography: extended version. - Fredrik Dahlqvist, Renato Neves:
The syntactic side of autonomous categories enriched over generalised metric spaces. - Stepan L. Kuznetsov
:
Relational Models for the Lambek Calculus with Intersection and Constants. - Alain Finkel, Étienne Lozes:
Synchronizability of Communicating Finite State Machines is not Decidable. - Rémy Cerda, Lionel Vaux Auclair:
Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications. - Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche:
Existential Definability over the Subword Ordering. - Paul C. Bell, Pavel Semukhin:
Decision Questions for Probabilistic Automata on Small Alphabets. - Arnaldo Cesco, Roberto Gorrieri
:
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets. - Martin Raszyk, David A. Basin, Srdan Krstic, Dmitriy Traytel
:
Efficient Evaluation of Arbitrary Relational Calculus Queries. - Brecht Vandevoort, Bas Ketsman
, Christoph Koch, Frank Neven:
Robustness against Read Committed for Transaction Templates with Functional Constraints.
![](https://dblp.org/img/cog.dark.24x24.png)
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.