| Lazy abstraction TA Henzinger, R Jhala, R Majumdar, G Sutre Principles of Programming Languages (POPL'02), 58-70, 2002 | 1532 | 2002 |
| Software verification with BLAST TA Henzinger, R Jhala, R Majumdar, G Sutre Model Checking Software (SPIN'03), 235-239, 2003 | 710 | 2003 |
| Temporal-safety proofs for systems code T Henzinger, G Necula, R Jhala, G Sutre, R Majumdar, W Weimer Computer Aided Verification (CAV'02), 382-399, 2002 | 239 | 2002 |
| Flat counter automata almost everywhere! J Leroux, G Sutre Automated Technology for Verification and Analysis (ATVA'05), 489-503, 2005 | 128 | 2005 |
| Reachability analysis of communicating pushdown systems A Heußner, J Leroux, A Muscholl, G Sutre Logical Methods in Computer Science 8 (3:23), 1-20, 2012 | 80 | 2012 |
| An optimal automata approach to LTL model checking of probabilistic systems JM Couvreur, N Saheb, G Sutre Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'03), 361-375, 2003 | 69 | 2003 |
| On flatness for 2-dimensional vector addition systems with states J Leroux, G Sutre Concurrency Theory (CONCUR'04), 402-416, 2004 | 66 | 2004 |
| Decidability of reachability problems for classes of two counters automata A Finkel, G Sutre Theoretical Aspects of Computer Science (STACS'00), 346-357, 2000 | 60 | 2000 |
| Well-abstracted transition systems: Application to FIFO automata A Finkel, S Purushothaman Iyer, G Sutre Information and Computation 181 (1), 1-31, 2003 | 54 | 2003 |
| Reachability analysis of communicating pushdown systems A Heußner, J Leroux, A Muscholl, G Sutre Foundations of Software Science and Computation Structures (FOSSACS'10), 267-281, 2010 | 48 | 2010 |
| On the coverability problem for pushdown vector addition systems in one dimension J Leroux, G Sutre, P Totzke International Colloquium on Automata, Languages, and Programming, 324-336, 2015 | 38 | 2015 |
| Polynomial precise interval analysis revisited T Gawlitza, J Leroux, J Reineke, H Seidl, G Sutre, R Wilhelm Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of …, 2009 | 34 | 2009 |
| Accelerated data-flow analysis J Leroux, G Sutre Static Analysis (SAS'07), 184-199, 2007 | 34 | 2007 |
| Decidable topologies for communicating automata with FIFO and bag channels L Clemente, F Herbreteau, G Sutre International Conference on Concurrency Theory, 281-296, 2014 | 31 | 2014 |
| An algorithm constructing the semilinear post* for 2-dim Reset/Transfer VASS A Finkel, G Sutre Mathematical Foundations of Computer Science (MFCS'00), 353-362, 2000 | 30 | 2000 |
| Hyper-Ackermannian bounds for pushdown vector addition systems J Leroux, M Praveen, G Sutre Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 29 | 2014 |
| Reachability of communicating timed processes L Clemente, F Herbreteau, A Stainer, G Sutre Foundations of Software Science and Computation Structures (FOSSACS'13), 81-96, 2013 | 21 | 2013 |
| Parametric analysis and abstraction of genetic regulatory networks M Adélaıde, G Sutre Concurrent Models in Molecular Biology (BioCONCUR'04), 2004 | 20 | 2004 |
| Well-abstracted transition systems A Finkel, P Iyer, G Sutre Concurrency Theory (CONCUR'00), 566-580, 2000 | 18 | 2000 |
| Polynomial-space completeness of reachability for succinct branching vass in dimension one D Figueira, R Lazić, J Leroux, F Mazowiecki, G Sutre The 44th International Colloquium on Automata, Languages, and Programming …, 2017 | 15 | 2017 |
Jerome LerouxCNRS researcher, LaBRI, FranceVerified email at labri.fr
