معرفی
Laure Daviaud is an Associate Professor in the School of Computing Sciences at the University of East Anglia (UEA). She holds associate membership in the Algebra, Number Theory, Logic, and Representations (ANTLR) group and the Computational Biology team, and is a member of UEA's Data Science and AI initiatives. Her academic background includes a Doctor of Philosophy from IRIF - CNRS/Université de Paris, focusing on the asymptotic behavior of min-plus and max-plus automata (2014).
Her research interests center on Formal Verification, Automata Theory, Logic, Automata Learning, and Decidability. Recent work explores decidability questions in max-plus automata, probabilistic automata containment, and neural network analysis. She has contributed to quasi-polynomial lower bounds for parity games and the study of counting mechanisms in ReLU RNNs.
Current projects include the Engineering and Physical Sciences Research Council-funded 'Learning, Approximating and Minimising Streaming Automata for Large-scale Optimisation' (2023–2024). She collaborates internationally, including as a Visiting Research Fellow at City, University of London since 2023.
Her publications span over 25 peer-reviewed articles, with recent focus on weighted automata, max-plus algebra, and formal methods. She actively participates in program committees for conferences like ICALP and FoSSaCS, and delivers invited talks at events such as Highlights of Logic, Games and Automata.
