David Monniaux

Registered user since Sat 23 May 2015

Name: David Monniaux

Bio: David Monniaux obtained his PhD in 2001 in Paris under Prof Patrick Cousot; his dissertation was on the static analysis of probabilistic programs by abstract interpretation. He then joined CNRS as a junior researcher and first worked on the Astrée static analyzer, still in Paris. In 2007 he transferred to VERIMAG in Grenoble, where he works on various aspects of program verification (decision procedures, abstract interpretation…).

He now is a senior researcher at CNRS and an adjunct professor at École polytechnique.

Affiliation: Grenoble Alps University / CNRS / Grenoble INP / VERIMAG

Personal website: http://www-verimag.imag.fr/~monniaux/

Research interests: program verification, abstract interpretation, satisfiability testing, quantifier elimination, logic, floating-point, embedded systems


POPL 2021 Committee Member in Program Committee within the POPL-track
SPLASH 2020 Author of Certified and Efficient Instruction Scheduling: Application to Interlocked VLIW Processors within the OOPSLA-track
Author of Certified and Efficient Instruction Scheduling within the Posters-track
VMCAI 2020 PC Member in Program Committee within the VMCAI 2020-track
POPL 2019 Author of Fast and exact analysis for LRU caches within the Research Papers-track
VMCAI 2017 Committee Member in Organizing Committee
Session Chair of Invited talk 1 (part of VMCAI)
Chair in Program committee
Session Chair of Concurrency 2 (part of VMCAI)
Program Co-Chair in Program Chairs within the VMCAI-track
VMCAI Author of Polyhedral Approximation of Multivariate Polynomials using Handelman’s Theorem within the VMCAI-track
Author of Program Analysis with Local Policy Iteration within the VMCAI-track
Session Chair of Hybrid and Timed Systems (part of VMCAI)
POPL 2016 Session Chair of Track 1: Learning and verification (part of Research Papers)
Committee Member in Program Committee within the Research Papers-track
Committee Member in Program Committee
PLDI 2015 Author of Synthesis of ranking functions using extremal counterexamples within the Research Papers-track