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.

News

Advanced Automata Theory Course at TU Kaiserslautern

May 2019

Damien Zufferey and Daniel Neider are co-teaching Advanced Automata Theory in summer 2019 at the University of Kaiserslautern.

Georg Zetzsche joins MPI-SWS

November 2018

Georg Zetzsche has joined the institute as a tenure-track faculty member. His research focuses on issues of decidability, complexity, synthesis, and expressiveness arising in program verification and mathematics.

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 receives 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.