How to compose Presburger-accelerations: Applications to broadcast protocols A Finkel, J Leroux International Conference on Foundations of Software Technology and …, 2002 | 203 | 2002 |

Fast: Fast acceleration of symbolic transition systems S Bardin, A Finkel, J Leroux, L Petrucci International Conference on Computer Aided Verification, 118-121, 2003 | 153 | 2003 |

Flat counter automata almost everywhere! J Leroux, G Sutre International Symposium on Automated Technology for Verification and …, 2005 | 123 | 2005 |

Flat acceleration in symbolic model checking S Bardin, A Finkel, J Leroux, P Schnoebelen International symposium on automated technology for verification and …, 2005 | 104 | 2005 |

The general vector addition system reachability problem by Presburger inductive invariants J Leroux 2009 24th Annual IEEE Symposium on Logic In Computer Science, 4-13, 2009 | 100 | 2009 |

Vector addition system reachability problem: a short self-contained proof J Leroux International Conference on Language and Automata Theory and Applications, 41-64, 2011 | 99 | 2011 |

Demystifying reachability in vector addition systems J Leroux, S Schmitz 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 56-67, 2015 | 91 | 2015 |

FAST: acceleration from theory to practice S Bardin, A Finkel, J Leroux, L Petrucci International Journal on Software Tools for Technology Transfer 10 (5), 401-424, 2008 | 83 | 2008 |

The reachability problem for Petri nets is not elementary W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 80 | 2019 |

The BINCOA framework for binary code analysis S Bardin, P Herrmann, J Leroux, O Ly, R Tabary, A Vincent International Conference on Computer Aided Verification, 165-170, 2011 | 72 | 2011 |

FASTer acceleration of counter automata in practice S Bardin, A Finkel, J Leroux International Conference on Tools and Algorithms for the Construction and …, 2004 | 70 | 2004 |

A polynomial time Presburger criterion and synthesis for number decision diagrams J Leroux 20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), 147-156, 2005 | 69 | 2005 |

Vector addition systems reachability problem (a simpler solution) J Leroux EPiC 10, 214-228, 2012 | 67 | 2012 |

On flatness for 2-dimensional vector addition systems with states J Leroux, G Sutre International Conference on Concurrency Theory, 402-416, 2004 | 59 | 2004 |

FAST extended release S Bardin, J Leroux, G Point International Conference on Computer Aided Verification, 63-66, 2006 | 55 | 2006 |

Algorithmique de la vérification des systèmes à compteurs: approximation et accélération, implémentation de l'outil FAST J Leroux Cachan, Ecole normale supérieure, 2003 | 47 | 2003 |

Verification of population protocols J Esparza, P Ganty, J Leroux, R Majumdar Acta Informatica 54 (2), 191-215, 2017 | 39 | 2017 |

Reachability analysis of communicating pushdown systems A Heußner, J Leroux, A Muscholl, G Sutre International Conference on Foundations of Software Science and …, 2010 | 39 | 2010 |

Reachability analysis of communicating pushdown systems A Heußner, J Leroux, A Muscholl, G Sutre International Conference on Foundations of Software Science and …, 2010 | 39 | 2010 |

Presburger vector addition systems J Leroux 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 23-32, 2013 | 38 | 2013 |