FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

A
Ahn, Ki Yung	Quasi-Open Bisimilarity with Mismatch is Intuitionistic
Akshay, S.	Distribution-based objectives for Markov Decision Processes
Allred, Joel	A Simple and Optimal Complementation Algorithm for Büchi Automata
Altenkirch, Thorsten	Free Higher Groups in Homotopy Type Theory
Asada, Kazuyuki	Species, Profunctors and Taylor Expansion Weighted by SMCC--A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs--
Atkey, Robert	The Syntax and Semantics of Quantitative Type Theory
Atserias, Albert	Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem
Awodey, Steve	Impredicative Encodings of (Higher) Inductive Types
B
Bacci, Giorgio	An algebraic theory of Markov processes Boolean-Valued Semantics for Stochastic Lambda-Calculus
Baier, Christel	Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes
Bertrand, Nathalie	Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes
Bickford, Mark	Computability Beyond Church-Turing via Choice Sequences
Birkedal, Lars	ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency
Blot, Valentin	Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types
Bodirsky, Manuel	A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
Bohrer, Brandon	A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow
Bojańczyk, Mikołaj	Definable decompositions for graphs of bounded linear cliquewidth On computability and tractability for infinite sets Regular and First Order List Functions
Boker, Udi	Automaton-Based Criteria for Membership in CTL
Bonchi, Filippo	Rewriting with Frobenius Sound up-to techniques and Complete abstract domains
Brazdil, Tomas	Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
Bruni, Roberto	Concurrency and Probability: Removing Confusion, Compositionally
Buchholtz, Ulrik	Cellular Cohomology in Homotopy Type Theory Higher Groups in Homotopy Type Theory
C
Carbin, Michael	Computable decision making on the reals and other spaces via partiality and nondeterminism
Castellan, Simon	The concurrent game semantics of Probabilistic PCF
Chatterjee, Krishnendu	Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
Chen, Yijia	Tree depth, quantifier elimination, and quantifier rank A parameterized halting problem, the linear time hierarchy, and the MRDP theorem
Cheung, Wai-Tak	The Geometry of Computation-Graph Abstraction
Chlipala, Adam	Computable decision making on the reals and other spaces via partiality and nondeterminism
Clairambault, Pierre	The concurrent game semantics of Probabilistic PCF
Cohen, Liron	Computability Beyond Church-Turing via Choice Sequences
Constable, Robert	Computability Beyond Church-Turing via Choice Sequences
Coquand, Thierry	Univalent Type Theory On Higher Inductive Types in Cubical Type Theory
Crary, Karl	Strong Sums in Focused Logic
Crubillé, Raphaëlle	Probabilistic stable functions on discrete cones are power series.
D
Danielski, Daniel	Unary negation fragment with equivalence relations has the finite model property
Dartois, Luc	Logics for Word Transductions with Synthesis
Das, Ankush	Work Analysis with Resource-Aware Session Types
Dave, Vrunda	Regular Transducer Expressions for Regular Transformations over infinite words
Daviaud, Laure	Regular and First Order List Functions A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games
de Silva, Nadish	Logical paradoxes in quantum computation
Demangeon, Romain	Causal Computational Complexity of Distributed Processes
Devriese, Dominique	Degrees of Relatedness - A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory
Dubslaff, Clemens	Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes
Durand, Arnaud	Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth
Durier, Adrien	Eager Functions as Processes
E
Eberhart, Clovis	What's in a game? A theory of game models
Esparza, Javier	One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata Verification of population protocols
F
Ferrère, Thomas	A Theory of Register Monitors
Figueira, Diego	Playing with Repetitions in Data Words Using Energy Games
Fijalkow, Nathanaël	The State Complexity of Alternating Automata
Filiot, Emmanuel	Logics for Word Transductions with Synthesis Rational Synthesis Under Imperfect Information
Flum, Jörg	Tree depth, quantifier elimination, and quantifier rank
Frey, Jonas	Impredicative Encodings of (Higher) Inductive Types
Fried, Dror	Sequential Relational Decomposition
Frumin, Dan	ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency
Furber, Robert	Boolean-Valued Semantics for Stochastic Lambda-Calculus
G
Gadducci, Fabio	Rewriting with Frobenius
Ganty, Pierre	Sound up-to techniques and Complete abstract domains
Gastin, Paul	Regular Transducer Expressions for Regular Transformations over infinite words
Gavazzo, Francesco	Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances
Gburek, Daniel	Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes
Genest, Blaise	Distribution-based objectives for Markov Decision Processes
Gentilini, Raffaella	Rational Synthesis Under Imperfect Information
Geoffroy, Guillaume	Classical realizability as a classifier for nondeterminism
Ghani, Neil	Compositional game theory
Ghica, Dan	The Geometry of Computation-Graph Abstraction
Giacobazzi, Roberto	Sound up-to techniques and Complete abstract domains
Grohe, Martin	Definable decompositions for graphs of bounded linear cliquewidth
Grädel, Erich	LICS Awards: The Kleene Award and the Test of Time Award
Guatto, Adrien	A Generalized Modality for Recursion
Głuch, Grzegorz	Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable.
H
Haak, Anselm	Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth
Hadzihasanovic, Amar	Two complete axiomatisations of pure-state qubit quantum computing
Hahn, Michael	Wreath Products of Distributive Forest Algebras
Harper, Robert	Guarded Computational Type Theory
Hedges, Jules	Compositional game theory
Henzinger, Thomas A	A Theory of Register Monitors
Hirschkoff, Daniel	Eager Functions as Processes
Hirschowitz, Tom	What's in a game? A theory of game models
Hoffmann, Jan	Work Analysis with Resource-Aware Session Types
Horne, Ross	Quasi-Open Bisimilarity with Mismatch is Intuitionistic
Hou Favonia, Kuen-Bang	Cellular Cohomology in Homotopy Type Theory
Hrushovski, Ehud	Polynomial Invariants for Affine Programs
Huber, Simon	On Higher Inductive Types in Cubical Type Theory
Hughes, Dominic	Unification nets: canonical proof net quantifiers
I
Idziak, Pawel	Satisfiability in multi-valued circuits
J
Jaskelioff, Mauro	Syntax and Semantics for Operations with Scopes
Jeandel, Emmanuel	A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics
Johann, Patricia	A General Framework for Relational Parametricity
Jurdzinski, Marcin	A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games
K
Kapron, Bruce	Type-two polynomial-time and restricted lookahead.
Kerjean, Marie	A Logical Account for Linear Partial Differential Equations
Kieronski, Emanuel	Unary negation fragment with equivalence relations has the finite model property
Kissinger, Aleks	Rewriting with Frobenius
Koskinen, Eric	A Fixpoint Logic and Dependent Effects for Temporal Property Verification
Kozen, Dexter	Boolean-Valued Semantics for Stochastic Lambda-Calculus
Kraus, Nicolai	Free Higher Groups in Homotopy Type Theory
Krebbers, Robbert	ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency
Krebs, Andreas	Wreath Products of Distributive Forest Algebras
Kretinsky, Jan	One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes
Krzaczkowski, Jacek	Satisfiability in multi-valued circuits
Kucera, Antonin	Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
Kuusisto, Antti	Weighted model counting beyond two-variable logic
König, Barbara	A van Benthem Theorem for Fuzzy Modal Logic
L
Laird, James	Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types
Laurent, Olivier	Around Classical and Intuitionistic Linear Logics
Lazic, Ranko	A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games
Legay, Axel	Sequential Relational Decomposition
Lehtinen, Karoliina	A modal mu perspective on solving parity games in quasipolynomial time.
Leventis, Thomas	Probabilistic Böhm Trees and Probabilistic Separation
Lhote, Nathan	Logics for Word Transductions with Synthesis
Lin, Shang-Wei	Quasi-Open Bisimilarity with Mismatch is Intuitionistic
Lindenhovius, Bert	Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams
Lutz, Carsten	Weighted model counting beyond two-variable logic
M
Madelaine, Florent	A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
Marcinkowski, Jerzy	Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable.
Mardare, Radu	An algebraic theory of Markov processes Boolean-Valued Semantics for Stochastic Lambda-Calculus
Martin, Ursula	On Diversity
Meggendorfer, Tobias	Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes
Melgratti, Hernan	Concurrency and Probability: Removing Confusion, Compositionally
Melliès, Paul-André	Ribbon tensorial logic An Asynchronous Soundness Theorem for Concurrent Separation Logic
Mio, Matteo	Riesz Modal Logic with Threshold Operators
Miquey, Étienne	A sequent calculus with dependent types for classical arithmetic
Mislove, Michael	Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams
Monin, Benoit	An answer to the Gamma question
Montanari, Ugo	Concurrency and Probability: Removing Confusion, Compositionally
Moss, Sean	Dialectica models of type theory
Mottet, Antoine	A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
Mueller, Moritz	A parameterized halting problem, the linear time hierarchy, and the MRDP theorem
Muroya, Koko	The Geometry of Computation-Graph Abstraction
Mörtberg, Anders	On Higher Inductive Types in Cubical Type Theory
N
Nanjo, Yoji	A Fixpoint Logic and Dependent Effects for Temporal Property Verification
Ng, Kang Feng	Two complete axiomatisations of pure-state qubit quantum computing
Niewerth, Matthias	MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
Novotný, Petr	Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
Nuyts, Andreas	Degrees of Relatedness - A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory
O
Ochremiak, Joanna	Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem
Ong, Luke	Species, Profunctors and Taylor Expansion Weighted by SMCC--A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs--
Ostropolski-Nalewaja, Piotr	Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable.
Ouaknine, Joel	Polynomial Invariants for Affine Programs Sequential Relational Decomposition
P
Palamidessi, Catuscia	The 2018 Alonzo Church Award for Outstanding Contributions to Logic and Computation
Panangaden, Prakash	An algebraic theory of Markov processes Boolean-Valued Semantics for Stochastic Lambda-Calculus
Paquet, Hugo	The concurrent game semantics of Probabilistic PCF
Pattinson, Dirk	A van Benthem Theorem for Fuzzy Modal Logic
Pavlovic, Dusko	Sound up-to techniques and Complete abstract domains
Perdrix, Simon	A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics
Pfenning, Frank	Work Analysis with Resource-Aware Session Types
Pierce, Benjamin C.	Remembering Martin Hofmann
Pilipczuk, Michał	On the number of types in sparse graphs Definable decompositions for graphs of bounded linear cliquewidth Parameterized circuit complexity of model-checking on sparse structures
Piróg, Maciej	Syntax and Semantics for Operations with Scopes
Platzer, André	A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow Differential Equation Axiomatization: The Impressive Power of Differential Ghosts
Plotkin, Gordon	An algebraic theory of Markov processes
Pouly, Amaury	Polynomial Invariants for Affine Programs
Pous, Damien	Allegories: decidability and graph homomorphisms
Powell, Thomas	A functional interpretation with state
Pradic, Pierre	LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic
Praveen, M.	Playing with Repetitions in Data Words Using Energy Games
R
Rahli, Vincent	Computability Beyond Church-Turing via Choice Sequences
Raskin, Jean-Francois	Rational Synthesis Under Imperfect Information
Riba, Colin	LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic
Rijke, Egbert	Higher Groups in Homotopy Type Theory
S
S, Krishna	Regular and First Order List Functions Regular Transducer Expressions for Regular Transformations over infinite words
Sangiorgi, Davide	Eager Functions as Processes
Sankur, Ocan	Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes
Sarac, N Ege	A Theory of Register Monitors
Schrijvers, Tom	Syntax and Semantics for Operations with Scopes
Schröder, Lutz	A van Benthem Theorem for Fuzzy Modal Logic
Sciarappa, Luke	Computable decision making on the reals and other spaces via partiality and nondeterminism
Scott, Dana	Boolean-Valued Semantics for Stochastic Lambda-Calculus
Shaulian, Yariv	Automaton-Based Criteria for Membership in CTL
Sherman, Benjamin	Computable decision making on the reals and other spaces via partiality and nondeterminism
Sickert, Salomon	One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata
Siebertz, Sebastian	On the number of types in sparse graphs Parameterized circuit complexity of model-checking on sparse structures
Sobocinski, Pawel	Rewriting with Frobenius
Sojakova, Kristina	A General Framework for Relational Parametricity
Speight, Sam	Impredicative Encodings of (Higher) Inductive Types
Stefanesco, Léo	An Asynchronous Soundness Theorem for Concurrent Separation Logic
Steinberg, Florian	Type-two polynomial-time and restricted lookahead.
Sterling, Jonathan	Guarded Computational Type Theory
Straubing, Howard	Wreath Products of Distributive Forest Algebras
T
Tan, Yong Kiam	Differential Equation Axiomatization: The Impressive Power of Differential Ghosts
Tannen, Val	Provenance Analysis for First-order Model Checking
Terauchi, Tachio	A Fixpoint Logic and Dependent Effects for Temporal Property Verification
Tiu, Alwen	Quasi-Open Bisimilarity with Mismatch is Intuitionistic
Toruńczyk, Szymon	On the number of types in sparse graphs Parameterized circuit complexity of model-checking on sparse structures On computability and tractability for infinite sets
Tsukada, Takeshi	Species, Profunctors and Taylor Expansion Weighted by SMCC--A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs--
U
Ultes-Nitsche, Ulrich	A Simple and Optimal Complementation Algorithm for Büchi Automata
Unno, Hiroshi	A Fixpoint Logic and Dependent Effects for Temporal Property Verification
V
van Doorn, Floris	Higher Groups in Homotopy Type Theory
Vardi, Moshe Y	Sequential Relational Decomposition Constraints, Graphs, Algebra, Logic, and Complexity
Velan, Dominik	Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
Vial, Pierre	Every λ-Term is Meaningful for the Infinitary Relational Model
Vignudelli, Valeria	Allegories: decidability and graph homomorphisms
Vilmart, Renaud	A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics
Vollmer, Heribert	Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth
von Glehn, Tamara	Dialectica models of type theory
Vyas, Nikhil	Distribution-based objectives for Markov Decision Processes
W
Wang, Quanlong	Two complete axiomatisations of pure-state qubit quantum computing
Wild, Paul	A van Benthem Theorem for Fuzzy Modal Logic
Winschel, Viktor	Compositional game theory
Winskel, Glynn	The concurrent game semantics of Probabilistic PCF
Worrell, James	Polynomial Invariants for Affine Programs
Wu, Nicolas	Syntax and Semantics for Operations with Scopes
Y
Yokoyama, Keita	A parameterized halting problem, the linear time hierarchy, and the MRDP theorem
Yoshida, Nobuko	Causal Computational Complexity of Distributed Processes
Z
Zahn, Philipp	Compositional game theory
Zamdzhiev, Vladimir	Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams
Zanasi, Fabio	Rewriting with Frobenius
Zeilberger, Noam	A theory of linear typings as flows on 3-valent graphs
Zetzsche, Georg	Separability by piecewise testable languages and downward closures beyond subwords
Zuleger, Florian	Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS

Disclaimer | Powered by EasyChair Smart Program