default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 18
Volume 18, Number 1, 2022
- Federico Olimpieri, Lionel Vaux Auclair
:
On the Taylor expansion of λ-terms and the groupoid structure of their rigid approximants. - Antoine Amarilli, Ismail Ilkan Ceylan:
The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs. - Karoliina Lehtinen, Martin Zimmermann:
Good-for-games ω-Pushdown Automata. - Laura Nenzi, Ezio Bartocci, Luca Bortolussi, Michele Loreti:
A Logic for Monitoring Dynamic Networks of Spatially-distributed Cyber-Physical Systems. - Batya Kenig, Dan Suciu:
Integrity Constraints Revisited: From Exact to Approximate Implication. - Mathias Hülsbusch, Barbara König, Sebastian Küpper, Lara Stoltenow:
Conditional Bisimilarity for Reactive Systems. - Francesco Ciraulo:
σ-locales in Formal Topology. - Karoliina Lehtinen, Pawel Parys, Sven Schewe, Dominik Wojtczak:
A Recursive Approach to Solving Parity Games in Quasipolynomial Time. - Ankush Das, Frank Pfenning:
Rast: A Language for Resource-Aware Session Types. - Antonin Delpeuch, Jamie Vicary:
Normalization for planar string diagrams and a quadratic equivalence algorithm. - Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Games Where You Can Play Optimally with Arena-Independent Finite Memory. - Clifford Bergman, William J. DeMeo:
Universal Algebraic Methods for Constraint Satisfaction Problems. - Maaike Zwart, Dan Marsden:
No-Go Theorems for Distributive Laws. - Sebastian Biewer, Rayna Dimitrova, Michael Fries, Maciej Gazda, Thomas Heinze, Holger Hermanns, Mohammad Reza Mousavi:
Conformance Relations and Hyperproperties for Doping Detection in Time and Space. - Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen:
On the Axiomatisability of Parallel Composition. - Mai Gehrke, Tomas Jakl, Luca Reggio:
A duality theoretic view on limits of finite structures: Extended version. - Andrej Bauer, Anja Petkovic Komel:
An extensible equality checking algorithm for dependent type theories. - Andrew W. Swan:
On the Nielsen-Schreier Theorem in Homotopy Type Theory. - Benedikt Bollig, Alain Finkel, Amrita Suresh:
Bounded Reachability Problems are Decidable in FIFO Machines. - Hans van Ditmarsch, Tim French:
Quantifying over Boolean announcements. - Johannes Doleschal, Benny Kimelfeld, Wim Martens, Liat Peterfreund:
Weight Annotation in Information Extraction. - Massimo Bartoletti, Stefano Lande, Maurizio Murgia, Roberto Zunino:
Verifying liquidity of recursive Bitcoin contracts. - Basil Fürer, Andreas Lochbihler, Joshua Schneider, Dmitriy Traytel:
Quotients of Bounded Natural Functors. - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. - Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues:
Regular matching problems for infinite trees. - Mikolaj Bojanczyk, Michal Pilipczuk:
Optimizing tree decompositions in MSO. - Guram Bezhanishvili, Luca Carai, Patrick J. Morandi:
Duality for powerset coalgebras. - Thierry Coquand, Simon Huber, Christian Sattler:
Canonicity and homotopy canonicity for cubical type theory. - Joshua Moerman, Matteo Sammartino:
Residuality and Learning for Nondeterministic Nominal Automata. - Jérémy Dubut, Akihisa Yamada:
Fixed Points Theorems for Non-Transitive Relations. - Étienne André, Didier Lime, Olivier H. Roux:
Reachability and liveness in parametric timed automata. - Christophe Lucas, Matteo Mio:
Proof Theory of Riesz Spaces and Modal Riesz Spaces. - Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. - Martin Grohe, Peter Lindner:
Infinite Probabilistic Databases. - Dominique Larchey-Wendling, Yannick Forster:
Hilbert's Tenth Problem in Coq (Extended Version). - Robin Eßmann, Tobias Nipkow, Simon Robillard, Ujkan Sulejmani:
Verified Approximation Algorithms. - Dror Fried, Axel Legay, Joël Ouaknine, Moshe Y. Vardi:
Sequential Relational Decomposition. - Nikola Benes, Lubos Brim, Samuel Pastva, David Safránek:
BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs. - Dan Plyukhin, Gul Agha:
A Scalable Algorithm for Decentralized Actor Termination Detection. - Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser:
The Big-O Problem. - Mathieu Huot, Sam Staton, Matthijs Vákár:
Higher Order Automatic Differentiation of Higher Order Functions. - Szymon Torunczyk, Thomas Zeume:
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. - Jonathan Sterling, Carlo Angiuli, Daniel Gratzer:
A Cubical Language for Bishop Sets.
Volume 18, Number 2, 2022
- Sebastian Ullrich, Leonardo de Moura:
Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages. - Silvio Ghilardi, Alessandro Gianola, Deepak Kapur:
Uniform Interpolants in EUF: Algorithms using DAG-representations. - Seulkee Baek, Mario Carneiro, Marijn J. H. Heule:
A Flexible Proof Format for SAT Solver-Elaborator Communication. - Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco:
Gluing resource proof-structures: inhabitation and inverting the Taylor expansion. - Claudia Faggian:
Probabilistic Rewriting and Asymptotic Behaviour: on Termination and Unique Normal Forms. - Bas Ketsman, Dan Suciu, Yufei Tao:
A Near-Optimal Parallel Algorithm for Joining Binary Relations. - Arnaud Durand, Nicole Schweikardt, Luc Segoufin:
Enumerating Answers to First-Order Queries over Databases of Low Degree. - Farzaneh Derakhshan, Frank Pfenning:
Circular Proofs as Session-Typed Processes: A Local Validity Condition. - Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski:
Determinisability of register and timed automata. - Xavier Allamigeon, Ricardo D. Katz, Pierre-Yves Strub:
Formalizing the Face Lattice of Polyhedra. - Manuel Bodirsky, Johannes Greiner, Jakub Rydval:
Tractable Combinations of Temporal CSPs. - Michael Kompatscher:
CC-circuits and the expressive power of nilpotent algebras. - Mahsa Zarneshan, Fatemeh Ghassemi, Ehsan Khamespanah, Marjan Sirjani, John Hatcliff:
Specification and Verification of Timing Properties in Interoperable Medical Systems. - Antoine Amarilli, Michael Benedikt:
When Can We Answer Queries Using Result-Bounded Data Interfaces? - Marcelo P. Fiore, Andrew M. Pitts, S. C. Steenkamp:
Quotients, inductive types, and quotient inductive types. - Jonas Kastberg Hinrichsen, Jesper Bengtson, Robbert Krebbers:
Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation Logic. - Dominik Kirst, Dominique Larchey-Wendling:
Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens. - Makoto Hamana:
Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers. - Paul Wild, Lutz Schröder:
Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions. - Ester Livshits, Benny Kimelfeld:
The Shapley Value of Inconsistency Measures for Functional Dependencies. - Filippo Bonchi, Ana Sokolova, Valeria Vignudelli:
The Theory of Traces for Systems with Nondeterminism, Probability, and Termination. - Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Asynchronous wreath product and cascade decompositions for concurrent behaviours. - Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, Nathan Lhote:
Synthesis of Computable Regular Functions of Infinite Words.
Volume 18, Number 3, 2022
- Jim de Groot, Dirk Pattinson:
Modal meet-implication logic. - Thomas Ehrhard:
Differentials and distances in probabilistic coherence spaces. - André Hirschowitz, Tom Hirschowitz, Ambroise Lafont:
Modules over monads and operational semantics (expanded version). - Guram Bezhanishvili, Nick Bezhanishvili, Jim de Groot:
A Coalgebraic Approach to Dualities for Neighborhood Frames. - Bartosz Bednarczyk, Stéphane Demri:
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? - Jeff Erickson, Gabriel Nivasch, Junyan Xu:
Fusible numbers and Peano Arithmetic. - Eleni Bila, John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Modularising Verification Of Durable Opacity. - Eike Neumann:
Uniform Envelopes. - Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier:
Computability of Data-Word Transductions over Different Data Domains. - Giuseppe Della Penna, Benedetto Intrigila, Giulio Manzonetto:
Addressing Machines as models of lambda-calculus. - Michele Chiari, Dino Mandrioli, Matteo Pradella:
A First-Order Complete Temporal Logic for Structured Context-Free Languages. - Jaroslav Bendík, Ahmet Sencan, Ebru Aydin Gol, Ivana Cerná:
Timed Automata Robustness Analysis via Model Checking. - Suguman Bansal, Swarat Chaudhuri, Moshe Y. Vardi:
Comparator automata in quantitative verification. - Nathan Grosshans, Pierre McKenzie, Luc Segoufin:
Tameness and the power of programs over monoids in DA. - Ming Ng, Steven Vickers:
Point-free Construction of Real Exponentiation. - Bader Abu Radi, Orna Kupferman:
Minimization and Canonization of GFG Transition-Based Automata. - Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
One-Clock Priced Timed Games with Negative Weights. - Marta Bílková, Matej Dostál:
Moss' logic for ordered coalgebras. - Benjamin Bisping, David N. Jansen, Uwe Nestmann:
Deciding All Behavioral Equivalences at Once: A Game for Linear-Time-Branching-Time Spectroscopy. - Andrej Bauer:
Instance reducibility and Weihrauch degrees. - Hannes Diener, Matthew Hendtlass:
The Third Trick. - M. Clarence Protin, Gilda Ferreira:
Typability and Type Inference in Atomic Polymorphism. - Wilmer Ricciotti, James Cheney:
Strongly-Normalizing Higher-Order Relational Queries. - Franziskus Wiesnet, Nils Köpp:
Limits of real numbers in the binary signed digit representation. - Alexandr Kazda, Peter Mayr, Dmitriy Zhuk:
Small Promise CSPs that reduce to large CSPs. - Makai Mann, Ahmed Irfan, Alberto Griggio, Oded Padon, Clark W. Barrett:
Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays. - Luca Ciccone, Luca Padovani:
Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types. - Peng Fu, Kohei Kishida, Peter Selinger:
Linear Dependent Type Theory for Quantum Programming Languages. - Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The Theory of Universal Graphs for Infinite Duration Games. - Hugo Gimbert:
Distributed Asynchronous Games With Causal Memory are Undecidable. - Thorsten Wißmann:
Minimality Notions via Factorization Systems and Examples. - Alejandro Díaz-Caro, Octavio Malherbe:
Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model. - Hannes Saffrich, Peter Thiemann:
Relating Functional and Imperative Session Types. - Youyou Cong, Chiaki Ishio, Kaho Honda, Kenichi Asai:
A Functional Abstraction of Typed Invocation Contexts. - Andrew Polonsky, Richard Statman:
On sets of terms having a given intersection type. - Mirai Ikebuchi:
A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods. - Tom Hirschowitz, Ambroise Lafont:
A categorical framework for congruence of applicative bisimilarity in higher-order languages.
Volume 18, Number 4, 2022
- Matteo Acclavio, Ross Horne, Lutz Straßburger:
An Analytic Propositional Proof System on Graphs. - Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. - Antoine Amarilli, Benny Kimelfeld:
Uniform Reliability of Self-Join-Free Conjunctive Queries. - Marie Farrell, Rosemary Monahan, James F. Power:
Building Specifications in the Event-B Institution. - Maria Emilia Maietti, Samuele Maschio, Michael Rathjen:
Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice. - Thorsten Wißmann, Stefan Milius, Lutz Schröder:
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. - Nick Bezhanishvili, Vincenzo Ciancia, David Gabelaia, Gianluca Grilletti, Diego Latella, Mieke Massink:
Geometric Model Checking of Continuous Space. - Filippo Bonchi, Alessio Santamaria:
Convexity via Weak Distributive Laws. - Cameron Calk, Eric Goubault, Philippe Malbos, Georg Struth:
Algebraic coherent confluence and higher globular Kleene algebras. - Nick Bezhanishvili, Jim de Groot, Yde Venema:
Coalgebraic Geometric Logic: Basic Theory. - Piotr Hofman, Jakub Rózycki:
Linear equations for unordered data vectors in $[D]^k\to{}Z^d$. - Massimo Bartoletti, James Hsin-yu Chiang, Alberto Lluch-Lafuente:
A theory of Automated Market Makers in DeFi. - Benno van den Berg, Robert Paßmann:
Converse extensionality and apartness.
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-12 20:49 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:
