Publications of Grégoire Sutre
Journal articles and book chapters
-
F. Bréant,
J.-M. Couvreur,
F. Gilliers,
F. Kordon,
I. Mounier,
E. Paviot-Adet,
D. Poitrenaud,
D. Regep,
and G. Sutre.
Modeling and verifying behavioral aspects.
In F. Kordon and M. Lemoine, editors, Formal Methods for Embedded Distributed Systems · How to master the complexity,
chapter 6,
pages 171-211.
Kluwer Academic,
2004.
[doi]
[bib]
-
A. Finkel,
S. P. Iyer,
and G. Sutre.
Well-Abstracted Transition Systems: Application to FIFO automata.
Information and Computation,
181(1):1-31,
2003.
[doi]
[bib]
Conference articles
-
A. Heussner,
T. Le Gall,
and G. Sutre.
McScM: A General Framework for the Verification of Communicating Machines.
In Proc. 18th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'12), Tallinn, Estonia, Mar.-Apr. 2012,
Lecture Notes in Computer Science,
Springer,
2012.
Note: Tool paper. To appear.
[bib]
-
A. Heussner,
J. Leroux,
A. Muscholl,
and G. Sutre.
Reachability Analysis of Communicating Pushdown Systems.
In Proc. 13th Int. Conf. Foundations of Software Science and Computation Structures (FOSSACS'10), Paphos, Cyprus, Mar. 2010,
volume 6014 of Lecture Notes in Computer Science,
pages 267-281.
Springer,
2010.
[doi]
[bib]
-
H. Soueidan,
G. Sutre,
and M. Nikolski.
Qualitative Transition Systems for the Abstraction and Comparison of Transient Behavior in Parametrized Dynamic Models.
In Proc. 7th Int. Conf. on Computational Methods in Systems Biology (CMSB'09), Bologna, Italy, Aug.-Sep. 2009,
volume 5688 of Lecture Notes in Computer Science,
pages 313-327.
Springer,
2009.
[doi]
[bib]
-
T. Gawlitza,
J. Leroux,
J. Reineke,
H. Seidl,
G. Sutre,
and R. Wilhelm.
Polynomial Precise Interval Analysis Revisited.
In Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday,
volume 5760 of Lecture Notes in Computer Science,
pages 422-437.
Springer,
2009.
[doi]
[bib]
-
A. Heussner,
T. Le Gall,
and G. Sutre.
Extrapolation-based Path Invariants for Abstraction Refinement of Fifo Systems.
In Proc. 16th Int. SPIN Workshop on Model Checking of Software (SPIN'09), Grenoble, France, Jun. 2009,
volume 5578 of Lecture Notes in Computer Science,
pages 107-124.
Springer,
2009.
[pdf]
[doi]
[bib]
-
J. Leroux and G. Sutre.
Acceleration in Convex Data-Flow Analysis.
In Proc. 27th Int. Conf. Found. of Software Technology and Theor. Comp. Sci. (FSTTCS'07), New Delhi, India, Dec. 2007,
volume 4855 of Lecture Notes in Computer Science,
pages 520-531.
Springer,
2007.
[ps]
[doi]
[bib]
-
J. Leroux and G. Sutre.
Accelerated Data-flow Analysis.
In Proc. 14th Int. Static Analysis Symposium (SAS'07), Kongens Lyngby, Denmark, Aug. 2007,
volume 4634 of Lecture Notes in Computer Science,
pages 184-199.
Springer,
2007.
[ps]
[doi]
[bib]
-
F. Herbreteau,
G. Sutre,
and T. Q. Tran.
Unfolding Concurrent Well-Structured Transition Systems.
In Proc. 13th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'07), Braga, Portugal, Mar.-Apr. 2007,
volume 4424 of Lecture Notes in Computer Science,
pages 706-720.
Springer,
2007.
[ps]
[doi]
[bib]
-
J. Leroux and G. Sutre.
Flat counter automata almost everywhere!.
In Proc. 3rd Int. Symp. Automated Technology for Verification and Analysis (ATVA'05), Taipei, Taiwan, Oct. 2005,
volume 3707 of Lecture Notes in Computer Science,
pages 489-503.
Springer,
2005.
[ps]
[doi]
[bib]
-
J. Leroux and G. Sutre.
On Flatness for 2-dimensional Vector Addition Systems with States.
In Proc. 15th Int. Conf. Concurrency Theory (CONCUR'04), London, UK, Aug.-Sep. 2004,
volume 3170 of Lecture Notes in Computer Science,
pages 402-416.
Springer,
2004.
[ps]
[bib]
-
M. Adélaïde and G. Sutre.
Parametric Analysis and Abstraction of Genetic Regulatory Networks.
In Proc. 2nd Workshop on Concurrent Models in Molecular Biology (BioCONCUR'04), London, UK, Aug. 2004,
Electronic Notes in Theor. Comp. Sci.,
Elsevier,
2004.
Note: To appear.
[ps]
[bib]
-
J.-M. Couvreur,
N. Saheb,
and G. Sutre.
An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems.
In Proc. 10th Int. Conf. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'2003), Almaty, Kazakhstan, Sep. 2003,
volume 2850 of Lecture Notes in Artificial Intelligence,
pages 361-375.
Springer,
2003.
[ps]
[doi]
[bib]
-
T. A. Henzinger,
R. Jhala,
R. Majumdar,
and G. Sutre.
Software Verification with BLAST.
In Proc. 10th Int. SPIN Workshop (SPIN'2003), Portland, OR, USA, May 2003,
volume 2648 of Lecture Notes in Computer Science,
pages 235-239.
Springer,
2003.
Note: Tool paper.
[ps]
[doi]
[bib]
-
T. A. Henzinger,
R. Jhala,
R. Majumdar,
G. C. Necula,
G. Sutre,
and W. Weimer.
Temporal-Safety Proofs for Systems Code.
In Proc. 14th Int. Conf. Computer Aided Verification (CAV'2002), Copenhagen, Denmark, July 2002,
volume 2404 of Lecture Notes in Computer Science,
pages 526-538.
Springer,
2002.
[ps]
[doi]
[bib]
-
F. Herbreteau,
F. Cassez,
A. Finkel,
O. Roux,
and G. Sutre.
Verification of Embedded Reactive Fiffo Systems.
In Proc. 5th Latin American Symposium on Theoretical Informatics (LATIN'2002), Cancún, México, Apr. 2002,
volume 2286 of Lecture Notes in Computer Science,
pages 400-414.
Springer,
2002.
[ps]
[doi]
[bib]
-
T. A. Henzinger,
R. Jhala,
R. Majumdar,
and G. Sutre.
Lazy Abstraction.
In Proc. 29th ACM Symp. Principles of Programming Languages (POPL'2002), Portland, OR, USA, Jan. 2002,
pages 58-70.
ACM Press,
2002.
[ps]
[doi]
[bib]
-
A. Finkel and G. Sutre.
An algorithm constructing the semilinear $post^*$ for 2-dim Reset/Transfer VASS.
In Proc. 25th Int. Symp. Math. Found. Comp. Sci. (MFCS'2000), Bratislava, Slovakia, Aug. 2000,
volume 1893 of Lecture Notes in Computer Science,
pages 353-362.
Springer,
2000.
[ps]
[doi]
[bib]
-
A. Finkel,
S. P. Iyer,
and G. Sutre.
Well-Abstracted Transition Systems.
In Proc. 11th Int. Conf. Concurrency Theory (CONCUR'2000), University Park, PA, USA, Aug. 2000,
volume 1877 of Lecture Notes in Computer Science,
pages 566-580.
Springer,
2000.
[ps]
[doi]
[bib]
-
A. Finkel and G. Sutre.
Decidability of reachability problems for classes of two counters automata.
In Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STACS'2000), Lille, France, Feb. 2000,
volume 1770 of Lecture Notes in Computer Science,
pages 346-357.
Springer,
2000.
[ps]
[doi]
[bib]
-
G. Sutre,
A. Finkel,
O. Roux,
and F. Cassez.
Effective Recognizability and Model Checking of Reactive Fiffo Automata.
In Proc. 7th Int. Conf. Algebraic Methodology and Software Technology (AMAST'98), Amazonia, Brazil, Jan. 1999,
volume 1548 of Lecture Notes in Computer Science,
pages 106-123.
Springer,
1999.
[ps]
[doi]
[bib]
Thesis
-
G. Sutre.
Abstraction et accélération de systèmes infinis.
PhD thesis,
ENS de Cachan,
October 2000.
[ps]
[bib]
Internal reports
-
A. Heussner,
T. Le Gall,
and G. Sutre.
Extrapolation-based Path Invariants for Abstraction Refinement of Fifo Systems.
Research Report RR-1459-09,
Lab. Bordelais de Recherche en Informatique,
Talence, France,
May 2009.
Note: 45 pages.
[pdf]
[bib]
-
A. Finkel,
S. P. Iyer,
and G. Sutre.
Well-Abstracted Transition Systems: Application to FIFO Automata.
Research Report LSV-00-6,
Lab. Specification and Verification, ENS de Cachan,
Cachan, France,
June 2000.
Note: 28 pages.
[ps]
[bib]
-
G. Sutre,
A. Finkel,
O. Roux,
and F. Cassez.
Effective Recognizability and Model Checking of Reactive Fiffo Automata.
Research Report LSV-98-10,
Lab. Specification and Verification, ENS de Cachan,
Cachan, France,
October 1998.
Note: 18 pages.
[ps]
[bib]
Other publications
-
G. Sutre.
Decidability of Reachability problems for classes of two counters automata.
In Proc. 4th Int. Summer School on MOdelling and VErification of Parallel Processes (MOVEP'2k), Nantes, France, Jun. 2000,
pages 224-227.
2000.
[ps]
[bib]
-
G. Sutre.
Vérification des automates à file réactifs : un modèle pour les systèmes réactifs écrits en Electre.
In Actes 2ième Congrès Modélisation des Systèmes Réactifs (MSR'99), Cachan, France, Mar. 1999,
pages 71-78.
Hermès,
1999.
[ps]
[bib]
-
G. Sutre.
Vérification de propriétés sur les automates à file réactifs produits par compilation de programmes Electre.
Master's thesis,
Univ. Paris VII et Ecole Polytechnique,
September 1997.
Note: Mémoire de DEA.
[ps]
[bib]
-
G. Sutre.
Analyse Sémantique Relationnelle -- Généralisation des Sections Simples.
Mémoire d'Enseignement Par la Recherche, ENSTA,
June 1996.
[bib]
This document was translated from BibTEX by
bibtex2html