| 2025 | EMNLP | Formalizing Style in Personal Narratives. | Gustave Cortal, Alain Finkel |
| 2025 | MODELSWARD | An Automata-Based Method to Formalize Psychological Theories: The Case Study of Lazarus and Folkman's Stress Theory. | Alain Finkel, Gaspard Fougea, Stphane Le Roux |
| 2024 | ECCV | Textualized and Feature-Based Models for Compound Multimodal Emotion Recognition in the Wild. | Nicolas Richet, Soufiane Belharbi, Haseeb Aslam, Meike Emilie Schadt, Manuela Gonzlez-Gonzlez, Gustave Cortal, Alessandro Lameiras Koerich, Marco Pedersoli, Alain Finkel, Simon Bacon, Eric Granger |
| 2024 | LICS | Soundness of reset workflow nets. | Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt |
| 2024 | VMCAI | Resilience and Home-Space for WSTS. | Alain Finkel, Mathieu Hilaire |
| 2023 | CONCUR | About Decisiveness of Dynamic Probabilistic Models. | Alain Finkel, Serge Haddad, Lina Ye |
| 2022 | FORTE | Branch-Well-Structured Transition Systems and Extensions. | Benedikt Bollig, Alain Finkel, Amrita Suresh |
| 2021 | ATVA | Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. | Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benot Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye |
| 2021 | CONCUR | A Unifying Framework for Deciding Synchronizability. | Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, tienne Lozes, Amrita Suresh |
| 2020 | CONCUR | Bounded Reachability Problems Are Decidable in FIFO Machines. | Benedikt Bollig, Alain Finkel, Amrita Suresh |
| 2020 | FOSSACS | Minimal Coverability Tree Construction Made Complete and Efficient. | Alain Finkel, Serge Haddad, Igor Khmelnitsky |
| 2019 | CONCUR | Verification of Flat FIFO Systems. | Alain Finkel, M. Praveen |
| 2017 | ICALP | Synchronizability of Communicating Finite State Machines is not Decidable. | Alain Finkel, tienne Lozes |
| 2016 | TACAS | Approaching the Coverability Problem Continuously. | Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad |
| 2015 | LICS | Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. | Michael Blondin, Alain Finkel, Stefan Gller, Christoph Haase, Pierre McKenzie |
| 2014 | ICALP | Handling Infinitely Branching WSTS. | Michael Blondin, Alain Finkel, Pierre McKenzie |
| 2013 | MFCS | Reachability in Register Machines with Polynomial Updates. | Alain Finkel, Stefan Gller, Christoph Haase |
| 2012 | DLT | Unambiguous Constrained Automata. | Michal Cadilhac, Alain Finkel, Pierre McKenzie |
| 2011 | FOSSACS | Ordinal Theory for Expressiveness of Well Structured Transition Systems. | Rmi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo |
| 2010 | SOFSEM | Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. | Alain Finkel, Arnaud Sangnier |
| 2009 | ICALP | Forward Analysis for WSTS, Part II: Complete WSTS. | Alain Finkel, Jean Goubault-Larrecq |
| 2009 | STACS | Forward Analysis for WSTS, Part I: Completions. | Alain Finkel, Jean Goubault-Larrecq |
| 2008 | MFCS | Reversal-Bounded Counter Machines Revisited. | Alain Finkel, Arnaud Sangnier |
| 2008 | TIME | Decomposition of Decidable First-Order Logics over Integers and Reals. | Florent Bouchy, Alain Finkel, Jrme Leroux |
| 2006 | ATVA | Towards a Model-Checker for Counter Systems. | Stphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen |
| 2005 | ATVA | Flat Acceleration in Symbolic Model Checking. | Sbastien Bardin, Alain Finkel, Jrme Leroux, Philippe Schnoebelen |
| 2004 | ATVA | Composition of Accelerations to Verify Infinite Heterogeneous Systems. | Sbastien Bardin, Alain Finkel |
| 2004 | CAV | Image Computation in Infinite State Model Checking. | Alain Finkel, Jrme Leroux |
| 2004 | TACAS | FASTer Acceleration of Counter Automata in Practice. | Sbastien Bardin, Alain Finkel, Jrme Leroux |
| 2003 | CAV | FAST: Fast Acceleration of Symbolikc Transition Systems. | Sbastien Bardin, Alain Finkel, Jrme Leroux, Laure Petrucci |
| 2002 | LATIN | Verification of Embedded Reactive Fiffo Systems. | Frdric Herbreteau, Franck Cassez, Alain Finkel, Olivier F. Roux, Grgoire Sutre |
| 2000 | CONCUR | Well-Abstracted Transition Systems. | Alain Finkel, S. Purushothaman Iyer, Grgoire Sutre |
| 2000 | MFCS | An Algorithm Constructing the Semilinear Post | Alain Finkel, Grgoire Sutre |
| 2000 | STACS | Decidability of Reachability Problems for Classes of Two Counters Automata. | Alain Finkel, Grgoire Sutre |
| 1999 | LICS | On the Verification of Broadcast Protocols. | Javier Esparza, Alain Finkel, Richard Mayr |
| 1998 | ICALP | Reset Nets Between Decidability and Undecidability. | Catherine Dufourd, Alain Finkel, Philippe Schnoebelen |
| 1998 | LATIN | Fundamental Structures in Well-Structured Infinite Transition Systems. | Alain Finkel, Philippe Schnoebelen |
| 1997 | CAV | Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract). | Grard Cc, Alain Finkel |
| 1991 | CAV | Avoiding State Exposion by Composition of Minimal Covering Graphs. | Alain Finkel, Laure Petrucci |
| 1987 | ICALP | A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems. | Alain Finkel |
| 1984 | STACS | Blocage et vivacit dans les rseaux a pile-file. | Alain Finkel |