default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGrégoire Sutre
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c37]Romain Delpy, Anca Muscholl, Grégoire Sutre:
An Automata-Based Approach for Synchronizable Mailbox Communication. CONCUR 2024: 22:1-22:19- [i9]Romain Delpy, Anca Muscholl, Grégoire Sutre:
An automata-based approach for synchronizable mailbox communication. CoRR abs/2407.06968 (2024) - 2023
- [c36]Theo De Castro Pinto, Antoine Rollet, Grégoire Sutre, Ireneusz Tobor:
Guiding Symbolic Execution with A-Star. SEFM 2023: 47-65 - 2020
- [c35]Jérôme Leroux, Grégoire Sutre:
Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free. CONCUR 2020: 37:1-37:17 - [i8]Jérôme Leroux, Grégoire Sutre:
Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free. CoRR abs/2007.09096 (2020)
2010 – 2019
- 2019
- [j5]Petr Jancar
, Jérôme Leroux, Grégoire Sutre:
Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States. Fundam. Informaticae 169(1-2): 123-150 (2019) - [j4]Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre:
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. Log. Methods Comput. Sci. 15(4) (2019) - [i7]Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre:
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. CoRR abs/1904.04090 (2019) - 2018
- [j3]Thomas Geffroy, Jérôme Leroux, Grégoire Sutre:
Occam's Razor applied to the Petri net coverability problem. Theor. Comput. Sci. 750: 38-52 (2018) - [c34]Petr Jancar, Jérôme Leroux, Grégoire Sutre:
Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States. Petri Nets 2018: 184-203 - [c33]Alain Finkel, Jérôme Leroux, Grégoire Sutre:
Reachability for Two-Counter Machines with One Test and One Reset. FSTTCS 2018: 31:1-31:14 - [c32]Vincent Penelle, Sylvain Salvati, Grégoire Sutre:
On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems. FSTTCS 2018: 44:1-44:20 - 2017
- [c31]Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre:
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One. ICALP 2017: 119:1-119:14 - [c30]Thomas Geffroy, Jérôme Leroux, Grégoire Sutre:
Backward coverability with pruning for lossy channel systems. SPIN 2017: 132-141 - 2016
- [c29]Thomas Geffroy, Jérôme Leroux, Grégoire Sutre:
Occam's Razor Applied to the Petri Net Coverability Problem. RP 2016: 77-89 - [i6]Thomas Geffroy, Jérôme Leroux, Grégoire Sutre:
Occam's Razor Applied to the Petri Net Coverability Problem. CoRR abs/1607.05956 (2016) - 2015
- [c28]Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. ICALP (2) 2015: 324-336 - [c27]Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On Boundedness Problems for Pushdown Vector Addition Systems. RP 2015: 101-113 - [i5]Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. CoRR abs/1503.04018 (2015) - [i4]Jérôme Leroux, Grégoire Sutre, Patrick Totzke:
On Boundedness Problems for Pushdown Vector Addition Systems. CoRR abs/1507.07362 (2015) - 2014
- [c26]Jérôme Leroux, Vincent Penelle, Grégoire Sutre:
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems. ATVA 2014: 248-263 - [c25]Lorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre:
Decidable Topologies for Communicating Automata with FIFO and Bag Channels. CONCUR 2014: 281-296 - [c24]Jérôme Leroux, M. Praveen, Grégoire Sutre:
Hyper-Ackermannian bounds for pushdown vector addition systems. CSL-LICS 2014: 63:1-63:10 - 2013
- [c23]Jérôme Leroux, M. Praveen, Grégoire Sutre:
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness. CONCUR 2013: 137-151 - [c22]Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre:
Reachability of Communicating Timed Processes. FoSSaCS 2013: 81-96 - [c21]Jérôme Leroux, Vincent Penelle, Grégoire Sutre:
On the Context-Freeness Problem for Vector Addition Systems. LICS 2013: 43-52 - 2012
- [j2]Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre:
Reachability Analysis of Communicating Pushdown Systems. Log. Methods Comput. Sci. 8(3) (2012) - [c20]Alexander Heußner, Tristan Le Gall, Grégoire Sutre:
Safety Verification of Communicating One-Counter Machines. FSTTCS 2012: 224-235 - [c19]Alexander Heußner, Tristan Le Gall, Grégoire Sutre:
McScM: A General Framework for the Verification of Communicating Machines. TACAS 2012: 478-484 - [i3]Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre:
Reachability of Communicating Timed Processes. CoRR abs/1209.0571 (2012) - 2010
- [c18]Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre:
Reachability Analysis of Communicating Pushdown Systems. FoSSaCS 2010: 267-281
2000 – 2009
- 2009
- [c17]Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm:
Polynomial Precise Interval Analysis Revisited. Efficient Algorithms 2009: 422-437 - [c16]Hayssam Soueidan, Grégoire Sutre, Macha Nikolski:
Qualitative Transition Systems for the Abstraction and Comparison of Transient Behavior in Parametrized Dynamic Models. CMSB 2009: 313-327 - [c15]Alexander Heußner, Tristan Le Gall, Grégoire Sutre:
Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems. SPIN 2009: 107-124 - 2008
- [i2]Jérôme Leroux, Grégoire Sutre:
Accelerated Data-Flow Analysis. CoRR abs/0812.2011 (2008) - 2007
- [c14]Jérôme Leroux, Grégoire Sutre:
Acceleration in Convex Data-Flow Analysis. FSTTCS 2007: 520-531 - [c13]Jérôme Leroux, Grégoire Sutre:
Accelerated Data-Flow Analysis. SAS 2007: 184-199 - [c12]Frédéric Herbreteau, Grégoire Sutre, The Quang Tran:
Unfolding Concurrent Well-Structured Transition Systems. TACAS 2007: 706-720 - 2006
- [i1]Jérôme Leroux, Grégoire Sutre:
Flat counter automata almost everywhere!. Software Verification: Infinite-State Model Checking and Static Program Analysis 2006 - 2005
- [c11]Jérôme Leroux, Grégoire Sutre:
Flat Counter Automata Almost Everywhere! ATVA 2005: 489-503 - 2004
- [c10]Jérôme Leroux, Grégoire Sutre:
On Flatness for 2-Dimensional Vector Addition Systems with States. CONCUR 2004: 402-416 - [p1]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:
Modeling and verifying behavioral aspects. Formal Methods for Embedded Distributed Systems 2004: 171-211 - 2003
- [j1]Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre:
Well-abstracted transition systems: application to FIFO automata. Inf. Comput. 181(1): 1-31 (2003) - [c9]Jean-Michel Couvreur, Nasser Saheb, Grégoire Sutre:
An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems. LPAR 2003: 361-375 - [c8]Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Grégoire Sutre:
Software Verification with BLAST. SPIN 2003: 235-239 - 2002
- [c7]Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, George C. Necula, Grégoire Sutre, Westley Weimer:
Temporal-Safety Proofs for Systems Code. CAV 2002: 526-538 - [c6]Frédéric Herbreteau, Franck Cassez, Alain Finkel, Olivier F. Roux, Grégoire Sutre:
Verification of Embedded Reactive Fiffo Systems. LATIN 2002: 400-414 - [c5]Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Grégoire Sutre:
Lazy abstraction. POPL 2002: 58-70 - 2000
- [c4]Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre:
Well-Abstracted Transition Systems. CONCUR 2000: 566-580 - [c3]Alain Finkel, Grégoire Sutre:
An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS. MFCS 2000: 353-362 - [c2]Alain Finkel, Grégoire Sutre:
Decidability of Reachability Problems for Classes of Two Counters Automata. STACS 2000: 346-357
1990 – 1999
- 1998
- [c1]Grégoire Sutre, Alain Finkel, Olivier F. Roux, Franck Cassez:
Effective Recognizability and Model Checking of Reactive Fiffo Automata. AMAST 1998: 106-123
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 01:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
