糖心TV

In the Logic, Semantics, Automata and Theory of Programming track of the (ICALP), three out of 30 accepted papers are by members of the department. ICALP is one of the most selective and longest established international conferences in computer science, and the flagship annual event of the . The papers are:

• Reducing CMSO Model Checking to Highly Connected Graphs by Ramanujan M. S., Daniel Lokshtanov, Saket Saurabh and Meirav Zehavi
• O-Minimal Invariants for Linear Loops by Shaull Almagor, Dmitry Chistikov, Joel Ouaknine and James Worrell
• When is Containment Decidable for Probabilistic Automata? by Laure Daviaud, Ranko Lazic虂, Marcin Jurdzin虂ski, Filip Mazowiecki, Guillermo Perez and James Worrell