Chapters in books |
|
| [1] |
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. [ bib ] |
Journal papers |
|
| [2] |
A. Finkel, S. P. Iyer, and G. Sutre.
Well-abstracted transition systems: Application to FIFO automata.
Information and Computation, 181(1):1-31, 2003. [ bib | doi ] |
Conference papers |
|
| [3] |
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. [ bib | .ps.gz ] |
| [4] |
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.
To appear. [ bib | .ps.gz ] |
| [5] |
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. [ bib | .ps.gz ] |
| [6] |
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.
Tool paper. [ bib | .ps.gz ] |
| [7] |
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. [ bib | .ps.gz ] |
| [8] |
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. [ bib | .ps.gz ] |
| [9] |
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. [ bib | .ps.gz ] |
| [10] |
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. [ bib | .ps.gz ] |
| [11] |
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. [ bib | .ps.gz ] |
| [12] |
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. [ bib | .ps.gz ] |
| [13] |
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. [ bib | .ps.gz ] |
PhD thesis |
|
| [14] |
G. Sutre.
Abstraction et accélération de systèmes infinis.
Thèse ENS de Cachan, October 2000. [ bib | .ps.gz ] |
Other publications |
|
| [15] |
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. [ bib | .ps.gz ] |
| [16] |
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.
28 pages. [ bib | .ps.gz ] |
| [17] |
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.
18 pages. [ bib | .ps.gz ] |
| [18] |
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. [ bib | .ps.gz ] |
| [19] |
G. Sutre.
Vérification de propriétés sur les automates à file réactifs produits
par compilation de programmes Electre.
Mémoire de DEA, Univ. Paris VII et Ecole Polytechnique, September
1997. [ bib | .ps.gz ] |
| [20] |
G. Sutre.
Analyse sémantique relationnelle - généralisation des sections
simples.
Mémoire d'Enseignement Par la Recherche, ENSTA, June 1996. [ bib ] |