| A static analyzer for large safety-critical software B Blanchet, P Cousot, R Cousot, J Feret, L Mauborgne, A Miné, ... Proceedings of the ACM SIGPLAN 2003 conference on Programming language …, 2003 | 949 | 2003 |
| The ASTRÉE analyzer P Cousot, R Cousot, J Feret, L Mauborgne, A Miné, D Monniaux, X Rival Programming Languages and Systems: 14th European Symposium on Programming …, 2005 | 732 | 2005 |
| 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: complexity, analysis, transformation, 85-108, 2002 | 311 | 2002 |
| The pitfalls of verifying floating-point computations D Monniaux ACM Transactions on Programming Languages and Systems (TOPLAS) 30 (3), 1-41, 2008 | 301 | 2008 |
| Combination of abstractions in the Astrée static analyzer P Cousot, R Cousot, J Feret, L Mauborgne, A Miné, D Monniaux, X Rival Advances in Computer Science-ASIAN 2006. Secure Software and Related Issues …, 2007 | 191 | 2007 |
| Abstract interpretation of probabilistic semantics D Monniaux International Static Analysis Symposium, 322-339, 2000 | 135 | 2000 |
| Abstracting cryptographic protocols with tree automata D Monniaux International Static Analysis Symposium, 149-163, 1999 | 125 | 1999 |
| Quantifier elimination by lazy model enumeration D Monniaux International Conference on Computer Aided Verification, 585-599, 2010 | 104 | 2010 |
| Pagai: A path sensitive static analyser J Henry, D Monniaux, M Moy Electronic Notes in Theoretical Computer Science 289, 15-25, 2012 | 103 | 2012 |
| 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 | 93 | 2007 |
| A quantifier elimination algorithm for linear real arithmetic D Monniaux International Conference on Logic for Programming Artificial Intelligence …, 2008 | 90 | 2008 |
| An abstract Monte-Carlo method for the analysis of probabilistic programs D Monniaux Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of …, 2001 | 71 | 2001 |
| Automatic modular abstractions for linear constraints DP Monniaux ACM SIGPLAN Notices 44 (1), 140-151, 2009 | 65 | 2009 |
| Cell morphing: From array programs to array-free horn clauses D Monniaux, L Gonnord International Static Analysis Symposium, 361-382, 2016 | 58 | 2016 |
| An abstract analysis of the probabilistic termination of programs D Monniaux International Static Analysis Symposium, 111-126, 2001 | 56 | 2001 |
| A survey of satisfiability modulo theory D Monniaux Computer Algebra in Scientific Computing: 18th International Workshop, CASC …, 2016 | 54 | 2016 |
| Abstracting cryptographic protocols with tree automata D Monniaux Science of Computer Programming 47 (2-3), 177-202, 2003 | 50 | 2003 |
| Abstract interpretation of programs as Markov decision processes D Monniaux Science of Computer Programming 58 (1-2), 179-205, 2005 | 49 | 2005 |
| 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 | 48 | 2013 |
| Verification of device drivers and intelligent controllers: a case study D Monniaux Proceedings of the 7th ACM & IEEE international conference on Embedded …, 2007 | 48 | 2007 |
Xavier RivalDirecteur de Recherche, INRIA在 inria.fr 的电子邮件经过验证
