Grégoire Sutre

57 papers A* 4A 3B 19Journal 14Unranked 16
YearRankTypeTitle / Venue / Authors
2026 B conf
Bridging the Gap Between Plain VASS and Branching VASS.
FoSSaCS
Clotilde Bizière, Jérôme Leroux, Grégoire Sutre
2025 — conf
An Efficient and Versatile Approach to Shortest Path Problems in Interprocedural Programs.
SPIN
Theo De Castro Pinto, Antoine Rollet, Grégoire Sutre
2025 B conf
On the Reachability Problem for Two-Dimensional Branching VASS.
MFCS
Clotilde Bizière, Thibault Hilaire, Jérôme Leroux, Grégoire Sutre
2025 J jnl
On the Reachability Problem for Two-Dimensional Branching VASS.
CoRR
Clotilde Bizière, Thibault Hilaire, Jérôme Leroux, Grégoire Sutre
2025 B conf
On the Send-Synchronizability Problem for Mailbox Communication.
CONCUR
Romain Delpy, Anca Muscholl, Grégoire Sutre
2024 B conf
An Automata-Based Approach for Synchronizable Mailbox Communication.
CONCUR
Romain Delpy, Anca Muscholl, Grégoire Sutre
2024 J jnl
An automata-based approach for synchronizable mailbox communication.
CoRR
Romain Delpy, Anca Muscholl, Grégoire Sutre
2023 B conf
Guiding Symbolic Execution with A-Star.
SEFM
Theo De Castro Pinto, Antoine Rollet, Grégoire Sutre, Ireneusz Tobor
2020 B conf
Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free.
CONCUR
Jérôme Leroux, Grégoire Sutre
2020 J jnl
Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free.
CoRR
Jérôme Leroux, Grégoire Sutre
2019 J jnl
Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States.
Fundam. Informaticae
Petr Jancar, Jérôme Leroux, Grégoire Sutre
2019 J jnl
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems.
CoRR
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre
2019 J jnl
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems.
Log. Methods Comput. Sci.
Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre
2018 B conf
Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States.
Petri Nets
Petr Jancar, Jérôme Leroux, Grégoire Sutre
2018 J jnl
Occam's Razor applied to the Petri net coverability problem.
Theor. Comput. Sci.
Thomas Geffroy, Jérôme Leroux, Grégoire Sutre
2018 — conf
On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems.
FSTTCS
Vincent Penelle, Sylvain Salvati, Grégoire Sutre
2018 — conf
Reachability for Two-Counter Machines with One Test and One Reset.
FSTTCS
Alain Finkel, Jérôme Leroux, Grégoire Sutre
2017 — conf
Backward coverability with pruning for lossy channel systems.
SPIN
Thomas Geffroy, Jérôme Leroux, Grégoire Sutre
2017 A* conf
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One.
ICALP
Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre
2016 — conf
Occam's Razor Applied to the Petri Net Coverability Problem.
RP
Thomas Geffroy, Jérôme Leroux, Grégoire Sutre
2016 J jnl
Occam's Razor Applied to the Petri Net Coverability Problem.
CoRR
Thomas Geffroy, Jérôme Leroux, Grégoire Sutre
2015 — conf
On Boundedness Problems for Pushdown Vector Addition Systems.
RP
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
2015 J jnl
On Boundedness Problems for Pushdown Vector Addition Systems.
CoRR
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
2015 — conf
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension.
ICALP (2)
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
2015 J jnl
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension.
CoRR
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
2014 B conf
Decidable Topologies for Communicating Automata with FIFO and Bag Channels.
CONCUR
Lorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre
2014 — conf
Hyper-Ackermannian bounds for pushdown vector addition systems.
CSL-LICS
Jérôme Leroux, M. Praveen, Grégoire Sutre
2014 B conf
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems.
ATVA
Jérôme Leroux, Vincent Penelle, Grégoire Sutre
2013 B conf
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness.
CONCUR
Jérôme Leroux, M. Praveen, Grégoire Sutre
2013 A* conf
On the Context-Freeness Problem for Vector Addition Systems.
LICS
Jérôme Leroux, Vincent Penelle, Grégoire Sutre
2013 B conf
Reachability of Communicating Timed Processes.
FoSSaCS
Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre
2012 A conf
McScM: A General Framework for the Verification of Communicating Machines.
TACAS
Alexander Heußner, Tristan Le Gall, Grégoire Sutre
2012 J jnl
Reachability Analysis of Communicating Pushdown Systems
Log. Methods Comput. Sci.
Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre
2012 J jnl
Reachability of Communicating Timed Processes
CoRR
Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre
2012 — conf
Safety Verification of Communicating One-Counter Machines.
FSTTCS
Alexander Heußner, Tristan Le Gall, Grégoire Sutre
2010 B conf
Reachability Analysis of Communicating Pushdown Systems.
FoSSaCS
Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre
2009 — conf
Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems.
SPIN
Alexander Heußner, Tristan Le Gall, Grégoire Sutre
2009 — conf
Polynomial Precise Interval Analysis Revisited.
Efficient Algorithms
Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm
2009 — conf
Qualitative Transition Systems for the Abstraction and Comparison of Transient Behavior in Parametrized Dynamic Models.
CMSB
Hayssam Soueidan, Grégoire Sutre, Macha Nikolski
2008 J jnl
Accelerated Data-Flow Analysis
CoRR
Jérôme Leroux, Grégoire Sutre
2007 B conf
Accelerated Data-Flow Analysis.
SAS
Jérôme Leroux, Grégoire Sutre
2007 — conf
Acceleration in Convex Data-Flow Analysis.
FSTTCS
Jérôme Leroux, Grégoire Sutre
2007 A conf
Unfolding Concurrent Well-Structured Transition Systems.
TACAS
Frédéric Herbreteau, Grégoire Sutre, The Quang Tran
2006 — conf
Flat counter automata almost everywhere!.
Software Verification: Infinite-State Model Checking and Static Program Analysis
Jérôme Leroux, Grégoire Sutre
2005 B conf
Flat Counter Automata Almost Everywhere!
ATVA
Jérôme Leroux, Grégoire Sutre
2004 — ch.
Modeling and verifying behavioral aspects.
Formal Methods for Embedded Distributed Systems
François Breant, Jean-Michel Couvreur, Frédéric Gilliers, Fabrice Kordon, Isabelle Mounier, Emmanuel Paviot-Adet, Denis Poitrenaud, Dan Marius Regep, Grégoire Sutre
2004 B conf
On Flatness for 2-Dimensional Vector Addition Systems with States.
CONCUR
Jérôme Leroux, Grégoire Sutre
2003 B conf
An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems.
LPAR
Jean-Michel Couvreur, Nasser Saheb, Grégoire Sutre
2003 — conf
Software Verification with BLAST.
SPIN
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Grégoire Sutre
2003 J jnl
Well-abstracted transition systems: application to FIFO automata.
Inf. Comput.
Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre
2002 A* conf
Lazy abstraction.
POPL
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Grégoire Sutre
2002 A* conf
Temporal-Safety Proofs for Systems Code.
CAV
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, George C. Necula, Grégoire Sutre, Westley Weimer
2002 B conf
Verification of Embedded Reactive Fiffo Systems.
LATIN
Frédéric Herbreteau, Franck Cassez, Alain Finkel, Olivier F. Roux, Grégoire Sutre
2000 B conf
An Algorithm Constructing the Semilinear Post
MFCS
Alain Finkel, Grégoire Sutre
2000 A conf
Decidability of Reachability Problems for Classes of Two Counters Automata.
STACS
Alain Finkel, Grégoire Sutre
2000 B conf
Well-Abstracted Transition Systems.
CONCUR
Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre
1998 — conf
Effective Recognizability and Model Checking of Reactive Fiffo Automata.
AMAST
Grégoire Sutre, Alain Finkel, Olivier F. Roux, Franck Cassez