Alain Finkel

ORCID

Publication Activity (10 Years)

Years Active: 1983-2024
Publications (10 Years): 51

Top Venues

CoRR

Log. Methods Comput. Sci.

CONCUR

FSTTCS

Publications

Alain Finkel, Mathieu Hilaire
Resilience and Home-Space for WSTS. VMCAI (1) (2024)
Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
Soundness of reset workflow nets. LICS (2024)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Branch-Well-Structured Transition Systems and Extensions. Log. Methods Comput. Sci. 20 (2) (2024)
Nicolas Richet, Soufiane Belharbi, Haseeb Aslam, Meike Emilie Schadt, Manuela González-González, Gustave Cortal, Alessandro Lameiras Koerich, Marco Pedersoli, Alain Finkel, Simon Bacon, Eric Granger
Textualized and Feature-based Models for Compound Multimodal Emotion Recognition in the Wild. CoRR (2024)
Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
Analysis of recurrent neural networks via property-directed verification of surrogate models. Int. J. Softw. Tools Technol. Transf. 25 (3) (2023)
Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye
Emotion Recognition based on Psychological Components in Guided Narratives for Emotion Regulation. CoRR (2023)
Alain Finkel, Serge Haddad, Lina Ye
Introducing Divergence for Infinite Probabilistic Models. RP (2023)
Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye
Détection de l'émotion à partir de ses composantes à l'aide d'un corpus de récits émotionnels. EGC (2023)
Alain Finkel, Serge Haddad, Lina Ye
Introducing Divergence for Infinite Probabilistic Models. CoRR (2023)
Alain Finkel, Étienne Lozes
Synchronizability of Communicating Finite State Machines is not Decidable. Log. Methods Comput. Sci. 19 (4) (2023)
Alain Finkel, Serge Haddad, Lina Ye
About Decisiveness of Dynamic Probabilistic Models. CoRR (2023)
Alain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Georg Zetzsche
Counter Machines with Infrequent Reversals. FSTTCS (2023)
Alain Finkel, Serge Haddad, Lina Ye
About Decisiveness of Dynamic Probabilistic Models. CONCUR (2023)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Branch-Well-Structured Transition Systems and Extensions. FORTE (2022)
Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye
Natural Language Processing for Cognitive Analysis of Emotions. CoRR (2022)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Branch-Well-Structured Transition Systems and Extensions. CoRR (2022)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Bounded Reachability Problems are Decidable in FIFO Machines. Log. Methods Comput. Sci. 18 (1) (2022)
Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Igor Khmelnitsky, Martin Leucker, Daniel Neider, Rajarshi Roy, Lina Ye
Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search. ICGI (2021)
Alain Finkel, Serge Haddad, Igor Khmelnitsky
Commodification of accelerations for the Karp and Miller Construction. Discret. Event Dyn. Syst. 31 (2) (2021)
Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Étienne Lozes, Amrita Suresh
A Unifying Framework for Deciding Synchronizability. CONCUR (2021)
Alain Finkel, Serge Haddad, Igor Khmelnitsky
Coverability, Termination, and Finiteness in Recursive Petri Nets. CoRR (2021)
Alain Finkel, Serge Haddad, Igor Khmelnitsky
Coverability, Termination, and Finiteness in Recursive Petri Nets. Fundam. Informaticae 183 (1-2) (2021)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Bounded Reachability Problems are Decidable in FIFO Machines. CoRR (2021)
Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM 68 (5) (2021)
Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. ATVA (2021)
Alain Finkel, M. Praveen
Verification of Flat FIFO Systems. Log. Methods Comput. Sci. 16 (4) (2020)
Alain Finkel, Jean Goubault-Larrecq
Forward analysis for WSTS, part I: completions. Math. Struct. Comput. Sci. 30 (7) (2020)
Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
Property-Directed Verification of Recurrent Neural Networks. CoRR (2020)
Alain Finkel, Serge Haddad, Igor Khmelnitsky
Minimal Coverability Tree Construction Made Complete and Efficient. FoSSaCS (2020)
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees. Log. Methods Comput. Sci. 16 (2) (2020)
Benedikt Bollig, Alain Finkel, Amrita Suresh
Bounded Reachability Problems Are Decidable in FIFO Machines. CONCUR (2020)
Alain Finkel
From Well Structured Transition Systems to Program Verification. VPT/HCVS@ETAPS (2020)
Alain Finkel, Ekanshdeep Gupta
The Well Structured Problem for Presburger Counter Machines. FSTTCS (2019)
Alain Finkel, M. Praveen
Verification of Flat FIFO Systems. CONCUR (2019)
Alain Finkel, Serge Haddad, Igor Khmelnitsky
Coverability and Termination in Recursive Petri Nets. Petri Nets (2019)
Alain Finkel, Ekanshdeep Gupta
The Well Structured Problem for Presburger Counter Machines. CoRR (2019)
Alain Finkel, M. Praveen
Verification of Flat FIFO Systems. CoRR (2019)
Michael Blondin, Alain Finkel, Pierre McKenzie
Handling infinitely branching well-structured transition systems. Inf. Comput. 258 (2018)
Alain Finkel, Jérôme Leroux, Grégoire Sutre
Reachability for Two-Counter Machines with One Test and One Reset. FSTTCS (2018)
Raphaël Chane-Yack-Fa, Marc Frappier, Amel Mammar, Alain Finkel
Parameterized verification of monotone information systems. Formal Aspects Comput. 30 (3-4) (2018)
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
The Logical View on Continuous Petri Nets. ACM Trans. Comput. Log. 18 (3) (2017)
Michael Blondin, Alain Finkel, Pierre McKenzie
Well Behaved Transition Systems. Log. Methods Comput. Sci. 13 (3) (2017)
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees. FSTTCS (2017)
Alain Finkel, Étienne Lozes
Synchronizability of Communicating Finite State Machines is not Decidable. ICALP (2017)
Alain Finkel, Étienne Lozes
Synchronizability of Communicating Finite State Machines is not Decidable. CoRR (2017)
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees. CoRR (2017)
Pierre Chambart, Alain Finkel, Sylvain Schmitz
Forward analysis and model checking for trace bounded WSTS. Theor. Comput. Sci. 637 (2016)
Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov
Preface. Fundam. Informaticae 143 (3-4) (2016)
Alain Finkel
The Ideal Theory for WSTS. RP (2016)
Michael Blondin, Alain Finkel, Pierre McKenzie
Well Behaved Transition Systems. CoRR (2016)
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
Approaching the Coverability Problem Continuously. TACAS (2016)
Alain Finkel, Jérôme Leroux
Recent and simple algorithms for Petri nets. Softw. Syst. Model. 14 (2) (2015)
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. LICS (2015)
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
Approaching the Coverability Problem Continuously. CoRR (2015)
Michael Blondin, Alain Finkel, Pierre McKenzie
Handling Infinitely Branching WSTS. ICALP (2) (2014)
Javier Esparza, Alain Finkel, Pierre McKenzie, Joël Ouaknine
Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141). Dagstuhl Reports 4 (3) (2014)
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR (2014)
Alain Finkel, Jérôme Leroux
Neue, einfache Algorithmen für Petrinetze. Inform. Spektrum 37 (3) (2014)
Florent Bouchy, Alain Finkel, Pierluigi San Pietro
Dense-choice Counter Machines revisited. Theor. Comput. Sci. 542 (2014)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Unambiguous constrained Automata. Int. J. Found. Comput. Sci. 24 (7) (2013)
Alain Finkel, Stefan Göller, Christoph Haase
Reachability in Register Machines with Polynomial Updates. MFCS (2013)
Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo
Ordinal theory for expressiveness of well-structured transition systems. Inf. Comput. 224 (2013)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Bounded Parikh Automata. Int. J. Found. Comput. Sci. 23 (8) (2012)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Unambiguous Constrained Automata. Developments in Language Theory (2012)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Affine Parikh automata. RAIRO Theor. Informatics Appl. 46 (4) (2012)
Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part II: Complete WSTS Log. Methods Comput. Sci. 8 (3) (2012)
Rémi Bonnet, Alain Finkel, M. Praveen
Extending the Rackoff technique to Affine nets. FSTTCS (2012)
Alain Finkel, Jean Goubault-Larrecq
The Theory of WSTS: The Case of Complete WSTS. Petri Nets (2012)
Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun
Model Checking Vector Addition Systems with one zero-test Log. Methods Comput. Sci. 8 (2) (2012)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Bounded Parikh Automata WORDS (2011)
Pierre Chambart, Alain Finkel, Sylvain Schmitz
Forward Analysis and Model Checking for Trace Bounded WSTS. Petri Nets (2011)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
On the Expressiveness of Parikh Automata and Related Models. NCMA (2011)
Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo
Ordinal Theory for Expressiveness of Well Structured Transition Systems. FoSSaCS (2011)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Storming the Parikh Automaton CoRR (2011)
Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun
Place-Boundedness for Vector Addition Systems with one zero-test. FSTTCS (2010)
Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen
Model-checking CTL* over flat Presburger counter systems. J. Appl. Non Class. Logics 20 (4) (2010)
Pierre Chambart, Alain Finkel, Sylvain Schmitz
Forward Analysis and Model Checking for Bounded WSTS CoRR (2010)
Alain Finkel, Arnaud Sangnier
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. SOFSEM (2010)
Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part II: Complete WSTS. ICALP (2) (2009)
Emmanuelle Encrenaz, Alain Finkel
Automatic Verification of Counter Systems With Ranking Function. INFINITY (2009)
Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part I: Completions. STACS (2009)
Alain Finkel, Jean Goubault-Larrecq
Forward analysis for WSTS, Part I: Completions CoRR (2009)
Florent Bouchy, Alain Finkel, Pierluigi San Pietro
Dense-choice Counter Machines revisited INFINITY (2009)
Florent Bouchy, Alain Finkel, Arnaud Sangnier
Reachability in Timed Counter Systems. INFINITY (2009)
Alain Finkel, Arnaud Sangnier
Reversal-Bounded Counter Machines Revisited. MFCS (2008)
Alain Finkel, Jérôme Leroux
The convex hull of a regular set of integer vectors is polyhedral and effectively computable CoRR (2008)
Florent Bouchy, Alain Finkel, Jérôme Leroux
Decomposition of Decidable First-Order Logics over Integers and Reals. TIME (2008)
Florent Bouchy, Alain Finkel, Jérôme Leroux
Decomposition of Decidable First-Order Logics over Integers and Reals CoRR (2008)
Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci
FAST: acceleration from theory to practice. Int. J. Softw. Tools Technol. Transf. 10 (5) (2008)
Alain Finkel, Étienne Lozes, Arnaud Sangnier
Towards Model-Checking Programs with Lists. ILC (2007)
Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
-language expressive power of extended Petri nets. Theor. Comput. Sci. 356 (3) (2006)
Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen
Towards a Model-Checker for Counter Systems. ATVA (2006)
Gérard Cécé, Alain Finkel
Verification of programs with half-duplex communication. Inf. Comput. 202 (2) (2005)
Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen
Flat Acceleration in Symbolic Model Checking. ATVA (2005)
Christophe Darlot, Alain Finkel, Laurent Van Begin
About Fast and TReX Accelerations. Electron. Notes Theor. Comput. Sci. 128 (6) (2005)
Alain Finkel, Jérôme Leroux
The convex hull of a regular set of integer vectors is polyhedral and effectively computable. Inf. Process. Lett. 96 (1) (2005)
Alain Finkel, Jérôme Leroux
Polynomial Time Image Computation with Interval-Definable Counters Systems. SPIN (2004)
Sébastien Bardin, Alain Finkel, Jérôme Leroux
FASTer Acceleration of Counter Automata in Practice. TACAS (2004)
Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
On the omega-language Expressive Power of Extended Petri Nets. EXPRESS (2004)
Alain Finkel, Jérôme Leroux
Image Computation in Infinite State Model Checking. CAV (2004)

Alain Finkel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alain Finkel