David Monniaux
David Monniaux
Researcher in computer science, CNRS, VERIMAG
Verified email at univ-grenoble-alpes.fr - Homepage
TitleCited byYear
A static analyzer for large safety-critical software
B Blanchet, P Cousot, R Cousot, J Feret, L Mauborgne, A Miné, ...
ACM SIGPLAN Notices 38 (5), 196-207, 2003
7632003
The ASTRÉE analyzer
P Cousot, R Cousot, J Feret, L Mauborgne, A Miné, D Monniaux, X Rival
European Symposium on Programming, 21-30, 2005
5242005
Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software
B Blanchet, P Cousot, R Cousot, J Feret, L Mauborgne, A Miné, ...
The essence of computation, 85-108, 2002
2522002
The pitfalls of verifying floating-point computations
D Monniaux
ACM Transactions on Programming Languages and Systems (TOPLAS) 30 (3), 12, 2008
2282008
Combination of abstractions in the ASTRÉE static analyzer
P Cousot, R Cousot, J Feret, L Mauborgne, A Miné, D Monniaux, X Rival
Annual Asian Computing Science Conference, 272-300, 2006
1362006
Abstract interpretation of probabilistic semantics
D Monniaux
International Static Analysis Symposium, 322-339, 2000
1152000
Abstracting cryptographic protocols with tree automata
D Monniaux
International Static Analysis Symposium, 149-163, 1999
1141999
A quantifier elimination algorithm for linear real arithmetic
D Monniaux
International Conference on Logic for Programming Artificial Intelligence …, 2008
772008
Quantifier elimination by lazy model enumeration
D Monniaux
International Conference on Computer Aided Verification, 585-599, 2010
722010
Pagai: A path sensitive static analyser
J Henry, D Monniaux, M Moy
Electronic Notes in Theoretical Computer Science 289, 15-25, 2012
692012
Varieties of static analyzers: A comparison with ASTRÉE
P Cousot, R Cousot, J Feret, M Antoine, L Mauborgne, D Monniaux, ...
First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software …, 2007
692007
An abstract Monte-Carlo method for the analysis of probabilistic programs
D Monniaux
arXiv preprint cs/0701195, 2007
652007
Automatic modular abstractions for linear constraints
D Monniaux
arXiv preprint arXiv:0811.0166, 2008
522008
Abstract interpretation of programs as Markov decision processes
D Monniaux
Science of Computer Programming 58 (1-2), 179-205, 2005
462005
Abstracting cryptographic protocols with tree automata
D Monniaux
Science of Computer Programming 47 (2-3), 177-202, 2003
452003
Using bounded model checking to focus fixpoint iterations
D Monniaux, L Gonnord
International Static Analysis Symposium, 369-385, 2011
412011
Automatic modular abstractions for template numerical constraints
D Monniaux
arXiv preprint arXiv:1005.4844, 2010
392010
Efficient generation of correctness certificates for the abstract domain of polyhedra
A Fouilhé, D Monniaux, M Périn
International Static Analysis Symposium, 345-365, 2013
352013
Verification of device drivers and intelligent controllers: a case study
D Monniaux
Proceedings of the 7th ACM & IEEE international conference on Embedded …, 2007
342007
How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics
J Henry, M Asavoae, D Monniaux, C Maïza
ACM SIGPLAN Notices 49 (5), 43-52, 2014
332014
The system can't perform the operation now. Try again later.
Articles 1–20