Algorithms, Theory & Logic

The algorithms, theory, and logic theme encompasses our research into the mathematical underpinnings of computer science and the application of foundational ideas to concrete applications in many different areas of computer science. Our research spans both algorithms, decidability, and complexity as well as logic, semantics, and proof theory.


Research Spotlight: From Newton to Turing to cyber-physical systems

February 2018
MPI-SWS researchers are investigating what classes of infinite-state programs can be analyzed algorithmically by viewing computer programs abstractly as dynamical systems.

Amaury Pouly wins Ackermann Award

June 2017
Amaury Pouly has won the 2017 Ackermann Award, presented annually to the author of an exceptional doctoral dissertation in the area of computer science logic.

Advanced Automata Theory Course at TU Kaiserslautern

April 2017
Rupak Majumdar and Daniel Neider are co-teaching Advanced Automata Theory in summer 2017 at the University of Kaiserslautern.

Complexity Theory Course at TU Kaiserslautern

November 2016
Course Announcement: Complexity Theory. Rupak Majumdar is teaching Complexity Theory at the University of Kaiserslautern in the Winter 2016-17 semester.

Three MPI-SWS papers accepted to POPL'17

October 2016
The 44th ACM SIGPLAN Symposium on Principles of Programming Language will take place in Paris in January 2017.


Timed Temporal Logics.

Patricia Bouyer, François Laroussinie, Nicolas Markey, Joël Ouaknine, James Worrell.
Models, Algorithms, Logics and Tools 2017.