Publications of Jérôme Leroux with Alain Finkel


Books and proceedings

  1. Alain Finkel, Jérôme Leroux, and Igor Potapov, editors. Reachability Problems - 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings, volume 7550 of Lecture Notes in Computer Science, 2012. Springer. [url] [doi] [bib]

Journal articles and book chapters

  1. Alain Finkel and Jérôme Leroux. Neue, einfache Algorithmen für Petrinetze. Informatik Spektrum, 37(3):229-236, 2014. [doi] [bib]

  2. Rémi Bonnet, Alain Finkel, Jérôme Leroux, and Marc Zeitoun. Model Checking Vector Addition Systems with one zero-test. Logical Methods in Computer Science, 8(2):11, June 2012. [url] [pdf] [doi] [bib]

  3. Sébastien Bardin, Alain Finkel, Jérôme Leroux, and Laure Petrucci. FAST: acceleration from theory to practice. International Journal on Software Tools for Technology Transfer (STTT), 10(5):401-424, 2008. [ps] [doi] [bib]

  4. Alain Finkel and Jérôme Leroux. The convex hull of a regular set of integer vectors is polyhedral and effectively computable. Information Processing Letters, 96(1):30-35, 2005. [ps] [doi] [bib]

Conference articles

  1. Rémi Bonnet, Alain Finkel, Jérôme Leroux, and Marc Zeitoun. Place-Boundedness for Vector Addition Systems with one zero-test. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, IMSc, Chennai, India, volume 8 of Leibniz International Proceedings in Informatics (LIPIcs), pages 192-203, 2010. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [url] [doi] [bib]

  2. Florent Bouchy, Jérôme Leroux, and Alain Finkel. Decomposition of Decidable First-Order Logics over Integers and Reals. In Temporal Representation and Reasoning, 15th International Symposium, TIME 2008, Montréal, Canada, June 16 - 18, 2008, Proceedings, pages 147-155, 2008. IEEE Computer Society Press. [ps] [doi] [bib]

  3. Sébastien Bardin, Alain Finkel, Jérôme Leroux, and Ph. Schnoebelen. Flat Acceleration in Symbolic Model Checking. In Automated Technology for Verification and Analysis, Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings, volume 3707 of Lecture Notes in Computer Science, pages 474-488, 2005. Springer. [pdf] [doi] [bib]

  4. Alain Finkel and Jérôme Leroux. Image Computation in Infinite State Model Checking. In Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings, volume 3114 of Lecture Notes in Computer Science, pages 361-371, 2004. Springer. [ps] [doi] [bib]

  5. Alain Finkel and Jérôme Leroux. Polynomial Time Image Computation with Interval-Definable Counters Systems. In Model Checking Software, 11th International SPIN Workshop, Barcelona, Spain, April 1-3, 2004, Proceedings, volume 2989 of Lecture Notes in Computer Science, pages 182-197, 2004. Springer. [ps] [doi] [bib]

  6. Sébastien Bardin, Alain Finkel, and Jérôme Leroux. FASTer Acceleration of Counter Automata in Practice. In Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings, volume 2988 of Lecture Notes in Computer Science, pages 576-590, 2004. Springer. [ps] [doi] [bib]

  7. Sébastien Bardin, Alain Finkel, Jérôme Leroux, and Laure Petrucci. FAST: Fast Acceleration of Symbolikc Transition Systems. In Computer Aided Verification, 15th International Conference, CAV 2003, Boulder, CO, USA, July 8-12, 2003, Proceedings, volume 2725 of Lecture Notes in Computer Science, pages 118-121, 2003. Springer. [ps] [doi] [bib]

  8. Alain Finkel and Jérôme Leroux. How to Compose Presburger-Accelerations: Applications to Broadcast Protocols. In Foundations of Software Technology and Theoretical Computer Science, 22th International Conference, FSTTCS 2002, Kanpur, India, December 12-14, 2002, Proceedings, volume 2556 of Lecture Notes in Computer Science, pages 145-156, 2002. Springer. [ps] [doi] [bib]

  9. Alain Finkel and Jérôme Leroux. A finite covering tree for analysing entropic broadcast protocols. In C. R. Ramakrishnan M. Leuschel, A. Podelski and U. Ultes-Nitsche, editors, International Workshop on Verification and Computational Logic, VCL 2000, London, July 2000, 2000, Proceedings published as Report DSSE-TR-2000-6, Univ. Southampton, GB, 2000. [ps] [bib]


This document was translated from BibTEX by bibtex2html