| Title/Authors | Title | Research Artifacts
[?] A research
artifact is any by-product of a research project that is not
directly included in the published research paper. In Computer
Science research this is often source code and data sets, but
it could also be media, documentation, inputs to proof
assistants, shell-scripts to run experiments, etc.
|
Details |
|---|
|
Symbolic execution and probabilistic reasoning Corina S. Pasareanu |
Symbolic execution and probabilistic reasoning Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Quotients in monadic programming: Projective algebras are equivalent to coalgebras Dusko Pavlovic, Peter-Michael Seidel |
Quotients in monadic programming: Projective algebras are equivalent to coalgebras Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Riesz Modal logic for Markov processes Matteo Mio, Robert Furber, Radu Mardare |
Riesz Modal logic for Markov processes Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Quantifiers on languages and codensity monads Mai Gehrke, Daniela Petrisan, Luca Reggio |
Quantifiers on languages and codensity monads Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Typability in bounded dimension Andrej Dudenhefner, Jakob Rehof |
Typability in bounded dimension Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
An interpretation of system F through bar recursion Valentin Blot |
An interpretation of system F through bar recursion Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
A convenient category for higher-order probability theory Chris Heunen, Ohad Kammar, Sam Staton, Hongseok Yang |
A convenient category for higher-order probability theory Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Definability of semidefinite programming and lasserre lower bounds for CSPs Anuj Dawar, Pengming Wang |
Definability of semidefinite programming and lasserre lower bounds for CSPs Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Strategy logic with imperfect information Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi |
Strategy logic with imperfect information Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
The pebbling comonad in Finite Model Theory Samson Abramsky, Anuj Dawar, Pengming Wang |
The pebbling comonad in Finite Model Theory Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
A categorical semantics for causal structure Aleks Kissinger, Sander Uijlen |
A categorical semantics for causal structure Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
First-order logic with counting Dietrich Kuske, Nicole Schweikardt |
First-order logic with counting Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Definability of summation problems for Abelian groups and semigroups Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa |
Definability of summation problems for Abelian groups and semigroups Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Constraint satisfaction problems over semilattice block Mal'tsev algebras Andrei A. Bulatov |
Constraint satisfaction problems over semilattice block Mal'tsev algebras Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Fully abstract encodings of λ-calculus in HOcore through abstract machines Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt |
Fully abstract encodings of λ-calculus in HOcore through abstract machines Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Understanding the complexity of #SAT using knowledge compilation Florent Capelli |
Understanding the complexity of #SAT using knowledge compilation Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Large scale geometries of infinite strings Bakh Khoussainov, Toru Takisaka |
Large scale geometries of infinite strings Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Enumeration reducibility in closure spaces with applications to logic and algebra Emmanuel Jeandel |
Enumeration reducibility in closure spaces with applications to logic and algebra Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Logics for continuous reachability in Petri nets and vector addition systems with states Michael Blondin, Christoph Haase |
Logics for continuous reachability in Petri nets and vector addition systems with states Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The limits of SDP relaxations for general-valued CSPs Johan Thapper, Stanislav Zivny |
The limits of SDP relaxations for general-valued CSPs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Constructive completeness for the linear-time μ-calculus Amina Doumane |
Constructive completeness for the linear-time μ-calculus Details |
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
|
Revisiting reachability in timed automata Karin Quaas, Mahsa Shirmohammadi, James Worrell |
Revisiting reachability in timed automata Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Cut-free completeness for modal mu-calculus Bahareh Afshari, Graham E. Leigh |
Cut-free completeness for modal mu-calculus Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The clocks are ticking: No more delays! Patrick Bahr, Hans Bugge Grathwohl, Rasmus Ejlers Møgelberg |
The clocks are ticking: No more delays! Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Other
Verification:
Authors have
verified
information
|
|
The real projective spaces in homotopy type theory Ulrik Buchholtz, Egbert Rijke |
The real projective spaces in homotopy type theory Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Thomas Place, Marc Zeitoun |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
An effectful way to eliminate addiction to dependence Pierre-Marie Pédrot, Nicolas Tabareau |
An effectful way to eliminate addiction to dependence Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Taichi Uemura |
Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Differentiation in logical form Abbas Edalat, Mehrdad Maleki |
Differentiation in logical form Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
A cartesian-closed category for higher-order model checking Martin Hofmann, Jérémy Ledent |
A cartesian-closed category for higher-order model checking Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Linear combinations of unordered data vectors Piotr Hofman, Jérôme Leroux, Patrick Totzke |
Linear combinations of unordered data vectors Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz |
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The Weisfeiler-Leman dimension of planar graphs is at most 3 Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer |
The Weisfeiler-Leman dimension of planar graphs is at most 3 Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Succinct progress measures for solving parity games Marcin Jurdzinski, Ranko Lazic |
Succinct progress measures for solving parity games Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Logic and regular cost functions Thomas Colcombet |
Logic and regular cost functions Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Quantitative semantics of the lambda calculus: Some generalisations of the relational model C.-H. Luke Ong |
Quantitative semantics of the lambda calculus: Some generalisations of the relational model Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Data structures for quasistrict higher categories Krzysztof Bar, Jamie Vicary |
Data structures for quasistrict higher categories Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
On strong determinacy of countable stochastic games Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak |
On strong determinacy of countable stochastic games Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
A type-theoretical definition of weak ω-categories Eric Finster, Samuel Mimram |
A type-theoretical definition of weak ω-categories Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
A fine-grained hierarchy of hard problems in the separated fragment Marco Voigt |
A fine-grained hierarchy of hard problems in the separated fragment Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Author has
verified
information
|
|
Foundations of information integration under bag semantics André Hernich, Phokion G. Kolaitis |
Foundations of information integration under bag semantics Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Algorithms for some infinite-state MDPs and stochastic games Kousha Etessami |
Algorithms for some infinite-state MDPs and stochastic games Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
On the extension of computable real functions Mathieu Hoyrup, Walid Gomaa |
On the extension of computable real functions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Capturing polynomial time using Modular Decomposition Berit Grußien |
Capturing polynomial time using Modular Decomposition Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Foundational nonuniform (Co)datatypes for higher-order logic Jasmin Christian Blanchette, Fabian Meier, Andrei Popescu, Dmitriy Traytel |
Foundational nonuniform (Co)datatypes for higher-order logic Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Timed pushdown automata and branching vector addition systems Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki |
Timed pushdown automata and branching vector addition systems Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens Ugo Dal Lago, Ryo Tanaka, Akira Yoshimizu |
The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Uniform, integral and efficient proofs for the determinant identities Iddo Tzameret, Stephen A. Cook |
Uniform, integral and efficient proofs for the determinant identities Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
MDPs with energy-parity objectives Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak |
MDPs with energy-parity objectives Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Infinitary intersection types as sequences: A new answer to Klop's problem Pierre Vial |
Infinitary intersection types as sequences: A new answer to Klop's problem Details |
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
|
Static analysis of deterministic negotiations Javier Esparza, Anca Muscholl, Igor Walukiewicz |
Static analysis of deterministic negotiations Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Untwisting two-way transducers in elementary time Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis |
Untwisting two-way transducers in elementary time Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Parity objectives in countable MDPs Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak |
Parity objectives in countable MDPs Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
On shift-invariant maximal filters and hormonal cellular automata Julien Cervelle, Grégory Lafitte |
On shift-invariant maximal filters and hormonal cellular automata Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
A monad for full ground reference cells Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton |
A monad for full ground reference cells Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Simone Bova, Fabio Mogavero |
Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Martin Zimmermann |
Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Descriptive Complexity for counting complexity classes Marcelo Arenas, Martin Muñoz, Cristian Riveros |
Descriptive Complexity for counting complexity classes Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The homomorphism problem for regular graph patterns Miguel Romero, Pablo Barceló, Moshe Y. Vardi |
The homomorphism problem for regular graph patterns Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
On the axiomatizability of quantitative algebras Radu Mardare, Prakash Panangaden, Gordon D. Plotkin |
On the axiomatizability of quantitative algebras Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker |
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Other
Verification:
Authors have
verified
information
|
|
Learning first-order definable concepts over structures of small degree Martin Grohe, Martin Ritzert |
Learning first-order definable concepts over structures of small degree Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
A crevice on the Crane Beach: Finite-degree predicates Michaël Cadilhac, Charles Paperman |
A crevice on the Crane Beach: Finite-degree predicates Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Stack semantics of type theory Thierry Coquand, Bassel Mannaa, Fabian Ruch |
Stack semantics of type theory Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Domains and event structures for fusions Paolo Baldan, Andrea Corradini, Fabio Gadducci |
Domains and event structures for fusions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Bounded time computation on metric spaces and Banach spaces Matthias Schröder, Florian Steinberg |
Bounded time computation on metric spaces and Banach spaces Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Regular separability of one counter automata Wojciech Czerwinski, Slawomir Lasota |
Regular separability of one counter automata Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Descriptive complexity of linear equation systems and applications to propositional proof complexity Martin Grohe, Wied Pakusa |
Descriptive complexity of linear equation systems and applications to propositional proof complexity Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Unrestricted stone duality for Markov processes Robert Furber, Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden |
Unrestricted stone duality for Markov processes Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The continuity of monadic stream functions Venanzio Capretta, Jonathan Fowler |
The continuity of monadic stream functions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
On delay and regret determinization of max-plus automata Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin |
On delay and regret determinization of max-plus automata Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The complexity of minimal inference problem for conservative constraint languages Michal Wrona |
The complexity of minimal inference problem for conservative constraint languages Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Effectful applicative bisimilarity: Monads, relators, and Howe's method Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy |
Effectful applicative bisimilarity: Monads, relators, and Howe's method Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Generalised species of rigid resource terms Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong |
Generalised species of rigid resource terms Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Lean and full congruence formats for recursion Rob J. van Glabbeek |
Lean and full congruence formats for recursion Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Equivalence of inductive definitions and cyclic proofs under arithmetic Stefano Berardi, Makoto Tatsuta |
Equivalence of inductive definitions and cyclic proofs under arithmetic Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Computing quantiles in Markov chains with multi-dimensional costs Christoph Haase, Stefan Kiefer, Markus Lohrey |
Computing quantiles in Markov chains with multi-dimensional costs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Common knowledge and multi-scale locality analysis in Cayley structures Felix Canavoi, Martin Otto |
Common knowledge and multi-scale locality analysis in Cayley structures Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Verification of randomized security protocols Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan |
Verification of randomized security protocols Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
A weakest pre-expectation semantics for mixed-sign expectations Benjamin Lucien Kaminski, Joost-Pieter Katoen |
A weakest pre-expectation semantics for mixed-sign expectations Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Partial derivatives on graphs for Kleene allegories Yoshiki Nakamura |
Partial derivatives on graphs for Kleene allegories Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
The logic of counting query answers Hubie Chen, Stefan Mengel |
The logic of counting query answers Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The primitivity of operators in the algebra of binary relations under conjunctions of containments Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht |
The primitivity of operators in the algebra of binary relations under conjunctions of containments Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Register automata with linear arithmetic Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu |
Register automata with linear arithmetic Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Joël Ouaknine |
Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Gödel logic: From natural deduction to parallel computation Federico Aschieri, Agata Ciabattoni, Francesco A. Genco |
Gödel logic: From natural deduction to parallel computation Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Polynomial automata: Zeroness and applications Michael Benedikt, Timothy Duff, Aditya Sharad, James Worrell |
Polynomial automata: Zeroness and applications Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Foundation for a series of efficient simulation algorithms Gérard Cécé |
Foundation for a series of efficient simulation algorithms Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Paul-André Melliès |
Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Bar induction: The good, the bad, and the ugly Vincent Rahli, Mark Bickford, Robert L. Constable |
Bar induction: The good, the bad, and the ugly Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Categorical liveness checking by corecursive algebras Natsuki Urabe, Masaki Hara, Ichiro Hasuo |
Categorical liveness checking by corecursive algebras Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Dual-context calculi for modal logic G. A. Kavvos |
Dual-context calculi for modal logic Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Decidability, complexity, and expressiveness of first-order logic over the subword ordering Simon Halfon, Philippe Schnoebelen, Georg Zetzsche |
Decidability, complexity, and expressiveness of first-order logic over the subword ordering Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|