Nombre de documents

47


Article dans une revue8 documents

Communication dans un congrès34 documents

  • Piotr Hofman, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, Sylvain Schmitz, et al.. Coverability Trees for Petri Nets with Unordered Data. FoSSaCS, 2016, Eindhoven, Netherlands. Springer, 9634, pp.445--461, Lecture Notes in Computer Science. 〈10.1007/978-3-662-49630-5_26〉. 〈hal-01252674〉
  • Jérôme Leroux, Sylvain Schmitz. Ideal Decompositions for Vector Addition Systems. Nicolas Ollinger and Heribert Vollmer. STACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science, 2016, Orléans, France. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 47, pp.1--13, 2016, Leibniz International Proceedings in Informatics (LIPIcs). 〈http://drops.dagstuhl.de/opus/volltexte/2016/5702〉. 〈10.4230/LIPIcs.STACS.2016.1〉. 〈hal-01275991〉
  • Thomas J.B. Dewez, Jérôme Leroux, Stéphane Morelli. CLIFF COLLAPSE HAZARD FROM REPEATED MULTICOPTER UAV ACQUISITIONS: RETURN ON EXPERIENCE. XXIII ISPRS Congress, Jul 2016, Prague, Czech Republic. XLI-B5, pp.805-811, 2016, International Archives of the Photogrammetry Remote Sensing and Spatial Information Sciences. 〈10.5194/isprs-archives-XLI-B5-805-2016〉. 〈hal-01333956〉
  • Thomas Dewez, Jérôme Leroux, S Morelli. UAV sensing of coastal cliff topography for rock fall hazard applications. Journées Aléas Gravitaires JAG 2015, Sep 2015, Caen, France. 2015. 〈hal-01180649〉
  • Jérôme Leroux, Sylvain Schmitz. Demystifying Reachability in Vector Addition Systems. LICS 2015, Jul 2015, Kyoto, Japan. IEEE, pp.56--67, 〈10.1109/LICS.2015.16〉. 〈hal-01168388〉
  • Jérôme Leroux, Vincent Penelle, Grégoire Sutre. The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems. ATVA'14, Nov 2014, Sydney, Australia. Springer, 8837, pp.248 - 263, 2014, Lecture Notes in Computer Science. 〈10.1007/978-3-319-11936-6_19〉. 〈hal-01084819〉
  • Jérôme Leroux, M. Praveen, Grégoire Sutre. Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems. CSL-LICS 2014 - Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2014, Vienna, Austria. ACM, pp.Article 63, 2014, 〈10.1145/2603088.2603146〉. 〈hal-00989109〉
  • Jérôme Leroux. Presburger Vector Addition Systems. LICS, Jun 2013, New Orleans, United States. IEEE Computer Society, pp.23-32, 2013, 〈10.1109/LICS.2013.7〉. 〈hal-00780462v2〉
  • Jérôme Leroux, M Praveen, Grégoire Sutre. A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. CONCUR 2013, Aug 2013, Buenos Aires, Argentina. pp.137 - 151, 2013, LNCS. 〈10.1007/978-3-642-40184-8_11〉. 〈hal-01084803〉
  • Jérôme Leroux, Vincent Penelle, Grégoire Sutre. On the Context-Freeness Problem for Vector Addition Systems. LICS 2013, Jun 2013, New Orleans, LA, United States. IEEE, pp.43-52, 2013, 〈10.1109/LICS.2013.9〉. 〈hal-00788744v2〉
  • Jérôme Leroux, M. Praveen, Grégoire Sutre. A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. CONCUR 2013 - 24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. Springer, 8052, pp.137-151, 2013, LNCS. 〈10.1007/978-3-642-40184-8_11〉. 〈hal-00851915〉
  • Jérôme Leroux. Acceleration For Presburger Petri Nets. VPT@CAV, 2013, Saint Petersbourg, Russia. easychair, 16, pp.10-12, 2013, EPiC Series. 〈hal-00959699〉
  • Jérôme Leroux. Acceleration for Petri Nets. Springer. ATVA, 2013, Hanoi, Vietnam. pp.1-4, 2013, LNCS. 〈10.1007/978-3-319-02444-8_1〉. 〈hal-00959698〉
  • Jérôme Leroux. Vector Addition Systems Reachability Problem (A Simpler Solution). Andrei Voronkov. The Alan Turing Centenary Conference, Jun 2012, Manchester, United Kingdom. Andrei Voronkov, 10, pp.214-228, 2012, EPiC Series. 〈hal-00674970v3〉
  • Jérôme Leroux. Vector Addition System Reachability Problem (A Short Self-Contained Proof). Principles of Programming Languages, Jan 2011, Austin, TX, United States. ACM, pp.307--316, 2011, POPL '11. 〈10.1145/1926385.1926421〉. 〈hal-00502865v4〉
  • Sebastien Bardin, Philippe Herrman, Jérôme Leroux, Olivier Ly, Renaud Tabary, et al.. The BINCOA Framework for Binary Code Analysis. Gopalakrishnan, Ganesh and Qadeer, Shaz. Computer Aided Verification, 2011, United Kingdom. 6806, pp.165-170, 2011, 〈10.1007/978-3-642-22110-1_13〉. 〈hal-01006499〉
  • Jérôme Leroux. Vector Addition System Reachability Problem: A Short Self-contained Proof. Adrian Horia Dediu and Shunsuke Inenaga and Carlos Martín-Vide. Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings, May 2011, Taragonne, Spain. Springer, 6638, pp.41-64, 2011, 〈10.1007/978-3-642-21254-3_3〉. 〈hal-00599756〉
  • Jérôme Leroux. The Vector Addition System Reversible Reachability Problem. CONCUR 2011 - Concurrency Theory, 22th International Conference, Aachen, Germany, 5-10 September, 2011, Proceedings, Sep 2011, Aachen, Germany. Springer, pp.327-341, 2011, LNCS. 〈10.1007/978-3-642-23217-6_22〉. 〈hal-00599757〉
  • Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre. Reachability Analysis of Communicating Pushdown Systems. Luke Ong. FOSSACS 2010, 2010, Cyprus. 6014, pp.267-281, 2010, LNCS. 〈10.1007/978-3-642-12032-9_19〉. 〈hal-00527648〉
  • Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun. Place-Boundedness for Vector Addition Systems with one zero-test. FSTTCS 2010, Dec 2010, India. pp.192--203, 2010. 〈hal-00948975〉
  • Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, et al.. Polynomial Precise Interval Analysis Revisited. Albers, Susanne; Alt, Helmut; Näher, Stefan. Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, Aug 2009, Saarbrücken, Germany. Springer Berlin, 5760, pp.422-437, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-03456-5_28〉. 〈hal-00414750〉
  • Bernard Boigelot, Julien Brusten, Jérôme Leroux. A Generalization of Semenov's Theorem to Automata over Real Numbers. Renate A. Schmidt. Automated Deduction, 22nd International Conference, CADE 2009, Aug 2009, Montréal, Canada. Springer Berlin, 5663, pp.469-484, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-02959-2_34〉. 〈hal-00414753〉
  • Jérôme Leroux. The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. Logic in Computer Science (LICS 2009), Aug 2009, Los Angeles, United States. IEEE Computer Society., pp.4-13, 2009. 〈hal-00272667v12〉
  • Jérôme Leroux, Gérald Point. TaPAS : The Talence Presburger Arithmetic Suite. Stefan Kowalewski and Anna Philippou. TACAS, 2009, York, United Kingdom. Springer, 5505, pp.182-185, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-00768-2〉. 〈hal-00368653〉
  • Jérôme Leroux. Convex Hull of Arithmetic Automata. Static Analysis, 2008, Valencia, Spain. Springer, 5079, pp.47-61, 2008, LNCS. 〈10.1007/978-3-540-69166-2_4〉. 〈hal-00346001〉
  • Florent Bouchy, Alain Finkel, Jérôme Leroux. Decomposition of Decidable First-Order Logics over Integers and Reals. IEEE Computer Society Press. Temporal Representation and Reasoning, 2008. TIME '08. 15th International Symposium on, 2008, Montreal, QC, Canada. pp.147-155, 2008, 〈10.1109/TIME.2008.22〉. 〈hal-00345998〉
  • Nicolas Caniart, Emmanuel Fleury, Jérôme Leroux, Marc Zeitoun. Accelerating Interpolation-Based Model-Checking. C. R. Ramakrishnan and J. Rehof. 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08), 2008, Budapest, Hungary. Springer, 4963, pp.428-442, 2008, Lecture Notes in Computer Science. 〈10.1007/978-3-540-78800-3_32〉. 〈hal-00350416〉
  • Jérôme Leroux, Grégoire Sutre. Acceleration in Convex Data-Flow Analysis. FSTTCS, 2007, New Delhi, India. Springer, 4855, pp.520-531, 2007, Lecture Notes in Computer Science. 〈10.1007/978-3-540-77050-3_43〉. 〈hal-00346295〉
  • Jérôme Leroux, Grégoire Sutre. Accelerated Data-Flow Analysis. Springer Berlin. Static Analysis, 2007, Kongens Lyngby, Denmark. 4634, pp.184-199, 2007, Lecture Notes in Computer Science. 〈10.1007/978-3-540-74061-2_12〉. 〈hal-00346005〉
  • Sébastien Bardin, Jérôme Leroux, Gérald Point. FAST Extended Release. Computer Aided Verification, CAV'06, Aug 2006, Seattle, WA, United States. Springer Verlag, 4144, pp.63-66, 2006, Lecture Notes in Computer Science. 〈hal-00344195〉
  • Jérôme Leroux, Grégoire Sutre. Flat Counter Automata Almost Everywhere!. Third International Symposium, ATVA 2005, 2005, Taipei, Taiwan. Springer, 3707, pp.489-503, 2005, Lecture Notes in Computer Science. 〈10.1007/11562948_36〉. 〈hal-00346310〉
  • Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen. Flat Acceleration in Symbolic Model Checking. Third International Symposium, ATVA 2005, 2005, Taipei, Taiwan. Springer, 3707, pp.474-488, 2005, Lecture Notes in Computer Science. 〈10.1007/11562948_35〉. 〈hal-00346302〉
  • Jérôme Leroux. A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams. LICS, 2005, France. IEEE Computer Society Washington, DC, USA, pp.147 - 156, 2005, IEEE. 〈10.1109/LICS.2005.2〉. 〈hal-00346307〉
  • Laure Petrucci, Sébastien Bardin, Alain Finkel, Jérôme Leroux. FAST: Fast Acceleration of Symbolic Transition Systems. 15th international conference on Computer Aided Verification, 2003, United States. Springer-Verlag, pp.118-121, 2003, LNCS 2725. 〈hal-00084185〉

Poster1 document

  • Jérôme Leroux, Dimitri Lague. Modeling rates of bank erosion in sinuous tidal channel derived from event-based terrestrial lidar surveys in the Mont Saint Michel Bay. AGU Fall Meeting 2012, Dec 2012, San Francisco, United States. 2012. 〈insu-01113327〉

Direction d'ouvrage, Proceedings, Dossier1 document

Pré-publication, Document de travail2 documents

  • Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre. Reachability Analysis of Communicating Pushdown Systems. 2010. 〈hal-00443529〉
  • Jérôme Leroux. Least Significant Digit First Presburger Automata. 2006. 〈hal-00118748〉

Rapport1 document

  • Jérôme Leroux. Structural Presburger-definable Digit Vector Automata. [Research Report] PI 1718, 2005. 〈inria-00000039〉