HIGHLIGHTS 2018: HIGHLIGHTS OF LOGIC, GAMES AND AUTOMATA

A
Abboud, Amir	Fine-Grained Complexity and Hardness in P
Amrane, Amazigh	Logic and rational languages of scattered and countable series-parallel posets
Ashok, Pranav	Continuous-Time Markov Decisions based on Partial Exploration
B
Berkholz, Christoph	Interactions Between Proof Complexity and Finite Model Theory (part 1) Interactions Between Proof Complexity and Finite Model Theory (part 2)
Berthon, Raphaël	Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes
Bojanczyk, Mikolaj	Regular and First Order List Functions
Brunet, Paul	Bracket Algebras: a nominal theory of interleaved scopes
Bulatov, Andrei	The Complexity of Constraints: Dichotomies and Beyond
Busatto-Gaston, Damien	Symbolic Approximation of Weighted Timed Games
C
Cadilhac, Michaël	Weak Cost Register Automata are Still Powerful
Cheval, Vincent	DEEPSEC: Deciding Equivalence Properties in Security Protocols Theory and Practice
Clemente, Lorenzo	Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
Colcombet, Thomas	Universal parity graphs and lower bounds for parity games
Czerwiński, Wojciech	The Reachability Problem for Vector Addition Systems is Not Elementary
D
Daviaud, Laure	Solving mean-payoff parity games in pseudo-quasi-polynomial time.
Descotte, Maria Emilia	Resynchronizing Classes of Word Relations
Doyen, Laurent	Graph Planning with Expected Finite Horizon
E
Exibard, Léo	Automatic Synthesis of Systems with Data
F
Fortin, Marie	It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"
Frochaux, André	An Optimal Construction for the Barthelmann-Schwentick Normal Form on Classes of Structures of Bounded Degree
G
Ganty, Pierre	Algorithms for inclusion into a regular language
Gaubert, Stéphane	Nonarchimedean Convex Programming and Its Relation to Mean-Payoff Games
Godin, Thibault	A new hierarchy for automaton semigroups
Goeminne, Aline	Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives
Gool, Samuel J. V.	Pointlike sets for varieties determined by groups
Guha, Shibashis	Safe and Optimal Scheduling of Hard and Soft Tasks
Guillon, Bruno	Determinizing two-way automata with linear-time Turing machines
H
Hausmann, Daniel	Permutation Games for the Weakly Aconjunctive mu-Calculus
I
Iosti, Simon	Eventually safe languages and Good-for-Games automata
J
Jamroga, Wojtek	Towards Partial Order Reductions for Strategic Ability
Jecker, Ismaël	A Ramsey Theorem for semigroups
K
Kara, Ahmet	Counting Triangles under Updates in Worst-Case Optimal Time
Katoen, Joost-Pieter	Principles of Probabilistic Programming
Kelmendi, Edon	Expressing Unboudedness in MSO + nabla
Keppeler, Jens	Answering UCQs under updates
Kersting, Kristian	The Automatic Data Scientist: Making Data Science Easier using High-level Languages, Fractional Automorphisms, and Arithmetic Circuits
Kiefer, Sandra	Distinguishing Graphs via Logics with Counting
Kiefer, Stefan	Efficient analysis of probabilistic systems that accumulate quantities
Kovács, Laura	Symbol Elimination for Program Analysis
Kuperberg, Denis	Is your automaton good for playing games ?
Köcher, Chris	Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid
Křetínský, Jan	A Journey from LTL to Your Favourite Automaton
L
Lehtinen, Karoliina	Solving parity games in quasi-polynomial time -- a logician's approach
Leroux, Jérôme	Polynomial Vector Addition Systems With States
Lhote, Nathan	Observation synthesis for games with imperfect information
M
Martinov, Emanuel	Reachability for Branching Concurrent Stochastic Games
Maubert, Bastien	Reasoning about Knowledge and Strategies
Mazowiecki, Filip	Pumping lemmas for weighted automata
Mazzocchi, Nicolas	A Pattern Logic for Automata with Outputs
Meggendorfer, Tobias	Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes
Meyer, Philipp J.	Strix: Explicit Reactive Synthesis Strikes Back!
Michaliszyn, Jakub	What can you expect of a weighted automaton?
Michielini, Vincent	Uniformization Problem for Variants of First Order Logic over Words
Muskalla, Sebastian	Regular separability of WSTS
N
Neider, Daniel	Learning Linear Temporal Properties
O
Ochremiak, Joanna	Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
Ohlmann, Pierre	Characterization of non-associative circuits using automata, and applications
Olteanu, Dan	Learning Models over Relational Databases
P
Parker, David	Probabilistic Model Checking: Advances and Applications
Parys, Paweł	Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
Pirogov, Anton	A unified approach to Büchi determinisation
Piórkowski, Radosław	Decidability in data Petri nets — a conjecture.
Popova, Svetlana	Non-convergence in existential monadic second order logic of random graphs
Pouly, Amaury	Continuous Models of Computation: Computability, Complexity, Universality
Przybyłko, Marcin	On Computing the Measures of First-Order Definable Sets of Trees
Purser, David	Bisimilarity Distances for Approximate Differential Privacy
Q
Quaas, Karin	The Containment Problem for Unambiguous Register Automata
R
Rabinovich, Roman	Gralog, a visual tool for working with graphs, games, automata, logics
S
S, Krishna	Regular Transducer Expressions for Regular Transformations
Salamanca, Julian	Abstract MSO languages over monads
Schweikardt, Nicole	Constant Delay Enumeration of Query Results
Shallit, Jeffrey	Finite Automata and Additive Number Theory
Shirmohammadi, Mahsa	Costs and Rewards in Priced Timed Automata
Skrzypczak, Michał	Unambiguous languages exhaust the index hierarchy
Srivathsan, B	Reachability in timed automata with diagonal constraints
T
Totzke, Patrick	Universal Safety for Timed Petri Nets is PSPACE-complete
Tzevelekos, Nikos	Polynomial-time equivalence testing for deterministic fresh-register automata
U
Urbat, Henning	Eilenberg Theorems for Free
V
Van Den Bogaard, Marie	Beyond Admissibility: Rationality in Quantitative Games
van Dijk, Tom	Solving parity games with tangles
Verbitsky, Oleg	On the First-Order Complexity of Subgraph Isomorphism
Vortmeier, Nils	Reachability and Distances under Multiple Changes
W
Weinert, Alexander	Parity Games with Weights
Wißmann, Thorsten	Efficient and Modular Coalgebraic Partition-Refinement
Worrell, James	Algebraic Invariants for Affine Programs
Y
Yamakami, Tomoyuki	The Linear Space Hypothesis and Its Close Connection to Two-Way Finite Automata
Z
Zetzsche, Georg	Unboundedness problems for languages of vector addition systems
Zeume, Thomas	Introduction to Iltis: An Interactive, Web-Based System for Teaching Logic
Zimmermann, Martin	Synthesizing Optimally Resilient Controllers
Zuleger, Florian	Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS

Disclaimer | Powered by EasyChair Smart Program