Publications of Grégoire Sutre (with BibTeX, sorted by year)

2012

  1. 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, volume 7214 of Lecture Notes in Computer Science, pages 478-484. Springer, 2012. Note: Tool paper. [doi]
    @inproceedings{Heussner:2012:TACAS,
    author = {Heu{\ss}ner, A. and Le Gall, T. and Sutre, G.},
    title = {McScM: A General Framework for the Verification of Communicating Machines},
    booktitle = {Proc.\ 18th Int.\ Conf.\ Tools and Algorithms for the Construction and Analysis of Systems (TACAS'12), Tallinn, Estonia, Mar.-Apr.\ 2012},
    volume = {7214},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {478--484},
    year = {2012},
    note = {Tool paper},
    doi = {10.1007/978-3-642-28756-5_34} 
    }
    

2010

  1. 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]
    @inproceedings{Heussner:2010:FOSSACS,
    author = {Heu{\ss}ner, A. and Leroux, J. and Muscholl, A. and Sutre, G.},
    title = {Reachability Analysis of Communicating Pushdown Systems},
    booktitle = {Proc.\ 13th Int.\ Conf.\ Foundations of Software Science and Computation Structures (FOSSACS'10), Paphos, Cyprus, Mar.\ 2010},
    volume = {6014},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {267--281},
    year = {2010},
    doi = {10.1007/978-3-642-12032-9_19} 
    }
    

2009

  1. 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]
    @inproceedings{Soueidan:2009:CMSB,
    author = {Soueidan, H. and Sutre, G. and Nikolski, M.},
    title = {Qualitative Transition Systems for the Abstraction and Comparison of Transient Behavior in Parametrized Dynamic Models},
    booktitle = {Proc.\ 7th Int.\ Conf.\ on Computational Methods in Systems Biology (CMSB'09), Bologna, Italy, Aug.-Sep.\ 2009},
    volume = {5688},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {313--327},
    year = {2009},
    doi = {10.1007/978-3-642-03845-7_21} 
    }
    
  2. 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]
    @inproceedings{Gawlitza:2009:EA,
    author = {Gawlitza, T. and Leroux, J. and Reineke, J. and Seidl, H. and Sutre, G. and Wilhelm, R.},
    title = {Polynomial Precise Interval Analysis Revisited},
    booktitle = {Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday},
    volume = {5760},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {422-437},
    year = {2009},
    doi = {10.1007/978-3-642-03456-5_28} 
    }
    
  3. 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]
    @inproceedings{Heussner:2009:SPIN,
    author = {Heu{\ss}ner, A. and Le Gall, T. and Sutre, G.},
    title = {Extrapolation-based Path Invariants for Abstraction Refinement of Fifo Systems},
    booktitle = {Proc.\ 16th Int.\ SPIN Workshop on Model Checking of Software (SPIN'09), Grenoble, France, Jun.\ 2009},
    volume = {5578},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {107--124},
    year = {2009},
    pdf = {http://www.labri.fr/~sutre/Publications/Documents/Heussner:2009:SPIN.pdf},
    doi = {10.1007/978-3-642-02652-2_11} 
    }
    
  4. 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]
    @techreport{Heussner:2009:TR-LaBRI,
    author = {Heu{\ss}ner, A. and Le Gall, T. and Sutre, G.},
    title = {Extrapolation-based Path Invariants for Abstraction Refinement of Fifo Systems},
    type = {Research Report},
    number = {{RR}-1459-09},
    institution = {Lab.\ Bordelais de Recherche en Informatique},
    address = {Talence, France},
    month = may,
    year = {2009},
    note = {45 pages},
    pdf = {http://www.labri.fr/~sutre/Publications/Documents/Heussner:2009:TR-LaBRI.pdf} 
    }
    

2007

  1. 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]
    @inproceedings{Leroux:2007:FSTTCS,
    author = {Leroux, J. and Sutre, G.},
    title = {Acceleration in Convex Data-Flow Analysis},
    booktitle = {Proc.\ 27th Int.\ Conf.\ Found.\ of Software Technology and Theor.\ Comp.\ Sci.\ (FSTTCS'07), New Delhi, India, Dec.\ 2007},
    volume = {4855},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {520--531},
    year = {2007},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Leroux:2007:FSTTCS-Long.ps.gz},
    doi = {10.1007/978-3-540-77050-3_43} 
    }
    
  2. 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]
    @inproceedings{Leroux:2007:SAS,
    author = {Leroux, J. and Sutre, G.},
    title = {Accelerated Data-flow Analysis},
    booktitle = {Proc.\ 14th Int.\ Static Analysis Symposium (SAS'07), Kongens Lyngby, Denmark, Aug.\ 2007},
    volume = {4634},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {184--199},
    year = {2007},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Leroux:2007:SAS-Long.ps.gz},
    doi = {10.1007/978-3-540-74061-2_12} 
    }
    
  3. 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]
    @inproceedings{Herbreteau:2007:TACAS,
    author = {Herbreteau, F. and Sutre, G. and Tran, {T. Q.}},
    title = {Unfolding Concurrent Well-Structured Transition Systems},
    booktitle = {Proc.\ 13th Int.\ Conf.\ Tools and Algorithms for the Construction and Analysis of Systems (TACAS'07), Braga, Portugal, Mar.-Apr.\ 2007},
    volume = {4424},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {706--720},
    year = {2007},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Herbreteau:2007:TACAS-Long.ps.gz},
    doi = {10.1007/978-3-540-71209-1_55} 
    }
    

2005

  1. 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]
    @inproceedings{Leroux:2005:ATVA,
    author = {Leroux, J. and Sutre, G.},
    title = {Flat counter automata almost everywhere!},
    booktitle = {Proc.\ 3rd Int.\ Symp.\ Automated Technology for Verification and Analysis (ATVA'05), Taipei, Taiwan, Oct.\ 2005},
    volume = {3707},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {489--503},
    year = {2005},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Leroux:2005:ATVA-Long.ps.gz},
    doi = {10.1007/11562948_36} 
    }
    

2004

  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. [doi]
    @incollection{Kordon:2004:BOOK,
    author = {Bréant, F. and Couvreur, {J.-M.} and Gilliers, F. and Kordon, F. and Mounier, I. and Paviot-Adet, E. and Poitrenaud, D. and Regep, D. and Sutre, G.},
    title = {Modeling and verifying behavioral aspects},
    booktitle = {Formal Methods for Embedded Distributed Systems · How to master the complexity},
    chapter = {6},
    editor = {Kordon, F. and Lemoine, M.},
    publisher = {Kluwer Academic},
    pages = {171--211},
    year = {2004},
    doi = {10.1007/1-4020-7997-4_6} 
    }
    
  2. 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]
    @inproceedings{Leroux:2004:CONCUR,
    author = {Leroux, J. and Sutre, G.},
    title = {On Flatness for 2-dimensional Vector Addition Systems with States},
    booktitle = {Proc.\ 15th Int.\ Conf.\ Concurrency Theory (CONCUR'04), London, UK, Aug.-Sep.\ 2004},
    volume = {3170},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {402--416},
    year = {2004},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Leroux:2004:CONCUR-Long.ps.gz} 
    }
    
  3. 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]
    @inproceedings{Adelaide:2004:BioCONCUR,
    author = {Adélaïde, M. and Sutre, G.},
    title = {Parametric Analysis and Abstraction of Genetic Regulatory Networks},
    booktitle = {Proc.\ 2nd Workshop on Concurrent Models in Molecular Biology (BioCONCUR'04), London, UK, Aug.\ 2004},
    series = {Electronic Notes in Theor.\ Comp.\ Sci.},
    publisher = {Elsevier},
    year = {2004},
    note = {To appear},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Adelaide:2004:BioCONCUR.ps.gz} 
    }
    

2003

  1. 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]
    @article{Finkel:2003:IC,
    author = {Finkel, A. and Iyer, {S. P.} and Sutre, G.},
    title = {Well-Abstracted Transition Systems: Application to {FIFO} automata},
    journal = {Information and Computation},
    volume = {181},
    number = {1},
    pages = {1--31},
    year = {2003},
    doi = {10.1016/S0890-5401(02)00027-5} 
    }
    
  2. 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]
    @inproceedings{Couvreur:2003:LPAR,
    author = {Couvreur, {J.-M.} and Saheb, N. and Sutre, G.},
    title = {An Optimal Automata Approach to {LTL} Model Checking of Probabilistic Systems},
    booktitle = {Proc.\ 10th Int.\ Conf.\ Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'2003), Almaty, Kazakhstan, Sep.\ 2003},
    volume = {2850},
    series = {Lecture Notes in Artificial Intelligence},
    publisher = {Springer},
    pages = {361--375},
    year = {2003},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Couvreur:2003:LPAR.ps.gz},
    doi = {10.1007/b13986} 
    }
    
  3. 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]
    @inproceedings{Henzinger:2003:SPIN,
    author = {Henzinger, {T. A.} and Jhala, R. and Majumdar, R. and Sutre, G.},
    title = {Software Verification with {BLAST}},
    booktitle = {Proc.\ 10th Int.\ SPIN Workshop (SPIN'2003), Portland, OR, USA, May 2003},
    volume = {2648},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {235--239},
    year = {2003},
    note = {Tool paper},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Henzinger:2003:SPIN.ps.gz},
    doi = {10.1007/3-540-44829-2_17} 
    }
    

2002

  1. 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]
    @inproceedings{Henzinger:2002:CAV,
    author = {Henzinger, {T. A.} and Jhala, R. and Majumdar, R. and Necula, {G. C.} and Sutre, G. and Weimer, W.},
    title = {Temporal-Safety Proofs for Systems Code},
    booktitle = {Proc.\ 14th Int.\ Conf.\ Computer Aided Verification (CAV'2002), Copenhagen, Denmark, July 2002},
    volume = {2404},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {526--538},
    year = {2002},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Henzinger:2002:CAV.ps.gz},
    doi = {10.1007/3-540-45657-0_45} 
    }
    
  2. 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]
    @inproceedings{Herbreteau:2002:LATIN,
    author = {Herbreteau, F. and Cassez, F. and Finkel, A. and Roux, O. and Sutre, G.},
    title = {Verification of Embedded Reactive Fiffo Systems},
    booktitle = {Proc.\ 5th Latin American Symposium on Theoretical Informatics (LATIN'2002), Canc\'un, M\'exico, Apr.\ 2002},
    volume = {2286},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {400--414},
    year = {2002},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Herbreteau:2002:LATIN.ps.gz},
    doi = {10.1007/3-540-45995-2_36} 
    }
    
  3. 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]
    @inproceedings{Henzinger:2002:POPL,
    author = {Henzinger, {T. A.} and Jhala, R. and Majumdar, R. and Sutre, G.},
    title = {Lazy Abstraction},
    booktitle = {Proc.\ 29th ACM Symp.\ Principles of Programming Languages (POPL'2002), Portland, OR, USA, Jan.\ 2002},
    publisher = {ACM Press},
    pages = {58--70},
    year = {2002},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Henzinger:2002:POPL.ps.gz},
    doi = {10.1145/503272.503279} 
    }
    

2000

  1. 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]
    @inproceedings{Finkel:2000:MFCS,
    author = {Finkel, A. and Sutre, G.},
    title = {An algorithm constructing the semilinear $post^*$ for 2-dim Reset/Transfer VASS},
    booktitle = {Proc.\ 25th Int.\ Symp.\ Math.\ Found.\ Comp.\ Sci.\ (MFCS'2000), Bratislava, Slovakia, Aug.\ 2000},
    volume = {1893},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {353--362},
    year = {2000},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Finkel:2000:MFCS.ps.gz},
    doi = {10.1007/3-540-44612-5_31} 
    }
    
  2. 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]
    @inproceedings{Finkel:2000:CONCUR,
    author = {Finkel, A. and Iyer, {S. P.} and Sutre, G.},
    title = {Well-Abstracted Transition Systems},
    booktitle = {Proc.\ 11th Int.\ Conf.\ Concurrency Theory (CONCUR'2000), University Park, PA, USA, Aug.\ 2000},
    volume = {1877},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {566--580},
    year = {2000},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Finkel:2000:CONCUR.ps.gz},
    doi = {10.1007/3-540-44618-4_40} 
    }
    
  3. 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]
    @inproceedings{Finkel:2000:STACS,
    author = {Finkel, A. and Sutre, G.},
    title = {Decidability of reachability problems for classes of two counters automata},
    booktitle = {Proc.\ 17th Ann.\ Symp.\ Theoretical Aspects of Computer Science (STACS'2000), Lille, France, Feb.\ 2000},
    volume = {1770},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {346--357},
    year = {2000},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Finkel:2000:STACS.ps.gz},
    doi = {10.1007/3-540-46541-3_29} 
    }
    
  4. G. Sutre. Abstraction et accélération de systèmes infinis. PhD thesis, ENS de Cachan, October 2000. [ps]
    @phdthesis{Sutre:2000:THESE,
    author = {Sutre, G.},
    title = {Abstraction et accélération de systèmes infinis},
    school = {ENS de Cachan},
    month = oct,
    year = {2000},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Sutre:2000:THESE.ps.gz} 
    }
    
  5. 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]
    @techreport{Finkel:2000:TR-LSV,
    author = {Finkel, A. and Iyer, {S. P.} and Sutre, G.},
    title = {Well-Abstracted Transition Systems: Application to FIFO Automata},
    type = {Research Report},
    number = {LSV-00-6},
    institution = {Lab.\ Specification and Verification, ENS de Cachan},
    address = {Cachan, France},
    month = jun,
    year = {2000},
    note = {28 pages},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Finkel:2000:TR-LSV.ps.gz} 
    }
    
  6. 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]
    @conference{Sutre:2000:MOVEP,
    author = {Sutre, G.},
    title = {Decidability of Reachability problems for classes of two counters automata},
    booktitle = {Proc.\ 4th Int.\ Summer School on MOdelling and VErification of Parallel Processes (MOVEP'2k), Nantes, France, Jun.\ 2000},
    pages = {224--227},
    year = {2000},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Sutre:2000:MOVEP.ps.gz} 
    }
    

1999

  1. 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]
    @inproceedings{Sutre:1999:AMAST,
    author = {Sutre, G. and Finkel, A. and Roux, O. and Cassez, F.},
    title = {Effective Recognizability and Model Checking of Reactive Fiffo Automata},
    booktitle = {Proc.\ 7th Int.\ Conf.\ Algebraic Methodology and Software Technology (AMAST'98), Amazonia, Brazil, Jan.\ 1999},
    volume = {1548},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer},
    pages = {106--123},
    year = {1999},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Sutre:1999:AMAST.ps.gz},
    doi = {10.1007/3-540-49253-4_10} 
    }
    
  2. 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]
    @conference{Sutre:1999:MSR,
    author = {Sutre, G.},
    title = {Vérification des automates à file réactifs : un modèle pour les systèmes réactifs écrits en {\sc Electre}},
    booktitle = {Actes 2i\`eme Congrès Modélisation des Systèmes Réactifs (MSR'99), Cachan, France, Mar.\ 1999},
    publisher = {Herm\`es},
    pages = {71--78},
    year = {1999},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Sutre:1999:MSR.ps.gz} 
    }
    

1998

  1. 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]
    @techreport{Sutre:1998:TR-LSV,
    author = {Sutre, G. and Finkel, A. and Roux, O. and Cassez, F.},
    title = {Effective Recognizability and Model Checking of Reactive Fiffo Automata},
    type = {Research Report},
    number = {LSV-98-10},
    institution = {Lab.\ Specification and Verification, ENS de Cachan},
    address = {Cachan, France},
    month = oct,
    year = {1998},
    note = {18 pages},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Sutre:1998:TR-LSV.ps.gz} 
    }
    

1997

  1. 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]
    @mastersthesis{Sutre:1997:DEA,
    author = {Sutre, G.},
    title = {Vérification de propriétés sur les automates à file réactifs produits par compilation de programmes {\sc Electre}},
    school = {Univ.\ Paris VII et Ecole Polytechnique},
    month = sep,
    year = {1997},
    note = {Mémoire de DEA},
    postscript = {http://www.labri.fr/~sutre/Publications/Documents/Sutre:1997:DEA.ps.gz} 
    }
    

1996

  1. G. Sutre. Analyse Sémantique Relationnelle -- Généralisation des Sections Simples. Mémoire d'Enseignement Par la Recherche, ENSTA, June 1996.
    @misc{Sutre:1996:EPR,
    author = {Sutre, G.},
    title = {Analyse Sémantique Relationnelle -- Généralisation des Sections Simples},
    howpublished = {Mémoire d'Enseignement Par la Recherche, ENSTA},
    month = jun,
    year = {1996} 
    }
    

This document was translated from BibTEX by bibtex2html