Benedikt Bollig

October 31, 2019

Our technical report

​

Parameterized Synthesis for Fragments of First-Order Logic over Data Words

​

(with Béatrice Bérard, Mathieu Lehaut, and Nathalie Sznajder) is on arXiv.

October 27, 2019

The project

​

LeaRNNIfy: New Challenges for Recurrent Neural Networks and Grammatical Inference

​

with our partners Daniel Neider (MPI Kaiserslautern) and Martin Leucker (Universität Lübeck) has been accepted (Programme Procope 2020). Further information will follow soon.

September 29, 2019

Our paper

​

The Complexity of Flat Freeze LTL

​

(with Karin Quaas and Arnaud Sangnier) has been published in Logical Methods in Computer Science (special issue CONCUR'17).

January 26, 2019

Our paper

​

Identifiers in Registers - Describing Network Algorithms with Logic

​

(with Patricia Bouyer and Fabian Reiter) has been accepted for presentation at the 22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS).

September 06, 2018

For our paper

​

It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"

​

(with Marie Fortin and Paul Gastin), we received the best paper award at CONCUR'18. 

June 17, 2019

At the Journées annuelles du GT Vérif, I gave an invited presentation about our FoSSaCS'19 paper:

​

Identifiers in Registers - Describing Network Algorithms with Logic

January 20, 2019

At the CAALM workshop (Complexity, Algorithms, Automata and Logic Meet) in Chennai, India, I gave an invited presentation about our CONCUR'18 paper:

​

It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"​

March 07, 2018

I presented our paper

​

Communicating Finite-State Machines and Two-Variable Logic

​

in the Verification Seminar of the Department of Computer Science at the University of Oxford.

May 17, 2017

In our internal seminar, I presented the paper

​

The Complexity of Flat Freeze LTL.

January 25, 2017

I presented my FSTTCS'16 paper

​

One-Counter Automata with Counter Observability

​

in the Theory Group seminar at Queen Mary University of London.

September 05, 2016

At Highlights 2016, I gave a tutorial on

Automata and Logics for Distributed Systems.

​

The tutorial covers several models of distributed systems in a unifying framework.

September 25, 2019

With C. Aiswarya and S. Akshay, I am organizing GALA 2019: Gems of Automata, Logic and Algebra. The workshop, which is co-located with FSTTCS 2019, takes place on December 14, 2019, at the Indian Institute of Technology Bombay.

March 13, 2019

I serve on the Program Committee of the Second International Workshop on Recent Advances in Concurrency and Logic (RADICAL 2019), which is co-located with CONCUR'19.

March 11, 2019

The web site of the Digicosme Spring School on Formal Methods and Machine Learning (ForMaL) is online.

November 08, 2018

I will join the Program Committee of the 30th International Conference on Concurrency Theory (CONCUR'19), which takes place in Amsterdam, The Netherlands (August 26-31, 2019).

October 23, 2018

I will join the Program Committee of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS'19), which takes place in Aachen, Germany (August 26-31, 2019).

July 19, 2018

I co-organized (with Peter Habermehl) the 13th Summer School on Modelling and Verification of Parallel Processes (MOVEP'18).

March 13, 2018

I am on the Program Committee of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS'19), which takes place in Berlin, Germany (March 13-16, 2019).