G
Grégoire Sutre
Researcher at L'Abri
Publications - 52
Citations - 2824
Grégoire Sutre is an academic researcher from L'Abri. The author has contributed to research in topics: Reachability & Decidability. The author has an hindex of 18, co-authored 52 publications receiving 2753 citations. Previous affiliations of Grégoire Sutre include University of Bordeaux & École normale supérieure de Cachan.
Papers
More filters
Proceedings ArticleDOI
Lazy abstraction
TL;DR: This work presents an algorithm for model checking safety properties using lazy abstraction and describes an implementation of the algorithm applied to C programs and provides sufficient conditions for the termination of the method.
Book ChapterDOI
Software verification with BLAST
TL;DR: Blast implements an abstract-model check-refine loop to check for reachability of a specified label in the program, and short-circuits the loop from abstraction to verification to refinement, integrating the three steps tightly through “lazy abstraction”.
Book ChapterDOI
Temporal-Safety Proofs for Systems Code
Thomas A. Henzinger,Ranjit Jhala,Rupak Majumdar,George C. Necula,Grégoire Sutre,Westley Weimer +5 more
TL;DR: The Berkeley Lazy Abstraction Software verification Tool (BLAST) as mentioned in this paper is a methodology and tool for verifying and certifying systems code based on the lazy abstraction paradigm for intertwining the following three logical steps: construct a predicate abstraction from the code, model check the abstraction, and automatically refine the abstraction based on counterexample analysis.
Proceedings Article
Flat counter automata almost everywhere
Jérôme Leroux,Grégoire Sutre +1 more
TL;DR: In this article, it was shown that flatness is a necessary and sufficient condition for termination of accelerated symbolic model checking, a generic semi-algorithmic technique implemented in successful tools like FAST, LASH or TReX.
Book ChapterDOI
Flat counter automata almost everywhere
Jérôme Leroux,Grégoire Sutre +1 more
TL;DR: It is shown that flatness is a necessary and sufficient condition for termination of accelerated symbolic model checking, a generic semi-algorithmic technique implemented in successful tools like FAST, LASH or TReX and proved that many known semilinear subclasses of counter automata are flat.