| Abstract acceleration of general linear loops | 20 | 0.70 | 2014 |
| Relational interprocedural verification of concurrent programs | 15 | 0.73 | 2013 |
| Inferring Effective Types for Static Analysis of C Programs | 0 | 0.34 | 2012 |
| From hybrid data-flow languages to hybrid automata: a complete translation | 8 | 0.50 | 2012 |
| Applying abstract acceleration to (co-)reachability analysis of reactive programs | 3 | 0.37 | 2012 |
| Logico-numerical abstract acceleration and application to the verification of data-flow programs | 8 | 0.44 | 2011 |
| Precise interprocedural analysis in the presence of pointers to the stack | 4 | 0.42 | 2011 |
| Policy iteration within logico-numerical abstract domains | 8 | 0.46 | 2011 |
| Widening with thresholds for programs with complex control graphs | 16 | 0.64 | 2011 |
| Some Experience on the Software Engineering of Abstract Interpretation Tools | 5 | 0.42 | 2010 |
| Concrete Memory Models for Shape Analysis | 2 | 0.36 | 2010 |
| Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs | 7 | 0.46 | 2010 |
| Combining control and data abstraction in the verification of hybrid systems. | 0 | 0.34 | 2009 |
| Apron: A Library of Numerical Abstract Domains for Static Analysis | 194 | 4.73 | 2009 |
| Automatic test generation from interprocedural specifications | 4 | 0.41 | 2007 |
| Lattice automata: a representation for languages on infinite alphabets, and some applications to verification | 11 | 0.55 | 2007 |
| Verification of communication protocols using abstract interpretation of FIFO queues | 13 | 0.67 | 2006 |
| Model-Based Test Selection for Infinite-State Reactive Systems | 3 | 0.38 | 2006 |
| Contrôle de systèmes symboliques, discrets ou hybrides | 0 | 0.34 | 2006 |
| Symbolic test selection based on approximate analysis | 43 | 1.82 | 2005 |
| A relational approach to interprocedural shape analysis | 28 | 1.18 | 2004 |
| Abstracting Call-Stacks for Interprocedural Verification of Imperative Programs | 15 | 0.89 | 2004 |
| From Safety Verification to Safety Testing | 10 | 0.75 | 2004 |
| Reduction and Refinement Strategies for Probabilistic Analysis | 48 | 2.28 | 2002 |
| Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes | 7 | 0.53 | 2002 |
| Reachability Analysis of Probabilistic Systems by Successive Refinements | 91 | 3.69 | 2001 |
| UPPAAL - Now, Next, and Future | 39 | 2.49 | 2000 |
| Dynamic Partitioning in Analyses of Numerical Properties | 39 | 2.17 | 1999 |
