Підписатись
David Monniaux
David Monniaux
Researcher in computer science, CNRS, VERIMAG
Підтверджена електронна адреса в univ-grenoble-alpes.fr - Домашня сторінка
Назва
Посилання
Посилання
Рік
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
9682003
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
7592005
The pitfalls of verifying floating-point computations
D Monniaux
ACM Transactions on Programming Languages and Systems (TOPLAS) 30 (3), 1-41, 2008
3152008
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
3072002
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
1992006
Abstract interpretation of probabilistic semantics
D Monniaux
International Static Analysis Symposium, 322-339, 2000
1382000
Abstracting cryptographic protocols with tree automata
D Monniaux
International Static Analysis Symposium, 149-163, 1999
1241999
Quantifier elimination by lazy model enumeration
D Monniaux
International Conference on Computer Aided Verification, 585-599, 2010
1092010
Pagai: A path sensitive static analyser
J Henry, D Monniaux, M Moy
Electronic Notes in Theoretical Computer Science 289, 15-25, 2012
1042012
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
982007
A quantifier elimination algorithm for linear real arithmetic
D Monniaux
International Conference on Logic for Programming Artificial Intelligence …, 2008
942008
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
752001
Automatic modular abstractions for linear constraints
DP Monniaux
ACM SIGPLAN Notices 44 (1), 140-151, 2009
682009
Cell morphing: From array programs to array-free horn clauses
D Monniaux, L Gonnord
International Static Analysis Symposium, 361-382, 2016
612016
A survey of satisfiability modulo theory
D Monniaux
Computer Algebra in Scientific Computing: 18th International Workshop, CASC …, 2016
592016
An abstract analysis of the probabilistic termination of programs
D Monniaux
International Static Analysis Symposium, 111-126, 2001
582001
Verification of device drivers and intelligent controllers: a case study
D Monniaux
Proceedings of the 7th ACM & IEEE international conference on Embedded …, 2007
522007
Abstracting cryptographic protocols with tree automata
D Monniaux
Science of Computer Programming 47 (2-3), 177-202, 2003
512003
Abstract interpretation of programs as Markov decision processes
D Monniaux
Science of Computer Programming 58 (1-2), 179-205, 2005
502005
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 Maiza
Proceedings of the 2014 SIGPLAN/SIGBED conference on Languages, compilers …, 2014
492014
У даний момент система не може виконати операцію. Спробуйте пізніше.
Статті 1–20