FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

A
Accattoli, Beniamino	Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic Reasonable Space for the Lambda-Calculus, Logarithmically
Ackerman, Nathanael	Computable PAC Learning of Continuous Features
Adamek, Jiri	Varieties of quantitative algebras and their monads
Ahrens, Benedikt	Semantics for two-dimensional type theory
Aiswarya, C.	On the Satisfiability of Context-free String Constraints with Subword Ordering
Antonelli, Melissa	Curry and Howard Meet Borel
Asada, Kazuyuki	Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings
Asilis, Julian	Computable PAC Learning of Continuous Features
Avanzini, Martin	Quantum Expectation Transformers for Cost Analysis
B
Baelde, David	Bouncing threads for circular and non-wellfounded proofs
Balaji, Nikhil	Identity testing for radical expressions
Barbarossa, Davide	Resource approximation for the lambda-mu-calculus
Barloy, Corentin	The Regular Languages of First-Order Logic with One Alternation
Barthe, Gilles	Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Baunsgaard Kristensen, Magnus	Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
Beohar, Harsh	Graded Monads and Behavioural Equivalence Games
Bergsträßer, Pascal	Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
Beutner, Raven	Deciding Hyperproperties Combined with Functional Specifications
Blondin, Michael	The complexity of soundness in workflow nets
Blot, Valentin	A direct computational interpretation of second-order arithmetic via update recursion
Bonacina, Ilario	On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
Bonet, Maria Luisa	On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
Bonnet, Édouard	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
C
Cadilhac, Michaël	The Regular Languages of First-Order Logic with One Alternation
Carral, David	Deciding Hyperproperties Combined with Functional Specifications
Chistikov, Dmitry	Geometric decision procedures and the VC dimension of linear arithmetic theories
Curzi, Gianluca	Cyclic Implicit Complexity
Czerwiński, Wojciech	The boundedness and zero isolation problems for weighted automata over nonnegative rationals Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes
D
Dagnino, Francesco	Logical Foundations of Quantitative Equality
Dal Lago, Ugo	Curry and Howard Meet Borel Reasonable Space for the Lambda-Calculus, Logarithmically
Dartois, Luc	Efficient Construction of Reversible Transducers from Regular Transducer Expressions
Das, Anupam	Cyclic Implicit Complexity
Dawar, Anuj	Separating LREC from LFP
de Felice, Giovanni	Monoidal Streams for Dataflow Programming
Delannoy, Remi	On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing
Di, Jieqi	Computable PAC Learning of Continuous Features
Di Lavore, Elena	Monoidal Streams for Dataflow Programming
Doumane, Amina	Bouncing threads for circular and non-wellfounded proofs
Doyen, Laurent	Stochastic Games with Synchronizing Objectives
Dreier, Jan	Treelike decompositions for transductions of sparse graphs Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
F
Ferreira Santos, Felipe	Separating LREC from LFP
Figueira, Diego	Reasoning on Data Words over Numeric Domains
Finkbeiner, Bernd	Deciding Hyperproperties Combined with Functional Specifications
Finster, Eric	A Type Theory for Strictly Unital Infinity-Categories
Ford, Chase	Graded Monads and Behavioural Equivalence Games
Freer, Cameron	Computable PAC Learning of Continuous Features
G
Gajarský, Jakub	Treelike decompositions for transductions of sparse graphs Stable graphs of bounded twin-width Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Ganardi, Moses	Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification The complexity of bidirected reachability in valence systems
Gastin, Paul	Efficient Construction of Reversible Transducers from Regular Transducer Expressions
Geoffroy, Guillaume	A first-order completeness result about characteristic Boolean algebras in classical realizability
Ghosh, Arka	Solvability of orbit-finite systems of linear equations
Govind, R.	Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods Efficient Construction of Reversible Transducers from Regular Transducer Expressions
Grabmayer, Clemens	Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete
Gratzer, Daniel	Normalization for Multimodal Type Theory
Grädel, Erich	Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics
Gutsfeld, Jens Oliver	Temporal Team Semantics Revisited
H
Haase, Christoph	Geometric decision procedures and the VC dimension of linear arithmetic theories
Heidemann, Lukas	Zigzag normalisation for associative n-categories
Helal, Hayyan	Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics
Herbreteau, Frédéric	Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
Hofman, Piotr	Solvability of orbit-finite systems of linear equations
Hofmann, Jana	Deciding Hyperproperties Combined with Functional Specifications
I
Idziak, Paweł	Complexity of Modular Circuits
J
Jacobs, Bart	Partitions and Ewens Distributions in element-free Probability Theory
K
Kavvos, G. A.	Syllepsis in Homotopy Type Theory
Kawałek, Piotr	Complexity of Modular Circuits
Kelmendi, Edon	Computing the Density of the Positivity Set for Linear Recurrence Sequences
Kiefer, Sandra	Treelike decompositions for transductions of sparse graphs
Kreutzer, Stephan	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Krzaczkowski, Jacek	Complexity of Modular Circuits
Krötzsch, Markus	Deciding Hyperproperties Combined with Functional Specifications
Kuperberg, Denis	Bouncing threads for circular and non-wellfounded proofs
Kupke, Clemens	Size measures and alphabetic equivalence in the mu-calculus
König, Barbara	Graded Monads and Behavioural Equivalence Games
L
Lasota, Sławomir	Solvability of orbit-finite systems of linear equations
Lefaucheux, Engel	The boundedness and zero isolation problems for weighted automata over nonnegative rationals
Li, Guanyan	Probabilistic Verification Beyond Context-Freeness
Lichter, Moritz	Choiceless Polynomial Time with Witnessed Symmetric Choice
Lin, Anthony Widjaja	Reasoning on Data Words over Numeric Domains Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
Lipton, Richard	On the Skolem Problem and the Skolem Conjecture
Liu, Junyi	Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Lopez, Aliaume	When Locality Meets Preservation
Luca, Florian	On the Skolem Problem and the Skolem Conjecture
M
Majumdar, Rupak	The complexity of bidirected reachability in valence systems
Mal, Soumodev	On the Satisfiability of Context-free String Constraints with Subword Ordering
Mansutti, Alessio	Geometric decision procedures and the VC dimension of linear arithmetic theories
Marti, Johannes	Size measures and alphabetic equivalence in the mu-calculus
Matache, Cristina	Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
Mazowiecki, Filip	The complexity of soundness in workflow nets The boundedness and zero isolation problems for weighted automata over nonnegative rationals
Meel, Kuldeep S.	On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing
Meier, Arne	Temporal Team Semantics Revisited
Melliès, Paul-André	A functorial excursion between algebraic geometry and linear logic
Milius, Stefan	Graded Monads and Behavioural Equivalence Games
Mio, Matteo	Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
Montacute, Yoàv	The Pebble-Relation Comonad in Finite Model Theory
Moser, Georg	Quantum Expectation Transformers for Cost Analysis
Moss, Sean	Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction) Probability monads with submonads of deterministic states
Mottet, Antoine	Smooth approximations and CSPs over finitely bounded homogeneous structures
Murawski, Andrzej	Probabilistic Verification Beyond Context-Freeness
Muscholl, Anca	Active learning for sound negotiations
Mählmann, Nikolas	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Møgelberg, Rasmus Ejlers	Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
N
Naaf, Matthias	Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics
Nieuwveld, Joris	On the Skolem Problem and the Skolem Conjecture
North, Paige	Semantics for two-dimensional type theory
Nosan, Klara	Identity testing for radical expressions
O
Offtermatt, Philip	The complexity of soundness in workflow nets
Ohlmann, Pierre	Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
Ohrem, Christoph	Temporal Team Semantics Revisited
Ong, Luke	Probabilistic Verification Beyond Context-Freeness
Orlikowski, Łukasz	Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes
Ouaknine, Joel	On the Skolem Problem and the Skolem Conjecture
P
Paperman, Charles	The Regular Languages of First-Order Logic with One Alternation
Pasquali, Fabio	Logical Foundations of Quantitative Equality
Perdrix, Simon	Quantum Expectation Transformers for Cost Analysis
Perrone, Paolo	Probability monads with submonads of deterministic states
Pilipczuk, Michał	Treelike decompositions for transductions of sparse graphs Stable graphs of bounded twin-width
Pinsker, Michael	Smooth approximations and CSPs over finitely bounded homogeneous structures
Pistone, Paolo	Curry and Howard Meet Borel
Place, Thomas	The amazing mixed polynomial closure and its applications to two-variable first-order logic
Purser, David	On the Skolem Problem and the Skolem Conjecture The boundedness and zero isolation problems for weighted automata over nonnegative rationals
Péchoux, Romain	Quantum Expectation Transformers for Cost Analysis
R
Reutter, David	Zigzag normalisation for associative n-categories
Reutter, David	A Type Theory for Strictly Unital Infinity-Categories
Rice, Alex	A Type Theory for Strictly Unital Infinity-Categories
Román, Mario	Monoidal Streams for Dataflow Programming
S
S, Krishna	Efficient Construction of Reversible Transducers from Regular Transducer Expressions
Saivasan, Prakash	On the Satisfiability of Context-free String Constraints with Subword Ordering
Sarkis, Ralph	Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
Saurin, Alexis	Bouncing threads for circular and non-wellfounded proofs
Schröder, Lutz	Graded Monads and Behavioural Equivalence Games
Schweitzer, Pascal	Choiceless Polynomial Time with Witnessed Symmetric Choice
Shah, Nihil	The Pebble-Relation Comonad in Finite Model Theory
Shirmohammadi, Mahsa	Identity testing for radical expressions
Simon, Pierre	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Sojakova, Kristina	Syllepsis in Homotopy Type Theory
Srivathsan, B	Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
Staton, Sam	Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
T
Toruńczyk, Szymon	Treelike decompositions for transductions of sparse graphs Stable graphs of bounded twin-width Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Tristan, Jean-Baptiste	Computable PAC Learning of Continuous Features
Tsukada, Takeshi	Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings
V
van der Weide, Niels	Semantics for two-dimensional type theory
Vanoni, Gabriele	Reasonable Space for the Lambda-Calculus, Logarithmically
Venema, Yde	Size measures and alphabetic equivalence in the mu-calculus
Vezzosi, Andrea	Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
Vicary, Jamie	Zigzag normalisation for associative n-categories A Type Theory for Strictly Unital Infinity-Categories
Vignudelli, Valeria	Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
Virtema, Jonni	Temporal Team Semantics Revisited
W
Walukiewicz, Igor	Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods Active learning for sound negotiations
Whiteland, Markus	The boundedness and zero isolation problems for weighted automata over nonnegative rationals
Wilke, Richard	Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics
Worrell, James	On the Skolem Problem and the Skolem Conjecture Identity testing for radical expressions
Y
Ying, Mingsheng	Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Z
Zamdzhiev, Vladimir	Quantum Expectation Transformers for Cost Analysis
Zetzsche, Georg	Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification The complexity of bidirected reachability in valence systems
Zeume, Thomas	The Regular Languages of First-Order Logic with One Alternation
Zhou, Li	Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs

Disclaimer | Powered by EasyChair Smart Program