2,232 reputation
11 17

Michael Blondin

I am a Ph.D. student in complexity theory and formal verification at the ENS Cachan and the Université de Montréal under the direction of Alain Finkel and Pierre McKenzie. I am interested in computational complexity theory, in particular in the context of formal verification and automata theory. I am also interested in the role that algebra plays within these fields. My recent work deals with reachability problems in infinite state systems such as vector addition systems and well-structured transition systems.

Top Tags (29)

Score 94
Posts 7
Posts % 44
Score 50
Posts 2
Score 36
Posts 2
Score 34
Posts 2
Score 29
Posts 3
Score 29
Posts 3

Top Posts (16) All Questions Answers | Votes Newest

View all questions and answers

Badges (28)

Gold
Silver 11

Rarest

Bronze 17

Rarest