Grégoire Sutre

According to our database1, Grégoire Sutre authored at least 40 papers between 1998 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

2017
Backward coverability with pruning for lossy channel systems.
Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017

Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Occam's Razor Applied to the Petri Net Coverability Problem.
CoRR, 2016

Occam's Razor Applied to the Petri Net Coverability Problem.
Proceedings of the Reachability Problems - 10th International Workshop, 2016

2015
On Boundedness Problems for Pushdown Vector Addition Systems.
CoRR, 2015

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension.
CoRR, 2015

On Boundedness Problems for Pushdown Vector Addition Systems.
Proceedings of the Reachability Problems - 9th International Workshop, 2015

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Hyper-Ackermannian bounds for pushdown vector addition systems.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Decidable Topologies for Communicating Automata with FIFO and Bag Channels.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
On the Context-Freeness Problem for Vector Addition Systems.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Reachability of Communicating Timed Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
Reachability of Communicating Timed Processes
CoRR, 2012

Reachability Analysis of Communicating Pushdown Systems
Logical Methods in Computer Science, 2012

McScM: A General Framework for the Verification of Communicating Machines.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Safety Verification of Communicating One-Counter Machines.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2010
Reachability Analysis of Communicating Pushdown Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009
Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems.
Proceedings of the Model Checking Software, 2009

Qualitative Transition Systems for the Abstraction and Comparison of Transient Behavior in Parametrized Dynamic Models.
Proceedings of the Computational Methods in Systems Biology, 7th International Conference, 2009

Polynomial Precise Interval Analysis Revisited.
Proceedings of the Efficient Algorithms, 2009

2008
Accelerated Data-Flow Analysis
CoRR, 2008

2007
Unfolding Concurrent Well-Structured Transition Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Accelerated Data-Flow Analysis.
Proceedings of the Static Analysis, 14th International Symposium, 2007

Acceleration in Convex Data-Flow Analysis.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006
Flat counter automata almost everywhere!.
Proceedings of the Software Verification: Infinite-State Model Checking and Static Program Analysis, 19.02., 2006

2005
Flat Counter Automata Almost Everywhere!
Proceedings of the Automated Technology for Verification and Analysis, 2005

2004
On Flatness for 2-Dimensional Vector Addition Systems with States.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Well-abstracted transition systems: application to FIFO automata.
Inf. Comput., 2003

Software Verification with BLAST.
Proceedings of the Model Checking Software, 2003

An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems.
Proceedings of the Logic for Programming, 2003

2002
Lazy abstraction.
Proceedings of the Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002

Verification of Embedded Reactive Fiffo Systems.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Temporal-Safety Proofs for Systems Code.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2000
Decidability of Reachability Problems for Classes of Two Counters Automata.
Proceedings of the STACS 2000, 2000

An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Well-Abstracted Transition Systems.
Proceedings of the CONCUR 2000, 2000

1998
Effective Recognizability and Model Checking of Reactive Fiffo Automata.
Proceedings of the Algebraic Methodology and Software Technology, 1998


  Loading...