The SCEAS System
Navigation Menu

Search the dblp DataBase


Jérôme Leroux: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sébastien Bardin, Alain Finkel, Jérôme Leroux, Ph. Schnoebelen
    Flat Acceleration in Symbolic Model Checking. [Citation Graph (0, 0)][DBLP]
    ATVA, 2005, pp:474-488 [Conf]
  2. Jérôme Leroux
    Disjunctive Invariants for Numerical Systems. [Citation Graph (0, 0)][DBLP]
    ATVA, 2004, pp:93-107 [Conf]
  3. Jérôme Leroux, Grégoire Sutre
    Flat Counter Automata Almost Everywhere! [Citation Graph (0, 0)][DBLP]
    ATVA, 2005, pp:489-503 [Conf]
  4. Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci
    FAST: Fast Acceleration of Symbolikc Transition Systems. [Citation Graph (0, 0)][DBLP]
    CAV, 2003, pp:118-121 [Conf]
  5. Sébastien Bardin, Jérôme Leroux, Gérald Point
    FAST Extended Release. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:63-66 [Conf]
  6. Alain Finkel, Jérôme Leroux
    Image Computation in Infinite State Model Checking. [Citation Graph (0, 0)][DBLP]
    CAV, 2004, pp:361-371 [Conf]
  7. Jérôme Leroux, Grégoire Sutre
    On Flatness for 2-Dimensional Vector Addition Systems with States. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:402-416 [Conf]
  8. Alain Finkel, Jérôme Leroux
    How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:145-156 [Conf]
  9. Jérôme Leroux
    A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:147-156 [Conf]
  10. Alain Finkel, Jérôme Leroux
    Polynomial Time Image Computation with Interval-Definable Counters Systems. [Citation Graph (0, 0)][DBLP]
    SPIN, 2004, pp:182-197 [Conf]
  11. Sébastien Bardin, Alain Finkel, Jérôme Leroux
    FASTer Acceleration of Counter Automata in Practice. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:576-590 [Conf]
  12. Jérôme Leroux
    The Affine Hull of a Binary Automaton is Computable in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:89-104 [Journal]
  13. Alain Finkel, Jérôme Leroux
    The convex hull of a regular set of integer vectors is polyhedral and effectively computable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:1, pp:30-35 [Journal]
  14. Jérôme Leroux, Grégoire Sutre
    Accelerated Data-Flow Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2007, pp:184-199 [Conf]
  15. Jérôme Leroux
    Least Significant Digit First Presburger Automata [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  16. Polynomial Precise Interval Analysis Revisited. [Citation Graph (, )][DBLP]

  17. A Generalization of Semenov's Theorem to Automata over Real Numbers. [Citation Graph (, )][DBLP]

  18. Flat counter automata almost everywhere!. [Citation Graph (, )][DBLP]

  19. Reachability Analysis of Communicating Pushdown Systems. [Citation Graph (, )][DBLP]

  20. Acceleration in Convex Data-Flow Analysis. [Citation Graph (, )][DBLP]

  21. The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. [Citation Graph (, )][DBLP]

  22. Convex Hull of Arithmetic Automata. [Citation Graph (, )][DBLP]

  23. Accelerating Interpolation-Based Model-Checking. [Citation Graph (, )][DBLP]

  24. TaPAS: The Talence Presburger Arithmetic Suite. [Citation Graph (, )][DBLP]

  25. Decomposition of Decidable First-Order Logics over Integers and Reals. [Citation Graph (, )][DBLP]

  26. The convex hull of a regular set of integer vectors is polyhedral and effectively computable [Citation Graph (, )][DBLP]

  27. Convex Hull of Arithmetic Automata [Citation Graph (, )][DBLP]

  28. Decomposition of Decidable First-Order Logics over Integers and Reals [Citation Graph (, )][DBLP]

  29. Accelerated Data-Flow Analysis [Citation Graph (, )][DBLP]

Search in 0.005secs, Finished in 0.006secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002