Nine Oxford papers accepted at LICS 2016!

Nine papers co-authored by members of the Oxford University Departement of Computer Science have been accepted at the 2016 Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), one of the top conferences in theoretical computer science, making Oxford account for over 10% of all accepted papers! The conference will be taking place in New York City in July.

More details available at http://lics.rwth-aachen.de/lics16/

The list of Oxford papers:

Martin C. Cooper and Stanislav Živný.
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns.

Michael Benedikt, Pierre Bourhis, Gabriele Puppis and Balder Ten Cate.
Querying Visible and Invisible Information

Michael Benedikt, Pierre Bourhis and Michael Vanden Boom.
A step up in expressiveness of decidable fixpoint logics.

Stefan Kiefer and A. Prasad Sistla.
Distinguishing Hidden Markov Chains.

Sam Staton, Hongseok Yang, Chris Heunen, Ohad Kammar and Frank Wood.
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints.

Joel Ouaknine, Amaury Pouly, Joao Sousa-Pinto and James Worrell.
Solvability of Matrix-Exponential Equations.

Ventsislav Chonev, Joel Ouaknine and James Worrell.
On Recurrent Reachability for Continuous Linear Dynamical Systems.

Takeshi Tsukada and Luke Ong.
Plays as Resource Terms via Non-idempotent Intersection Types

Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan and Georg Zetzsche.
Complexity of regular abstractions of one-counter languages