default search action
Logical Methods in Computer Science, Volume 20
Volume 20, Number 1, 2024
- Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Depth lower bounds in Stabbing Planes for combinatorial principles. - Bineet Ghosh, Étienne André:
Offline and online energy-efficient monitoring of scattered uncertain logs using a bounding model. - Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. - Christel Baier, Jakob Piribauer, Robin Ziemek:
Foundations of probability-raising causality in Markov decision processes. - Delia Kesner, Loïc Peyrot, Daniel Ventura:
Node Replication: Theory And Practice. - Kiraku Shintani, Nao Hirokawa:
Compositional Confluence Criteria. - Thomas Powell:
Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language. - Sam van Gool, Adrien Guatto, George Metcalfe, Simon Santschi:
Deciding Equations in the Time Warp Algebra. - Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon:
Linear Programs with Conjunctive Database Queries. - Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe, Ten Years Later. - Laura Bocchi, Ivan Lanese, Claudio Antares Mezzina, Shoji Yuen:
revTPL: The Reversible Temporal Process Language. - Natanael Alpay, Peter Jipsen, Melissa Sugimoto:
Varieties of unary-determined distributive $\ell$-magmas and bunched implication algebras. - Dylan McDermott, Alan Mycroft:
Galois connecting call-by-value and call-by-name. - Leroy Chew, Friedrich Slivovsky:
Towards Uniform Certification in QBF. - Michael Blondin, Javier Esparza:
Separators in Continuous Petri Nets. - Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche:
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests. - Marcelo Fiore, Zeinab Galal, Hugo Paquet:
Stabilized profunctors and stable species of structures. - André Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi:
Variable binding and substitution for (nameless) dummies. - Marc Hermes, Dominik Kirst:
An Analysis of Tennenbaum's Theorem in Constructive Type Theory. - Renaud Vilmart:
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing. - Erich Grädel, Niels Lücking, Matthias Naaf:
Semiring Provenance for B\"uchi Games: Strategy Analysis with Absorptive Polynomials. - Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy:
Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise. - Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala:
The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete.
Volume 20, Number 2, 2024
- Francesco Dagnino, Francesco Gavazzo:
A Fibrational Tale of Operational Logical Relations: Pure, Effectful and Differential. - Christian Antic:
Boolean proportions. - Jamie Tucker-Foltz:
Inapproximability of Unique Games in Fixed-Point Logic with Counting. - Eduardo Bonelli, Delia Kesner, Andrés Viso:
A Strong Bisimulation for a Classical Term Calculus. - Anna Schmitt, Kirstin Peters, Yuxin Deng:
Encodability Criteria for Quantum Based Systems. - Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Executable First-Order Queries in the Logic of Information Flows. - Bartosz Bednarczyk:
Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features. - Damien Pous, Jurriaan Rot, Jana Wagemaker:
On Tools for Completeness of Kleene Algebra with Hypotheses. - Yoàv Montacute, Nihil Shah:
The Pebble-Relation Comonad in Finite Model Theory. - Emmanuel Jeandel, Simon Perdrix, Margarita Veshchezerova:
Addition and Differentiation of ZX-diagrams. - S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. - Benedikt Bollig, Alain Finkel, Amrita Suresh:
Branch-Well-Structured Transition Systems and Extensions. - Corina Cîrstea:
Linear-time logics - a coalgebraic perspective. - Mitsumasa Ikeda, Yoriyuki Yamagata, Takayuki Kihara:
On the Metric Temporal Logic for Continuous Stochastic Processes. - Michele Boreale, Luisa Collodi, Daniele Gorla:
An implicit function theorem for the stream calculus. - Andreas Nuyts, Dominique Devriese:
Transpension: The Right Adjoint to the Pi-type. - Sewon Park, Franz Brauße, Pieter Collins, SunYoung Kim, Michal Konecný, Gyesik Lee, Norbert Th. Müller, Eike Neumann, Norbert Preining, Martin Ziegler:
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation. - Liron Cohen, Vincent Rahli:
$\text{TT}^{\Box}_{\mathcal C}$: a Family of Extensional Type Theories with Effectful Realizers of Continuity. - Daniel Silva Graça, Ning Zhong:
Robust non-computability of dynamical systems and computability of robust dynamical systems.
Volume 20, Number 3, 2024
- Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
On the Satisfiability of Local First-Order Logics with Data. - S. Akshay, Paul Gastin, R. Govind, B. Srivathsan:
Simulations for Event-Clock Automata. - Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt:
Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines. - Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. - Thomas Neele, Jaco van de Pol:
Operations on Fixpoint Equation Systems. - Alexander Kurz, Wolfgang Poiger, Bruno Teheux:
Many-valued coalgebraic logic over semi-primal varieties. - Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory. - Adam Ó Conghaile, Anuj Dawar:
Game Comonads & Generalised Quantifiers. - Daniel Hausmann, Lutz Schröder:
Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi. - José Espírito Santo, Delia Kesner, Loïc Peyrot:
A Faithful and Quantitative Notion of Distant Reduction for the Lambda-Calculus with Generalized Applications. - Roland Glück:
Isolated Suborders and their Application to Counting Closure Operators. - Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey O. Shallit:
Decidability for Sturmian words. - Dimitrios Kouzapas, Ramunas Gutkovas, A. Laura Voinea, Simon J. Gay:
A Session Type System for Asynchronous Unreliable Broadcast Communication. - Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Anna Ingólfsdóttir:
Complexity results for modal logic with recursion via translations and tableaux. - Olivier Carton, Sylvain Perifel:
Deterministic pushdown automata can compress some normal sequences.
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.