Skip to main content

LICS conference success


This year, a record 16 papers by members of the department have been accepted to the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017), one of the top conferences in theoretical computer science. Last year Oxford was represented on around 10% of LICS papers, this year it's approaching 20%!

LICS will be held in Reykjavik in June:

The papers are as follows:

Michael Blondin and Christoph Haase: Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States

Simone Bova and Fabio Mogavero: Herbrand Property, Finite Quasi-Herbrand Models, and a Chandra-Merlin Theorem for Quantified Conjunctive Queries

Lorenzo Clemente, Slawomir Lasota, Ranko Lazic and Filip Mazowiecki. Timed pushdown automata and branching vector addition systems

Johan Thapper and Stanislav Živný: The Limits of SDP Relaxations for General-Valued CSPs

G. A. Kavvos: Dual-Context Calculi for Modal Logic                                                                                    

Christoph Haase, Stefan Kiefer and Markus Lohrey: Computing Quantiles in Markov Chains with Multi-Dimensional Costs

Takeshi Tsukada, Kazuyuki Asada and Luke Ong: Generalised Species of Rigid Resource Terms

Karin Quaas, Mahsa Shirmohammadi and James Worrell: Revisiting Reachability in Timed Automata

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi and Dominik Wojtczak: Parity Objectives in Countable MDPs

Michael Benedikt, Timothy Duff, Aditya Sharad and James Worrell: Polynomial Automata: Zeroness and Applications

Ohad Kammar, Paul Blain Levy, Sean Moss and Sam Staton: A monad for full ground reference cells

Samson Abramsky, Anuj Dawar and Pengming Wang: The Pebbling Comonad in Finite Model Theory

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi and Dominik Wojtczak: On Strong Determinacy of Countable Stochastic Games

Chris Heunen, Ohad Kammar, Sam Staton and Hongseok Yang: A Convenient Category for Higher-Order Probability Theory

Krzysztof Bar and Jamie Vicary: Data structures for quasistrict higher categories

Michaël Cadilhac and Charles Paperman: A Crevice on the Crane Beach: Finite-Degree Predicates

Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo Perez, and Jean-Francois Raskin: On Delay and Regret Determinization of Max-Plus Automata