Skip to main content

Strong showing for Oxford at Logic in Computer Science conference


Four papers (co)-authored by Oxford computer scientists have been accepted to the Login in Computer Science (LICS 2012) conference.

The twenty-seventh annual ACM/IEEE LICS symposium will be held in June in Dubrovnik, Croatia.   This international forum covers topics that lie at the intersection of computer science and mathematical logic.   Details of the accepted papers are as follows:

  • Daniel Bundala, Joel Ouaknine and James Worrell. On the Magnitude of Completeness Thresholds in Bounded Model Checking
  • Bob Coecke, Ross Duncan, Aleks Kissinger and Quanlong Wang. Strong Complementarity and Non-locality in Categorical Quantum Mechanics
  • Serge Haddad, Sylvain Schmitz and Philippe Schnoebelen. The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets
  • Jamie Vicary. Higher Semantics of Quantum Protocols