default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical 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. - Chia-Hsuan Lu, Tony Tan:
On two-variable guarded fragment logic with expressive local Presburger constraints. - Renato Acampora, Luca Geatti, Nicola Gigante, Angelo Montanari, Valentino Picotti:
Controller Synthesis for Timeline-based Games. - Thomas Seiller:
Zeta Functions and the (Linear) Logic of Markov Processes. - Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove:
Half-Positional Objectives Recognized by Deterministic Büchi Automata. - Bart Bogaerts, Balder ten Cate, Brett McLean, Jan Van den Bussche:
Preservation theorems for Tarski's relation algebra. - Lê Thành Dung Nguyên:
Simply typed convertibility is TOWER-complete even for safe lambda-terms. - Meena Mahajan, Gaurav Sood:
QBF Merge Resolution is powerful but unnatural. - Thiago Felicissimo, Frédéric Blanqui:
Sharing proofs with predicative theories through universe-polymorphic elaboration. - Simon Castellan, Pierre Clairambault:
Disentangling Parallelism and Interference in Game Semantics. - Lars Fritsche, Jens Kosiol, Alexander Lauer, Adrian Möller, Andy Schürr:
Advanced Model Consistency Restoration with Higher-Order Short-Cut Rules. - Danel Ahman, Matija Pretnar:
Higher-Order Asynchronous Effects. - Damien Pous, Jana Wagemaker:
Completeness Theorems for Kleene algebra with tests and top.
Volume 20, Number 4, October - December 2024
- Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke:
History-deterministic Timed Automata. - Iosif Petrakis, Max Zeuner:
Pre-measure spaces and pre-integration spaces in predicative Bishop-Cheng measure theory. - Robert Söldner, Detlef Plump:
Formalising the Double-Pushout Approach to Graph Transformation. - Tim Kräuter, Adrian Rutle, Harald König, Yngve Lamo:
A higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems. - Mario Bravetti, Julien Lange, Gianluigi Zavattaro:
Fair Asynchronous Session Subtyping. - Bas van den Heuvel, Jorge A. Pérez:
Asynchronous Session-Based Concurrency: Deadlock-freedom in Cyclic Process Networks. - Jean Goubault-Larrecq, Xiaodong Jia:
A cone-theoretic barycenter existence theorem. - Paul W. Wilson, Dan R. Ghica, Fabio Zanasi:
String diagrams for Strictification and Coherence. - Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Sum and Tensor of Quantitative Effects. - Dana Angluin, Dana Fisman:
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages. - Krishnendu Chatterjee, Laurent Doyen:
Stochastic Processes with Expected Stopping Time. - Roy Overbeek, Jörg Endrullis:
Termination of Graph Transformation Systems Using Weighted Subgraph Counting. - Vera Koponen, Felix Weitkämper:
On the relative asymptotic expressivity of inference frameworks. - Dominique Devriese, Eric Mark Martin, Marco Patrignani:
On the Semantic Expressiveness of Iso- and Equi-Recursive Types. - Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Reasonable Space for the ${\lambda}$-Calculus, Logarithmically. - Markus L. Schmid, Nicole Schweikardt:
Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners.
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 2024-12-17 21:02 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:
