@phdthesis{lf-these-82,
  author = {Fribourg, Laurent},
  title = {D{\'e}monstration automatique: r{\'e}futation par
                 superposition de clauses {\'e}quationnelles},
  year = {1982},
  month = sep,
  type = {Th{\`e}se de doctorat},
  school = {Universit{\'e} Paris~7, Paris, France}
}
@inproceedings{lf-ijcai-83,
  address = {Karlsruhe, West Germany},
  month = aug,
  year = 1983,
  publisher = {William Kaufmann},
  editor = {Bundy, Alan},
  acronym = {{IJCAI}'83},
  booktitle = {{P}roceedings of the 8th {I}nternational {J}oint
               {C}onference on {A}rtificial {I}ntelligence
               ({IJCAI}'83)},
  author = {Fribourg, Laurent},
  title = {A Superposition Oriented Theorem Prover},
  pages = {923-925}
}
@inproceedings{lf-cade-84,
  address = {Napa, California, USA},
  month = may,
  year = 1984,
  volume = 170,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer-Verlag},
  editor = {Shostak, Robert E.},
  acronym = {{CADE}'84},
  booktitle = {{P}roceedings of the 7th {I}nternational 
               {C}onference on {A}utomated {D}eduction
               ({CADE}'84)},
  author = {Fribourg, Laurent},
  title = {A Narrowing Procedure for Theories with Constructors},
  pages = {259-281}
}
@inproceedings{lf-icalp-84,
  address = {Antwerp, Belgium},
  month = jul,
  year = 1984,
  volume = 172,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer-Verlag},
  editor = {Paredaens, Jan},
  acronym = {{ICALP}'84},
  booktitle = {{P}roceedings of the 11th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming
               ({ICALP}'84)},
  author = {Fribourg, Laurent},
  title = {Oriented Equational Clauses as a Programming
                 Language},
  pages = {162-173}
}
@article{lf-jlp-84,
  publisher = {Elsevier Science Publishers},
  journal = {Journal of Logic Programming},
  author = {Fribourg, Laurent},
  title = {Oriented Equational Clauses as a Programming
                 Language},
  volume = 1,
  number = 2,
  pages = {165-177},
  year = {1984},
  month = aug
}
@techreport{jorrand85,
  author = {Jorrand, {\relax Ph}ilippe and 
                 Hufflen, Jean-Michel and Marty, Annick
                 and Marty, Jean-{\relax Ch}arles and 
                 Schnoebelen, {\relax Ph}ilippe},
  title = {{FP2}: {T}he Language and its Formal Definition},
  type = {Research Report},
  number = {537},
  year = {1985},
  month = may,
  institution = {Laboratoire d'Informatique Fondamentale et 
                 d'Intelligence Artificielle, Grenoble, France},
  lsvhowpublished = {Esprit Project 415, Deliverable D1}
}
@inproceedings{lf-ilps-85,
  address = {Boston, Massachusetts, USA},
  month = jul,
  year = 1985,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{SLP}'85},
  booktitle = {{P}roceedings of the 2nd
               {IEEE} {S}ymposium on
               {L}ogic {P}rogramming 
               ({SLP}'85)},
  author = {Fribourg, Laurent},
  title = {{SLOG}: {A} Logic Programming Language Interpreter
                 Based on Clausal Superposition and Rewriting},
  pages = {172-184}
}
@inproceedings{lf-tapsoft-85,
  address = {Berlin, Germany},
  month = mar,
  year = 1985,
  volume = 186,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer-Verlag},
  editor = {Ehrig, Hartmut and Floyd, Christiane and
            Nivat, Maurice and Thatcher, James W.},
  acronym = {{TAPSOFT}'89},
  booktitle = {{P}roceedings of the 1st 
               {I}nternational {J}oint {C}onference on 
               {T}heory and {P}ractice of {S}oftware {D}evelopment
               ({TAPSOFT}'89),
               {V}olume~2: {C}olloquium on {S}oftware {E}ngineering
               ({CSE})},
  author = {Boug{\'e}, Luc and Choquet, N. and 
                 Fribourg, Laurent and 
                 Gaudel, Marie-Claude},
  missingauthor = {},
  title = {Application of {P}rolog to Test Sets Generation from
                 Algebraic Specifications},
  pages = {261-275}
}
@article{lf-tcs-85,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Fribourg, Laurent},
  title = {A Superposition Oriented Theorem Prover},
  volume = {35},
  number = {2-3},
  pages = {129-164},
  year = {1985},
  month = feb
}
@techreport{schnoebelen85,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {The Semantics of Concurrency in {FP2}},
  type = {Research Report},
  number = {558},
  year = {1985},
  month = oct,
  institution = {Laboratoire d'Informatique Fondamentale et 
                 d'Intelligence Artificielle, Grenoble, France}
}
@mastersthesis{schnoebelen85b,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {S{\'e}mantique du parall{\'e}lisme en {FP2}},
  year = {1985},
  month = jun,
  type = {Rapport de {DEA}},
  school = {Universit{\'e} de Grenoble, France}
}
@inproceedings{lf-icalp-86,
  address = {Rennes, France},
  month = jul,
  year = 1986,
  volume = 226,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer-Verlag},
  editor = {Kott, Laurent},
  acronym = {{ICALP}'86},
  booktitle = {{P}roceedings of the 13th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming
               ({ICALP}'86)},
  author = {Fribourg, Laurent},
  title = {A Strong Restriction of the Inductive Completion
                 Procedure},
  pages = {105-115}
}
@article{lf-jss-86,
  publisher = {Elsevier Science Publishers},
  journal = {Journal of Systems and Software},
  author = {Boug{\'e}, Luc and Choquet, N. and 
                 Fribourg, Laurent and Gaudel, Marie-Claude},
  missingauthor = {},
  title = {Test Sets Generation From Algebraic Specifications
                 Using Logic Programming},
  volume = {6},
  number = {4},
  pages = {343-360},
  year = {1986},
  month = nov
}
@inproceedings{lf-protocol-85,
  address = {Toulouse-Moissac, France},
  month = jun,
  year = 1985,
  publisher = {North-Holland},
  editor = {Diaz, Michel},
  acronym = {{PSTV}'85},
  booktitle = {{P}roceedings of the {IFIP} {WG}6.1 
               5th {I}nternational {C}onference on {P}rotocol 
               {S}pecification, {T}esting and {V}erification
               ({PSTV}'85)},
  author = {Choquet, N. and Fribourg, Laurent and Mauboussin, A.},
  missingauthor = {Mauboussin, Anne ?},
  title = {Runnable Protocol Specifications Using the Logic
                 Interpreter {SLOG}},
  pages = {149-168}
}
@techreport{microfp2,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {{\(\mu\)-FP2}: {A} Prototype Interpreter for {FP2}},
  type = {Research Report},
  number = {573},
  year = {1986},
  month = jan,
  institution = {Laboratoire d'Informatique Fondamentale et 
                 d'Intelligence Artificielle, Grenoble, France}
}
@techreport{schnoebelen86,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {About the Implementation of {FP2}},
  type = {Research Report},
  number = {574},
  year = {1986},
  month = jan,
  institution = {Laboratoire d'Informatique Fondamentale et 
                 d'Intelligence Artificielle, Grenoble, France}
}
@inproceedings{lf-alp-88,
  address = {Gaussig, German Democratic Republic},
  month = nov,
  year = 1988,
  volume = 343,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer-Verlag},
  editor = {Grabowski, Jan and Lescanne, Pierre and
            Wechler, Wolfgang},
  acronym = {{ALP}'88},
  booktitle = {{P}roceedings of the 1st {I}nternational
               {W}orkshop on {A}lgebraic and {L}ogic {P}rogramming
               ({ALP}'88)},
  author = {Fribourg, Laurent},
  title = {Functional Extensions to {P}rolog: {A}re They Needed?},
  pages = {21-29},
  note = {Invited paper}
}
@inproceedings{lf-ilps-88,
  address = {Seattle, Washington, USA},
  month = aug,
  year = 1988,
  publisher = {MIT Press},
  editor = {Kowalski, Robert A. and Bowen, Kenneth A.},
  acronym = {{ICLP}/{SLP}'88},
  booktitle = {{P}roceedings of the 5th
               {I}nternational {C}onference and {S}ymposium on
               {L}ogic {P}rogramming 
               ({ICLP}/{SLP}'88)},
  author = {Fribourg, Laurent},
  title = {Equivalence-Preserving Transformations of Inductive
                 Properties of {P}rolog Programs},
  pages = {893-908}
}
@techreport{tica-report,
  author = {Schnoebelen, {\relax Ph}ilippe and Lugiez, Denis 
                  and Comon, Hubert},
  title = {A Semantics for Polymorphic Subtypes in Computer
                 Algebra},
  type = {Research Report},
  number = {711},
  year = {1988},
  month = mar,
  institution = {Laboratoire d'Informatique Fondamentale et 
                 d'Intelligence Artificielle, Grenoble, France}
}
@misc{jorrand89,
  author = {Jorrand, {\relax Ph}ilippe and 
                 Hufflen, Jean-Michel and 
                 Ib{\'a}{\~n}ez, Mar{\'\i}a Blanca and 
                 Karasek, T. and Rog\'e, S. and 
                 Schnoebelen, {\relax Ph}ilippe and V{\'e}ron, A.},
  missingauthor = {},
  title = {Parallel Specification of the Connection Method on an
                 {FP2} Machine},
  year = {1989},
  month = oct,
  howpublished = {Esprit Project 415, Deliverable D17}
}
@incollection{lf-academic-89,
  author = {Laurent Fribourg},
  title = {Proofs by Combinatory Induction on Recursively
                 Reducible Expressions},
  editor = {Ait-Kaci, Hassan and Nivat, Maurice},
  booktitle = {Resolution of Equations in Algebraic Structures},
  chapter = {5},
  pages = {117-141},
  year = {1989},
  publisher = {Academic Press},
  month = mar
}
@article{lf-jsc-89,
  publisher = {Elsevier Science Publishers},
  journal = {Journal of Symbolic Computation},
  author = {Fribourg, Laurent},
  title = {A Strong Restriction of the Inductive Completion
                 Procedure},
  volume = {8},
  number = {3},
  pages = {253-276},
  year = {1989},
  month = sep
}
@techreport{belmesk90,
  author = {Belmesk, Zoubir and Schnoebelen, {\relax Ph}ilippe},
  title = {Une g{\'e}n{\'e}ralisation des pr{\'e}sentations {FP2}
                 bas{\'e}e sur la th{\'e}orie des r{\'e}seaux},
  type = {Research Report},
  number = {832-I},
  year = {1990},
  month = nov,
  institution = {Laboratoire d'Informatique Fondamentale et 
                 d'Intelligence Artificielle, Grenoble, France}
}
@phdthesis{lf-hab-90,
  author = {Fribourg, Laurent},
  title = {Contribution {\`a} la v{\'e}rification des programmes
                 logiques},
  year = {1990},
  month = oct,
  type = {M{\'e}moire d'habilitation},
  school = {Universit{\'e} Paris~7, Paris, France}
}
@inproceedings{lf-iclp-90,
  address = {Jerusalem, Israel},
  month = jun,
  year = 1990,
  publisher = {MIT Press},
  editor = {Warren, David H. D. and Szeredi, P{\'e}ter},
  acronym = {{ICLP}'90},
  booktitle = {{P}roceedings of the 7th
               {I}nternational {C}onference on
               {L}ogic {P}rogramming 
               ({ICLP}'90)},
  author = {Fribourg, Laurent},
  title = {Extracting Logic Programs from Proofs that use
                 Extended {P}rolog Execution and Induction},
  pages = {685-699}
}
@inproceedings{lf-plilp-90,
  address = {Link{\"o}ping, Sweden},
  month = aug,
  year = 1990,
  volume = 456,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer-Verlag},
  editor = {Deransart, Pierre and Maluszynski, Jan},
  acronym = {{PLILP}'90},
  booktitle = {{P}roceedings of the 2nd {I}nternational
               {W}orkshop on {P}rogramming {L}anguage 
               {I}mplementation and {L}ogic {P}rogramming
               ({PLILP}'90)},
  author = {Fribourg, Laurent},
  title = {A New {P}resburger Arithmetic Decision Procedure 
                 Based on Extended {P}rolog Execution},
  pages = {174-188}
}
@techreport{schnoebelen89c,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Congruence Properties of the Process Equivalence
                 Induced by Temporal Logic},
  type = {Research Report},
  number = {831-I},
  year = {1990},
  month = oct,
  institution = {Laboratoire d'Informatique Fondamentale et 
                 d'Intelligence Artificielle, Grenoble, France}
}
@inproceedings{lf-ilps-91,
  address = {San Diego, California, USA},
  month = oct,
  year = 1991,
  publisher = {MIT Press},
  editor = {Saraswat, Vijay A. and Ueda, Kazunori},
  acronym = {{ICLP}'91},
  booktitle = {{P}roceedings of the 8th
               {I}nternational {C}onference on
               {L}ogic {P}rogramming 
               ({ICLP}'91)},
  author = {Fribourg, Laurent},
  title = {Automatic Generation of Simplification Lemmas for
                 Inductive Proofs},
  pages = {103-116}
}
@inproceedings{lf-plilp-91,
  address = {Passau, Germany},
  month = aug,
  year = 1991,
  volume = 528,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer-Verlag},
  editor = {Maluszynski, Jan and Wirsing, Martin},
  acronym = {{PLILP}'91},
  booktitle = {{P}roceedings of the 3rd {I}nternational
               {S}ymposium on {P}rogramming {L}anguage 
               {I}mplementation and {L}ogic {P}rogramming
               ({PLILP}'91)},
  author = {Cheong, Pui Hung and Fribourg, Laurent},
  title = {Efficient Integration of Simplification into
                 {P}rolog},
  pages = {359-370}
}
@inproceedings{schnoebelen95,
  address = {Yaroslavl, Russia},
  month = nov,
  year = 1995,
  publisher = {Yaroslavl University Press},
  booktitle = {{P}roceedings of the {C}onference 
                      {P}robl{\`e}mes {A}ctuels des {S}ciences 
                      {N}aturelles et {H}umaines},
  author = {Schnoebelen, {\relax Ph}ilippe and 
                  Laroussinie, Fran{\c{c}}ois},
  title = {Temporal Logic with Past for the Specification and
                 Verification of Reactive Systems},
  pages = {143-146},
  note = {Invited talk}
}
@inproceedings{laroussinie96fac,
  address = {Toulouse, France},
  month = feb,
  year = 1996,
  acronym = {{FAC}'96},
  booktitle = {{A}ctes des 5{\`e}mes {J}ourn{\'e}es sur la 
               {F}ormalisation des {A}ctivit{\'e}s {C}oncurrentes
               ({FAC}'96)},
  author = {Laroussinie, Fran{\c{c}}ois and Schnoebelen, {\relax Ph}ilippe},
  title = {Translations for Model-Checking Temporal Logic with
                 Past},
  pages = {17-19},
  note = {Invited talk}
}
@inproceedings{AF-BW-PW-INF-97,
  address = {Bologna, Italy},
  month = jul,
  year = 1997,
  volume = 9,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Moller, Faron},
  acronym = {{INFINITY}'97},
  booktitle = {{P}roceedings of the 2nd {I}nternational 
               {W}orkshop on {V}erification of {I}nfinite
               {S}tate {S}ystems
               ({INFINITY}'97)},
  author = {Finkel, Alain and Willems, Bernard and Wolper, Pierre},
  title = {A Direct Symbolic Approach to Model Checking Pushdown
                 Systems (Extended Abstract)},
  pages = {27-39},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/FWW-infinity97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FWW-infinity97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FWW-infinity97.pdf}
}
@misc{AF-CC-RG-GDR-PRC-ISIS-CHM-97,
  author = {Collet, {\relax Ch}ristophe and Finkel, Alain and 
		  Rachid Gherbi},
  title = {Prise en compte dynamique des attitudes perceptive de
                 l'usager},
  year = {1997},
  missingmonth = {},
  missingnmonth = {},
  howpublished = {Rapport de synth{\`e}se (version~IV de l'Action Inter-{PRC}
                 10.2 {GDR}-{PRC} {ISIS} \& {CHM} : <<~Interaction
                 Syst{\`e}me-Environnement pour l'Interpr{\'e}tation des
                 Signaux et des Images~>>},
  lsv-lang = {FR}
}
@inproceedings{AF-CC-RG-IEEE-97,
  address = {Budapest, Hungary},
  month = sep,
  year = 1997,
  publisher = {{IEEE} Press},
  acronym = {{INES}'97},
  booktitle = {{P}roceedings of the {IEEE} {I}nternational
               {C}onference on {I}ntelligent {E}ngineering
               {S}ystems
               ({INES}'97)},
  author = {Collet, {\relax Ch}ristophe and Finkel, Alain and 
		  Rachid Gherbi},
  title = {Gaze Capture System in Man-Machine Interaction},
  pages = {557-581},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/CFG-ines97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CFG-ines97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CFG-ines97.pdf}
}
@inproceedings{AF-CC-RG-Inter-97,
  address = {Montpellier, France},
  month = may,
  year = 1997,
  booktitle = {{A}ctes des 6{\`e}mes {J}ourn{\'e}es 
               {I}nternationales {I}nterfaces},
  author = {Collet, {\relax Ch}ristophe and Finkel, Alain and 
		  Rachid Gherbi},
  title = {{C}ap{R}e : un syst{\`e}me de capture du regard dans un
                 contexte d'interaction homme-machine},
  pages = {36-39},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/CFG-jiim97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CFG-jiim97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CFG-jiim97.pdf},
  lsv-lang = {FR}
}
@inproceedings{AF-CD-FSTTCS-97,
  address = {Kharagpur, India},
  month = dec,
  year = 1997,
  volume = 1346,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Ramesh, S. and Sivakumar, G.},
  acronym = {{FSTTCS}'97},
  booktitle = {{P}roceedings of the 17th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'97)},
  author = {Dufourd, Catherine and Finkel, Alain},
  title = {Polynomial-Time Many-One Reductions for {P}etri Nets},
  pages = {312-326},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/DufFin-fsttcs97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DufFin-fsttcs97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DufFin-fsttcs97.pdf}
}
@inproceedings{AF-CT-CAV-97,
  address = {Haifa, Israel},
  month = jun,
  year = 1997,
  volume = 1254,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Grumberg, Orna},
  acronym = {{CAV}'97},
  booktitle = {{P}roceedings of the 9th
               {I}nternational {C}onference on 
               {C}omputer {A}ided {V}erification
               ({CAV}'97)},
  author = {C{\'e}c{\'e}, G{\'e}rard and Finkel, Alain},
  title = {Programs with Quasi-Stable Channels are Effectively
                 Recognizable},
  pages = {304-315},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/CecFin-cav97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CecFin-cav97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CecFin-cav97.pdf}
}
@inproceedings{AF-GRE-97,
  address = {Grenoble, France},
  month = mar,
  year = 1997,
  booktitle = {{P}roceedings of the 
               {G}renoble-{A}lpes d'{H}uez {E}uropean {S}chool 
               of {C}omputer {S}cience, {M}ethods and {T}ools 
               for the {V}erification of {I}nfinite {S}tate 
               {S}ystems},
  author = {Finkel, Alain},
  title = {Algorithms and Semi-Algorithms for Infinite State
                 Systems},
  pages = {189-190},
  note = {Invited tutorial}
}
@article{AF-PMc-TCS-97,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Finkel, Alain and McKenzie, Pierre},
  title = {Verifying Identical Communicating Processes is
                 Undecidable},
  volume = {174},
  number = {1-2},
  pages = {217-230},
  year = {1997},
  month = mar,
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/FMK-TCS97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FMK-TCS97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FMK-TCS97.pdf}
}
@inproceedings{AF-ZB-INF-97,
  address = {Bologna, Italy},
  month = jul,
  year = 1997,
  volume = 9,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Moller, Faron},
  acronym = {{INFINITY}'97},
  booktitle = {{P}roceedings of the 2nd {I}nternational 
               {W}orkshop on {V}erification of {I}nfinite
               {S}tate {S}ystems
               ({INFINITY}'97)},
  author = {Bouziane, Zakaria and Finkel, Alain},
  title = {Cyclic {P}etri Net Reachability Sets are Semi-Linear
                 Effectively Constructible},
  pages = {15-24},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/BF-infinity97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BF-infinity97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BF-infinity97.pdf}
}
@inproceedings{BB-CP-MFCS97,
  address = {Bratislava, Slovakia},
  month = aug,
  year = 1997,
  volume = 1295,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Pr{\'i}vara, Igor and Ruzicka, Peter},
  acronym = {{MFCS}'97},
  booktitle = {{P}roceedings of the 22nd
               {I}nternational {S}ymposium on
               {M}athematical {F}oundations of 
               {C}omputer {S}cience
               ({MFCS}'97)},
  author = {B{\'e}rard, B{\'e}atrice and Picaronny, Claudine},
  title = {Accepting {Z}eno Words without Making Time Stand
                 Still},
  pages = {149-158},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/BerPic-long.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BerPic-long.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BerPic-long.pdf}
}
@article{BCB-RC-AP-97,
  address = {Les Ulis, France},
  publisher = {EDP Sciences},
  journal = {RAIRO Informatique Th{\'e}orique et Applications},
  author = {Charron{-}Bost, Bernadette and Cori, Robert and 
                  Petit, Antoine},
  title = {Introduction {\`a} l'algorithmique en m{\'e}moire
                 partag{\'e}e},
  volume = {31},
  number = {2},
  pages = {97-148},
  year = {1997},
  missingmonth = {},
  missingnmonth = {},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCP-RAIRO97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CCP-RAIRO97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CCP-RAIRO97.pdf},
  lsv-lang = {FR}
}
@inproceedings{CD-Renpar-97,
  address = {Lausanne, Switzerland},
  month = may,
  year = 1997,
  acronym = {{RENPAR}'97},
  booktitle = {{A}ctes des 9{\`e}mes {R}encontres 
               {F}rancophones du {P}arall{\'e}lisme
               ({RENPAR}'97)},
  author = {Dufourd, Catherine},
  title = {Une extension d'un r{\'e}sultat d'ind{\'e}cidabilit{\'e}
                 pour les automates temporis{\'e}s},
  pages = {219-222},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/Duf-renpar97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Duf-renpar97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Duf-renpar97.pdf},
  lsv-lang = {FR}
}
@inproceedings{FB-LP-MOSIM-97,
  address = {Rouen, France},
  month = jun,
  year = 1997,
  publisher = {Herm{\`e}s},
  acronym = {{MOSIM}'97},
  booktitle = {{A}ctes de la 1{\`e}re {C}onf{\'e}rence
               {F}rancophone de {M}od{\'e}lisation et de 
               {S}imulation
               ({MOSIM}'97)},
  author = {Belala, F. and Petrucci, Laure},
  missingauthor = {},
  title = {{S}\'emantique des {ECATN}ets en termes de {CPN}ets :
                 application {\`a} un exemple de production},
  missingpages = {},
  lsv-lang = {FR}
}
@inproceedings{GC-Renpar-97,
  address = {Lausanne, Switzerland},
  month = may,
  year = 1997,
  acronym = {{RENPAR}'97},
  booktitle = {{A}ctes des 9{\`e}mes {R}encontres 
               {F}rancophones du {P}arall{\'e}lisme
               ({RENPAR}'97)},
  author = {C{\'e}c{\'e}, G{\'e}rard},
  title = {Les programmes utilisant des canaux quasi-stables sont
                 effectivement reconnaissables},
  pages = {215-218},
  lsv-lang = {FR}
}
@book{JCB-HC-CK-DK-MM-JMM-AP-YR-livre96,
  author = {Bajard, Jean-Claude and Comon, Hubert and 
                 Kenyon, Claire and Krob, Daniel
                 and Morvan, Michel and Muller, Jean-Michel and 
                 Petit, Antoine and Robert, Yves},
  title = {Exercices d'algorithmique (oraux d'{ENS})},
  year = {1997},
  publisher = {Vuibert},
  month = jan,
  pages = {272},
  isbn = {2-84180-105-5},
  lsv-lang = {FR}
}
@techreport{LSV:97:10,
  author = {Williams{-}Preston, Nicky},
  title = {An Experiment in Reverse Engineering Using Algebraic
                 Specifications},
  type = {Research Report},
  number = {LSV-97-10},
  year = {1997},
  month = nov,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-1997-10.rr.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-1997-10.rr.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-1997-10.rr.ps}
}
@inproceedings{MM-MB-GB-LP-MOSIM-97,
  address = {Rouen, France},
  month = jun,
  year = 1997,
  publisher = {Herm{\`e}s},
  acronym = {{MOSIM}'97},
  booktitle = {{A}ctes de la 1{\`e}re {C}onf{\'e}rence
               {F}rancophone de {M}od{\'e}lisation et de 
               {S}imulation
               ({MOSIM}'97)},
  author = {Maouche, Mourad and Bettaz, Mohamed and 
                 Berthelot, G{\'e}rard and Petrucci, Laure},
  title = {Du vrai parall{\'e}lisme dans les r{\'e}seaux
                 alg{\'e}briques et de son application dans les syst{\`e}mes
                 de production},
  pages = {417-424},
  lsv-lang = {FR}
}
@inproceedings{RM-AP-mfcs97,
  address = {Bratislava, Slovakia},
  month = aug,
  year = 1997,
  volume = 1295,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Pr{\'i}vara, Igor and Ruzicka, Peter},
  acronym = {{MFCS}'97},
  booktitle = {{P}roceedings of the 22nd
               {I}nternational {S}ymposium on
               {M}athematical {F}oundations of 
               {C}omputer {S}cience
               ({MFCS}'97)},
  author = {Meyer, Rapha{\"e}l and Petit, Antoine},
  title = {Decomposition of {TrPTL} Formulas},
  pages = {418-427},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/MeyPet-mfcs97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MeyPet-mfcs97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MeyPet-mfcs97.pdf}
}
@inproceedings{VD-PG-AP-stacs97,
  address = {L{\"u}beck, Germany},
  month = feb,
  year = 1997,
  volume = 1200,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Reischuk, R{\"u}diger and Morvan, Michel},
  acronym = {{STACS}'97},
  booktitle = {{P}roceedings of the 14th {A}nnual
               {S}ymposium on {T}heoretical {A}spects of
               {C}omputer {S}cience
               ({STACS}'97)},
  author = {Diekert, Volker and Gastin, Paul and Petit, Antoine},
  title = {Removing {{\(\epsilon\)}}-Transitions in Timed Automata},
  pages = {583-594},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/DGP-stacs97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DGP-stacs97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DGP-stacs97.pdf},
  abstract = {Timed automata are among the most widely studied models for
                  real-time systems. Silent transitions, \emph{i.e.},
                  \(\epsilon\)-transitions, have already been proposed in the
                  original paper on timed automata by Alur and Dill. B{\'e}rard,
                  Gastin and Petit have shown that \(\epsilon\)-transitions
                  can be removed, if they do not reset clocks; moreover
                  \(\epsilon\)-transitions strictly increase the power of timed
                  automata, if there is a self-loop containing
                  \(\epsilon\)-transitions which reset some clocks. This paper left
                  open the problem about the power of the \(\epsilon\)-transitions
                  which reset clocks, if they do not lie on any cycle.\par
                  The present paper settles this open question. Precisely, we
                  prove that a timed automaton such that no \(\epsilon\)-transition
                  with nonempty reset set lies on any directed cycle can be
                  effectively transformed into a timed automaton without
                  \(\epsilon\)-transitions. Interestingly, this main result holds
                  under the assumption of non-Zenoness and it is false
                  otherwise.\par 
                  Besides, we develop a promising new technique based on a
                  notion of precise 
                  time which allows to show that some timed languages are not
                  recognizable by any \(\epsilon\)-free timed automaton.}
}
@inproceedings{comon97lics,
  address = {Warsaw, Poland},
  month = jul,
  year = 1997,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'97},
  booktitle = {{P}roceedings of the 12th
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'97)},
  author = {Comon, Hubert and Jacquemard, Florent},
  title = {Ground Reducibility is {EXPTIME}-Complete},
  pages = {26-34},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/ComJac-lics97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComJac-lics97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ComJac-lics97.pdf}
}
@misc{comon97licsb,
  author = {Comon, Hubert},
  title = {Applications of Tree Automata in Rewriting and
                 Lambda-Calculus},
  year = 1997,
  month = jul,
  howpublished = {Invited lecture, 12th
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'97), Warsaw, Poland}
}
@proceedings{comon97rta,
  title = {{P}roceedings of the 8th {I}nternational
           {C}onference on {R}ewriting {T}echniques
           and {A}pplications
           ({RTA}'97)},
  booktitle = {{P}roceedings of the 8th {I}nternational
               {C}onference on {R}ewriting {T}echniques
               and {A}pplications
               ({RTA}'97)},
  editor = {Comon, Hubert},
  publisher = {Springer},
  volume = {1232},
  series = {Lecture Notes in Computer Science},
  pages = {348},
  year = {1997},
  month = jun,
  isbn = {3-540-62950-5},
  url = {http://www.springer.com/978-3-540-62950-5},
  olderurl = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-62950-5}
}
@article{comon97tcs,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Comon, Hubert and Treinen, Ralf},
  title = {The First-Order Theory of Lexicographic Path Orderings
                 is Undecidable},
  volume = {176},
  number = {1-2},
  pages = {67-87},
  year = {1997},
  month = apr,
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/ComTre-TCS97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComTre-TCS97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ComTre-TCS97.pdf}
}
@misc{edf-comon-97,
  author = {Comon, Hubert},
  title = {Une approche logique des contr{\^o}les logiques},
  year = {1997},
  month = jun,
  howpublished = {Rapport de contrat EDF/DER/MOS--LSV},
  lsv-lang = {FR}
}
@techreport{forma-sric-BerBid-97,
  author = {B{\'e}rard, B{\'e}atrice and Bidoit, Michel},
  title = {Contribution du {LSV} {\`a} l'op{\'e}ration~2 <<~{\'E}tude de
                 cas {SRIC}~>>},
  year = {1997},
  month = oct,
  type = {Contract Report},
  institution = {Action FORMA},
  note = {29 pages}
}
@article{hen-wir-bid-tcs-wadt,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Hennicker, Rolf and Wirsing, Martin and Bidoit, Michel},
  title = {Proof Systems for Structured Specifications with
                 Observability Operators},
  volume = {173},
  number = {2},
  pages = {393-443},
  year = {1997},
  month = feb
}
@inproceedings{kouchnarenko97,
  address = {Yaroslavl, Russia},
  month = sep,
  year = 1997,
  volume = 1277,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Malyshkin, Victor E.},
  acronym = {{PaCT}'97},
  booktitle = {{P}roceedings of the 4th {I}nternational
               {C}onference on {P}arallel {C}omputing
               {T}echnologies
               ({PaCT}'97)},
  author = {Kouchnarenko, Olga and Schnoebelen, {\relax Ph}ilippe},
  title = {A Formal Framework for the Analysis of
                 Recursive-Parallel Programs},
  pages = {45-59},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/KusSch-pact97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/KusSch-pact97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KusSch-pact97.pdf},
  doi = {10.1007/3-540-63371-5_6}
}
@inproceedings{kouchnarenko97b,
  address = {Pisa, Italy},
  year = 1997,
  volume = 5,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Steffen, B. and Caucal, Didier},
  acronym = {{INFINITY}'96},
  booktitle = {{P}roceedings of the 1st {I}nternational 
               {W}orkshop on {V}erification of {I}nfinite
               {S}tate {S}ystems
               ({INFINITY}'96)},
  author = {Kouchnarenko, Olga and Schnoebelen, {\relax Ph}ilippe},
  title = {A Model for Recursive-Parallel Programs},
  pages = {30},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/KouSch-infin96.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/KouSch-infin96.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KouSch-infin96.pdf},
  doi = {10.1016/S1571-0661(05)82512-5}
}
@inproceedings{kristoffersen97,
  address = {Lille, France},
  month = apr,
  year = 1997,
  volume = 1214,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Bidoit, Michel and Dauchet, Max},
  acronym = {{TAPSOFT}'97},
  booktitle = {{P}roceedings of the 7th 
               {I}nternational {J}oint {C}onference {CAAP}/{FASE} on 
               {T}heory and {P}ractice of {S}oftware {D}evelopment
               ({TAPSOFT}'97)},
  author = {Kristoffersen, K{\aa}re J. and 
                 Laroussinie, Fran{\c{c}}ois and 
                 Larsen, Kim G. and Pettersson, Paul and Yi, Wang},
  title = {A Compositional Proof of a Real-Time Mutual Exclusion
                 Protocol},
  pages = {565-579},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/KLLPY-tapsoft97.pdf},
  ps = {KLLPY-tapsoft97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KLLPY-tapsoft97.pdf},
  doi = {10.1007/BFb0030626}
}
@inproceedings{laroussinie97,
  address = {Santa Margherita Ligure, Italy},
  month = sep,
  year = 1997,
  volume = 7,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Palamidessi, Catuscia and Parrow, Joachim},
  acronym = {{EXPRESS}'97},
  booktitle = {{P}roceedings of the 4th {I}nternational
               {W}orkshop on {E}xpressiveness in
               {C}oncurrency
               ({EXPRESS}'97)},
  author = {Laroussinie, Fran{\c{c}}ois and 
                  Schnoebelen, {\relax Ph}ilippe},
  title = {Specification in {CTL}+{P}ast, Verification in {CTL}},
  pages = {161-184},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/LarSch-express97.pdf},
  ps = {LarSch-express97.ps},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LarSch-express97.pdf},
  doi = {10.1016/S1571-0661(05)80472-4}
}
@inproceedings{lf-ho-concur-97,
  address = {Warsaw, Poland},
  month = jul,
  year = 1997,
  volume = 1243,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Mazurkiewicz, Antoni W. and Winkowski, J{\'o}zef},
  acronym = {{CONCUR}'97},
  booktitle = {{P}roceedings of the 8th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'97)},
  author = {Fribourg, Laurent and Ols{\'e}n, Hans},
  title = {Proving Safety Properties of Infinite State Systems by
                 Compilation into {P}resburger Arithmetic},
  pages = {213-227},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/LF-concur97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LF-concur97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LF-concur97.pdf}
}
@article{lf-ho-constraint-97,
  publisher = {Kluwer Academic Publishers},
  journal = {Constraints},
  author = {Fribourg, Laurent and Ols{\'e}n, Hans},
  title = {A Decompositional Approach for Computing Least
                 Fixed-Points of {D}atalog Programs with {Z}-Counters},
  volume = {2},
  number = {3-4},
  pages = {305-335},
  year = {1997},
  missingmonth = {>oct},
  missingnmonth = {>10},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/LF-constraints97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LF-constraints97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LF-constraints97.pdf}
}
@inproceedings{lf-ho-infinity-97,
  address = {Bologna, Italy},
  month = jul,
  year = 1997,
  volume = 9,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Moller, Faron},
  acronym = {{INFINITY}'97},
  booktitle = {{P}roceedings of the 2nd {I}nternational 
               {W}orkshop on {V}erification of {I}nfinite
               {S}tate {S}ystems
               ({INFINITY}'97)},
  author = {Fribourg, Laurent and Ols{\'e}n, Hans},
  title = {Reachability Sets of Parametrized Rings As Regular
                 Languages},
  pages = {40},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/LF-infinity97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LF-infinity97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LF-infinity97.pdf}
}
@proceedings{mb-max-tapsoft97,
  title = {{P}roceedings of the 7th 
           {I}nternational {J}oint {C}onference {CAAP}/{FASE} on 
           {T}heory and {P}ractice of {S}oftware {D}evelopment
           ({TAPSOFT}'97)},
  booktitle = {{P}roceedings of the 7th 
               {I}nternational {J}oint {C}onference {CAAP}/{FASE} on 
               {T}heory and {P}ractice of {S}oftware {D}evelopment
               ({TAPSOFT}'97)},
  editor = {Bidoit, Michel and Max Dauchet},
  publisher = {Springer},
  volume = {1214},
  series = {Lecture Notes in Computer Science},
  pages = {889},
  year = {1997},
  month = apr,
  organization = {Lille, France},
  isbn = {3-540-62781-2},
  url = {http://www.springer.com/978-3-540-62781-2},
  olderurl = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-62781-2}
}
@incollection{plandedefense,
  author = {Bidoit, Michel and Pellen, {\relax Ch}ristine and 
                 Ryckbosch, J{\'e}r{\^o}me},
  title = {Plan de D{\'e}fense~--- {F}ormalisation du cahier des
                 charges du {P}oint {C}entral {\`a} l'aide de sp{\'e}cifications
                 alg{\'e}briques},
  booktitle = {Application des techniques formelles au logiciel},
  chapter = {7},
  type = {chapter},
  pages = {123-132},
  series = {ARAGO 20},
  publisher = {Observatoire Fran\c{c}ais des Techniques Avanc\'ees},
  year = {1997},
  month = jun,
  lsv-lang = {FR}
}
@mastersthesis{sutre97,
  author = {Sutre, Gr{\'e}goire},
  title = {V{\'e}rification de propri{\'e}t{\'e}s sur les automates 
                 {\`a} file
                 r{\'e}actifs produits par compilation de programmes
                 {E}lectre},
  year = {1997},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Algorithmique, Paris, France},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/Sut-dea97.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Sut-dea97.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sut-dea97.pdf},
  lsv-lang = {FR}
}
@misc{AF-MOVEP-98,
  author = {Finkel, Alain},
  title = {Analyse des syst{\`e}mes infinis bien 
                 structur{\'e}s ou <<~reconnaissables~>>},
  howpublished = {Invited tutorial, 3{\`e}me {\'E}cole d'{\'e}t{\'e}
               {M}od{\'e}lisation et {V}{\'e}rification des
               {P}rocessus {P}arall{\`e}les
               ({MOVEP}'98), Nantes, France},
  year = 1998,
  month = jul,
  lsv-lang = {FR}
}
@inproceedings{AF-ZB-98-RevPN,
  address = {Kunming, China},
  year = 1998,
  publisher = {Springer},
  editor = {Shum, Kar Ping and Guo, Yuqi and Ito, Massami
            and Fong, Yuen},
  booktitle = {{P}roceedings of the {I}nternational
               {C}onference in {S}emigroups and its
               {R}elated {T}opics},
  author = {Bouziane, Zakaria and Finkel, Alain},
  title = {The Equivalence Problem for Commutative 
                 Semigroups and
                 Reversible {P}etri Nets is Complete in Exponential
                 Space under Log-Lin Reducibility},
  pages = {63-76}
}
@techreport{AP-mc98,
  author = {Petit, Antoine},
  title = {Le model-checking, une technique de 
                 v{\'e}rification en plein essor. {I}ntroduction},
  year = {1998},
  month = oct,
  type = {Contract Report},
  institution = {EDF/DER/MOS - LSV},
  lsv-lang = {FR}
}
@techreport{BB-MB-AP-src98,
  author = {B{\'e}rard, B{\'e}atrice and Bidoit, Michel and 
                 Petit, Antoine},
  title = {Recommandations sur le cahier des charges {SRC}},
  year = {1998},
  missingmonth = {},
  missingnmonth = {},
  type = {Contract Report},
  institution = {EDF/DER/MOS - LSV},
  lsv-lang = {FR}
}
@article{BB-VD-PG-AP-98,
  publisher = {{IOS} Press},
  journal = {Fundamenta Informaticae},
  author = {B{\'e}rard, B{\'e}atrice and Diekert, Volker and 
                 Gastin, Paul and Petit, Antoine},
  title = {Characterization of the Expressive Power of Silent
                 Transitions in Timed Automata},
  volume = {36},
  number = {2},
  pages = {145-182},
  year = {1998},
  month = nov,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BDGP-FUNDI98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BDGP-FUNDI98.ps},
  abstract = {Timed automata are among the 
	most widely studied models for real-time 
	systems. Silent transitions (or 
	\(\epsilon\)-transitions) have already been 
	proposed in the original paper on timed 
	automata by Alur and~Dill. We show that the 
	class of timed languages recognized by 
	automata with \(\epsilon\)-transitions, is more 
	robust and more expressive than the 
	corresponding class without 
	\(\epsilon\)-transitions. \par
	We then focus on \(\epsilon\)-transitions which do 
	not reset clocks. We propose an algorithm to 
	construct, given a timed automaton, an 
	equivalent one without such transitions. This 
	algorithm is in two steps, it first suppresses 
	the cycles of \(\epsilon\)-transitions without 
	reset and then the remaining ones.\par
	Then, we prove that a timed automaton such 
	that no \(\epsilon\)-transition which resets clocks 
	lies on any directed cycle, can be effectively 
	transformed into a timed automaton without 
	\(\epsilon\)-transitions. Interestingly, this main 
	result holds under the assumption of 
	non-Zenoness and it is false otherwise.\par
	To complete the picture, we exhibit a simple 
	timed automaton with an \(\epsilon\)-transition, 
	which resets some clock, on a cycle and which 
	is not equivalent to any \(\epsilon\)-free timed 
	automaton. To show this, we develop a 
	promising new technique based on the notion of 
	precise action.}
}
@article{CC-AF-RG-aci98,
  address = {Tokyo, Japan},
  publisher = {Fuji Technology Press},
  journal = {Journal of Advanced 
             Computational Intelligence},
  author = {Collet, {\relax Ch}ristophe and Finkel, Alain and 
		  Gherbi, Rachid},
  title = {{C}ap{R}e: {A}~Gaze Tracking System in Man-Machine
                 Interaction},
  volume = {2},
  number = {3},
  pages = {77-81},
  year = {1998},
  missingnmonth = {},
  missingmonth = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CFG-JACI98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CFG-JACI98.ps}
}
@inproceedings{CC-AP-mteac98,
  address = {Las Vegas, Nevada, USA},
  month = jan,
  year = 1998,
  editor = {B{\"o}hm, A. P. Wim and Najjar, Walid A.},
  acronym = {{MTEAC}'98},
  booktitle = {{P}roceedings of the {W}orkshop on
               {M}ultithreaded {E}xecution, {A}rchitecture
               and {C}ompilation
               ({MTEAC}'98)},
  author = {C{\'e}rin, {\relax Ch}ristophe and Petit, Antoine},
  title = {Application of Algebraic Techniques to Compute the
                 Efficiency Measure for Multithreaded Architecture},
  missingpages = {??},
  howpublished = {Proceedings published as 
                 Technical Report CS-98-102,
                 Colorado State University},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CP-mteac98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CP-mteac98.ps}
}
@techreport{DD1-98,
  author = {Laroussinie, Fran{\c{c}}ois and Petit, Antoine and 
                 Schnoebelen, {\relax Ph}ilippe},
  title = {Le model-checking, une technique de 
                 v{\'e}rification en
                 plein essor. {I}~--- {P}rincipes et techniques},
  year = {1998},
  month = oct,
  type = {Contract Report},
  institution = {EDF/DER/MOS - LSV},
  lsv-lang = {FR}
}
@techreport{DD2-98,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Le model-checking, une technique de 
                 v{\'e}rification en
                 plein essor. {III}~--- {S}p{\'e}cifier pour  
                 v{\'e}rifier},
  year = {1998},
  month = oct,
  type = {Contract Report},
  institution = {EDF/DER/MOS - LSV},
  lsv-lang = {FR}
}
@techreport{DD3-98,
  author = {B{\'e}rard, B{\'e}atrice and 
                  C{\'e}c{\'e}, G{\'e}rard and 
                 Dufourd, Catherine and Finkel, Alain and
                 Laroussinie, Fran{\c{c}}ois and Petit, Antoine and 
                 Schnoebelen, {\relax Ph}ilippe and 
                 Sutre, Gr{\'e}goire},
  title = {Le model-checking, une technique de 
                 v{\'e}rification en
                 plein essor. {II}~--- {Q}uelques outils},
  year = {1998},
  month = oct,
  type = {Contract Report},
  institution = {EDF/DER/MOS - LSV},
  lsv-lang = {FR}
}
@article{GG-RM-AP-PW-98,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Guaiana, Giovana and Meyer, Rapha{\"e}l and 
                  Petit, Antoine and Weil, Pascal},
  title = {An Extension of the Wreath Product Principle for
                 Finite {M}azurkiewicz Traces},
  volume = {67},
  number = {6},
  pages = {277-282},
  year = {1998},
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GMPW-IPL98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GMPW-IPL98.ps}
}
@inproceedings{KB-LP-WFM-98,
  address = {Lisbon, Portugal},
  month = jun,
  year = 1998,
  volume = {98/7},
  series = {Computing Science Report},
  optaddress = {Eindhoven, The Netherlands},
  publisher = {Eindhoven University of Technology, Eindhoven, The Netherlands},
  editor = {van der Aalst, Wil M. P. and De Michelis, Giorgio and
            Ellis, Clarence A.},
  acronym = {{WFM}'98},
  booktitle = {{P}roceedings of {W}orkflow {M}anagement:
               {N}et-{B}ased {C}oncepts, {M}odels, 
               {T}echniques and {T}ools
               ({WFM}'98)},
  author = {Barkaoui,Kamel and Petrucci, Laure},
  title = {Structural Analysis of Workflow Nets with Shared
                 Resources},
  pages = {82-95},
  howpublished = {Proceedings published as Computing Science Report
                 98/7, Eindhoven University of Technology, NL},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BarPet-wfm98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BarPet-wfm98.ps}
}
@inproceedings{LA-PB-AB-KL-fsttcs98,
  address = {Chennai, India},
  month = dec,
  year = 1998,
  volume = 1530,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Arvind, Vikraman and Ramanujam, R.},
  acronym = {{FSTTCS}'98},
  booktitle = {{P}roceedings of the 18th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'98)},
  author = {Aceto, Luca and Bouyer, Patricia and 
                 Burgue{\~n}o, Augusto and Larsen, Kim G.},
  title = {The Power of Reachability Testing for 
                 Timed Automata},
  pages = {245-256},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ABBL-fsttcs98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ABBL-fsttcs98.ps},
  abstract = {In this paper we provide a 
	complete characterization of the class of
	properties of (networks of) timed automata for 
	which model checking
	can be reduced to reachability checking in the 
	context of testing
	automata.}
}
@book{LA-PG-BP-AP-NP-PW-livre98,
  author = {Albert, Luc and Gastin, Paul and 
                 Petazzoni, Bruno and Petit, Antoine
                 and Puech, Nicolas and Weil, Pascal},
  title = {Cours et exercices d'informatique, Classes
                 pr{\'e}paratoires, premier et second cycles
                 universitaires},
  year = {1998},
  month = jun,
  publisher = {Vuibert},
  isbn = {2-7117-8621-8},
  lsv-lang = {FR}
}
@techreport{LSV:98:2,
  author = {Fribourg, Laurent},
  title = {A Closed-Form Evaluation for Extended Timed Automata},
  type = {Research Report},
  number = {LSV-98-2},
  year = {1998},
  month = mar,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-1998-2.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-1998-2.rr.ps}
}
@mastersthesis{Labroue-dea,
  author = {Labroue, Anne},
  title = {Conditions de vivacit{\'e} dans les automates
                 temporis{\'e}s},
  year = {1998},
  month = jul,
  type = {Rapport de {DEA}},
  school = {{DEA} Informatique, Orsay, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-1998-7.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-1998-7.rr.ps},
  lsv-lang = {FR}
}
@mastersthesis{PB-dea98,
  author = {Bouyer, Patricia},
  title = {Automates temporis{\'e}s et modularit{\'e}},
  year = {1998},
  month = jun,
  type = {Rapport de {DEA}},
  school = {{DEA} Algorithmique, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bou-dea98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bou-dea98.ps},
  lsv-lang = {FR}
}
@inproceedings{PG-RM-AP-mfcs98,
  address = {Brno, Czech Republic},
  month = aug,
  year = 1998,
  volume = 1450,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Brim, Lubos and Gruska, Jozef and Zlatuska, Jir{\'i}},
  acronym = {{MFCS}'98},
  booktitle = {{P}roceedings of the 23rd
               {I}nternational {S}ymposium on
               {M}athematical {F}oundations of 
               {C}omputer {S}cience
               ({MFCS}'98)},
  author = {Gastin, Paul and Meyer, Rapha{\"e}l and 
                  Petit, Antoine},
  title = {A (non-elementary) modular decision procedure for
                 {LTrL}},
  pages = {356-365},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GMP-mfcs98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GMP-mfcs98.ps},
  abstract = {Thiagarajan and Walukiewicz have defined a
                  temporal logic~LTrL on Mazurkiewicz
                  traces, patterned on the famous
                  propositional temporal logic of linear
                  time~LTL defined by Pnueli. They have
                  shown that this logic is equal in
                  expressive power to the first order theory
                  of finite and infinite traces.\par 
                  The hopes to get an {"}easy{"} decision
                  procedure for~LTrL, as it is the case 
                  for~LTL, vanished very recently due to a
                  result of Walukiewicz who showed that the
                  decision procedure for~LTrL is
                  non-elementary. However, tools like Mona
                  or Mosel show that it is possible to
                  handle non-elementary logics on
                  significant examples. Therefore, it
                  appears worthwhile to have a direct
                  decision procedure for LTrL.\par 
                  In this paper we propose such a decision
                  procedure, in a modular way. Since the
                  logic~LTrL is not pure future, our
                  algorithm constructs by induction a finite
                  family of B{\"u}chi automata for each
                  LTrL-formula. As expected by the results
                  of Walukiewicz, the main difficulty comes
                  from the {"}Until{"} operator.}
}
@inproceedings{RM-AP-stacs98,
  address = {Paris, France},
  month = feb,
  year = 1998,
  volume = 1373,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Morvan, Michel and Meinel, {\relax Ch}ristoph and
            Krob, Daniel},
  acronym = {{STACS}'98},
  booktitle = {{P}roceedings of the 15th {A}nnual
               {S}ymposium on {T}heoretical {A}spects of
               {C}omputer {S}cience
               ({STACS}'98)},
  author = {Meyer, Rapha{\"e}l and Petit, Antoine},
  title = {Expressive Completeness of {LTrL} on Finite Traces:
                 {A}n Algebraic Proof},
  pages = {533-543}
}
@inproceedings{SC-LP-SMC-98,
  address = {San Diego, California, USA},
  month = oct,
  year = 1998,
  publisher = {Argos Press},
  acronym = {{SMC} 2000},
  booktitle = {{P}roceedings of the {IEEE} {I}nternational
               {C}onference on {S}ystems, {M}an and {C}ybernetics
               ({SMC} 2000)},
  author = {Christensen, S{\o}ren and Petrucci, Laure},
  title = {How to Determine and Use Place Flows in Coloured
                 {P}etri Nets},
  pages = {66-71}
}
@phdthesis{THESE-CECE-98,
  author = {C{\'e}c{\'e}, G{\'e}rard},
  title = {V{\'e}rification, analyse et approximations 
                 symboliques
                 des automates communicants},
  year = {1998},
  month = jan,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Cece-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Cece-these.ps},
  lsv-lang = {FR}
}
@phdthesis{THESE-DUFOURD-98,
  author = {Dufourd, Catherine},
  title = {R{\'e}seaux de {P}etri avec 
                 Reset{\slash}Transfert :
                 d{\'e}cidabilit{\'e} et ind{\'e}cidabilit{\'e}},
  year = {1998},
  month = oct,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Dufourd-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Dufourd-these.ps},
  lsv-lang = {FR}
}
@techreport{alcatel-ComPad-98a,
  author = {Comon, Hubert and Padovani, Vincent},
  title = {Specifications Consistency Verification.
                 {I}ntermediate Report},
  year = {1998},
  month = sep,
  type = {Contract Report},
  number = {MAR/UAO/C/98/0051}
}
@techreport{alcatel-ComPad-98b,
  author = {Comon, Hubert and Padovani, Vincent},
  title = {Specifications Consistency Verification. {F}inal
                 Report},
  year = {1998},
  month = dec,
  type = {Contract Report},
  number = {MAR/UAO/C/98/0080},
  note = {280 pages}
}
@article{bid-hen-acta-amast,
  publisher = {Springer},
  journal = {Acta Informatica},
  author = {Bidoit, Michel and Hennicker, Rolf},
  title = {Modular Correctness Proofs of Behavioural
                 Implementations},
  volume = {35},
  number = {11},
  pages = {951-1005},
  year = {1998},
  month = nov,
  doi = {10.1007/s002360050149}
}
@inproceedings{comon97csl,
  address = {{\AA}rhus, Denmark},
  year = 1998,
  volume = 1414,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Nielsen, Mogens and Thomas, Wolfgang},
  acronym = {{CSL}'97},
  booktitle = {{S}elected {P}apers from the 11th {I}nternational
               {W}orkshop on {C}omputer {S}cience {L}ogic
               ({CSL}'97)},
  author = {Comon, Hubert and Jurski, Yan},
  title = {Higher-order matching and tree automata},
  pages = {157-176},
  note = {Invited lecture},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComJur-csl97.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComJur-csl97.ps}
}
@article{comon97jsc1,
  publisher = {Elsevier Science Publishers},
  journal = {Journal of Symbolic Computation},
  author = {Comon, Hubert},
  title = {Completion of Rewrite Systems with Membership
                 Constraints. {P}art~{I}: {D}eduction Rules},
  volume = {25},
  number = {4},
  pages = {397-420},
  year = {1998},
  month = apr,
  optnote = {This is a first part of a paper whose abstract
                 appeared in Proc.\ {ICALP '92}, Vienna.},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Com-cirs1.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Com-cirs1.ps}
}
@article{comon97jsc2,
  publisher = {Elsevier Science Publishers},
  journal = {Journal of Symbolic Computation},
  author = {Comon, Hubert},
  title = {Completion of Rewrite Systems with Membership
                 Constraints. {P}art~{II}: {C}onstraint Solving},
  volume = {25},
  number = {4},
  pages = {421-454},
  year = {1998},
  month = apr,
  optnote = {This is the second part of a paper whose abstract
                 appeared in Proc.\ {ICALP '92}, Vienna.},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Com-cirs2.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Com-cirs2.ps}
}
@inproceedings{comon98cav,
  address = {Vancouver, British Columbia, Canada},
  month = jun,
  year = 1998,
  volume = 1427,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Hu, Alan J. and Vardi, Moshe Y.},
  acronym = {{CAV}'98},
  booktitle = {{P}roceedings of the 10th
               {I}nternational {C}onference on 
               {C}omputer {A}ided {V}erification
               ({CAV}'98)},
  author = {Comon, Hubert and Jurski, Yan},
  title = {Multiple Counters Automata, Safety Analysis and
                 {P}resburger Arithmetic},
  pages = {268-279},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComJur-cav98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComJur-cav98.ps}
}
@inproceedings{comon98lics,
  address = {Indianapolis, Indiana, USA},
  month = jun,
  year = 1998,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'98},
  booktitle = {{P}roceedings of the 13th
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'98)},
  author = {Comon, Hubert and Narendran, Paliath and 
                 Nieuwenhuis, Robert and Rusinowitch, Micha{\"e}l},
  title = {Decision Problems in Ordered Rewriting},
  pages = {276-286},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CNNR-lics98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CNNR-lics98.ps}
}
@inproceedings{comon98rta,
  address = {Tsukuba, Japan},
  month = mar,
  year = 1998,
  volume = 1379,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Nipkow, Tobias},
  acronym = {{RTA}'98},
  booktitle = {{P}roceedings of the 9th {I}nternational
               {C}onference on {R}ewriting {T}echniques
               and {A}pplications
               ({RTA}'98)},
  author = {Comon, Hubert},
  title = {About proofs by consistency},
  pages = {136-137},
  note = {Invited lecture}
}
@inproceedings{demri98,
  address = {Paris, France},
  month = feb,
  year = 1998,
  volume = 1373,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Morvan, Michel and Meinel, {\relax Ch}ristoph and
            Krob, Daniel},
  acronym = {{STACS}'98},
  booktitle = {{P}roceedings of the 15th {A}nnual
               {S}ymposium on {T}heoretical {A}spects of
               {C}omputer {S}cience
               ({STACS}'98)},
  author = {Demri, St{\'e}phane and Schnoebelen, {\relax Ph}ilippe},
  title = {The Complexity of Propositional Linear Temporal Logics
                 in Simple Cases (Extended Abstract)},
  pages = {61-72},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DemSch-stacs98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DemSch-stacs98.ps},
  doi = {10.1007/BFb0028549}
}
@inproceedings{dufourd98,
  address = {Aalborg, Denmark},
  month = jul,
  year = 1998,
  volume = 1443,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Larsen, Kim G. and Skyum, Sven and Winskel, Glynn},
  acronym = {{ICALP}'98},
  booktitle = {{P}roceedings of the 25th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming
               ({ICALP}'98)},
  author = {Dufourd, Catherine and Finkel, Alain and
                 Schnoebelen, {\relax Ph}ilippe},
  title = {Reset Nets between Decidability and 
                 Undecidability},
  pages = {103-115},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DFS-icalp98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DFS-icalp98.ps},
  doi = {10.1007/BFb0055044},
  abstract = {We study Petri nets with Reset arcs (also Transfer and
                 Doubling arcs) in combination with other extensions of
                 the basic Petri net model. While Reachability is
                 undecidable in all these extensions (indeed they are
                 Turing-powerful), we exhibit unexpected frontiers for
                 the decidability of Termination, Coverability,
                 Boundedness and place-Boundedness. In particular, we
                 show counter-intuitive separations between seemingly
                 related problems. Our main theorem is the very
                 surprising fact that boundedness is undecidable for
                 Petri nets with Reset arcs.}
}
@inproceedings{finkel98,
  address = {Campinas, Brasil},
  month = apr,
  year = 1998,
  volume = 1380,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Lucchesi, Claudio L. and Moura, Arnaldo V.},
  acronym = {{LATIN}'98},
  booktitle = {{P}roceedings of the 3rd {L}atin {A}merican
               {S}ymposium on {T}heoretical {I}nformatics
               ({LATIN}'98)},
  author = {Finkel, Alain and Schnoebelen, {\relax Ph}ilippe},
  title = {Fundamental Structures in Well-Structured Infinite
                 Transition Systems},
  pages = {102-118},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FinSch-latin98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FinSch-latin98.ps},
  doi = {10.1007/BFb0054314}
}
@techreport{forma98,
  author = {Sifakis, Joseph},
  editor = {Sifakis, Joseph},
  title = {Action {FORMA}. {B}ilan de la premi{\`e}re ann{\'e}e},
  year = {1998},
  month = jan,
  type = {Contract Report},
  institution = {DSP-STTC/CNRS/MENRT},
  lsv-lang = {FR}
}
@inproceedings{laroussinie98b,
  address = {Paris, France},
  month = nov,
  year = 1998,
  volume = 135,
  series = {{IFIP} Conference Proceedings},
  publisher = {Kluwer Academic Publishers},
  editor = {Budkowski, Stanislaw and Cavalli, Ana R. and Najm, Elie},
  acronym = {{FORTE'XI}/{PSTV'XVIII}},
  booktitle = {{P}roceedings of {IFIP} {TC6} {WG6.1} {J}oint
               {I}nternational {C}onference on {F}ormal {D}escription
               {T}echniques for {D}istributed {S}ystems and 
               {C}ommunication {P}rotocols ({FORTE'XI}) and 
               {P}rotocol {S}pecification, {T}esting and
               {V}erification ({PSTV'XVIII})},
  author = {Laroussinie, Fran{\c{c}}ois and Larsen, Kim G.},
  title = {{CMC}: {A}~Tool for Compositional Model-Checking of
                 Real-Time Systems},
  pages = {439-456},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LarLar-forte98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LarLar-forte98.ps}
}
@inproceedings{lf-mvp-latin-98,
  address = {Campinas, Brasil},
  month = apr,
  year = 1998,
  volume = 1380,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Lucchesi, Claudio L. and Moura, Arnaldo V.},
  acronym = {{LATIN}'98},
  booktitle = {{P}roceedings of the 3rd {L}atin {A}merican
               {S}ymposium on {T}heoretical {I}nformatics
               ({LATIN}'98)},
  author = {Veloso{ }Peixoto, Marcos and Fribourg, Laurent},
  title = {Unfolding Parametric Automata},
  pages = {88-101}
}
@inproceedings{lugiez98,
  address = {Nice, France},
  month = sep,
  year = 1998,
  volume = 1466,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Sangiorgi, Davide and de Simone, Robert},
  acronym = {{CONCUR}'98},
  booktitle = {{P}roceedings of the 9th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'98)},
  author = {Lugiez, Denis and Schnoebelen, {\relax Ph}ilippe},
  title = {The Regular Viewpoint on {PA}-Processes},
  pages = {50-66},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/LugSch-concur98.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LugSch-concur98.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LugSch-concur98.ps},
  doi = {10.1007/BFb0055615}
}
@misc{phs-infinity98,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Regular Tree Languages for Process Algebra},
  year = 1998,
  month = jul,
  howpublished = {Invited lecture, 3rd {I}nternational 
               {W}orkshop on {V}erification of {I}nfinite
               {S}tate {S}ystems
               ({INFINITY}'98), Aalborg, Denmark}
}
@techreport{rap-icc-1,
  author = {Laroussinie, Fran{\c{c}}ois},
  title = {Analyse de l'{ICC}: mod{\'e}lisation},
  year = {1998},
  month = mar,
  type = {Contract Report},
  institution = {EDF/DER/MOS - LSV},
  lsv-lang = {FR}
}
@techreport{rap-icc-2,
  author = {Duflot, Marie and Markey, Nicolas},
  title = {{\'E}valuation de l'outil {UPPAAL} sur le probl{\`e}me de
                 l'{ICC}},
  year = {1998},
  month = sep,
  type = {Contract Report},
  institution = {EDF/DER/MOS - LSV},
  lsv-lang = {FR}
}
@techreport{sscop-98,
  author = {C{\'e}c{\'e}, G{\'e}rard and Deutsch, Pierre-{\'E}tienne 
                  and Finkel, Alain},
  title = {{FORMA}{\slash}{SSCOP}~--- {LSV}, bilan de l'ann{\'e}e~1998},
  year = {1998},
  month = nov,
  type = {Contract Report},
  institution = {FORMA},
  lsv-lang = {FR}
}
@article{AF-CD-TCS-Note,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Dufourd, Catherine and Finkel, Alain},
  title = {A Polynomial {{\(\lambda\)}}-Bisimilar Normalization
                 for Reset {P}etri Nets},
  volume = {222},
  number = {1-2},
  pages = {187-194},
  year = {1999},
  month = jul,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DufFin-TCS99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DufFin-TCS99.ps}
}
@misc{LP-cor-spin-99,
  author = {Petrucci, Laure},
  title = {{\scshape Promela} et {\scshape Spin} : 
                  exercices corrig{\'e}s},
  year = {1999},
  missinghowpublished = {},
  wrongurl = {http://www.lsv.ens-cachan.fr/~petrucci/cor_spin.ps.gz},
  wrongpsgz = {http://www.lsv.ens-cachan.fr/~petrucci/cor_spin.ps.gz},
  wrongps = {http://www.lsv.ens-cachan.fr/~petrucci/cor_spin.ps},
  lsv-lang = {FR}
}
@misc{LP-cours-spin-99,
  author = {Petrucci, Laure},
  title = {Un exemple de langage parall{\`e}le asynchrone : 
                 {\scshape Promela}},
  year = {1999},
  howpublished = {Polycopi{\'e} de cours, IEE, {\'E}vry, France},
  wrongurl = {http://www.lsv.ens-cachan.fr/~petrucci/poly_spin.ps.gz},
  wrongpsgz = {http://www.lsv.ens-cachan.fr/~petrucci/poly_spin.ps.gz},
  wrongps = {http://www.lsv.ens-cachan.fr/~petrucci/poly_spin.ps},
  lsv-lang = {FR}
}
@misc{LP-exos-spin-99,
  author = {Petrucci, Laure},
  title = {{\scshape Promela} et {\scshape Spin} : exercices},
  year = {1999},
  howpublished = {Polycopi{\'e}, IEE, {\'E}vry, France},
  wrongurl = {http://www.lsv.ens-cachan.fr/~petrucci/exos_spin.ps.gz},
  wrongpsgz = {http://www.lsv.ens-cachan.fr/~petrucci/exos_spin.ps.gz},
  wrongps = {http://www.lsv.ens-cachan.fr/~petrucci/exos_spin.ps},
  lsv-lang = {FR}
}
@techreport{LSV:99:2,
  author = {Finkel, Alain and McKenzie, Pierre and 
                  Picaronny, Claudine},
  title = {A~Well-Structured Framework for Analysing {P}etri 
                 Net Extensions},
  type = {Research Report},
  number = {LSV-99-2},
  year = {1999},
  month = feb,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-1999-2.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-1999-2.rr.ps}
}
@techreport{LSV:99:5,
  author = {Padovani, Vincent and Comon, Hubert and 
                 Leneutre, J. and Tingaud, R.},
  missingauthor = {},
  title = {A Formal Verification of Telephone Supplementary
                 Service Interactions},
  type = {Research Report},
  number = {LSV-99-5},
  year = {1999},
  month = may,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-1999-5.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-1999-5.rr.ps}
}
@inproceedings{NWP-PASTE99,
  address = {Toulouse, France},
  month = sep,
  year = 1999,
  publisher = {ACM Press},
  acronym = {{PASTE}'99},
  booktitle = {{P}roceedings of the {ACM} {SIGPLAN}/{SIGSOFT}
               {W}orkshop on {P}rogram {A}nalysis for
               {S}oftware {T}ools and {E}ngineering
               ({PASTE}'99)},
  author = {Williams{-}Preston, Nicky},
  title = {New Type Signatures for Legacy {F}ortran 
                 Subroutines},
  pages = {76-85},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Pre-paste99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Pre-paste99.ps}
}
@inproceedings{PB-AP-icalp99,
  address = {Prague, Czech Republic},
  month = jul,
  year = 1999,
  volume = 1644,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Wiedermann, Jir{\'i} and van Emde Boas, Peter and
            Nielsen, Mogens},
  acronym = {{ICALP}'99},
  booktitle = {{P}roceedings of the 26th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming
               ({ICALP}'99)},
  author = {Bouyer, Patricia and Petit, Antoine},
  title = {Decomposition and Composition of Timed Automata},
  pages = {210-219},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BP-icalp99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BP-icalp99.ps},
  abstract = {We propose in this paper a 
	decomposition theorem for the timed
	automata introduced by Alur and Dill. To this 
	purpose, we define a new
	simple and natural concatenation operation, 
	indexed by the set of
	clocks to be reset, on timed automata 
	generalizing the classical
	untimed concatenation.  \par
	Then we extend the famous Kleene's and B{\"u}chi's 
	theorems on classical
	untimed automata by simply changing the basic 
	objects to take time
	into account, keeping the union operation and 
	replacing the
	concatenation, finite and infinite iterations by 
	the new timed
	concatenations and their induced iterations.\par
	Thus, and up to our knowledge, our result 
	provides the simplest known
	algebraic characterization of recognizable timed 
	languages.}
}
@inproceedings{RM-PST-99,
  address = {Williamsburg, Virginia, USA},
  month = jun,
  year = 1999,
  publisher = {Kluwer Academic Publishers},
  editor = {Yakovlev, Alex and Lavagno, Luciano},
  acronym = {{HWPN}'99},
  booktitle = {{P}roceedings of the 2nd {I}nternational
               {W}orkshop on {H}ardware {D}esign and
               {P}etri {N}ets 
               ({HWPN}'99)},
  author = {Meyer, Rapha{\"e}l and Thiagarajan, P. S.},
  title = {{LTrL} Based Model-Checking for a Restricted Class 
                 of Signal Transition Graphs},
  pages = {3-14}
}
@techreport{alcatel-ComPad-99a,
  author = {Comon, Hubert and Padovani, Vincent},
  title = {Report on Specification Validation in
                 Telecommunication Services},
  year = {1999},
  month = jun,
  type = {Contract Report},
  missinginstitution = {}
}
@inproceedings{beauquier99,
  address = {Bratislava, Slovak republic},
  month = sep,
  year = 1999,
  volume = 1693,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Jayanti, Prasad},
  acronym = {{DISC}'99},
  booktitle = {{P}roceedings of the 13th {I}nternational
               {S}ymposium on {D}istributed {C}omputing
               ({DISC}'99)},
  author = {Beauquier, Joffroy and B{\'e}rard, B{\'e}atrice 
                  and Fribourg, Laurent},
  title = {A New Rewrite Method for Proving Convergence of
                 Self-Stabilizing Systems},
  pages = {240-253},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBF-disc99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBF-disc99.ps}
}
@inproceedings{berard99,
  address = {Trento, Italy},
  month = jul,
  year = 1999,
  volume = 1633,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Halbwachs, Nicolas and Peled, Doron},
  acronym = {{CAV}'99},
  booktitle = {{P}roceedings of the 11th
               {I}nternational {C}onference on 
               {C}omputer {A}ided {V}erification
               ({CAV}'99)},
  author = {B{\'e}rard, B{\'e}atrice and Fribourg, Laurent},
  title = {Automated Verification of a Parametric Real-Time
                 Program: {T}he {ABR} Conformance Protocol},
  pages = {96-107},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BerFri-cav99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BerFri-cav99.ps}
}
@inproceedings{berard99b,
  address = {Eindhoven, The Netherlands},
  month = aug,
  year = 1999,
  volume = 1664,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Baeten, Jos C. M. and Mauw, Sjouke},
  acronym = {{CONCUR}'99},
  booktitle = {{P}roceedings of the 10th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'99)},
  author = {B{\'e}rard, B{\'e}atrice and Fribourg, Laurent},
  title = {Reachability Analysis of (Timed) {P}etri Nets Using
                 Real Arithmetic},
  pages = {178-193},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BerFri-concur99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BerFri-concur99.ps}
}
@mastersthesis{blanc-dea,
  author = {Blanc, Benjamin},
  title = {Mod{\'e}lisation et sp{\'e}cification 
                 d'architectures logicielles},
  year = {1999},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Programmation, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bla-dea99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bla-dea99.ps},
  lsv-lang = {FR}
}
@article{comon97cacm,
  publisher = {Kluwer Academic Publishers},
  journal = {Constraints},
  author = {Comon, Hubert and Dincbas, Mehmet and 
                 Jouannaud, Jean-Pierre and Kirchner, Claude},
  title = {A Methodological View of Constraint Solving},
  volume = {4},
  number = {4},
  pages = {337-361},
  year = {1999},
  month = dec,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Com-constraints.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Com-constraints.ps}
}
@inproceedings{comon99,
  address = {Eindhoven, The Netherlands},
  month = aug,
  year = 1999,
  volume = 1664,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Baeten, Jos C. M. and Mauw, Sjouke},
  acronym = {{CONCUR}'99},
  booktitle = {{P}roceedings of the 10th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'99)},
  author = {Comon, Hubert and Jurski, Yan},
  title = {Timed Automata and the Theory of Real Numbers},
  pages = {242-257},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComJur-concur99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComJur-concur99.ps}
}
@mastersthesis{cortier-dea,
  author = {Cortier, V{\'e}ronique},
  title = {V{\'e}rification de syst{\`e}mes {\`a} compteurs},
  year = {1999},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} de Logique, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Cor-dea99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Cor-dea99.ps},
  lsv-lang = {FR}
}
@inproceedings{cortier-icalp99,
  address = {Prague, Czech Republic},
  month = jul,
  year = 1999,
  volume = 1644,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Wiedermann, Jir{\'i} and van Emde Boas, Peter and
            Nielsen, Mogens},
  acronym = {{ICALP}'99},
  booktitle = {{P}roceedings of the 26th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming
               ({ICALP}'99)},
  author = {Cortier, V{\'e}ronique and Ganzinger, Harald and 
                 Jacquemard, Florent and Veanes, Margus},
  title = {Decidable Fragments of Simultaneous Rigid
                 Reachability},
  pages = {250-260},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CGJV-icalp99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CGJV-icalp99.ps}
}
@book{docdor99,
  author = {Schnoebelen, {\relax Ph}ilippe and 
                 B{\'e}rard, B{\'e}atrice and Bidoit, Michel
                 and Laroussinie, Fran{\c{c}}ois and Petit, Antoine},
  title = {V{\'e}rification de logiciels : techniques et 
                 outils du model-checking},
  year = {1999},
  month = apr,
  publisher = {Vuibert},
  isbn = {2-7117-8646-3},
  url = {http://www.vuibert.com/livre593.html},
  lsv-lang = {FR}
}
@inproceedings{dufourd99,
  address = {Prague, Czech Republic},
  month = jul,
  year = 1999,
  volume = 1644,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Wiedermann, Jir{\'i} and van Emde Boas, Peter and
            Nielsen, Mogens},
  acronym = {{ICALP}'99},
  booktitle = {{P}roceedings of the 26th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming
               ({ICALP}'99)},
  author = {Dufourd, Catherine and Jan{\v c}ar, Petr and
                 Schnoebelen, {\relax Ph}ilippe},
  title = {Boundedness of Reset {P/T} Nets},
  pages = {301-310},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DJS-icalp99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DJS-icalp99.ps},
  abstract = {P/T nets with reset and transfer arcs can be seen as
                 counter-machines with some restricted set of
                 operations. Surprisingly, several problems related to
                 boundedness are harder for Reset nets than for the more
                 expressive Transfer nets. Our main result is that
                 boundedness is undecidable for nets with three reset
                 arcs, while it is decidable for nets with two resetable
                 places.}
}
@inproceedings{esparza99,
  address = {Trento, Italy},
  month = jul,
  year = 1999,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'99},
  booktitle = {{P}roceedings of the 14th
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'99)},
  author = {Esparza, Javier and Finkel, Alain and Mayr, Richard},
  title = {On the verification of broadcast protocols},
  pages = {352-359},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/EFM-lics99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/EFM-lics99.ps}
}
@techreport{hcrt-disi99,
  author = {Hu{\ss}mann, Heinrich and Cerioli, Maura and 
                  Reggio, Gianna and Tort, Fran{\c{c}}oise},
  title = {Abstract Data Types and {UML} Models},
  type = {Technical Report},
  number = {DISI-TR-99-15},
  year = {1999},
  missingmonth = {},
  missingnmonth = {},
  institution = {DISI, Universit{\'a} di Genova, Italy}
}
@phdthesis{jurski99,
  author = {Jurski, Yan},
  title = {Expression de la relation binaire d'accessibilit{\'e}
                 pour les automates {\`a} compteurs plats et les automates
                 temporis{\'e}s},
  year = {1999},
  month = oct,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Jurski-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Jurski-these.ps},
  lsv-lang = {FR}
}
@inproceedings{laroussinie99,
  address = {Szklarska Poreba, Poland},
  month = sep,
  year = 1999,
  volume = 1672,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Kutylowski, Miroslaw and Pacholski, Leszek and
            Wierzbicki, Tomasz},
  acronym = {{MFCS}'99},
  booktitle = {{P}roceedings of the 24th
               {I}nternational {S}ymposium on
               {M}athematical {F}oundations of 
               {C}omputer {S}cience
               ({MFCS}'99)},
  author = {Aceto, Luca and Laroussinie, Fran{\c{c}}ois},
  title = {Is your Model Checker on Time?},
  pages = {125-136},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/AceLar-mfcs99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/AceLar-mfcs99.ps}
}
@mastersthesis{leroux-dea,
  author = {Leroux, J{\'e}r{\^o}me},
  title = {V{\'e}rification des syst{\`e}mes param{\'e}tr{\'e}s},
  year = {1999},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Algorithmique, Paris, France},
  lsv-lang = {FR}
}
@inproceedings{mb-don-at-amast98,
  address = {Amazonia, Brasil},
  month = jan,
  year = 1999,
  volume = 1548,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Haeberer, Armando Martin},
  acronym = {{AMAST}'98},
  booktitle = {{P}roceedings of the 7th {I}nternational
               {C}onference on {A}lgebraic {M}ethodology and
               {S}oftware {T}echnology
               ({AMAST}'98)},
  author = {Bidoit, Michel and Sannella, Donald and Tarlecki, Andrzej},
  title = {Architectural Specifications in {CASL}},
  pages = {341-357},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ECS-LFCS-99-407.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ECS-LFCS-99-407.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ECS-LFCS-99-407.ps}
}
@inproceedings{mb-rh-amast98,
  address = {Amazonia, Brasil},
  month = jan,
  year = 1999,
  volume = 1548,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Haeberer, Armando Martin},
  acronym = {{AMAST}'98},
  booktitle = {{P}roceedings of the 7th {I}nternational
               {C}onference on {A}lgebraic {M}ethodology and
               {S}oftware {T}echnology
               ({AMAST}'98)},
  author = {Hennicker, Rolf and Bidoit, Michel},
  title = {Observational Logic},
  pages = {263-277},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MB-RH-amast99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MB-RH-amast99.ps}
}
@inproceedings{mb-rolf-fm99,
  address = {Toulouse, France},
  month = sep,
  year = 1999,
  optaddress = {Bucharest, Romania},
  publisher = {Theta, Bucharest, Romania},
  editor = {Futatsugi, Kokichi and Goguen, Joseph and Meseguer, Jos{\'e}},
  acronym = {{FM}'99},
  booktitle = {{P}roceedings of the {OBJ}/{C}afe{OBJ}/{M}aude
               {W}orkshop at {F}ormal {M}ethods
               ({FM}'99)},
  author = {Bidoit, Michel and Hennicker, Rolf},
  title = {Observer Complete Definitions are Behaviourally
                 Coherent},
  pages = {83-94},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CafeOBJ.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CafeOBJ.ps}
}
@phdthesis{meyer-these99,
  author = {Meyer, Rapha{\"e}l},
  title = {Contributions {\`a} l'{\'e}tude des logiques temporelles sur
                 les traces},
  year = {1999},
  month = nov,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Meyer-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Meyer-these.ps},
  lsv-lang = {FR}
}
@incollection{proofsystems,
  author = {Bidoit, Michel and Cengarle, Mar{\'\i}a Victoria and
                 Hennicker, Rolf},
  title = {Proof systems for structured specifications and their
                 refinements},
  editor = {Astesiano, Egidio and Kreowski, Hans-J{\"o}rg and 
                 Krieg-Br{\"u}ckner, Bernd},
  booktitle = {Algebraic Foundations of Systems Specification},
  type = {chapter},
  chapter = {11},
  pages = {385-433},
  year = {1999},
  missingmonth = {},
  missingnmonth = {},
  publisher = {Springer},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ch11AFSSbook.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ch11AFSSbook.ps}
}
@article{schnoebelen99,
  publisher = {European Association for 
                 Theoretical Computer Science},
  journal = {EATCS Bulletin},
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Decomposable Regular Languages and the Shuffle
                 Operator},
  volume = {67},
  pages = {283-289},
  year = {1999},
  month = feb,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Sch-BEATCS99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Sch-BEATCS99.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-BEATCS99.pdf}
}
@inproceedings{sutre99,
  address = {Amazonia, Brasil},
  month = jan,
  year = 1999,
  volume = 1548,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Haeberer, Armando Martin},
  acronym = {{AMAST}'98},
  booktitle = {{P}roceedings of the 7th {I}nternational
               {C}onference on {A}lgebraic {M}ethodology and
               {S}oftware {T}echnology
               ({AMAST}'98)},
  author = {Sutre, Gr{\'e}goire and Finkel, Alain and 
                 Roux, Olivier F. and Cassez, Franck},
  title = {Effective Recognizability and Model Checking of
                 Reactive Fiffo Automata},
  pages = {106-123},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-1998-10.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-1998-10.rr.ps}
}
@inproceedings{sutre99b,
  address = {Cachan, France},
  month = mar,
  year = 1999,
  publisher = {Herm{\`e}s},
  editor = {Lesage, Jean-Jacques},
  acronym = {{MSR}'99},
  booktitle = {{A}ctes du 2{\`e}me {C}ongr{\`e}s sur la 
               {M}od{\'e}lisation des {S}yst{\`e}mes
               {R}{\'e}actifs
               ({MSR}'99)},
  author = {Sutre, Gr{\'e}goire},
  title = {V{\'e}rification des automates {\`a} file r{\'e}actifs : un
                 mod{\`e}le pour les syst{\'e}mes r{\'e}actifs {\'e}crits en 
                 {E}lectre},
  pages = {71-78},
  lsv-lang = {FR}
}
@inproceedings{tbhw-uml99,
  address = {Fort Collins, Colorado, USA},
  month = oct,
  year = 1999,
  volume = 1723,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {France, Robert B. and Rumpe, Bernhard},
  acronym = {{UML}'99},
  booktitle = {{P}roceedings of the 2nd {I}nternational
               {C}onference on the {U}nified {M}odeling 
               {L}anguage
               ({UML}'99)},
  author = {Bidoit, Michel and Hennicker, Rolf and 
                 Tort, Fran{\c{c}}oise and Wirsing, Martin},
  title = {Correct Realization of Interface Constraints with
                 {OCL}},
  pages = {399-415},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/TBHW-uml99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/TBHW-uml99.ps}
}
@mastersthesis{turuani-dea,
  author = {Turuani, Mathieu},
  title = {Logique temporelle temporis{\'e}e pour la v{\'e}rification
                 de programmes : expressivit{\'e} et complexit{\'e}},
  year = {1999},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Programmation, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-1999-8.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-1999-8.rr.ps},
  lsv-lang = {FR}
}
@inproceedings{AF-GS-STACS-2000,
  address = {Lille, France},
  month = feb,
  year = 2000,
  volume = 1770,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Reichel, Horst and Tison, Sophie},
  acronym = {{STACS} 2000},
  booktitle = {{P}roceedings of the 17th {A}nnual
               {S}ymposium on {T}heoretical {A}spects of
               {C}omputer {S}cience
               ({STACS} 2000)},
  author = {Finkel, Alain and Sutre, Gr{\'e}goire},
  title = {Decidability of Reachability Problems for Classes 
                 of Two-Counter Automata},
  pages = {346-357},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FinSut-stacs2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FinSut-stacs2000.ps},
  doi = {10.1007/3-540-46541-3_29}
}
@inproceedings{BDFP-mfcs-2000,
  address = {Bratislava, Slovakia},
  month = aug,
  year = 2000,
  volume = 1893,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Nielsen, Mogens and Rovan, Branislav},
  acronym = {{MFCS} 2000},
  booktitle = {{P}roceedings of the 25th
               {I}nternational {S}ymposium on
               {M}athematical {F}oundations of 
               {C}omputer {S}cience
               ({MFCS} 2000)},
  author = {Bouyer, Patricia and Dufourd, Catherine and 
                 Fleury, Emmanuel and Petit, Antoine},
  title = {Expressiveness of Updatable Timed Automata},
  pages = {232-242},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BDFP-mfcs2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BDFP-mfcs2000.ps},
  abstract = {Since their introduction by Alur 
	and Dill, timed automata have been
	one of the most widely studied models for 
	real-time systems. The
	syntactic extension of so-called updatable timed 
	automata allows more
	powerful updates of clocks than the reset 
	operation proposed in the
	original model.\par
	We prove that any language accepted by an 
	updatable timed automaton
	(from classes where emptiness is decidable) is 
	also accepted by a
	{"}classical{"} timed automaton. We propose even 
	more precise results on
	bisimilarity between updatable and classical 
	timed automata.}
}
@article{BEFMRWW-ipl2000,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Bouajjani, Ahmed and Esparza, Javier and 
                 Finkel, Alain and Maler, Oded
                 and Rossmanith, Peter and Willems, Bernard and 
                 Wolper, Pierre},
  title = {An Efficient Automata Approach to some Problems on
                 Context-Free Grammars},
  volume = {74},
  number = {5-6},
  pages = {221-227},
  year = {2000},
  month = jun,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BEFMRWW-IPL2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BEFMRWW-IPL2000.ps}
}
@article{BerDuf-IPL2000,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {B{\'e}rard, B{\'e}atrice and Dufourd, Catherine},
  title = {Timed Automata and Additive Clock Constraints},
  volume = {75},
  number = {1-2},
  pages = {1-7},
  year = {2000},
  month = jul,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BerDuf-IPL2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BerDuf-IPL2000.ps}
}
@article{BerPic-ACTA2000,
  publisher = {Springer},
  journal = {Acta Informatica},
  author = {B{\'e}rard, B{\'e}atrice and Picaronny, Claudine},
  title = {Accepting {Z}eno Words: {A} Way Toward Timed
                 Refinements},
  volume = {37},
  number = {1},
  pages = {45-81},
  year = {2000},
  missingmonth = {},
  missingnmonth = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BerPic-ACTA2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BerPic-ACTA2000.ps}
}
@misc{Calife-1.1,
  author = {B{\'e}rard, B{\'e}atrice and Cast{\'e}ran, Pierre 
                 and Fleury, Emmanuel and 
                 Fribourg, Laurent and Monin, Jean-Fran{\c{c}}ois 
                 and Paulin, {\relax Ch}ristine and Petit, Antoine and
                 Rouillard, Davy},
  title = {Document de sp{\'e}cification du mod{\`e}le 
                 commun},
  year = {2000},
  month = apr,
  howpublished = {Fourniture~1.1 du projet RNRT Calife},
  lsv-lang = {FR}
}
@misc{Calife-4.1,
  author = {Fribourg, Laurent},
  title = {Document de synth{\`e}se sur les techniques
                 d'abstraction},
  year = {2000},
  month = jan,
  howpublished = {Fourniture~4.1 du projet RNRT Calife},
  lsv-lang = {FR}
}
@misc{Calife-4.2,
  author = {Bouyer, Patricia and Fleury, Emmanuel and 
                  Petit, Antoine},
  title = {Document de synth{\`e}se sur les proc{\'e}dures de
                 v{\'e}rification des syst{\`e}mes temps r{\'e}el : 
                 Les automates temporis{\'e}s},
  year = {2000},
  month = jan,
  howpublished = {Fourniture~4.2 du projet RNRT Calife},
  lsv-lang = {FR}
}
@inproceedings{CasLar-cav2000,
  address = {Chicago, Illinois, USA},
  month = jul,
  year = 2000,
  volume = 1855,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Emerson, E. Allen and Sistla, A. Prasad},
  acronym = {{CAV} 2000},
  booktitle = {{P}roceedings of the 12th
               {I}nternational {C}onference on 
               {C}omputer {A}ided {V}erification
               ({CAV} 2000)},
  author = {Cassez, Franck and Laroussinie, Fran{\c{c}}ois},
  title = {Model-Checking for Hybrid Systems by Quotienting 
                 and Constraints Solving},
  pages = {373-388},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CasLar-cav2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CasLar-cav2000.ps}
}
@article{FB-MB-LP-IGPL-00,
  publisher = {Oxford University Press},
  journal = {Logic Journal of the IGPL},
  author = {Belala, F. and Bettaz, Mohamed and 
                  Petrucci{-}Dauchy, Laure},
  title = {Concurrent systems analysis using {ECATNets}},
  volume = {8},
  number = {2},
  pages = {149-164},
  year = {2000},
  month = mar,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/belala00concurrent.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/belala00concurrent.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/belala00concurrent.ps},
  doi = {10.1093/jigpal/8.2.149}
}
@inproceedings{FPS-concur-2000,
  address = {Pennsylvania State University, Pennsylvania, USA},
  month = aug,
  year = 2000,
  volume = 1877,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Palamidessi, Catuscia},
  acronym = {{CONCUR} 2000},
  booktitle = {{P}roceedings of the 11th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR} 2000)},
  author = {Finkel, Alain and Purushothaman{ }Iyer, S. and 
                 Sutre, Gr{\'e}goire},
  title = {Well-Abstracted Transition Systems},
  pages = {566-580},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2000-6.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2000-6.rr.ps}
}
@inproceedings{FS-mfcs-2000,
  address = {Bratislava, Slovakia},
  month = aug,
  year = 2000,
  volume = 1893,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Nielsen, Mogens and Rovan, Branislav},
  acronym = {{MFCS} 2000},
  booktitle = {{P}roceedings of the 25th
               {I}nternational {S}ymposium on
               {M}athematical {F}oundations of 
               {C}omputer {S}cience
               ({MFCS} 2000)},
  author = {Finkel, Alain and Sutre, Gr{\'e}goire},
  title = {An Algorithm Constructing the Semilinear {P}ost* 
                 for
                 2-Dim {R}eset{{\slash}}{T}ransfer {VASS}},
  pages = {353-362},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FinSut-mfcs2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FinSut-mfcs2000.ps}
}
@inproceedings{GB-LP-HLPN-00,
  address = {\AA rhus, Denmark},
  month = jun,
  year = 2000,
  howpublished = {Research Report DAIMI PB-547},
  optaddress = {\AA rhus, Denmark},
  optpublisher = {DAIMI},
  editor = {Jensen, Kurt},
  booktitle = {{P}roceedings of the {W}orkshop on 
               {P}ractical {U}se of {H}igh-{L}evel
               {P}etri {N}ets},
  author = {Berthelot, G{\'e}rard and Petrucci, Laure},
  title = {Specification and Validation of a Concurrent 
                 System:
                 {A}n Educational Project},
  pages = {55-72},
  url = {http://www.daimi.au.dk/designCPN/exam/Other/Trains/index.html},
  secondurl = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/BerPet-hlpn2000.ps}
}
@misc{GL:ASPROM,
  author = {Goubault{-}Larrecq, Jean},
  title = {Analyse de protocoles cryptographiques},
  year = {2000},
  month = oct,
  howpublished = {Invited lecture, Journ{\'e}es {ASPROM}, Paris,
                 France},
  lsv-lang = {FR}
}
@inproceedings{JGL:crypto:orPTA,
  address = {Cancun, Mexico},
  month = may,
  year = 2000,
  volume = 1800,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Rolim, Jos{\'e} D. P.},
  booktitle = {{P}roceedings of the Workshops of the 15th {I}nternational
               {P}arallel and {D}istributed {P}rocessing {S}ymposium},
  author = {Goubault{-}Larrecq, Jean},
  title = {A Method for Automatic Cryptographic Protocol
                 Verification (Extended Abstract)},
  pages = {977-984},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Gou-fmppta2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Gou-fmppta2000.ps}
}
@inproceedings{LF-LOPSTR-99,
  address = {Venezia, Italy},
  year = 2000,
  volume = 1817,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Bossi, Annalisa},
  acronym = {{LOPSTR}'99},
  booktitle = {{P}roceedings of the 9th {I}nternational 
               {W}orkshop on {L}ogic {P}rogram {S}ynthesis
               and {T}ransformation
               ({LOPSTR}'99)},
  author = {Laurent Fribourg},
  title = {Constraint Logic Programming Applied to Model
                 Checking},
  pages = {31-42},
  note = {Invited tutorial},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Fri-lopstr99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Fri-lopstr99.ps}
}
@inproceedings{LF-WFPL-99,
  address = {Benicassim, Spain},
  month = sep,
  year = 2000,
  optaddress = {Valencia, Spain},
  publisher = {Universidad Polit{\'e}cnica de Valencia, Spain},
  editor = {Alpuente, Mar{\'i}a},
  acronym = {{WFLP} 2000},
  booktitle = {{P}roceedings of the 9th {I}nternational
               {W}orkshop on {F}unctional and {L}ogic 
               {P}rogramming
               ({WFLP} 2000)},
  author = {Laurent Fribourg},
  title = {{P}etri Nets, Flat Languages and Linear Arithmetic},
  pages = {344-365},
  note = {Invited lecture},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Fri-wflp00.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Fri-wflp00.ps}
}
@inproceedings{LP-SCI-00,
  address = {Orlando, Florida, USA},
  month = jul,
  year = 2000,
  acronym = {{SCI} 2000},
  booktitle = {{P}roceedings of the 4th {W}orld
               {M}ulticonference on {S}ystemics, 
               {C}ybernetics and {I}nformatics
               ({SCI} 2000)},
  author = {Petrucci, Laure},
  title = {Design and Validation of a Controller},
  pages = {684-688},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Pet-sci2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Pet-sci2000.ps}
}
@techreport{LSV:00:2,
  author = {B{\'e}rard, B{\'e}atrice and Sierra, Luis},
  title = {Comparing Verification with {H}y{T}ech, {K}ronos 
                  and
                 {U}ppaal on the Railroad Crossing Example},
  type = {Research Report},
  number = {LSV-00-2},
  year = {2000},
  month = jan,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2000-2.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2000-2.rr.ps}
}
@inproceedings{PB-CD-EF-AP-cav2000,
  address = {Chicago, Illinois, USA},
  month = jul,
  year = 2000,
  volume = 1855,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Emerson, E. Allen and Sistla, A. Prasad},
  acronym = {{CAV} 2000},
  booktitle = {{P}roceedings of the 12th
               {I}nternational {C}onference on 
               {C}omputer {A}ided {V}erification
               ({CAV} 2000)},
  author = {Bouyer, Patricia and Dufourd, Catherine and 
                  Fleury, Emmanuel and Petit, Antoine},
  title = {Are Timed Automata Updatable?},
  pages = {464-479},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BDEP-cav2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BDEP-cav2000.ps},
  abstract = {In classical timed automata, as 
	defined by Alur and Dill and since
	widely studied, the only operation allowed to 
	modify the clocks is the
	reset operation. For instance, a clock can 
	neither be set to a
	non-null constant value, nor be set to the value 
	of another clock nor,
	in a non-deterministic way, to some value lower 
	or higher than a given
	constant. In this paper we study in details such 
	updates.\par
	We characterize in a thin way the frontier 
	between decidability and
	undecidability. Our main contributions are the 
	following:\par
	1)~We exhibit many classes of updates for which 
	emptiness is
	undecidable. These classes depend on the clock 
	constraints that are
	used ---~diagonal-free or not~--- whereas it is 
	well-known that these
	two kinds of constraints are equivalent for 
	classical timed
	automata.\par
	2)~We propose a generalization of the region 
	automaton proposed by Alur
	and Dill, allowing to handle larger classes of 
	updates. The
	complexity of the decision procedure remains 
	PSPACE-complete.}
}
@article{SC-LP-CJ-00,
  publisher = {Oxford University Press},
  journal = {The Computer Journal},
  author = {Christensen, S{\o}ren and Petrucci, Laure},
  title = {Modular Analysis of {P}etri Nets},
  volume = {43},
  number = {3},
  pages = {224-242},
  year = {2000},
  missingmonth = {},
  missingnmonth = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CP-COMPJ00.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CP-COMPJ00.ps}
}
@inproceedings{SchSid-atpn2000,
  address = {\AA rhus, Denmark},
  month = jun,
  year = 2000,
  volume = 1825,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Nielsen, Mogens and Simpson, Dan},
  acronym = {{ICATPN} 2000},
  booktitle = {{P}roceedings of the 21st
               {I}nternational {C}onference on
               {A}pplications and {T}heory of {P}etri {N}ets
               ({ICATPN} 2000)},
  author = {Schnoebelen, {\relax Ph}ilippe and 
                  Sidorova, Natalia},
  title = {Bisimulation and the Reduction of {P}etri Nets},
  pages = {409-423},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/SchSid-atpn2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/SchSid-atpn2000.ps}
}
@phdthesis{THESE-SUTRE-2000,
  author = {Sutre, Gr{\'e}goire},
  title = {Abstraction et acc{\'e}l{\'e}ration de syst{\`e}mes
                  infinis},
  year = {2000},
  month = oct,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Sutre-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Sutre-these.ps},
  lsv-lang = {FR}
}
@inproceedings{VGLPAK:BDDinCoq,
  address = {Penang, Malaysia},
  month = nov,
  year = 2000,
  volume = 1961,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {He, Jifeng and Sato, Masahito},
  acronym = {{ASIAN} 2000},
  booktitle = {{P}roceedings of the 6th {A}sian
               {C}omputing {S}cience {C}onference
               ({ASIAN} 2000)},
  author = {Verma, Kumar N. and Goubault{-}Larrecq, Jean and
                 Prasad, Sanjiva and Arun{-}Kumar, S.},
  title = {Reflecting {BDD}s in {C}oq},
  pages = {162-181},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/VGPA-asian2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/VGPA-asian2000.ps}
}
@article{VP-fourth-99,
  publisher = {Cambridge University Press},
  journal = {Mathematical Structures in Computer Science},
  author = {Padovani, Vincent},
  title = {Decidability of Fourth-Order Matching},
  volume = {10},
  number = {3},
  pages = {361-372},
  year = {2000},
  month = jun
}
@inproceedings{VULC-icp2000,
  address = {Utrecht, The Netherlands},
  month = oct,
  year = {2000},
  optaddress = {Zaltbommel, The Netherlands},
  publisher = {PLCopen},
  acronym = {{ICP} 2000},
  booktitle = {{P}roceedings of the 4th {I}nternational
               {PLC}open {C}onference on {I}ndustrial
               {C}ontrol {P}rogramming
               ({ICP} 2000)},
  author = {De{~}Smet, Olivier and Couffin, Sandrine and 
                 Rossi, Olivier and 
                 Canet, G{\'e}raud
                 and Lesage, Jean-Jacques and 
                 Schnoebelen, {\relax Ph}ilippe and Papini, H{\'e}l{\`e}ne},
  title = {Safe Programming of {PLC} Using Formal Verification
                 Methods},
  pages = {73-78},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/VULC-icp2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/VULC-icp2000.ps}
}
@inproceedings{bls-fossacs2000,
  address = {Berlin, Germany},
  month = mar,
  year = 2000,
  volume = 1784,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Tiuryn, Jerzy},
  acronym = {{FoSSaCS} 2000},
  booktitle = {{P}roceedings of the 3rd {I}nternational 
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS} 2000)},
  author = {B{\'e}rard, B{\'e}atrice and Labroue, Anne and
                 Schnoebelen, {\relax Ph}ilippe},
  title = {Verifying Performance Equivalence for {T}imed 
                 {B}asic {P}arallel {P}rocesses},
  pages = {35-47},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BLS-fossacs2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BLS-fossacs2000.ps}
}
@mastersthesis{boisseau-dea,
  author = {Boisseau, Alexandre},
  title = {V{\'e}rification de protocoles cryptographiques},
  year = {2000},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Programmation, Paris, France},
  lsv-lang = {FR}
}
@inproceedings{cclps-smc2000,
  address = {Nashville, Tennessee, USA},
  month = oct,
  year = 2000,
  publisher = {Argos Press},
  acronym = {{SMC} 2000},
  booktitle = {{P}roceedings of the {IEEE} {I}nternational
               {C}onference on {S}ystems, {M}an and {C}ybernetics
               ({SMC} 2000)},
  author = {Canet, G{\'e}raud and Couffin, Sandrine and 
                 Lesage, Jean-Jacques and Petit, Antoine
                 and Schnoebelen, {\relax Ph}ilippe},
  title = {Towards the Automatic Verification of {PLC} 
                 Programs
                 Written in {I}nstruction {L}ist},
  pages = {2449-2454},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CCLPS-smc2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CCLPS-smc2000.ps},
  doi = {10.1109/ICSMC.2000.884359},
  abstract = {We propose a framework for the automatic verification of PLC
  (programmable logic controller) programs written in Instruction List, one of
  the five languages defined in the IEC 61131-3 standard. We~propose a formal
  semantics for a significant fragment of the IL language, and a direct coding
  of this semantics into a model checking tool. We then automatically verify
  rich behavioral properties written in linear temporal logic. Our~approach is
  illustrated on the example of the tool-holder of a turning center}
}
@inproceedings{cdprs-cifa2000,
  address = {Lille, France},
  month = jul,
  year = 2000,
  optaddress = {Villeneuve d'Ascq, France},
  publisher = {Union des Chercheurs Ing{\'e}nieurs et {S}cientifiques, Villeneuve d'Ascq, France},
  editor = {Borne, Pierre and Richard, Jean-Pierre and
            Vanheeghe, {\relax Ph}ilippe},
  acronym = {{CIFA} 2000},
  booktitle = {{A}ctes de la 1{\`e}re {C}onf{\'e}rence 
               {I}nternationale {F}rancophone
               d'{A}utomatique
               ({CIFA} 2000)},
  author = {Canet, G{\'e}raud and Denis, Bruno and 
                 Petit, Antoine and Rossi, Olivier and
                 Schnoebelen, {\relax Ph}ilippe},
  title = {Un cadre pour la v{\'e}rification automatique de
                 programmes~{IL}},
  pages = {693-698},
  noisbn = {2-9512309-1-5},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CDPRS-cifa2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CDPRS-cifa2000.ps},
  lsv-lang = {FR}
}
@article{comon00ic2,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Comon, Hubert and Nieuwenhuis, Robert},
  title = {Inductive Proofs = {I}-Axiomatization + First-Order
                 Consistency},
  volume = {159},
  number = {1-2},
  pages = {151-186},
  year = {2000},
  month = may # {-} # jun,
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-1998-9.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-1998-9.rr.ps}
}
@inproceedings{comon2000csl,
  address = {Fischbachau, Germany},
  month = aug,
  year = 2000,
  volume = 1862,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Clote, Peter and Schwichtenberg, Helmut},
  acronym = {{CSL} 2000},
  booktitle = {{P}roceedings of the 14th {I}nternational
               {W}orkshop on {C}omputer {S}cience {L}ogic
               ({CSL} 2000)},
  author = {Comon, Hubert and Cortier, V{\'e}ronique},
  title = {Flatness is not a Weakness},
  pages = {262-276},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComCor-csl2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComCor-csl2000.ps}
}
@article{comon97ic,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Comon, Hubert},
  title = {Sequentiality, Monadic Second Order Logic and Tree
                 Automata},
  volume = {157},
  number = {1-2},
  pages = {25-51},
  year = {2000},
  month = feb # {-} # mar,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Com-sequentiality-ic.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/
		  Com-sequentiality-ic.ps}
}
@mastersthesis{duflot-dea,
  author = {Duflot, Marie},
  title = {Configurations r{\'e}currentes pour les anneaux de
                 processus --- {A}pplication {\`a} 
                 l'auto-stabilisation},
  year = {2000},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Algorithmique, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Duflot-dea.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Duflot-dea.ps},
  lsv-lang = {FR}
}
@inproceedings{finkel-leroux-vcl2000,
  address = {London, UK},
  month = jul,
  year = 2000,
  publisher = {University of Southampton, Southampton, UK},
  editor = {Leuschel, Michael and Podelski, Andreas and
            Ramakrishnan, C. R. and Ultes{-}Nitsche, Ulrich},
  acronym = {{VCL} 2000},
  booktitle = {{P}roceedings of the {I}nternational 
               {W}orkshop on {V}erification and
               {C}omputational {L}ogic
               ({VCL} 2000)},
  author = {Finkel, Alain and Leroux, J{\'e}r{\^o}me},
  title = {A Finite Covering Tree for Analysing Entropic
                 Broadcast Protocols},
  nopages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FinLer-vcl2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FinLer-vcl2000.ps}
}
@article{laroussinie98,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Laroussinie, Fran{\c{c}}ois and 
                  Schnoebelen, {\relax Ph}ilippe},
  title = {Specification in {CTL}+Past for verification in
                 {CTL}},
  volume = {156},
  number = {1-2},
  pages = {236-263},
  year = {2000},
  month = jan,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LarSch-IC98.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LarSch-IC98.ps},
  doi = {10.1006/inco.1999.2817}
}
@inproceedings{larsch-fossacs2000,
  address = {Berlin, Germany},
  month = mar,
  year = 2000,
  volume = 1784,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Tiuryn, Jerzy},
  acronym = {{FoSSaCS} 2000},
  booktitle = {{P}roceedings of the 3rd {I}nternational 
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS} 2000)},
  author = {Laroussinie, Fran{\c{c}}ois and 
                  Schnoebelen, {\relax Ph}ilippe},
  title = {The State-Explosion Problem from Trace to 
                  Bisimulation Equivalence},
  pages = {192-207},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LarSch-fossacs2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LarSch-fossacs2000.ps}
}
@inproceedings{lomazova99,
  address = {Novosibirsk, Russia},
  year = 2000,
  volume = 1755,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Bj{\o}rner, Dines and Broy, Manfred and 
            Zamulin, Alexandre V.},
  acronym = {{PSI}'99},
  booktitle = {{P}roceedings of the 3rd {I}nternational
               {A}ndrei {E}rshov {M}emorial {C}onference
               on {P}erspectives of {S}ystem {I}nformatics
               ({PSI}'99)},
  author = {Lomazova, Irina A. and 
                  Schnoebelen, {\relax Ph}ilippe},
  title = {Some Decidability Results for Nested {P}etri Nets},
  pages = {208-220},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LomSch-psi99.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LomSch-psi99.ps}
}
@inproceedings{lst-quant,
  address = {Punta del Este, Uruguay},
  month = apr,
  year = 2000,
  volume = 1776,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Gonnet, Gaston H. and Panario, Daniel and
            Viola, Alfredo},
  acronym = {{LATIN} 2000},
  booktitle = {{P}roceedings of the 4th {L}atin {A}merican
               {S}ymposium on {T}heoretical {I}nformatics
               ({LATIN} 2000)},
  author = {Laroussinie, Fran{\c{c}}ois and 
                 Schnoebelen, {\relax Ph}ilippe and
                 Turuani, Mathieu},
  title = {On the Expressivity and Complexity of Quantitative
                 Branching-Time Temporal Logics},
  pages = {437-446},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/LST-latin2000.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LST-latin2000.ps},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LST-latin2000.pdf},
  doi = {10.1007/10719839_43}
}
@inproceedings{lugsch-icalp2000,
  address = {Geneva, Switzerland},
  month = jul,
  year = 2000,
  volume = 1853,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Montanari, Ugo and Rolim, Jos{\'e} D. P. and
            Welzl, Emo},
  acronym = {{ICALP} 2000},
  booktitle = {{P}roceedings of the 27th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming
               ({ICALP} 2000)},
  author = {Lugiez, Denis and Schnoebelen, {\relax Ph}ilippe},
  title = {Decidable First-Order Transition Logics for
                 {PA}-Processes},
  pages = {342-353},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LugSch-icalp2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LugSch-icalp2000.ps}
}
@mastersthesis{markey-dea,
  author = {Markey, Nicolas},
  title = {Complexit{\'e} de la logique temporelle avec 
                 pass{\'e}},
  year = {2000},
  month = jun,
  type = {Rapport de {DEA}},
  school = {{DEA} Algorithmique, Paris, France},
  nops = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2000-11.rr.ps},
  nopsgz = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PSGZ/
		  rr-lsv-2000-11.rr.ps.gz},
  lsv-lang = {FR}
}
@misc{note-EVA-nov-2000,
  author = {Boisseau, Alexandre and Jacquemard, Florent and 
                 Le{ }M{\'e}tayer, Daniel},
  title = {Exemple de mod{\'e}lisation de protocoles
                 cryptographiques},
  year = {2000},
  month = nov,
  howpublished = {Projet EVA, note interne},
  lsv-lang = {FR}
}
@phdthesis{preston-these-2000,
  author = {Nicky Williams},
  missingauthor = {on met pas son nom complet ?},
  title = {Application des sp{\'e}cifications alg{\'e}briques
                 {\`a} la
                 r{\'e}tro-ing{\'e}nierie de codes {F}ortran},
  year = {2000},
  month = feb,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Williams-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Williams-these.ps},
  lsv-lang = {FR}
}
@inproceedings{rossch-adpm2000,
  address = {Dortmund, Germany},
  month = sep,
  year = 2000,
  optaddress = {Aachen, Germany},
  publisher = {Shaker Verlag},
  editor = {Engell, Sebastian and Kowalewski, Stefan and 
            Zaytoon, Janan},
  acronym = {{ADPM} 2000},
  booktitle = {{P}roceedings of the 4th {I}nternational
               {C}onference on {A}utomation of {M}ixed
               {P}rocesses: {H}ybrid {D}ynamic {S}ystems
               ({ADPM} 2000)},
  author = {Rossi, Olivier and Schnoebelen, {\relax Ph}ilippe},
  title = {Formal modeling of timed function blocks for the
                 automatic verification of {L}adder {D}iagram 
                 programs},
  pages = {177-182},
  noisbn = {3-8265-7836-8},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/RosSch-adpm2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/RosSch-adpm2000.ps}
}
@misc{fl:hcmc,
  author = {Laroussinie, Fran{\c{c}}ois},
  title = {{HCMC}: {A}n Extension of {CMC} for 
                  Hybrid Systems},
  year = {2000},
  howpublished = {Available at
                 \url{http://www.lsv.ens-cachan.fr/~fl/cmcweb.html}},
  url = {http://www.lsv.ens-cachan.fr/~fl/cmcweb.html},
  note = {See~\cite{CasLar-cav2000} for description. 
                 Written in C++ (about 26000 lines)}
}
@misc{stabilo,
  author = {Nilsson, Ulf and Duflot, Marie and Fribourg, Laurent},
  title = {{STABILO}, a tool computing inevitable configurations
                 in distributed protocols},
  year = {2000},
  month = nov,
  note = {See description in~\cite{DFN-concur-2001}. 
                 Written in PROLOG (about 500 lines on top of 
                 Gertjan van Noord's finite automata package)}
}
@misc{phs-jm2000,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Le probl{\`e}me de l'explosion du nombre 
                  d'{\'e}tats},
  year = {2000},
  month = mar,
  howpublished = {Invited talk, 8{\`e}me Journ\'ees Montoises 
                 d'Informatique Th\'eorique (JM 2000), 
                 Marne-la-Vall\'ee, France},
  lsv-lang = {FR}
}
@inproceedings{Alechina::Demri::deRijke01,
  address = {Rome, Italy},
  month = sep,
  year = 2001,
  volume = 45,
  series = {CEUR Workshop Proceedings},
  publisher = {RWTH Aachen, Germany},
  editor = {Lenzerini, Maurizio and Nardi, Daniele and Nutt, Werner
            and Suciu, Dan},
  acronym = {{KRDB}'01},
  booktitle = {{P}roceedings of the 8th {I}nternational 
               {W}orkshop on {K}nowledge {R}epresentation meets
               {D}atabases
               ({KRDB}'01)},
  author = {Alechina, Natasha and Demri, St{\'e}phane and 
                  de Rijke, Maarten},
  title = {Path Constraints from a Modal Logic Point of View
                 (Extended Abstract)},
  missingpages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ADdR-krdb01.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ADdR-krdb01.ps}
}
@inproceedings{BB-wadt2001,
  address = {Genova, Italy},
  month = apr,
  year = 2001,
  volume = 2267,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Cerioli, Maura and Reggio, Gianna},
  acronym = {{WADT}'01},
  booktitle = {{R}ecent {T}rends in {A}lgebraic {D}evelopment {T}echniques~---
               {S}elected {P}apers of the 15th {I}nternational {W}orkshop
               on {A}lgebraic {D}evelopment {T}echniques
               ({WADT}'01)},
  author = {Bidoit, Michel and Boisseau, Alexandre},
  title = {Algebraic Abstractions},
  pages = {21-47},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BB-wadt2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BB-wadt2001.ps}
}
@article{BBFM-DISTCOMP,
  publisher = {Springer},
  journal = {Distributed Computing},
  author = {Beauquier, Joffroy and B{\'e}rard, B{\'e}atrice and 
                 Fribourg, Laurent and Magniette, Fr{\'e}d{\'e}ric},
  title = {Proving Convergence of Self-Stabilizing Systems Using
                 First-Order Rewriting and Regular Languages},
  volume = {14},
  number = {2},
  pages = {83-95},
  year = {2001},
  missingmonth = {},
  missingnmonth = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBFM-DISCOMP2000.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBFM-DISCOMP2000.ps},
  doi = {10.1007/PL00008931}
}
@proceedings{BCF-lncs2102,
  title = {{P}roceedings of the 13th
           {I}nternational {C}onference on 
           {C}omputer {A}ided {V}erification
           ({CAV}'01)},
  booktitle = {{P}roceedings of the 13th
               {I}nternational {C}onference on 
               {C}omputer {A}ided {V}erification
               ({CAV}'01)},
  editor = {Berry, G{\'e}rard and Comon, Hubert and Finkel, Alain},
  publisher = {Springer},
  volume = {2102},
  series = {Lecture Notes in Computer Science},
  year = {2001},
  month = jul,
  address = {Paris, France},
  isbn = {3-540-42345-1},
  url = {http://www.springer.com/978-3-540-42345-1},
  olderurl = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-42345-1}
}
@inproceedings{BPT-concur-2001,
  address = {Aalborg, Denmark},
  month = aug,
  year = 2001,
  volume = 2154,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Larsen, Kim G. and Nielsen, Modens},
  acronym = {{CONCUR}'01},
  booktitle = {{P}roceedings of the 12th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'01)},
  author = {Bouyer, Patricia and Petit, Antoine and 
                  Th{\'e}rien, Denis},
  title = {An Algebraic Characterization of Data and Timed
                 Languages},
  pages = {248-261},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BPT-concur2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BPT-concur2001.ps},
  abstract = {Algebra offers an elegant and 
	powerful approach to understand regular
	languages and finite automata. Such framework 
	has been notoriously
	lacking for timed languages and timed automata. 
	We introduce the
	notion of monoid recognizability for data 
	languages, which include
	timed languages as special case, in a way that 
	respects the spirit of
	the classical situation. We study closure 
	properties and hierarchies
	in this model, and prove that emptiness is 
	decidable under natural
	hypotheses. Our class of recognizable languages 
	properly includes many
	families of deterministic timed languages that 
	have been proposed
	until now, and the same holds for 
	non-deterministic versions.}
}
@inproceedings{BT-afadl2001,
  address = {Nancy, France},
  month = jun,
  year = 2001,
  editor = {Souqui{\`e}res, Jeanine},
  acronym = {{AFADL}'01},
  booktitle = {{A}ctes du 4{\`e}me {A}telier sur les {A}pproches {F}ormelles
               dans l'{A}ssistance au {D}{\'e}veloppement de {L}ogiciels
               ({AFADL}'01)},
  author = {Blanc, Benjamin and Tort, Fran{\c{c}}oise},
  title = {Co-d\'eveloppement de sp\'ecifications alg\'ebriques},
  pages = {141-156},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BT-afadl01.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BT-afadl01.ps}
}
@misc{CASL-tut-2001,
  author = {Bidoit, Michel and Mosses, Peter D.},
  title = {A Gentle Introduction to {CASL}~v1.0.1},
  year = {2001},
  month = apr,
  howpublished = {Invited tutorial, CoFI Workshop at the 4th European Joint Conferences on
                 Theory and Practice of Software (ETAPS 2001), Genova,
                 Italy},
  url = {http://www.lsv.ens-cachan.fr/~bidoit/CASL/}
}
@techreport{CCR-vulcain-final,
  author = {Canet, G{\'e}raud and Couffin, S. and Rossi, O.},
  title = {Validation dans le cadre de l'utilisation des {SFC},
                 {LD} et~{ST}},
  year = {2001},
  month = may,
  type = {Final Report},
  institution = {t{\^a}ches~4, 5 et~6, projet VULCAIN},
  missinghowpublished = {Rapport final des t{\^a}ches~4, 5 et~6
                 du projet {VULCAIN}},
  note = {393 pages}
}
@proceedings{CMR-lncs2002,
  title = {{R}evised {L}ectures of the
           {I}nternational {S}ummer {S}chool on {C}onstraints
           in {C}omputational {L}ogics
           ({CCL}'99)},
  booktitle = {{R}evised {L}ectures of the
               {I}nternational {S}ummer {S}chool on {C}onstraints
               in {C}omputational {L}ogics
               ({CCL}'99)},
  editor = {Comon, Hubert and March{\'e}, Claude and Treinen, Ralf},
  publisher = {Springer},
  volume = {2002},
  series = {Lecture Notes in Computer Science},
  year = {2001},
  address = {Gif-sur-Yvette, France},
  isbn = {3-540-41950-0},
  url = {http://www.springer.com/978-3-540-41950-0},
  olderurl = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-41950-0}
}
@techreport{Calife-4.4,
  author = {B{\'e}rard, B{\'e}atrice and Bouyer, Patricia and 
                  Petit, Antoine},
  title = {Mod{\'e}lisation du protocole~{PGM} et de certaines de ses
                 propri{\'e}t{\'e}s en {UPPAAL}},
  year = {2001},
  month = nov,
  type = {Contract Report},
  number = {4.4},
  institution = {projet RNRT Calife},
  note = {18 pages}
}
@inproceedings{DFN-concur-2001,
  address = {Aalborg, Denmark},
  month = aug,
  year = 2001,
  volume = 2154,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Larsen, Kim G. and Nielsen, Modens},
  acronym = {{CONCUR}'01},
  booktitle = {{P}roceedings of the 12th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'01)},
  author = {Duflot, Marie and Fribourg, Laurent and Nilsson, Ulf},
  title = {Unavoidable Configurations of Parameterized Rings of
                 Processes},
  pages = {472-486},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DFN-concur2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DFN-concur2001.ps}
}
@inproceedings{DFP-disc2001,
  address = {Lisbon, Portugal},
  month = oct,
  year = 2001,
  volume = 2180,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Welch, Jennifer L.},
  acronym = {{DISC}'01},
  booktitle = {{P}roceedings of the 15th {I}nternational
               {S}ymposium on {D}istributed {C}omputing
               ({DISC}'01)},
  author = {Duflot, Marie and Fribourg, Laurent and Picaronny, Claudine},
  title = {Randomized Finite-State Distributed Algorithms as
                 {M}arkov Chains},
  pages = {240-254},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DFP-disc2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DFP-disc2001.ps}
}
@techreport{EVA-TR1,
  author = {Jacquemard, Florent and Le{ }M{\'e}tayer, Daniel},
  title = {Langage de sp{\'e}cification de protocoles
                 cryptographiques de {EVA}: syntaxe concr{\`e}te},
  year = {2001},
  month = nov,
  type = {Technical Report},
  number = 1,
  institution = {projet RNTL~EVA},
  note = {25 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR1.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR1.pdf}
}
@techreport{EVA-TR4,
  author = {Bolignano, Dominique and Fiorenza, Francesca and 
                 Jacquemard, Florent and Le{ }M{\'e}tayer, Daniel},
  title = {{EVA} test base},
  year = {2001},
  month = nov,
  type = {Technical Report},
  number = 4,
  institution = {projet RNTL~EVA},
  note = {55 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR4.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR4.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/EVA-TR4.ps}
}
@proceedings{Fri-lncs2142,
  title = {{P}roceedings of the 15th {I}nternational
           {W}orkshop on {C}omputer {S}cience {L}ogic
           ({CSL}'01)},
  booktitle = {{P}roceedings of the 15th {I}nternational
               {W}orkshop on {C}omputer {S}cience {L}ogic
               ({CSL}'01)},
  editor = {Fribourg, Laurent},
  publisher = {Springer},
  volume = {2142},
  series = {Lecture Notes in Computer Science},
  year = {2001},
  month = sep,
  address = {Paris, France},
  isbn = {3-540-42554-3},
  url = {http://www.springer.com/978-3-540-42554-3},
  olderurl = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-42554-3}
}
@article{GB-LP-JSTTT00,
  publisher = {Springer},
  journal = {International Journal on Software Tools 
             for Technology Transfer},
  author = {Berthelot, G{\'e}rard and Petrucci, Laure},
  title = {Specification and Validation of a Concurrent System:
                 {A}n Educational Project},
  volume = {3},
  number = {4},
  pages = {372-381},
  year = {2001},
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GB-LP-STTT01.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GB-LP-STTT01.ps},
  doi = {10.1007/s100090100064}
}
@inproceedings{GL:WFRR,
  address = {Paris, France},
  month = sep,
  year = 2001,
  volume = 2142,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Fribourg, Laurent},
  acronym = {{CSL}'01},
  booktitle = {{P}roceedings of the 15th {I}nternational
               {W}orkshop on {C}omputer {S}cience {L}ogic
               ({CSL}'01)},
  author = {Goubault{-}Larrecq, Jean},
  title = {Well-Founded Recursive Relations},
  pages = {484-497},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Gou-csl2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Gou-csl2001.ps}
}
@proceedings{JGL:LACPV,
  title = {{P}roceedings of the 1st {W}orkshop on {L}ogical {A}spects of
                 {C}ryptographic {P}rotocol {V}erification 
                 ({LACPV} 2001)},
  booktitle = {{P}roceedings of the 1st {W}orkshop on {L}ogical 
                 {A}spects of
                 {C}ryptographic {P}rotocol {V}erification 
                 ({LACPV} 2001)},
  editor = {Goubault{-}Larrecq, Jean},
  publisher = {Elsevier Science Publishers},
  volume = {55},
  number = 1,
  series = {Electronic Notes in Theoretical Computer Science},
  year = 2003,
  month = jan,
  address = {Paris, France},
  oldurl = {http://www.sciencedirect.com/science?_ob=IssueURL&
                  _tockey=%23TOC%2313109%232003%23999449998%23521171%23FLP%23
                  Volume_55,_Issue_1,_Pages_1-26_(January_2003)&
                  _auth=y&view=c&_acct=C000051058&_version=1&_urlVersion=0&
		  _userid=1052425&md5=01843f1018b98d2dd1c00502871bfff4},
  doi = {10.1016/S1571-0661(05)80576-6}
}
@techreport{JGL:eva:propal,
  author = {Goubault{-}Larrecq, Jean},
  title = {Une proposition de langage de description de
                 protocoles cryptographiques},
  year = {2001},
  month = jul,
  type = {Contract Report},
  number = 2,
  institution = {projet RNTL~EVA},
  note = {12 pages},
  missingcomprehension = {Je ne comprends pas pourquoi cette entree est en RC et pas en wwwpublic, 
                  alors que d'autres contrats EVA sont en TR et wwwpublic public}
}
@techreport{JGL:eva:sem,
  author = {Goubault{-}Larrecq, Jean},
  title = {Les syntaxes et la s{\'e}mantique du langage de
                 sp{\'e}cification~{EVA}},
  year = {2001},
  month = nov,
  type = {Contract Report},
  number = 3,
  institution = {projet RNTL~EVA},
  note = {32 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR3.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR3.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/EVA-TR4.ps}
}
@techreport{LSV:01:13,
  author = {Comon, Hubert and Cortier, V{\'e}ronique},
  title = {Tree Automata with One Memory, Set Constraints and
                 Cryptographic Protocols},
  type = {Research Report},
  number = {LSV-01-13},
  year = {2001},
  month = dec,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {98 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2001-13.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2001-13.rr.ps}
}
@techreport{LSV:01:9,
  author = {Goubault{-}Larrecq, Jean},
  title = {Higher-Order Automata, Pushdown Systems, and Set
                 Constraints},
  type = {Research Report},
  number = {LSV-01-9},
  year = {2001},
  month = nov,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {15 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2001-9.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2001-9.rr.ps}
}
@techreport{PKDAB-DSTO-01,
  author = {Petrucci, Laure and Kristensen, Lars M. and Dauchy, Pierre 
                 and Aziz, M. and Billington, Jonathan},
  missingauthor = {},
  title = {Modelling and analysis of airborne mission systems},
  year = {2001},
  month = dec,
  type = {Progress Report},
  number = 1,
  institution = {{DSTO/UniSA} contract},
  note = {54 pages}
}
@inproceedings{RGL:TAinCoq,
  address = {Edinburgh, Scotland, UK},
  month = sep,
  year = 2001,
  volume = 2152,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Boulton, Richard J. and Jackson, Paul B.},
  acronym = {{TPHOLs}'01},
  booktitle = {{P}roceedings of the 14th {I}nternational
               {C}onference on {T}heorem {P}roving in
               {H}igher {O}rder {L}ogics
               ({TPHOLs}'01)},
  author = {Rival, Xavier and Goubault{-}Larrecq, Jean},
  title = {Experiments with Finite Tree Automata in {C}oq},
  pages = {362-377},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/RivGou-tphol01.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/RivGou-tphol01.ps}
}
@inproceedings{RGL:log-art,
  address = {Cape Breton, Nova Scotia, Canada},
  month = jun,
  year = 2001,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{CSFW}'01},
  booktitle = {{P}roceedings of the 
               14th {IEEE} {C}omputer {S}ecurity {F}oundations
               {W}orkshop ({CSFW}'01)},
  author = {Roger, Muriel and Goubault{-}Larrecq, Jean},
  title = {Log Auditing through Model Checking},
  pages = {220-236},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/RogGou-csfw01.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/RogGou-csfw01.ps}
}
@inproceedings{Sch-tacs2001,
  address = {Sendai, Japan},
  month = oct,
  year = 2001,
  volume = 2215,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Kobayashi, Naoki and Pierce, Benjamin C.},
  acronym = {{TACS}'01},
  booktitle = {{P}roceedings of the 4th {I}nternational
               {W}orkshop on {T}heoretical {A}spects of
               {C}omputer {S}oftware
               ({TACS}'01)},
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Bisimulation and Other Undecidable Equivalences for
                 Lossy Channel Systems},
  pages = {385-399},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-tacs2001.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-tacs2001.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Sch-tacs2001.ps},
  abstract = {Lossy channel systems are systems of 
	finite state automata that communicate via unreliable 
	unbounded fifo channels. Today the main open question 
	in the theory of lossy channel systems is whether 
	bisimulation is decidable. \par
	We show that bisimulation, simulation, and in fact 
	all relations between bisimulation and trace 
	inclusion are undecidable for lossy channel systems 
	(and for lossy vector addition systems).}
}
@phdthesis{THESE-CANET-2001,
  author = {Canet, G{\'e}raud},
  title = {V{\'e}rification des programmes {\'e}crits dans les langages
                 de programmation~{IL} et~{ST} d{\'e}finis par la norme
                 {IEC}~61131-3},
  year = {2001},
  month = dec,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Canet-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Canet-these.ps}
}
@phdthesis{THESE-NARBONI-2001,
  author = {Narboni, Guy A.},
  title = {Un cas remarquable de syst{\`e}mes lin{\'e}aires: les
                 syst{\`e}mes monotones. {R}{\'e}solution et application {\`a} la
                 v{\'e}rification formelle de programmes},
  year = {2001},
  month = dec,
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  type = {Th{\`e}se de doctorat},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Narboni-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Narboni-these.ps}
}
@misc{ap-express01,
  author = {Petit, Antoine},
  title = {About Extensions of Timed Automata},
  howpublished = {Invited talk, 8th {I}nternational {W}orkshop on {E}xpressiveness in
                 {C}oncurrency ({EXPRESS}'01), {A}alborg, {D}enmark},
  year = 2001,
  month = aug
}
@inproceedings{bhk-fossacs2001,
  address = {Genova, Italy},
  month = apr,
  year = 2001,
  volume = 2030,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Honsell, Furio and Miculan, Marino},
  acronym = {{FoSSaCS}'01},
  booktitle = {{P}roceedings of the 4th {I}nternational 
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'01)},
  author = {Bidoit, Michel and Hennicker, Rolf and Kurz, Alexander},
  title = {On the Duality between Observability and
                 Reachability},
  pages = {72-87},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BHK-fossacs2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BHK-fossacs2001.ps}
}
@inproceedings{ccm-icalp2001,
  address = {Heraklion, Crete, Grece},
  month = jul,
  year = 2001,
  volume = 2076,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Orejas, Fernando and Spirakis, Paul G. and
            van Leeuwen, Jan},
  acronym = {{ICALP}'01},
  booktitle = {{P}roceedings of the 28th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming
               ({ICALP}'01)},
  author = {Comon, Hubert and Cortier, V{\'e}ronique and Mitchell, John},
  title = {Tree Automata with One Memory, Set Constraints and
                 Ping-Pong Protocols},
  pages = {682-693},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CCM-icalp2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CCM-icalp2001.ps}
}
@inproceedings{cgn-focs2001,
  address = {Las Vegas, Nevada, USA},
  month = oct,
  year = 2001,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{FOCS}'01},
  booktitle = {{P}roceedings of the 42nd {S}ymposium
               on {F}oundations of {C}omputer {S}cience
              ({FOCS}'01)},
  author = {Comon, Hubert and Godoy, Guillem and Nieuwenhuis, Robert},
  title = {The Confluence of Ground Term Rewrite Systems is
                 Decidable in Polynomial Time},
  pages = {298-307},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CGN-focs2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CGN-focs2001.ps}
}
@inproceedings{cmr-csfw2001,
  address = {Cape Breton, Nova Scotia, Canada},
  month = jun,
  year = 2001,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{CSFW}'01},
  booktitle = {{P}roceedings of the 
               14th {IEEE} {C}omputer {S}ecurity {F}oundations
               {W}orkshop ({CSFW}'01)},
  author = {Cortier, V{\'e}ronique and Millen, Jonathan K. and 
                  Rue{\ss}, Harald},
  title = {Proving Secrecy is Easy Enough},
  pages = {97-110},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CMR-csfw2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CMR-csfw2001.ps}
}
@inproceedings{comon01ccl,
  address = {Gif-sur-Yvette, France},
  year = 2001,
  volume = 2002,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Comon, Hubert and March{\'e}, {\relax Cl}aude
            and Treinen, Ralf},
  acronym = {{CCL}'99},
  booktitle = {{R}evised {L}ectures of the
               {I}nternational {S}ummer {S}chool on {C}onstraints
               in {C}omputational {L}ogics
               ({CCL}'99)},
  author = {Comon, Hubert and Kirchner, Claude},
  title = {Constraint Solving on Terms},
  pages = {47-103}
}
@incollection{comon99hb,
  author = {Comon, Hubert},
  title = {Inductionless Induction},
  editor = {Robinson, Alan and Voronkov, Andrei},
  booktitle = {Handbook of Automated Reasoning},
  volume = {1},
  chapter = {14},
  pages = {913-962},
  year = {2001},
  missingmonth = {},
  missingnmonth = {},
  publisher = {Elsevier Science Publishers},
  isbn = {0-444-82949-0},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/HC-hb.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/HC-hb.ps}
}
@mastersthesis{corbineau-dea,
  author = {Corbineau, Pierre},
  title = {Autour de la cl{\^o}ture de congruence avec {C}oq},
  year = {2001},
  month = sep,
  school = {{DEA} Programmation, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Corbineau-dea2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Corbineau-dea2001.ps}
}
@article{finkel98b,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Finkel, Alain and Schnoebelen, {\relax Ph}ilippe},
  title = {Well-Structured Transition Systems Everywhere!},
  volume = {256},
  number = {1-2},
  pages = {63-92},
  year = {2001},
  month = apr,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FinSch-TCS99.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FinSch-TCS99.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FinSch-TCS99.ps},
  doi = {10.1016/S0304-3975(00)00102-X},
  abstract = {Well-structured transition systems 
	(WSTS's) are a general class of infinite state 
	systems for which decidability results rely on the 
	existence of a well-quasi-ordering between states 
	that is compatible with the transitions.\par
	In this article, we provide an extensive treatment 
	of the WSTS idea and show several new results.  
	Our improved definitions allow many examples of 
	classical systems to be seen as instances of 
	WSTS's.}
}
@mastersthesis{hornus-dea,
  author = {Hornus, Samuel},
  title = {Requ{\^e}tes en logique temporelle},
  year = {2001},
  month = sep,
  school = {{DEA} Algorithmique, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Hornus-dea2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Hornus-dea2001.ps}
}
@inproceedings{lms-fossacs2001,
  address = {Genova, Italy},
  month = apr,
  year = 2001,
  volume = 2030,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Honsell, Furio and Miculan, Marino},
  acronym = {{FoSSaCS}'01},
  booktitle = {{P}roceedings of the 4th {I}nternational 
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'01)},
  author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas and 
                 Schnoebelen, {\relax Ph}ilippe},
  title = {Model checking {CTL}{\(^+\)} and {FCTL} is~hard},
  pages = {318-331},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMS-fossacs2001.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LMS-fossacs2001.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMS-fossacs2001.pdf},
  abstract = {Among the branching-time temporal logics used for the 
	specification and verification of systems, CTL\(^+\), FCTL and ECTL\(^+\) 
	are the
	most notable logics for which the precise computational complexity of
	model checking is not known. We answer this longstanding open 
	problem and show that model checking these (and some related) logics is
	\(\Delta_2^p\)-complete.}
}
@book{lsvmcbook01,
  author = {B{\'e}rard, B{\'e}atrice and Bidoit, Michel and Finkel, Alain 
                 and Laroussinie, Fran{\c{c}}ois and 
                 Petit, Antoine and Petrucci, Laure and 
                 Schnoebelen, {\relax Ph}ilippe},
  title = {Systems and Software Verification. {M}odel-Checking
                 Techniques and Tools},
  year = {2001},
  missingmonth = {},
  missingnmonth = {},
  publisher = {Springer},
  isbn = {3-540-41523-8},
  url = {http://www.springer.com/978-3-540-41523-8},
  olderurl = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-41523-8}
}
@phdthesis{phs-hab-01,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Sp{\'e}cification et v{\'e}rification des syst{\`e}mes
                 concurrents},
  year = {2001},
  month = oct,
  type = {M{\'e}moire d'habilitation},
  school = {Universit{\'e} Paris~7, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/phs-habile.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/phs-habile.ps}
}
@mastersthesis{pichon-dea,
  author = {Pichon, {\'E}ric},
  title = {Preuves observationnelles},
  year = {2001},
  month = sep,
  school = {{DEA} Programmation, Paris, France}
}
@book{scopos13-2001,
  author = {Badouel, {\'E}ric and Boucheron, St{\'e}phane and 
                 Dicky, Anne and Petit, Antoine
                 and Santha, Miklos and Weil, Pascal and Zeitoun, Marc},
  title = {Probl\`{e}mes d'informatique fondamentale},
  publisher = {Springer},
  volume = {13},
  series = {Scopos},
  year = {2001},
  missingmonth = {},
  missingnmonth = {},
  isbn = {3-540-42341-9},
  url = {http://www.springer.com/978-3-540-42341-9},
  olderurl = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-42341-9}
}
@article{BP-JALC2002,
  journal = {Journal of Automata, Languages and Combinatorics},
  author = {Bouyer, Patricia and Petit, Antoine},
  title = {A {K}leene{\slash}B{\"u}chi-like Theorem for Clock Languages},
  volume = {7},
  number = {2},
  pages = {167-186},
  year = {2002},
  missingmonth = {},
  missingnmonth = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BP-JALC2001.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BP-JALC2001.ps},
  abstract = {We propose in this paper a 
	generalization of the famous Kleene\slash B{\"u}chi's
	theorem on formal languages, one of the 
	cornerstones of theoretical
	computer science, to the timed model of clock 
	languages. These
	languages extend the now classical timed 
	languages introduced by Alur
	and Dill as a suitable model of real-time 
	systems. As a corollary of
	our main result, we get a simple algebraic 
	characterization of timed
	languages recognized by (updatable) timed 
	automata.}
}
@article{BST-FAC2002,
  publisher = {Springer},
  journal = {Formal Aspects of Computing},
  author = {Bidoit, Michel and Sannella, Donald and 
                 Tarlecki, Andrzej},
  title = {Architectural Specifications in {CASL}},
  volume = {13},
  number = {3-5},
  pages = {252-273},
  year = {2002},
  month = jul,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BST-FAC2002.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BST-FAC2002.ps},
  doi = {10.1007/s001650200012}
}
@inproceedings{BST-mfcs2002,
  address = {Warsaw, Poland},
  month = aug,
  year = 2002,
  volume = 2420,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Diks, Krzysztof and Rytter, Wojciech},
  acronym = {{MFCS}'02},
  booktitle = {{P}roceedings of the 27th
               {I}nternational {S}ymposium on
               {M}athematical {F}oundations of 
               {C}omputer {S}cience
               ({MFCS}'02)},
  author = {Bidoit, Michel and Sannella, Donald and
                 Tarlecki, Andrzej},
  title = {Global Development via Local Observational
                 Construction Steps},
  pages = {1-24},
  note = {Invited paper},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BST-MFCS02.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BST-MFCS02.ps}
}
@mastersthesis{Baclet-dea,
  author = {Baclet, Manuel},
  title = {Langages de donn{\'e}es},
  type = {Rapport de {DEA}},
  year = {2002},
  month = sep,
  school = {{DEA} Algorithmique, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Baclet-dea02.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Baclet-dea02.ps}
}
@mastersthesis{Bernat-dea,
  author = {Bernat, Vincent},
  title = {Transformation de l'authentification en secret},
  type = {Rapport de {DEA}},
  year = {2002},
  month = sep,
  school = {{DEA} Algorithmique, Paris, France}
}
@article{Bou-IPL2002,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Bouyer, Patricia},
  title = {A Logical Characterization of Data Languages},
  volume = {84},
  number = {2},
  pages = {75-85},
  year = {2002},
  month = oct,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bou-IPL2002.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bou-IPL2002.ps}
}
@inproceedings{DD-fsttcs2002,
  address = {Kanpur, India},
  month = dec,
  year = 2002,
  volume = 2556,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Agrawal, Manindra and Seth, Anil},
  acronym = {{FSTTCS}'02},
  booktitle = {{P}roceedings of the 22nd {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'02)},
  author = {Demri, St{\'e}phane and D'Souza, Deepak},
  title = {An Automata-Theoretic Approach to Constraint {LTL}},
  pages = {121-132},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DemDsou-fsttcs02.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DemDsou-fsttcs02.ps}
}
@inproceedings{DFP-tcs2002,
  address = {Montr{\'e}al, Qu{\'e}bec, Canada},
  month = aug,
  year = 2002,
  volume = 223,
  series = {IFIP Conference Proceedings},
  publisher = {Kluwer Academic Publishers},
  editor = {Baeza-Yates, Ricardo A. and Montanari, Ugo and 
            Santoro, Nicolas},
  acronym = {{IFIP~TCS}'02},
  booktitle = {{P}roceedings of the 2nd {IFIP} {I}nternational
               {C}onference on {T}heoretical {C}omputer
               {S}cience
               ({IFIP~TCS}'02)},
  author = {Duflot, Marie and Fribourg, Laurent and 
                  Picaronny, Claudine},
  title = {Randomized Dining Philosophers without Fairness
                 Assumption},
  pages = {169-180},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DFP-tcs02.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DFP-tcs02.ps}
}
@inproceedings{DLS-stacs2002,
  address = {Antibes Juan-les-Pins, France},
  month = mar,
  year = 2002,
  volume = 2285,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Alt, Helmut and Ferreira, Afonso},
  acronym = {{STACS}'02},
  booktitle = {{P}roceedings of the 19th {A}nnual
               {S}ymposium on {T}heoretical {A}spects of
               {C}omputer {S}cience
               ({STACS}'02)},
  author = {Demri, St{\'e}phane and Laroussinie, Fran{\c{c}}ois and
                 Schnoebelen, {\relax Ph}ilippe},
  title = {A Parametric Analysis of the State Explosion Problem
                 in Model Checking (Extended Abstract)},
  pages = {620-631},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLS-stacs2002.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DLS-stacs2002.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLS-stacs2002.pdf},
  abstract = {In model checking, the state explosion problem occurs when 
one checks a
\emph{non-flat system}, \emph{i.e.}~a system implicitly described as a
synchronized product of elementary subsystems. In this paper, we
investigate the complexity of a wide variety of model checking problems for
non-flat systems under the light of \emph{parameterized complexity}, taking
the number of synchronized components as a parameter. We provide precise
complexity measures (in the parameterized sense) for most of the problems
we investigate, and evidence that the results are robust.}
}
@article{DS-ICOMP2001,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Demri, St{\'e}phane and Schnoebelen, {\relax Ph}ilippe},
  title = {The Complexity of Propositional Linear Temporal Logics
                 in Simple Cases},
  volume = {174},
  number = {1},
  pages = {84-103},
  year = {2002},
  month = apr,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DS-ICOMP2001.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DS-ICOMP2001.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DS-ICOMP2001.pdf},
  doi = {10.1006/inco.2001.3094},
  abstract = {It is well-known that model 
	checking and satisfiability for PLTL are 
	PSPACE-complete. By contrast, very little is 
	known about whether there exist some 
	interesting fragments of PLTL with a lower 
	worst-case complexity. Such results would help 
	understand why PLTL model checkers are 
	successfully used in practice.\par
	In this paper we investigate this issue and 
	consider model checking and satisfiability for 
	all fragments of PLTL obtainable by 
	restricting (1) the temporal connectives 
	allowed, (2) the number of atomic 
	propositions, and (3) the temporal height.}
}
@book{Demri::Orlowska02,
  author = {Demri, St{\'e}phane and Or{\l}owska, Ewa},
  title = {Incomplete Information: Structure, Inference,
                 Complexity},
  series = {EATCS Monographs},
  year = {2002},
  missingnumber = {},
  missingmonth = {},
  missingnmonth = {},
  publisher = {Springer},
  isbn = {3-540-41904-7},
  url = {http://www.springer.com/978-3-540-41904-7},
  olderurl = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-41904-7}
}
@article{Demri::Sattler02,
  publisher = {{IOS} Press},
  journal = {Fundamenta Informaticae},
  author = {Demri, St{\'e}phane and Sattler, Ulrike},
  title = {Automata-Theoretic Decision Procedures for Information
                 Logics},
  volume = {53},
  number = {1},
  pages = {1-22},
  year = {2002},
  missingmonth = {},
  missingnmonth = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ds-fund-02.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ds-fund-02.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ds-fund-02.pdf}
}
@inproceedings{FRSV-infinity2002,
  address = {Brno, Czech Republic},
  month = aug,
  year = 2002,
  number = 6,
  volume = 68,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Ku{\v c}era, Anton{\'\i}n and Mayr, Richard},
  acronym = {{INFINITY}'02},
  booktitle = {{P}roceedings of the 4th {I}nternational 
               {W}orkshop on {V}erification of {I}nfinite
               {S}tate {S}ystems
               ({INFINITY}'02)},
  author = {Finkel, Alain and Raskin, Jean-Fran{\c{c}}ois and 
                 Samuelides, Mathias and Van{~}Begin, Laurent},
  title = {Monotonic Extensions of {P}etri Nets: Forward and
                 Backward Search Revisited},
  pages = {121-144},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FRSVB-infinity2002.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FRSVB-infinity2002.ps}
}
@inproceedings{FinLer-fsttcs2002,
  address = {Kanpur, India},
  month = dec,
  year = 2002,
  volume = 2556,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Agrawal, Manindra and Seth, Anil},
  acronym = {{FSTTCS}'02},
  booktitle = {{P}roceedings of the 22nd {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'02)},
  author = {Finkel, Alain and Leroux, J{\'e}r{\^o}me},
  title = {How To Compose {P}resburger-Accelerations:
                 Applications to Broadcast Protocols},
  pages = {145-156},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2002-14.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2002-14.rr.ps}
}
@inproceedings{GLLN-csl2002,
  address = {Edinburgh, Scotland, UK},
  month = sep,
  year = 2002,
  volume = 2471,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Bradfield, Julian C.},
  acronym = {{CSL}'02},
  booktitle = {{P}roceedings of the 16th {I}nternational
               {W}orkshop on {C}omputer {S}cience {L}ogic
               ({CSL}'02)},
  author = {Goubault{-}Larrecq, Jean and Lasota, S{\l}awomir and 
                 Nowak, David},
  title = {Logical Relations for Monadic Types},
  pages = {553-568},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GLLN-csl2002.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GLLN-csl2002.ps}
}
@inproceedings{HCFRS-latin2002,
  address = {Cancun, Mexico},
  month = apr,
  year = 2002,
  volume = 2286,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Rajsbaum, Sergio},
  acronym = {{LATIN}'02},
  booktitle = {{P}roceedings of the 5th {L}atin {A}merican
               {S}ymposium on {T}heoretical {I}nformatics
               ({LATIN}'02)},
  author = {Herbreteau, Fr{\'e}d{\'e}ric and Cassez, Franck and 
                 Finkel, Alain and Roux, Olivier F.
                 and Sutre, Gr{\'e}goire},
  title = {Verification of Embedded Reactive Fiffo Systems},
  pages = {400-414},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/HCFRS-latin2002.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/HCFRS-latin2002.ps}
}
@incollection{HHB-OCL,
  missingnmonth = {},
  missingmonth = {},
  year = 2002,
  volume = 2263,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Clark, Tony and Warmer, Jos},
  booktitle = {{O}bject {M}odeling with the {OCL}~--- 
                 {T}he {R}ationale behind the {O}bject {C}onstraint {L}anguage},
  author = {Hennicker, Rolf and Hu{\ss}mann, Heinrich and
                 Bidoit, Michel},
  title = {On the Precise Meaning of {OCL} Constraints},
  pages = {69-84},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/HBB-oclBook.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/HBB-oclBook.ps}
}
@inproceedings{HS-amast2002,
  address = {Saint Gilles les Bains, Reunion Island, France},
  month = sep,
  year = 2002,
  volume = 2422,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Kirchner, H{\'e}l{\`e}ne and 
            Ringeissen, {\relax Ch}ristophe},
  acronym = {{AMAST}'02},
  booktitle = {{P}roceedings of the 9th {I}nternational
               {C}onference on {A}lgebraic {M}ethodology and
               {S}oftware {T}echnology
               ({AMAST}'02)},
  author = {Hornus, Samuel and Schnoebelen, {\relax Ph}ilippe},
  title = {On Solving Temporal Logic Queries},
  pages = {163-177},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HS-amast2002.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HS-amast2002.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/HS-amast2002.ps},
  abstract = {Temporal query checking is an extension of temporal model 
checking where one asks what propositional formulae can be inserted in a 
temporal query (a temporal formula with a placeholder) so that the 
resulting formula is satisfied in the model at hand.\par
We study the problem of computing all minimal solutions to a temporal 
query without restricting to so-called {"}valid{"} queries (queries 
guaranteed to have a unique minimal solution). While this problem is 
intractable in general, we show that deciding uniqueness of the minimal 
solution (and computing it) can be done in polynomial-time. }
}
@inproceedings{JGL-csl2002,
  address = {Edinburgh, Scotland, UK},
  month = sep,
  year = 2002,
  volume = 2471,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Bradfield, Julian C.},
  acronym = {{CSL}'02},
  booktitle = {{P}roceedings of the 16th {I}nternational
               {W}orkshop on {C}omputer {S}cience {L}ogic
               ({CSL}'02)},
  author = {Goubault{-}Larrecq, Jean},
  title = {Higher-Order Positive Set Constraints},
  pages = {473-489},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2002-6.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2002-6.rr.ps}
}
@techreport{JGL:EVA:CPV/2,
  author = {Goubault{-}Larrecq, Jean},
  title = {Outils {CPV} et {CPV2}},
  year = {2002},
  month = may,
  type = {Contract Report},
  number = 8,
  institution = {Projet RNTL~EVA},
  oldhowpublished = {Rapport num{\'e}ro 8 du projet RNTL EVA},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR8.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR8.pdf},
  note = {7 pages}
}
@article{JGL:JTIT,
  address = {Warsaw, Poland},
  publisher = {Instytut {\L}{\k a}csno{\'s}ci},
  journal = {Journal of Telecommunications and 
             Information Technology},
  author = {Goubault{-}Larrecq, Jean},
  editor = {Goubault{-}Larrecq, Jean},
  title = {Special Issue on Models and Methods for Cryptographic
                 Protocol Verification},
  volume = {4/2002},
  year = {2002},
  missingmonth = {},
  missingnmonth = {},
  url = {http://www.nit.eu/archive?view=kwartalrok&rok=2002&kwartal=4}
}
@proceedings{JGL:SECI,
  title = {{A}ctes du 1er {W}orkshop {I}nternational
           sur la {S}{\'e}curit{\'e} des {C}ommunications
           sur {I}nternet
           ({SECI}'02)},
  booktitle = {{A}ctes du 1er {W}orkshop {I}nternational
               sur la {S}{\'e}curit{\'e} des {C}ommunications
               sur {I}nternet
               ({SECI}'02)},
  editor = {Goubault{-}Larrecq, Jean},
  publisher = {INRIA},
  year = 2002,
  month = sep,
  address = {Tunis, Tunisia},
  url = {http://www.lsv.ens-cachan.fr/~goubault/SECI-02/Final/actes-seci02/index.html}
}
@inproceedings{JGL:SECI:pirates,
  address = {Tunis, Tunisia},
  month = sep,
  year = 2002,
  publisher = {INRIA},
  editor = {Goubault{-}Larrecq, Jean},
  acronym = {{SECI}'02},
  booktitle = {{A}ctes du 1er {W}orkshop {I}nternational
               sur la {S}{\'e}curit{\'e} des {C}ommunications
               sur {I}nternet
               ({SECI}'02)},
  author = {Goubault{-}Larrecq, Jean},
  title = {{V}{\'e}rification de protocoles cryptographiques: la
                 logique {\`a} la rescousse!},
  pages = {119-152},
  note = {Invited paper},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/JGL-seci.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/JGL-seci.ps}
}
@article{JGL:crypto:modeles,
  address = {Bordeaux, France},
  publisher = {Groupe Pr{\'e}ventique},
  journal = {Ph{\oe}bus, la revue de la s{\^u}ret{\'e} de 
             fonctionnement},
  author = {Goubault{-}Larrecq, Jean},
  title = {{S}{\'e}curit{\'e}, mod{\'e}lisation et analyse de 
                 protocoles cryptographiques},
  missingpages = {??},
  volume = {20},
  year = {2002},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/DOC/GL-Phoebus2002.doc}
}
@techreport{JGL:dico:3.1,
  author = {Goubault{-}Larrecq, Jean and 
                 Pouzol, Jean-{\relax Ph}ilippe and Demri, St{\'e}phane
                 and M{\'e}, Ludovic and Carle, P.},
  missingauthor = {},
  title = {Langages de d{\'e}tection d'attaques par signatures},
  year = {2002},
  month = jun,
  type = {Contract Report},
  number = {(Sous-projet~3, livrable~1)},
  institution = {Projet RNTL DICO},
  oldhowpublished = {Sous-projet 3, livrable 1 du projet RNTL DICO. Version
                 1},
  note = {30 pages}
}
@inproceedings{LK-JB-LP-ZQ-RK-DASC-02,
  address = {Irvine, California, USA},
  month = oct,
  year = 2002,
  volume = 1,
  publisher = {{IEEE} Aerospace and Electronic Systems Society},
  acronym = {{DASC}'02},
  booktitle = {{P}roceedings of the 21st {IEEE}
               {D}igital {A}vionics {S}ystems
               {C}onference ({DASC}'02)},
  author = {Kristensen, Lars M. and Billington, Jonathan and 
                 Petrucci, Laure and
                 Qureshi, Zahid H. and Kiefer, R.},
  missingauthor = {},
  title = {Formal specification and analysis of airborne mission
                 systems},
  pages = {4.D.4.1-4.D.4.13},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/KBPQK-DASC-02.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/KBPQK-DASC-02.ps}
}
@inproceedings{LMS-fossacs2002,
  address = {Grenoble, France},
  month = apr,
  year = 2002,
  volume = 2303,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Nielsen, Mogens and Engberg, Uffe},
  acronym = {{FoSSaCS}'02},
  booktitle = {{P}roceedings of the 5th {I}nternational 
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'02)},
  author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas and
                 Schnoebelen, {\relax Ph}ilippe},
  title = {On Model Checking Durational {K}ripke Structures
                 (Extended Abstract)},
  pages = {264-279},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMS-fossacs2002.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LMS-fossacs2002.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMS-fossacs2002.pdf},
  abstract = {We consider quantitative model checking in \emph{durational
	Kripke structures} (Kripke structures where transitions have integer 
	durations) with timed temporal logics where subscripts put quantitative
	constraints on the time it takes before a property is satisfied.
	We investigate the conditions that allow polynomial-time model 
        checking algorithms for timed versions of CTL and exhibit an 
        important gap
	between logics where subscripts of the form {"}\(= c\){"} (exact duration) are
	allowed, and simpler logics that only allow subscripts of the form {"}\(\leq c\){"}
	or {"}\(\geq c\){"} (bounded duration).\par
	A surprising outcome of this study is that it provides the second example
	of a \(\Delta_2^P\)-complete model checking problem.}
}
@inproceedings{LMS-lics2002,
  address = {Copenhagen, Denmark},
  month = jul,
  year = 2002,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'02},
  booktitle = {{P}roceedings of the 17th
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'02)},
  author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas and
                 Schnoebelen, {\relax Ph}ilippe},
  title = {Temporal Logic with Forgettable Past},
  pages = {383-392},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMS-lics2002.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LMS-lics2002.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMS-lics2002.pdf},
  doi = {10.1109/LICS.2002.1029846},
  abstract = {We investigate NLTL, a linear-time temporal logic with
	forgettable past. NLTL can be exponentially more succinct 
	than LTL + Past (which in turn can be more succinct
	than LTL). We study satisfiability and model checking for
	NLTL and provide optimal automata-theoretic algorithms
	for these EXPSPACE-complete problems.}
}
@inproceedings{LP-LK-JB-ZQ-CRPIT-02,
  address = {Adelaide, Australia},
  month = jun,
  year = 2002,
  volume = 12,
  series = {Conferences in Research and Practice in Information
           Technology},
  publisher = {Australian Computer Society},
  editor = {Lakos, Charles and Esser, Robert and
            Kristensen, Lars M. and Billington, Jonathan},
  booktitle = {{P}roceedings of the {W}orkshops on
               {S}oftware {I}ngineering and {F}ormal
               {M}ethods and
               {F}ormal {M}ethods {A}pplied to 
               {D}efence {S}ystems},
  author = {Petrucci, Laure and Kristensen, Lars M. and 
                 Billington, Jonathan and
                 Qureshi, Zahid H.},
  title = {Towards Formal Specification and Analysis of Avionics
                 Mission Systems},
  pages = {95-104},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/PKBQ-CRPIT02.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/PKBQ-CRPIT02.ps}
}
@techreport{LSV:02:11,
  author = {Goubault{-}Larrecq, Jean and Verma, Kumar N.},
  title = {Alternating Two-Way {AC}-Tree Automata},
  type = {Research Report},
  number = {LSV-02-11},
  year = {2002},
  month = sep,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {21 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2002-11.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2002-11.rr.ps}
}
@techreport{LSV:02:12,
  author = {Fribourg, Laurent and Messika, St{\'e}phane and 
                 Picaronny, Claudine},
  title = {Traces of Randomized Distributed Algorithms as {G}ibbs
                 Fields},
  type = {Research Report},
  number = {LSV-02-12},
  year = {2002},
  month = sep,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {16 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2002-12.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2002-12.rr.ps}
}
@techreport{LSV:02:13,
  author = {Lasota, S{\l}awomir},
  title = {A Polynomial-Time Algorithm for Deciding True
                 Concurrency Equivalences of {B}asic {P}arallel
                 {P}rocesses},
  type = {Research Report},
  number = {LSV-02-13},
  year = {2002},
  month = sep,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {16 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2002-13.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2002-13.rr.ps}
}
@techreport{LSV:02:18,
  author = {Goubault{-}Larrecq, Jean},
  title = {Un algorithme pour l'analyse de logs},
  type = {Research Report},
  number = {LSV-02-18},
  year = {2002},
  month = nov,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {33 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2002-18.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2002-18.rr.ps}
}
@techreport{LSV:02:3,
  author = {Cortier, V{\'e}ronique},
  title = {Observational Equivalence and Trace Equivalence in an
                 Extension of {S}pi-calculus. {A}pplication to
                 Cryptographic Protocols Analysis. {E}xtended Version},
  type = {Research Report},
  number = {LSV-02-3},
  year = {2002},
  month = mar,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {33 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2002-3.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2002-3.rr.ps}
}
@techreport{LSV:02:4,
  author = {Boisseau, Alexandre},
  title = {Signatures {\'e}lectroniques de contrats},
  type = {Research Report},
  number = {LSV-02-4},
  year = {2002},
  month = apr,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {22 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2002-4.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2002-4.rr.ps}
}
@techreport{LSV:02:7,
  author = {Goubault{-}Larrecq, Jean},
  title = {{SKInT} Labels},
  type = {Research Report},
  number = {LSV-02-7},
  year = {2002},
  month = jul,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {15 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2002-7.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2002-7.rr.ps}
}
@techreport{LSV:02:8,
  author = {Goubault{-}Larrecq, Jean},
  title = {A Note on the Completeness of Certain Refinements of
                 Resolution},
  type = {Research Report},
  number = {LSV-02-8},
  year = {2002},
  month = jul,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {16 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2002-8.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2002-8.rr.ps}
}
@article{LabSch-NJC2002,
  journal = {Nordic Journal of Computing},
  author = {Labroue, Anne and Schnoebelen, {\relax Ph}ilippe},
  title = {An Automata-Theoretic Approach to the Reachability
                 Analysis of {RPPS} Systems},
  volume = {9},
  number = {2},
  pages = {118-144},
  year = {2002},
  month = jul,
  missingmonth = {dans DBLP, c'est summer},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LS-NJC.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LS-NJC.ps},
  abstract = {We show how the reachability 
	analysis of RPPS systems can be tackled with the 
	tree-automata techniques proposed by Lugiez and 
	Schnoebelen for PA. This approach requires that 
	we express the states of RPPS systems in RPA, a 
	tailor-made process rewrite system where 
	reachability is a relation recognizable by 
	finite tree-automata. Two outcomes of this study 
	are (1)~an NP algorithm for reachability in RPPS 
	systems, and (2)~a simple decision procedure for 
	a large class of reachability problems in RPA 
	systems.}
}
@inproceedings{LabSch-express2001,
  address = {Aalborg, Denmark},
  month = feb,
  year = 2002,
  number = 1,
  volume = 52,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Aceto, Luca and Panangaden, Prakash},
  acronym = {{EXPRESS}'01},
  booktitle = {{P}roceedings of the 8th {I}nternational
               {W}orkshop on {E}xpressiveness in
               {C}oncurrency
               ({EXPRESS}'01)},
  author = {Labroue, Anne and Schnoebelen, {\relax Ph}ilippe},
  title = {An Automata-Theoretic Approach to the Reachability
                 Analysis of {RPPS} Systems},
  pages = {1-20},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/LabSch-express2001.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LabSch-express2001.ps},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LabSch-express2001.pdf},
  doi = {10.1016/S1571-0661(04)00213-0}
}
@article{LugSch-tcs,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Lugiez, Denis and Schnoebelen, {\relax Ph}ilippe},
  title = {The Regular Viewpoint on {PA}-Processes},
  volume = {274},
  number = {1-2},
  pages = {89-115},
  year = {2002},
  month = mar,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LugSch-TCS99.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LugSch-TCS99.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LugSch-TCS99.pdf},
  doi = {10.1016/S0304-3975(00)00306-6},
  abstract = {PA is the process algebra allowing 
	non-determinism, sequential and parallel 
	compositions, and recursion.  We suggest viewing 
	PA-processes as trees, and using tree-automata 
	techniques for verification problems on PA.\par
	Our main result is that the set of iterated 
	predecessors of a regular set of PA-processes is a 
	regular tree language, and similarly for iterated 
	successors.  Furthermore, the corresponding 
	tree-automata can be built effectively in 
	polynomial-time.  This has many immediate 
	applications to verification problems for 
	PA-processes, among which a simple and general 
	model-checking algorithm.}
}
@inproceedings{MS-mfcs2002,
  address = {Warsaw, Poland},
  month = aug,
  year = 2002,
  volume = 2420,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Diks, Krzysztof and Rytter, Wojciech},
  acronym = {{MFCS}'02},
  booktitle = {{P}roceedings of the 27th
               {I}nternational {S}ymposium on
               {M}athematical {F}oundations of 
               {C}omputer {S}cience
               ({MFCS}'02)},
  author = {Masson, Beno{\^\i}t and Schnoebelen, {\relax Ph}ilippe},
  title = {On Verifying Fair Lossy Channel Systems},
  pages = {543-555},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MS-mfcs2002-long.pdf},
  abstract = {Lossy channel systems are systems 
	of finite state automata that communicate via 
	unreliable unbounded fifo channels. They are an 
	important computational model because of the 
	role they play in the algorithmic verification 
	of communication protocols.\par 
	In this paper, we show that fair termination is 
	decidable for a large class of these systems.}
}
@inproceedings{NM-express2002,
  address = {Brno, Czech Republic},
  month = aug,
  year = 2002,
  number = 2,
  volume = 68,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Nestmann, Uwe and Panagaden, Prakash},
  acronym = {{EXPRESS}'02},
  booktitle = {{P}roceedings of the 9th {I}nternational
               {W}orkshop on {E}xpressiveness in
               {C}oncurrency
               ({EXPRESS}'02)},
  author = {Markey, Nicolas},
  title = {Past is for Free: {O}n the Complexity of Verifying
                 Linear Temporal Properties with Past},
  pages = {87-104},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/NM-express2002.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/NM-express2002.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/NM-express2002.pdf},
  doi = {10.1016/S1571-0661(05)80366-4},
  abstract = {We study the complexity of satisfiability and model-checking of the linear-time 
	temporal logic with past~(PLTL). More precisely, we consider several fragments of PLTL,
	depending on the allowed set of temporal modalities, the use of negations or the nesting
	of future formulae into past formulae. Our~results show that {"}past is for free{"}, 
	that is
	it does not bring additional theoretical complexity, even for small fragments, and even
	when nesting future formulae into past formulae. We~also remark that existential and
	universal model-checking can have different complexity for certain fragments.}
}
@techreport{NowakDJJ:semddi2,
  author = {Lazi{\'c}, Ranko and Nowak, David},
  title = {On a Semantic Definition of Data Independence},
  type = {Research Report},
  number = {CS-RR-392},
  year = {2002},
  month = dec,
  institution = {Department of Computer Science, University of 
                 Warwick, UK},
  note = {19 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/RR-LazNow.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/RR-LazNow.ps}
}
@techreport{PKB-DSTO-02,
  author = {Petrucci, Laure and Kristensen, Lars M. and 
                  Billington, Jonathan},
  title = {Modelling and Analysis of Airborne Mission Systems},
  oldtitle = {[.]{F}inal report for phase 4 - {DSTO/UniSA} contract},
  year = {2002},
  month = oct,
  type = {Final Report},
  institution = {phase~4, {DSTO/UniSA} contract},
  nmnote = {Voir ce que ca donne en sortie...},
  note = {68 pages}
}
@techreport{PKGEDBA-DSTO-02,
  author = {Petrucci, Laure and Kristensen, Lars M. and 
                 Gallasch, Guy E. and
                 Elliot, M. and Dauchy, Pierre and 
                 Billington, Jonathan and Aziz, M.},
  missingauthor = {},
  title = {Modelling and Analysis of Airborne Mission Systems},
  oldtitle = {{F}inal report for phase 3 - {DSTO/UniSA} contract},
  year = {2002},
  month = aug,
  type = {Contract Report},
  number = {Final report for phase~3},
  institution = {{DSTO/UniSA} contract},
  note = {79 pages}
}
@phdthesis{THESE-BLANC-2002,
  author = {Blanc, Benjamin},
  title = {Prise en compte de principes architecturaux lors de la
                 formalisation des besoins},
  year = {2002},
  month = dec,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Blanc-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Blanc-these.ps}
}
@phdthesis{THESE-BOUYER-2002,
  author = {Bouyer, Patricia},
  title = {Mod{\`e}les et algorithmes pour la v{\'e}rification des
                 syst{\`e}mes temporis{\'e}s},
  year = {2002},
  month = apr,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bouyer-these.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bouyer-these.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bouyer-these.ps}
}
@phdthesis{THESE-FLEURY-2002,
  author = {Fleury, Emmanuel},
  title = {Automates temporis{\'e}s avec mises {\`a} jour},
  year = {2002},
  month = dec,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Fleury-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Fleury-these.ps}
}
@phdthesis{THESE-LABROUE-2002,
  author = {Labroue, Anne},
  title = {{M}{\'e}thodes alg{\'e}briques pour la v{\'e}rification 
                 des
                 syst{\`e}mes infinis},
  year = {2002},
  month = jan,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Labroue-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Labroue-these.ps}
}
@phdthesis{THESE-MAGNIETTE-2001,
  author = {Magniette, Fr{\'e}d{\'e}ric},
  title = {Preuves d'algorithmes auto-stabilisants},
  year = {2002},
  month = jun,
  type = {Th{\`e}se de doctorat},
  school = {Universit{\'e} Paris-Sud~11, Orsay, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/These-magniette.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/These-magniette.ps}
}
@techreport{VPQ:AS22:final,
  author = {Halbwachs, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title = {{V}{\'e}rification de propri{\'e}t{\'e}s quantitatives},
  year = {2002},
  month = dec,
  type = {Final Report},
  institution = {Action Sp\'ecifique~22 du D\'epartement
                 STIC du CNRS},
  oldhowpublished = {Rapport final de l'Action Sp\'ecifique 22 du D\'ept.\
                 STIC du CNRS}
}
@article{acefl-JLAP,
  publisher = {Elsevier Science Publishers},
  journal = {Journal of Logic and Algebraic Programming},
  author = {Aceto, Luca and Laroussinie, Fran{\c{c}}ois},
  title = {Is Your Model Checker on Time? {O}n the Complexity of
                 Model Checking for Timed Modal Logics},
  volume = {52-53},
  pages = {7-51},
  year = {2002},
  month = aug,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/AceLar-JLAP.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/AceLar-JLAP.ps},
  doi = {10.1016/S1567-8326(02)00022-X}
}
@mastersthesis{baudet02DEA,
  author = {Baudet, Mathieu},
  title = {Contr\^{o}le de ressource et {\'e}vitement des
                 interblocages sur la m{\'e}moire},
  year = {2002},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Programmation, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Baudet-dea02.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Baudet-dea02.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Baudet-dea02.pdf}
}
@inproceedings{bbp-rttools02,
  address = {Copenhagen, Denmark},
  month = aug,
  year = 2002,
  howpublished = {Technical Report 2002-025,
                  Department of Information Technology,
                  Uppsala University, Sweden},
  publisher = {Uppsala University},
  editor = {Petterson, Paul and Yi, Wang},
  acronym = {{RT-TOOLS}'02},
  booktitle = {{P}roceedings of the 2nd {W}orkshop
               on {R}eal-{T}ime {T}ools
               ({RT-TOOLS}'02)},
  author = {B{\'e}rard, B{\'e}atrice and Bouyer, Patricia and 
                  Petit, Antoine},
  title = {Analysing the {PGM} Protocol with {UPPAAL}},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/pgmfin.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/pgmfin.ps},
  abstract = {Pragmatic General Multicast (PGM) 
	is a reliable multicast protocol,
	designed to minimize both the probability of 
	negative acknowledgements
	(NAK) implosion and the loading of the network 
	due to retransmissions
	of lost packets. This protocol was presented to 
	the Internet
	Engineering Task Force as an open reference 
	specification. \par
	In this paper, we focus on the main reliability 
	property which PGM
	intends to guarantee: a receiver either receives 
	all data packets from
	transmissions and repairs or is able to detect 
	unrecoverable data
	packet loss.\par
	To this purpose, we propose a modelization of (a 
	simplified version
	of) PGM via a network of timed automata. Using 
	Uppaal model-checker,
	we then study the validity of the reliability 
	property above, which
	turns out to not be always verified but to 
	depend of the values of
	several parameters that we underscore.}
}
@phdthesis{berard-hab-02,
  author = {B{\'e}rard, B{\'e}atrice},
  title = {{V}{\'e}rification de mod{\`e}les temporis{\'e}s},
  year = {2002},
  month = apr,
  type = {M{\'e}moire d'habilitation},
  school = {Universit{\'e} Paris~7, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BB-habile.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BB-habile.ps}
}
@mastersthesis{bertrand2002,
  author = {Bertrand, Nathalie},
  title = {{V}{\'e}rification de canaux {\`a} pertes 
                 stochastiques},
  year = {2002},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Algorithmique, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/NB-dea02.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/NB-dea02.ps}
}
@inproceedings{bh-fossacs2002,
  address = {Grenoble, France},
  month = apr,
  year = 2002,
  volume = 2303,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Nielsen, Mogens and Engberg, Uffe},
  acronym = {{FoSSaCS}'02},
  booktitle = {{P}roceedings of the 5th {I}nternational 
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'02)},
  author = {Bidoit, Michel and Hennicker, Rolf},
  title = {On the Integration of Observability and Reachability
                 Concepts},
  pages = {21-36},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BidHenFossacs02SHORT.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/
		  BidHenFossacs02SHORT.ps}
}
@article{bid-etalias-casl-tcs,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Astesiano, Egidio and Bidoit, Michel and 
                 Kirchner, H{\'e}l{\`e}ne
                 and Krieg-Br{\"u}ckner, Bernd and Mosses, Peter D. and
                 Sannella, Donald and Tarlecki, Andrzej},
  title = {{CASL}: {T}he {C}ommon {A}lgebraic {S}pecification
                 {L}anguage},
  volume = {286},
  number = {2},
  pages = {153-196},
  year = {2002},
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CASL-TCS01.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CASL-TCS01.ps}
}
@article{comon02jtit,
  address = {Warsaw, Poland},
  publisher = {Instytut {\L}{\k a}csno{\'s}ci},
  journal = {Journal of Telecommunications and 
             Information Technology},
  author = {Comon, Hubert and Shmatikov, Vitaly},
  title = {Is it Possible to Decide whether a Cryptographic
                 Protocol is Secure or not?},
  volume = {4/2002},
  year = {2002},
  pages = {5-15},
  missingmonth = {},
  missingnmonth = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JTIT-CS.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JTIT-CS.pdf}
}
@article{cor-ITA,
  journal = {Informatique Th\'eorique et Applications},
  author = {Cortier, V{\'e}ronique},
  title = {About the Decision of Reachability for Register
                 Machines},
  volume = {36},
  number = {4},
  pages = {341-358},
  year = {2002},
  month = oct # {-} # dec,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Cor-ITA.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Cor-ITA.ps}
}
@techreport{cortier-securify-eva7,
  author = {Cortier, V{\'e}ronique},
  title = {Outil de v{\'e}rification {SECURIFY}},
  year = {2002},
  month = may,
  type = {Contract Report},
  number = 7,
  institution = {projet RNTL~EVA},
  note = {6 pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR7.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR7.pdf}
}
@inproceedings{lasota-concur2002,
  address = {Brno, Czech Republic},
  month = aug,
  year = 2002,
  volume = 2421,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Brim, Lubos and Jan{\v c}ar, Petr and 
            K{\v{r}}et{\'i}nsk{\'y}, Mojm{\'i}r and Ku{\v c}era, Anton{\'\i}n},
  acronym = {{CONCUR}'02},
  booktitle = {{P}roceedings of the 13th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'02)},
  author = {Lasota, S{\l}awomir},
  title = {Decidability of Strong Bisimilarity for Timed {BPP}},
  pages = {562-578},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Las-concur2002.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Las-concur2002.ps}
}
@mastersthesis{messika-dea,
  author = {Messika, St{\'e}phane},
  title = {{V}{\'e}rification param{\'e}tr{\'e}e de r{\'e}seaux 
                 {\`a} processus
                 probabiliste. {A}pplication du th{\'e}or{\`e}me de 
                 {H}ammersley
                 et {C}lifford aux algorithmes distribu{\'e}s},
  year = {2002},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Logique et Fondements de l'Informatique, Paris, 
       France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Messika-dea02.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Messika-dea02.ps}
}
@phdthesis{petrucci-hab-02,
  author = {Petrucci, Laure},
  title = {Mod{\'e}lisation, v{\'e}rification et applications},
  year = {2002},
  month = dec,
  type = {M{\'e}moire d'habilitation},
  school = {Universit{\'e} d'{\'E}vry, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LP-habile.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LP-habile.ps}
}
@article{phs-IPL2002,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Verifying Lossy Channel Systems has Nonprimitive
                 Recursive Complexity},
  volume = {83},
  number = {5},
  pages = {251-261},
  year = {2002},
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-IPL2002.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Sch-IPL2002.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-IPL2002.pdf},
  doi = {10.1016/S0020-0190(01)00337-4},
  abstract = {Lossy channel systems are systems of 
	finite state automata that communicate via unreliable 
	unbounded fifo channels. It is known that 
	reachability, termination and a few other verification 
	problems are decidable for these systems. In this 
	article we show that these problems cannot be solved 
	in primitive recursive time.}
}
@misc{phs-movep2002,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Temporal Logic and Verification},
  year = 2002,
  month = jun,
  howpublished = {Invited tutorial, 5th {S}ummer {S}chool on
               {M}odelling and {V}erifying {P}arallel {P}rocesses
               ({MOVEP}'02), Nantes, France}
}
@misc{securify1,
  author = {Cortier, V{\'e}ronique},
  title = {{Securify} version 1},
  year = {2002},
  howpublished = {Available at
                 \url{http://www.lsv.ens-cachan.fr/~cortier/EVA/securify.tar.gz}},
  note = {Started 2001. See~\cite{cortier-securify-eva7} for
                 description. Written in Caml (about 3200 lines)}
}
@mastersthesis{zhang2002,
  author = {Zhang, Yu},
  title = {Logical Relations For Names},
  year = {2002},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Programmation, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ZY-dea02.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ZY-dea02.ps}
}
@article{ABBL02,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Aceto, Luca and Bouyer, Patricia and 
                 Burgue{\~n}o, Augusto and Larsen, Kim G.},
  title = {The Power of Reachability Testing for Timed Automata},
  volume = {300},
  number = {1-3},
  pages = {411-475},
  year = {2003},
  month = may,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bou-ABBL02.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bou-ABBL02.ps},
  doi = {10.1016/S0304-3975(02)00334-1},
  abstract = {The computational engine of the verification tool Uppaal
    consists of a collection of efficient reachability properties of systems.
    Model-checking of properties other than plain reachability ones may
    currently be carried out in such a tool as follows. Given a property
    \(\phi\) to model-check, the user must provide a test
    automaton~\(T_{\phi}\) for it. This test automaton must be such that the
    original system \(S\) has the property expressed by \(\phi\) precisely
    when none of the distinguished reject states of~\(T_{\phi}\) can be
    reached in the synchronized parallel composition of \(S\) with
    \(T_{\phi}\). This raises the question of which properties may be analyzed
    by {\scshape Uppaal} in such a way. This paper gives an answer to this
    question by providing a complete characterization of the class of
    properties for which model-checking can be reduced to reachability testing
    in the sense outlined above. This result is obtained as a corollary of a
    stronger statement pertaining to the compositionality of the property
    language considered in this study. In particular, it is shown that our
    language is the least expressive compositional language that can express a
    simple safety property stating that no reject state can ever be
    reached.\par
    Finally, the property language characterizing the power of reachability
    testing is used to provide a definition of characteristic properties with
    respect to a timed version of the ready simulation preorder, for nodes of
    \(\tau\)-free, deterministic timed automata.}
}
@article{Alechina::Demri::DeRijke02,
  publisher = {Oxford University Press},
  journal = {Journal of Logic and Computation},
  author = {Alechina, Natasha and Demri, St{\'e}phane and 
                  de Rijke, Maarten},
  title = {A Modal Perspective on Path Constraints},
  volume = {13},
  number = {6},
  pages = {939-956},
  year = {2003},
  missingmonth = {},
  missingnmonth = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/final-jlc-adr.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/final-jlc-adr.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/final-jlc-adr.pdf}
}
@techreport{Averroes-4.1.1,
  author = {B{\'e}rard, B{\'e}atrice and 
                  Laroussinie, Fran{\c{c}}ois},
  title = {V{\'e}rification compositionnelle des p-automates},
  year = {2003},
  month = nov,
  type = {Contract Report},
  number = {(Lot~4.1 fourniture~1)},
  institution = {Projet RNTL Averroes},
  oldhowpublished = {Lot 4.1 fourniture 1, du projet RNTL Averroes},
  note = {16~pages}
}
@inproceedings{BBFL-tacas-2003,
  address = {Warsaw, Poland},
  month = apr,
  year = 2003,
  volume = 2619,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Garavel, Hubert and Hatcliff, John},
  acronym = {{TACAS}'03},
  booktitle = {{P}roceedings of the 9th {I}nternational 
               {C}onference on {T}ools and {A}lgorithms for
               {C}onstruction and {A}nalysis of {S}ystems
               ({TACAS}'03)},
  author = {Behrmann, Gerd and Bouyer, Patricia and 
                 Fleury, Emmanuel and Larsen, Kim G.},
  title = {Static Guard Analysis in Timed Automata Verification},
  pages = {254-277},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBFL-tacas-2003.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBFL-tacas-2003.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBFL-tacas-2003.ps},
  abstract = {By definition Timed Automata have 
	an infinite state-space, thus for verification 
	purposes, an exact finite abstraction is 
	required. We propose a location-based finite 
	zone abstraction, which computes an abstraction 
	based on the relevant guards for a particular 
	state of the model (as opposed to all guards). 
	We show that the location-based zone abstraction 
	is sound and complete with respect to location 
	reachability; that it generalises active-clock 
	reduction, in the sense that an inactive clock 
	has no relevant guards at all; that it enlarges 
	the class of timed automata, that can be 
	verified. We generalise the new abstraction to 
	the case of networks of timed automata, and 
	experimentally demonstrate a potentially 
	exponential speedup compared to the usual 
	abstraction.}
}
@inproceedings{BBP-msr2003,
  address = {Metz, France},
  month = oct,
  year = 2003,
  publisher = {Herm{\`e}s},
  editor = {M{\'e}ry, Dominique and Rezg, Nidhal and
            Xie, Xiaolan},
  acronym = {{MSR}'03},
  booktitle = {{A}ctes du 4{\`e}me {C}olloque sur la 
               {M}od{\'e}lisation des {S}yst{\`e}mes
               {R}{\'e}actifs
               ({MSR}'03)},
  author = {B{\'e}rard, B{\'e}atrice and Bouyer, Patricia and 
                  Petit, Antoine},
  title = {Une analyse du protocole {PGM} avec {UPPAAL}},
  pages = {415-430},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBP-msr2003.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBP-msr2003.ps},
  abstract = {Pragmatic General Multicast (PGM) 
	is a reliable multicast protocol,
	designed to minimize both the probability of 
	negative acknowledgements
	(NAK) implosion and the loading of the network 
	due to retransmissions
	of lost packets. This protocol was presented to 
	the Internet
	Engineering Task Force as an open reference 
	specification.  In this
	paper, we focus on the main reliability property 
	which PGM intends to
	guarantee: a receiver either receives all data 
	packets from
	transmissions and repairs or is able to detect 
	unrecoverable data
	packet loss.  To this purpose, we propose a 
	modelization of (a
	simplified version of) PGM via a network of 
	timed automata. Using
	Uppaal model-checker, we then study the validity 
	of the reliability
	property above, which turns out to not be always 
	verified but to
	depend of the values of several parameters that 
	we underscore.}
}
@inproceedings{BDMP-cav-2003,
  address = {Boulder, Colorado, USA},
  month = jul,
  year = 2003,
  volume = 2725,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Hunt, Jr, Warren A. and Somenzi, Fabio},
  acronym = {{CAV}'03},
  booktitle = {{P}roceedings of the 15th
               {I}nternational {C}onference on 
               {C}omputer {A}ided {V}erification
               ({CAV}'03)},
  author = {Bouyer, Patricia and D'Souza, Deepak and 
                 Madhusudan, P. and 
                 Petit, Antoine},
  title = {Timed Control with Partial Observability},
  pages = {180-192},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDMP-CAV03.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDMP-CAV03.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BDMP-CAV03.ps},
  abstract = {We consider the problem of 
	synthesizing controllers for timed systems 
	modeled using timed automata. The point of 
	departure from earlier work is that we 
	consider controllers that have only a 
	partial observation of the system that it 
	controls. In discrete event systems (where 
	continuous time is not modeled), it is well 
	known how to handle partial observability, 
	and decidability issues do not differ from 
	the complete information setting. We show 
	however that timed control under partial 
	observability is undecidable even for 
	internal specifications (while the analogous 
	problem under complete observability is 
	decidable) and we identify a decidable 
	subclass.}
}
@article{BFKM-FMSD,
  publisher = {Kluwer Academic Publishers},
  journal = {Formal Methods in System Design},
  author = {B{\'e}rard, B{\'e}atrice and Fribourg, Laurent and
                 Klay, Francis and 
                 Monin, Jean-Fran{\c{c}}ois},
  title = {A Compared Study of Two Correctness Proofs for the
                 Standardized Algorithm of {ABR} Conformance},
  volume = {22},
  number = {1},
  pages = {59-86},
  year = {2003},
  month = jan,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BFKM-FMSD.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BFKM-FMSD.ps},
  doi = {10.1023/A:1021704214464}
}
@techreport{BFN-edf10,
  author = {Bardin, S{\'e}bastien and Finkel, Alain and 
                  Nowak, David},
  title = {Note de synth{\`e}se {\`a}~10~mois},
  year = {2003},
  month = aug,
  type = {Contract Report},
  number = {P11L03/F01304/0 + 50.0241},
  institution = {collaboration entre EDF et le LSV},
  oldhowpublished = {Contrat P11L03/F01304/0 et 50.0241 de collaboration
                 entre EDF et le LSV},
  note = {21~pages}
}
@techreport{BFN-edf12,
  author = {Bardin, S{\'e}bastien and Finkel, Alain and 
                 Nowak, David},
  title = {Rapport final},
  year = {2003},
  month = nov,
  type = {Contract Report},
  number = {P11L03/F01304/0 + 50.0241},
  institution = {collaboration entre EDF et le LSV},
  oldhowpublished = {Contrat P11L03/F01304/0 et 50.0241 de collaboration
                 entre EDF et le~LSV},
  note = {50~pages}
}
@techreport{BFNS-edf6,
  author = {Bardin, S{\'e}bastien and Finkel, Alain and 
                 Nowak, David and
                 Schnoebelen, {\relax Ph}ilippe},
  title = {Note de synth{\`e}se {\`a} 6 mois},
  year = {2003},
  month = jul,
  type = {Contract Report},
  number = {P11L03/F01304/0 + 50.0241},
  institution = {collaboration entre EDF et le LSV},
  oldhowpublished = {Contrat P11L03/F01304/0 et 50.0241 de collaboration
                 entre EDF et le LSV},
  note = {43~pages}
}
@inproceedings{BP-msr03,
  address = {Metz, France},
  month = oct,
  year = 2003,
  publisher = {Herm{\`e}s},
  editor = {M{\'e}ry, Dominique and Rezg, Nidhal and
            Xie, Xiaolan},
  acronym = {{MSR}'03},
  booktitle = {{A}ctes du 4{\`e}me {C}olloque sur la 
               {M}od{\'e}lisation des {S}yst{\`e}mes
               {R}{\'e}actifs
               ({MSR}'03)},
  author = {Baclet, Manuel and Pacalet, Renaud},
  title = {V{\'e}rifications du protocole~{VCI}},
  pages = {431-445},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/vci-msr03.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/vci-msr03.ps}
}
@article{BPT03,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Bouyer, Patricia and Petit, Antoine and 
                 Th{\'e}rien, Denis},
  title = {An Algebraic Approach to Data Languages and Timed
                 Languages},
  volume = {182},
  number = {2},
  pages = {137-162},
  year = {2003},
  month = may,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BPT-IetC.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BPT-IetC.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BPT-IetC.ps},
  abstract = {Algebra offers an elegant and 
	powerful approach to understand regular
	 languages and finite automata. Such framework 
	has been notoriously
	 lacking for timed languages and timed automata. 
	We introduce the
	 notion of monoid recognizability for data 
	languages, which includes
	 timed languages as special case, in away that 
	respects the spirit of
	 the classical situation. We study closure 
	properties and hierarchies
	 in this model, and prove that emptiness is 
	decidable under natural
	 hypotheses.  Our class of recognizable 
	languages properly includes
	 many families of deterministic timed languages 
	that have been
	 proposed until now, and the same holds for 
	non-deterministic
	 versions.}
}
@inproceedings{BerSch-fossacs2003,
  address = {Warsaw, Poland},
  month = apr,
  year = 2003,
  volume = 2620,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Gordon, Andrew D.},
  acronym = {{FoSSaCS}'03},
  booktitle = {{P}roceedings of the 6th {I}nternational 
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'03)},
  author = {Bertrand, Nathalie and 
                 Schnoebelen, {\relax Ph}ilippe},
  title = {Model Checking Lossy Channels Systems Is Probably
                 Decidable},
  pages = {120-135},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BerSch-fossacs2003.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BerSch-fossacs2003.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BerSch-fossacs2003.pdf},
  abstract = {Lossy channel systems (LCS's) are systems of 
	finite state automata that communicate via unreliable 
	unbounded fifo channels. We propose a new probabilistic 
	model for these systems, where losses of messages are seen 
	as faults occurring with some given probability, and where 
	the internal behavior of the system remains 
	nondeterministic, giving rise to a reactive Markov chains 
	semantics. We then investigate the verification of 
	linear-time properties on this new model.}
}
@inproceedings{Bernat-spv2003,
  address = {Marseilles, France},
  month = sep,
  year = 2003,
  editor = {Rusinowitch, Micha{\"e}l},
  acronym = {{SPV}'03},
  booktitle = {{P}roceedings of the {W}orkshop
               on {S}ecurity {P}rotocols {V}erification
               ({SPV}'03)},
  author = {Bernat, Vincent},
  title = {Towards a Logic for Verification of Security
                 Protocols},
  pages = {31-35},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bernat-spv2003.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bernat-spv2003.ps}
}
@inproceedings{Bou-stacs-2003,
  address = {Berlin, Germany},
  month = feb,
  year = 2003,
  volume = 2607,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Alt, Helmut and Habib, Michel},
  acronym = {{STACS}'03},
  booktitle = {{P}roceedings of the 20th {A}nnual
               {S}ymposium on {T}heoretical {A}spects of
               {C}omputer {S}cience
               ({STACS}'03)},
  author = {Bouyer, Patricia},
  title = {Untameable Timed Automata!},
  pages = {620-631},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bou-stacs2003.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bou-stacs2003.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bou-stacs2003.ps},
  abstract = {Timed automata are a widely 
	studied model for real-time systems. Since 
	8~years, several tools implement this model and 
	are successfully used to verify real-life 
	examples. In spite of this well-established 
	framework, we prove that the forward analysis 
	algorithm implemented in these tools is not 
	correct! However, we also prove that it is 
	correct for a restricted class of timed 
	automata, which has been sufficient for modeling 
	numerous real-life systems.}
}
@article{CNNR-tocl03,
  publisher = {ACM Press},
  journal = {ACM Transactions on Computational Logic},
  author = {Comon, Hubert and Narendran, Paliath and 
                 Nieuwenhuis, Robert and 
                 Rusinowitch, Micha{\"e}l},
  title = {Deciding the Confluence of Ordered Term Rewrite
                 Systems},
  volume = {4},
  number = {1},
  pages = {33-55},
  year = {2003},
  month = jan
}
@inproceedings{ComCor-esop2003,
  address = {Warsaw, Poland},
  month = apr,
  year = 2003,
  volume = 2618,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Degano, Pierpaolo},
  acronym = {{ESOP}'03},
  booktitle = {{P}roceedings of the 12th
               {E}uropean {S}ymposium on {P}rogramming
               ({ESOP}'03)},
  author = {Comon{-}Lundh, Hubert  and Cortier, V{\'e}ronique},
  title = {Security properties: two agents are sufficient},
  pages = {99-113},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComonCortierESOP03.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComonCortierESOP03.ps}
}
@inproceedings{ComCor-rta2003,
  address = {Valencia, Spain},
  month = jun,
  year = 2003,
  volume = 2706,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Nieuwenhuis, Robert},
  acronym = {{RTA}'03},
  booktitle = {{P}roceedings of the 14th {I}nternational
               {C}onference on {R}ewriting {T}echniques
               and {A}pplications
               ({RTA}'03)},
  author = {Comon{-}Lundh, Hubert and Cortier, V{\'e}ronique},
  title = {New Decidability Results for Fragments of First-Order
                 Logic and Application to Cryptographic Protocols},
  pages = {148-164},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2003-2.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2003-2.rr.ps}
}
@article{ComJac-IC2003,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Comon, Hubert and Jacquemard, Florent},
  title = {Ground Reducibility is {EXPTIME}-complete},
  volume = {187},
  number = {1},
  pages = {123-153},
  year = {2003},
  month = nov,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CJ-icomp.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CJ-icomp.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CJ-icomp.ps}
}
@inproceedings{ComTre-mann03,
  month = feb,
  year = 2003,
  volume = 2772,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Dershowitz, Nachum},
  acronym = {{V}erification: {T}heory and {P}ractice},
  booktitle = {{V}erification: {T}heory and {P}ractice,
               {E}ssays {D}edicated to {Z}ohar {M}anna on
               the {O}ccasion of {H}is 64th {B}irthday},
  author = {Comon{-}Lundh, Hubert  and Treinen, Ralf},
  title = {Easy Intruder Deductions},
  pages = {225-242},
  note = {Invited paper},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CT-manna.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CT-manna.ps}
}
@inproceedings{Del-spv2003,
  address = {Marseilles, France},
  month = sep,
  year = 2003,
  editor = {Rusinowitch, Micha{\"e}l},
  acronym = {{SPV}'03},
  booktitle = {{P}roceedings of the {W}orkshop
               on {S}ecurity {P}rotocols {V}erification
               ({SPV}'03)},
  author = {Delaune, St{\'e}phanie},
  title = {Intruder Deduction Problem in Presence of Guessing
                 Attacks},
  pages = {26-30},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/Del-spv2003.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Del-spv2003.pdf},
  abstract = {We present a decidability result in the context of 
	the verification of cryptographic protocols in presence of data 
	which take value in a finite known set. Since the perfect 
	cryptography assumption is unrealistic for cryptographic protocols 
	that employ weak data, we extend the conventional Dolev-Yao model 
	to consider guessing attacks, where an intruder guesses the values 
	of weak data and verify these guesses. We show that the intruder 
	deduction problem, i.e. the existence of guessing attack, can be 
	decided in polynomial time for the extended Dolev-Yao model.}
}
@mastersthesis{Delaune-dea2003,
  author = {Delaune, St{\'e}phanie},
  title = {V{\'e}rification de protocoles de s{\'e}curit{\'e} 
                 dans un
                 mod{\`e}le de l'intrus {\'e}tendu},
  year = {2003},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Programmation, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Delaune-dea2003.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Delaune-dea2003.ps}
}
@article{Demri02,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Demri, St{\'e}phane},
  title = {A Polynomial-Space Construction of Tree-Like Models
                 for Logics with Local Chains of Modal Connectives},
  volume = {300},
  number = {1-3},
  pages = {235-258},
  year = {2003},
  month = may,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/demri-tcs02.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/demri-tcs02.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/demri-tcs02.pdf},
  doi = {10.1016/S0304-3975(02)00082-8}
}
@misc{Demri03,
  author = {Demri, St{\'e}phane},
  title = {({M}odal) Logics for Semistructured Data (Bis)},
  year = 2003,
  month = sep,
  howpublished = {Invited talk, 3rd
           {W}orkshop on {M}ethods for {M}odalities
           ({M4M}'03), Nancy, France}
}
@inproceedings{Demri::DeNivelle03b,
  address = {Nancy, France},
  month = sep,
  year = 2003,
  acronym = {{M4M-3}},
  booktitle = {{P}roceedings of the 3rd
               {W}orkshop on {M}ethods for {M}odalities
               ({M4M-3})},
  author = {Demri, St{\'e}phane and de Nivelle, Hans},
  title = {Relational Translations into {GF2}},
  pages = {93-108}
}
@techreport{EVA-TR13,
  author = {Cortier, V{\'e}ronique},
  title = {A Guide for {SECURIFY}},
  year = {2003},
  month = dec,
  number = 13,
  institution = {projet RNTL~EVA},
  oldhowpublished = {Rapport technique num\'ero 13 du projet RNTL EVA},
  note = {9~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR13.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR13.pdf}
}
@techreport{EVA-TR9,
  author = {Jacquemard, Florent},
  title = {The {EVA} Translator, version~2},
  year = {2003},
  month = jul,
  number = 9,
  institution = {projet RNTL EVA},
  oldhowpublished = {Rapport technique num\'ero 9 du projet RNTL EVA},
  note = {38~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR9.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EVA-TR9.pdf}
}
@misc{EVA2,
  author = {Jacquemard, Florent},
  title = {The {EVA} translator, version~2},
  year = {2003},
  month = jul,
  oldhowpublished = {Available??},
  note = {See~\cite{EVA-TR9} for description. Written in OCaml
                 (about 11000 lines)},
  note-fr = {Voir~\cite{EVA-TR9} pour la description. \'Ecrit en OCaml
                 (environ 11000 lignes)}
}
@inproceedings{FAST-cav03,
  address = {Boulder, Colorado, USA},
  month = jul,
  year = 2003,
  volume = 2725,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Hunt, Jr, Warren A. and Somenzi, Fabio},
  acronym = {{CAV}'03},
  booktitle = {{P}roceedings of the 15th
               {I}nternational {C}onference on 
               {C}omputer {A}ided {V}erification
               ({CAV}'03)},
  author = {Bardin, S{\'e}bastien and Finkel, Alain and 
                 Leroux, J{\'e}r{\^o}me and 
                 Petrucci, Laure},
  title = {{FAST}: {F}ast {A}cceleration of {S}ymbolic
                 {T}ransition Systems},
  pages = {118-121},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FAST-cav03.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FAST-cav03.ps},
  abstract = {FAST is a tool for the analysis 
	of infinite systems. This paper describes the 
	underlying theory, the architecture choices 
	that have been made in the tool design. The 
	user must provide a model to analyse, the 
	property to check and a computation policy. 
	Several such policies are proposed as a 
	standard in the package, others can be added by 
	the user. FAST capabilities are compared with 
	those of other tools. A range of case studies 
	from the literature has been investigated. }
}
@article{FPS-ICOMP,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Finkel, Alain and Purushothaman{ }Iyer, S. and 
                  Sutre, Gr{\'e}goire},
  title = {Well-Abstracted Transition Systems: {A}pplication to
                 {FIFO} Automata},
  volume = {181},
  number = {1},
  pages = {1-31},
  year = {2003},
  month = feb,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FPS-ICOMP.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FPS-ICOMP.ps}
}
@misc{Fast1-manual,
  author = {Bardin, S{\'e}bastien and Finkel, Alain and 
                 Leroux, J{\'e}r{\^o}me and Petrucci, Laure
                 and Worobel, Laurent},
  title = {{FAST} User's Manual},
  year = {2003},
  month = aug,
  oldhowpublished = {Available at
                 \url{http://www.lsv.ens-cachan.fr/fast/doc/manual.ps}},
  note = {33~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FAST-manual.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FAST-manual.ps}
}
@misc{FinLer-FAST2002,
  author = {Bardin, S{\'e}bastien and Finkel, Alain and 
                  Leroux, J{\'e}r{\^o}me},
  title = {{FAST} v1.0: {F}ast {A}cceleration of {S}ymbolic
                 {T}ransition Systems},
  year = {2003},
  month = jul,
  oldhowpublished = {Available at \url{www.lsv.ens-cachan.fr/fast/}},
  note = {See~\cite{FAST-cav03} for description. Written in C++
                 (about 4400 lines on top of the MONA v1.4 library)},
  note-fr = {Voir~\cite{FAST-cav03} pour la description. \'Ecrit en C++
                 (environ 4400 lignes ajout\'ees \`a la biblioth\`eque MONA~v1.4)},
  url = {http://www.lsv.ens-cachan.fr/fast/}
}
@inproceedings{GB03aplas,
  address = {Beijing, China},
  month = nov,
  year = 2003,
  volume = 2895,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Ohori, Atsushi},
  acronym = {{APLAS}'03},
  booktitle = {{P}roceedings of the 1st {A}sian {S}ymposium
               on {P}rogramming {L}anguages and {S}ystems
               ({APLAS}'03)},
  author = {Galland, Antoine and Baudet, Mathieu},
  title = {Controlling and Optimizing the Usage of One Resource},
  pages = {195-211},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GB03aplas.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GB03aplas.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GB03aplas.pdf},
  abstract = {This paper studies the problem of 
	resource availability in the context of mobile code 
	for embedded systems such as smart cards. It presents 
	an architecture dedicated to controlling the usage of 
	a single resource in a multi-process operating system. 
	Its specificity lies in its ability to improve the 
	task scheduling in order to spare resources. Our 
	architecture comprises two parts. The first statically 
	computes the resource needs using a dedicated lattice. 
	The second guarantees at runtime that there will 
	always be enough resources for every application to 
	terminate, thanks to an efficient deadlock-avoidance 
	algorithm. The example studied here is an 
	implementation on a JVM (Java Virtual Machine) for 
	smart cards, dealing with a realistic subset of the 
	Java bytecode.}
}
@inproceedings{GB03cfse,
  address = {La Colle sur Loup, France},
  month = oct,
  year = 2003,
  publisher = {INRIA},
  editor = {Auguin, Michel and Baude, Fran{\c{c}}oise and
            Lavenier, Dominique and Riveill, Michel},
  acronym = {{CFSE}'03},
  booktitle = {{A}ctes de la 3{\`e}me {C}onf{\'e}rence 
               {F}ran{\c{c}}aise sur les {S}yst{\`e}mes
               d'{E}xploitation
               ({CFSE}'03)},
  author = {Galland, Antoine and Baudet, Mathieu},
  title = {{\'E}conomiser l'or du banquier},
  pages = {638-649},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GB03cfse.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GB03cfse.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GB03cfse.pdf}
}
@misc{INTERFAST,
  author = {Worobel, Laurent},
  title = {{INTERFAST}~v1.0: {A}~{GUI} for {FAST}},
  year = {2003},
  month = aug,
  oldhowpublished = {Available at \url{www.lsv.ens-cachan.fr/fast/}},
  note = {See~\cite{Fast1-manual} for description. Written in
                 Java (6300 lines) and C (1600 lines), using Java Cup},
  note-fr = {Voir~\cite{Fast1-manual} pour la description. \'Ecrit en
                 Java (6300 lignes) et C (1600 lignes), utilise Java Cup},
  url = {http://www.lsv.ens-cachan.fr/fast/}
}
@article{JGL:S4:geometry,
  lsv-note = {Published in partnership with International Press},
  publisher = {HHA Publications},
  journal = {Homology, Homotopy and Applications},
  author = {Goubault{-}Larrecq, Jean and Goubault, {\'E}ric},
  title = {On the Geometry of Intuitionistic {S4} Proofs},
  volume = {5},
  number = {2},
  pages = {137-209},
  year = {2003},
  missingmonth = {},
  missingnmonth = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/S4G.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/S4G.ps}
}
@techreport{JGL:dico:3.3,
  author = {Demri, St{\'e}phane and Ducass{\'e}, Mireille and 
                 Goubault{-}Larrecq, Jean
                 and M{\'e}, Ludovic and Olivain, Julien and 
                 Picaronny, Claudine and 
                 Pouzol, Jean-{\relax Ph}ilippe and 
                 Totel, {\'E}ric and Vivinis, Bernard},
  title = {Algorithmes de d{\'e}tection et langages de
                 signatures},
  year = {2003},
  month = oct,
  type = {Contract Report},
  number = {(Sous-projet~3, livrable~3)},
  institution = {projet RNTL DICO},
  oldhowpublished = {Sous-projet 3, livrable 3 du projet RNTL DICO. 
                 Version~1},
  note = {72~pages}
}
@article{Jac-IPL03,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Jacquemard, Florent},
  title = {Reachability and Confluence are Indecidable for 
                 Flat
                 Term Rewriting Systems},
  volume = {87},
  number = {5},
  pages = {265-270},
  year = {2003},
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2003-6.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2003-6.rr.ps}
}
@inproceedings{KNT-icfem2003,
  address = {Singapore},
  month = nov,
  year = 2003,
  volume = 2885,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Song Dong, Jin and Woodcock, Jim},
  acronym = {{ICFEM}'03},
  booktitle = {{P}roceedings of the 5th {I}nternational
               {C}onference on {F}ormal {E}ngineering
               {M}ethods
               ({ICFEM}'03)},
  author = {Kerb{\oe}uf, Micka{\"e}l and Nowak, David and 
                 Talpin, Jean-Pierre},
  title = {Formal Proof of a Polychronous Protocol for Loosely
                 Time-Triggered Architectures},
  pages = {359-374},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/KNT-icfem03.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/KNT-icfem03.ps}
}
@book{LLSdFbook-2003,
  editor = {David, {\relax Ph}ilippe and Waeselynck, H{\'e}l{\`e}ne},
  title = {Logiciel libre et s{\^u}ret{\'e} de fonctionnement:
                 cas des syst{\`e}mes critiques},
  year = {2003},
  publisher = {Herm{\`e}s},
  oldpublisher = {Herm\`es Lavoisier},
  oldnote = {Ouvrage collectif r\'edig\'e sous la direction 
                 de Ph.~David et H.~Waeselynck},
  isbn = {2-7462-0727-3},
  url = {http://www.lavoisier.fr/fr/livres/index.asp?texte=2746207270&select=isbn}
}
@inproceedings{LP-LK-JB-ZQ-02,
  address = {Guimar{\~a}es, Portugal},
  month = jun,
  year = 2003,
  publisher = {{IEEE} Computer Society Press},
  editor = {Lilius, Johan and Balarin, Felice and
            Machado, Ricardo J.},
  acronym = {{ACSD}'03},
  booktitle = {{P}roceedings of the 3rd {I}nternational
               {C}onference on {A}pplication of {C}oncurrency
               to {S}ystem {D}esign
               ({ACSD}'03)},
  author = {Petrucci, Laure and Kristensen, Lars M. and 
                 Billington, Jonathan and
                 Qureshi, Zahid H.},
  title = {Developing a Formal Specification for the Mission
                 System of a Maritime Surveillance Aircraft},
  pages = {92-101},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/PKBQ-ACSD.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/PKBQ-ACSD.ps}
}
@techreport{LSV:03:1,
  author = {Comon{-}Lundh, Hubert and Shmatikov, Vitaly},
  title = {Constraint Solving, Exclusive Or and the Decision 
                 of
                 Confidentiality for Security Protocols Assuming a
                 Bounded Number of Sessions},
  type = {Research Report},
  number = {LSV-03-1},
  year = {2003},
  month = jan,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {17~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2003-1.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2003-1.rr.ps}
}
@techreport{LSV:03:10,
  author = {Fribourg, Laurent and Messika, St{\'e}phane and 
                  Picaronny, Claudine},
  title = {Traces of Randomized Distributed Algorithms As
                 {M}arkov Fields. {A}pplication to Rapid Mixing},
  type = {Research Report},
  number = {LSV-03-10},
  year = {2003},
  month = jul,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {19~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2003-10.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2003-10.rr.ps}
}
@techreport{LSV:03:12,
  author = {Baclet, Manuel},
  title = {Logical Characterization of Aperiodic Data Languages},
  type = {Research Report},
  number = {LSV-03-12},
  year = {2003},
  month = sep,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {16~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2003-12.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2003-12.rr.ps}
}
@techreport{LSV:03:15,
  author = {Delaune, St{\'e}phanie},
  title = {V{\'e}rification de protocoles de s{\'e}curit{\'e} dans un 
	   mod\`ele de l'intrus {\'e}tendu},
  type = {Research Report},
  number = {LSV-03-15},
  year = 2003,
  month = nov,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  fulladdress = lsvaddr,
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2003-15.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2003-15.rr.ps},
  abstract = {La difficult\'e de la conception des protocoles de
          s\'ecurit\'e tient au fait que les messages \'echang\'es peuvent
          \^etre \'ecout\'es, intercept\'es ou modifi\'es par une tierce
          personne: la fiabilit\'e de ces protocoles d\'epend donc du
          pouvoir de d\'eduction que l'on donne \`a l'intrus.\par

          Ce m\'emoire contient d'une part la formalisation et
          l'\'etude d'un nouveau mod\`ele d'intrus \'etendant le mod\`ele
          standard de Dolev-Yao pour prendre en compte les attaques
          par pr\'edictions, et d'autre part une pr\'esentation de
          r\'esultats utiles pour la v\'erification pratique des
          protocoles.}
}
@techreport{LSV:03:7,
  author = {Fribourg, Laurent and Messika, St{\'e}phane and 
                  Picaronny, Claudine},
  title = {On the Absence of Phase Transition in Randomized
                 Distributed Algorithms},
  type = {Research Report},
  number = {LSV-03-7},
  year = {2003},
  month = apr,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {17~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2003-7.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2003-7.rr.ps}
}
@inproceedings{LazNow-tlca2003,
  address = {Valencia, Spain},
  month = jun,
  year = 2003,
  volume = 2701,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Hofmann, Martin},
  acronym = {{TLCA}'03},
  booktitle = {{P}roceedings of the 6th {I}nternational
               {C}onference on {T}yped {L}ambda {C}alculi
               and {A}pplications
               ({TLCA}'03)},
  author = {Lazi{\'c}, Ranko and Nowak, David},
  title = {On a Semantic Definition of Data Independence},
  pages = {226-240},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/RR-LazNow.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/RR-LazNow.ps}
}
@misc{MR:MOP,
  author = {Roger, Muriel},
  title = {{MOP}: {MO}dular {P}rover},
  year = {2003},
  note = {See description in~\cite{THESE-ROGER-2003,GLRV:acm}.
                 Written in OCaml (9611 lines)},
  note-fr = {Voir la description dans~\cite{THESE-ROGER-2003,GLRV:acm}.
                 \'Ecrit en OCaml (9611 lignes)}
}
@inproceedings{MarSch-concur2003,
  address = {Marseilles, France},
  month = aug,
  year = 2003,
  volume = 2761,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Amadio, Roberto M. and Lugiez, Denis},
  acronym = {{CONCUR}'03},
  booktitle = {{P}roceedings of the 14th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'03)},
  author = {Markey, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title = {Model Checking a Path (Preliminary Report)},
  pages = {251-265},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MarSch-concur03.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MarSch-concur03.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MarSch-concur03.pdf},
  doi = {10.1007/b11938},
  abstract = {We consider the problem of checking whether a finite (or
	ultimately periodic) run satisfies a temporal logic formula. This problem
	is at the heart of {"}runtime verification{"} but it also appears in many other
	situations. By considering several extended temporal logics, we show that
	the problem of model checking a path can usually be solved efficiently,
	and profit from specialized algorithms. We further show it is possible to
	efficiently check paths given in compressed form.}
}
@inproceedings{Sch-icalp2003,
  address = {Eindhoven, The Netherlands},
  month = jun,
  year = 2003,
  volume = 2719,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Baeten, Jos C. M. and Lenstra, Jan Karel and 
            Parrow, Joachim and Woeginger, Gerhard J.},
  acronym = {{ICALP}'03},
  booktitle = {{P}roceedings of the 30th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming
               ({ICALP}'03)},
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Oracle circuits for branching-time model checking},
  pages = {790-801},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-icalp03-long.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Sch-icalp03-long.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-icalp03-long.pdf},
  abstract = {A special class of oracle 
	circuits with tree-vector form is introduced. 
	It is shown that they can be evaluated in 
	deterministic polynomial-time with a polylog 
	number of adaptive queries to an NP oracle. 
	This framework allows us to evaluate the 
	precise computational complexity of model 
	checking for some branching-time logics where 
	it was known that the problem is NP-hard and 
	coNP-hard.}
}
@phdthesis{THESE-BOISSEAU-2003,
  author = {Boisseau, Alexandre},
  title = {Abstractions pour la v{\'e}rification de 
                 propri{\'e}t{\'e}s de
                 s{\'e}curit{\'e} de protocoles cryptographiques},
  year = {2003},
  month = sep,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Boisseau-these.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Boisseau-these.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Boisseau-these.pdf}
}
@phdthesis{THESE-CORTIER-2003,
  author = {Cortier, V{\'e}ronique},
  title = {V{\'e}rification automatique des protocoles
                 cryptographiques},
  year = {2003},
  month = mar,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Cortier-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Cortier-these.ps}
}
@phdthesis{THESE-DUFLOT-2003,
  author = {Duflot, Marie},
  title = {Algorithmes distribu{\'e}s sur des anneaux 
                 param{\'e}tr{\'e}s~---
                 {P}reuves de convergence probabiliste et 
                 d{\'e}terministe},
  year = {2003},
  month = sep,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Duflot-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Duflot-these.ps}
}
@phdthesis{THESE-LEROUX-2003,
  author = {Leroux, J{\'e}r{\^o}me},
  title = {Algorithmique de la v{\'e}rification des 
                 syst{\`e}mes {\`a}
                 compteurs. {A}pproximation et acc{\'e}l{\'e}ration.
                 {I}mpl{\'e}mentation de l'outil~{FAST}},
  year = {2003},
  month = dec,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Leroux-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Leroux-these.ps}
}
@phdthesis{THESE-MARKEY-2003,
  author = {Markey, Nicolas},
  title = {Logiques temporelles pour la v{\'e}rification:
                 expressivit{\'e}, complexit{\'e}, algorithmes},
  year = {2003},
  month = apr,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire d'Informatique Fondamentale d'Orl{\'e}ans, 
		France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Markey-these.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Markey-these.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Markey-these.pdf}
}
@phdthesis{THESE-ROGER-2003,
  author = {Roger, Muriel},
  title = {Raffinements de la r{\'e}solution et 
                 v{\'e}rification de
                 protocoles cryptographiques},
  year = {2003},
  month = oct,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Roger-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Roger-these.ps}
}
@phdthesis{THESE-VERMA-2003,
  author = {Verma, Kumar N.},
  title = {Automates d'arbres bidirectionnels modulo 
                  th{\'e}ories {\'e}quationnelles},
  year = {2003},
  month = sep,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Verma-these.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Verma-these.ps}
}
@misc{TSMVv1.0,
  author = {Markey, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title = {{TSMV}~v1.0},
  year = {2003},
  month = oct,
  howpublished = {Available at
                 \url{http://www.lsv.ens-cachan.fr/~markey/TSMV/}},
  note = {See description in~\cite{MS-formats2004}. Written in C
                 (about 4000~lines on top of NuSMV v2.1.2)},
  note-fr = {Voir la description dans~\cite{MS-formats2004}. \'Ecrit en C
                 (environ 4000~lignes \`ajout\'ees \`a NuSMV~v2.1.2)},
  url = {http://www.lsv.ens-cachan.fr/~markey/TSMV/}
}
@inproceedings{ZhaNow-csl2003,
  address = {Vienna, Austria},
  month = aug,
  year = 2003,
  volume = 2803,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Baaz, Matthias and Makowsky, Johann A.},
  acronym = {{CSL}'03},
  booktitle = {{P}roceedings of the 17th {I}nternational
               {W}orkshop on {C}omputer {S}cience {L}ogic
               ({CSL}'03)},
  author = {Zhang, Yu and Nowak, David},
  title = {Logical Relations for Dynamic Name Creation},
  pages = {575-588},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ZN-csl2003.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ZN-csl2003.ps}
}
@techreport{artist-W1A2N1Y1,
  author = {Jonsson, Bengt and others},
  title = {Roadmap on Component-based Design and Integration
                 Platforms},
  year = {2003},
  month = may,
  type = {Contract Report},
  number = {(Deliverable W1.A2.N1.Y1)},
  institution = {European Project IST-2001-34820 
                  {"}ARTIST{"} Advanced Real-Time Systems},
  oldhowpublished = {Deliverable W1.A2.N1.Y1 of European Project
                 IST-2001-34820 ``ARTIST'' Advanced Real-Time Systems},
  note = {78~pages}
}
@article{bhk-tcs-fossacs01,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Bidoit, Michel and Hennicker, Rolf and 
                  Kurz, Alexander},
  title = {Observational Logic, Constructor-Based Logic, and
                 their Duality},
  volume = {298},
  number = {3},
  pages = {471-510},
  year = {2003},
  month = apr,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BHK-TCS-FOSSACS01.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BHK-TCS-FOSSACS01.ps}
}
@inproceedings{comon03lics,
  address = {Ottawa, Canada},
  month = jun,
  year = 2003,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'03},
  booktitle = {{P}roceedings of the 18th
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'03)},
  author = {Comon{-}Lundh, Hubert  and Shmatikov, Vitaly},
  title = {Intruder Deductions, Constraint Solving and Insecurity
                 Decision in Presence of Exclusive Or},
  pages = {271-280}
}
@incollection{couvreur-chap03,
  author = {Couvreur, Jean-Michel and Poitrenaud, Denis},
  title = {{D}{\'e}pliage pour la v{\'e}rification de
                 propri{\'e}t{\'e}s temporelles},
  chapter = {3},
  editor = {Michel Diaz},
  booktitle = {V{\'e}rification et mise en {\oe}uvre des 
                 r{\'e}seaux de {P}etri~--- Tome~2},
  pages = {127-161},
  year = {2003},
  month = jan,
  publisher = {Herm{\`e}s}
}
@inproceedings{couvreur-lpar03,
  address = {Almaty, Kazakhstan},
  month = sep,
  year = 2003,
  volume = 2850,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer},
  editor = {Vardi, Moshe Y. and Voronkov, Andrei},
  acronym = {{LPAR}'03},
  booktitle = {{P}roceedings of the 10th {I}nternational
               {C}onference on {L}ogic for {P}rogramming,
               {A}rtificial {I}ntelligence, and {R}easoning
               ({LPAR}'03)},
  author = {Couvreur, Jean-Michel and Saheb, Nasser and 
                 Sutre, Gr{\'e}goire},
  title = {An Optimal Automata Approach to {LTL} Model Checking
                 of Probabilistic Systems},
  pages = {361-375},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CSS-lpar03.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CSS-lpar03.ps}
}
@misc{fl-cours-etr2003,
  author = {Laroussinie, Fran{\c{c}}ois},
  title = {Automates temporis{\'e}s et hybrides, 
                 mod{\'e}lisation et
                 v{\'e}rification},
  year = {2003},
  month = sep,
  howpublished = {Invited lecture, \'ecole d'\'et\'e ETR 2003 (\'Ecole Temps
                 R\'eel), Toulouse, France}
}
@inproceedings{invLP-ICATPN-03,
  address = {Eindhoven, The Netherlands},
  month = jun,
  year = 2003,
  volume = 2679,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {van der Aalst, Wil M. P. and Best, Eike},
  acronym = {{ICATPN}'03},
  booktitle = {{P}roceedings of the 24th
               {I}nternational {C}onference on
               {A}pplications and {T}heory of {P}etri {N}ets
               ({ICATPN}'03)},
  author = {Billington, Jonathan and Christensen, S{\o}ren and 
                 van Hee, Kees M. and 
                 Kindler, Ekkart and Kummer, Olaf and 
                 Petrucci, Laure and Post, Reinier and
                 Stehno, {\relax Ch}ristian and Weber, Michael},
  title = {The {P}etri {N}et {M}arkup {L}anguage: {C}oncepts,
                 Technology and Tools},
  pages = {483-505},
  note = {Invited paper},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/PNML-ATPN03.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/PNML-ATPN03.ps}
}
@article{lst-TCS2001,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Laroussinie, Fran{\c{c}}ois and 
                 Schnoebelen, {\relax Ph}ilippe and 
                 Turuani, Mathieu},
  title = {On the Expressivity and Complexity of Quantitative
                 Branching-Time Temporal Logics},
  volume = {297},
  number = {1-3},
  pages = {297-315},
  year = {2003},
  month = mar,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LST-TCS01.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LST-TCS01.ps},
  doi = {10.1016/S0304-3975(02)00644-8},
  abstract = {We investigate extensions of 
	CTL allowing to express quantitative 
	requirements about an abstract notion of time 
	in a simple discrete-time framework, and 
	study the expressive power of several 
	relevant logics.\par
	When only subscripted modalities are used, 
	polynomial-time model checking is possible 
	even for the largest logic we consider, while 
	the introduction of freeze quantifiers leads 
	to a complexity blow-up.}
}
@article{markey-beatcs,
  publisher = {European Association for 
                 Theoretical Computer Science},
  journal = {EATCS Bulletin},
  author = {Markey, Nicolas},
  title = {Temporal Logic with Past is Exponentially More
                 Succinct},
  volume = {79},
  pages = {122-128},
  year = {2003},
  month = feb,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/NM-succinct.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/NM-succinct.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/NM-succinct.pdf},
  abstract = {We positively answer the old question whether temporal logic with
              past is more succinct than pure-future temporal logic. Surprisingly, 
              the proof is quite simple and elementary, although the question 
              has been open for twenty years.}
}
@mastersthesis{mongi-dea2003,
  author = {Ben{ }Gaid, Mongi},
  title = {Mod{\'e}lisation et v{\'e}rification des aspects
                 temporis{\'e}s des langages pour automates 
                 programmables
                 industriels},
  year = {2003},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Informatique Distribu{\'e}e, Orsay, France},
  note = {68~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Mongi-dea2003.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Mongi-dea2003.pdf}
}
@inproceedings{phs-aiml02,
  address = {Toulouse, France},
  unsure-month = sep,
  unsure-nmonth = 9,
  year = 2003,
  optaddress = {London, UK},
  publisher = {King's College Publication},
  editor = {Balbiani, {\relax Ph}ilippe and Suzuki, Nobu-Yuki
            and Wolter, Frank and Zakharyaschev, Michael},
  acronym = {{AiML}'02},
  booktitle = {{S}elected {P}apers from the 4th
           {W}orkshop on {A}dvances in {M}odal {L}ogics
           ({AiML}'02)},
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {The Complexity of Temporal Logic Model Checking},
  chapter = {19},
  pages = {393-436},
  note = {Invited paper},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-aiml02.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Sch-aiml02.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-aiml02.pdf}
}
@misc{phs-svhss2003,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Model Checking Branching-Time Temporal Logics},
  year = {2003},
  month = may,
  howpublished = {Invited talk, Franco-Israeli Workshop on Semantics and
                 Verification of Hardware and Software Systems,
                 Tel-Aviv, Israel}
}
@misc{securify2,
  author = {Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
  title = {{Securify} version~2},
  year = {2003},
  missingmonth = {},
  missingnmonth = {},
  oldhowpublished = {Available at
                 \url{http://www.lsv.ens-cachan.fr/~cortier/EVA/securify2.tar.gz}},
  note = {See~\cite{EVA-TR13} for description. Written in Caml
                 (about 3300 lines)},
  note-fr = {Voir~\cite{EVA-TR13} pour la description. \'Ecrit en Caml
                 (environ 3300 lignes)},
  url = {http://www.lsv.ens-cachan.fr/~cortier/EVA/securify2.tar.gz}
}
@misc{spore,
  author = {Jacquemard, Florent},
  title = {{SPORE}: {S}ecurity {P}rotocols {O}pen {RE}pository},
  year = {2003},
  month = jul,
  oldhowpublished = {A base of protocol descriptions, reachable at
                 \url{www.lsv.ens-cachan.fr/spore}},
  note = {Works with Perl scripts (about 1200 lines) and
                 contains about 50 protocol descriptions (as of Aug.~2004)},
  note-fr = {Utilise des scripts Perl (environ 1200 lignes),
                 contient environ 50 descriptions de protocoles (en Ao\^ut~2004)},
  url = {http://www.lsv.ens-cachan.fr/spore/}
}
@misc{symprod-02,
  author = {Petrucci, Laure},
  title = {{\ttfamily symprod}: construction et analyse du 
                 produit
                 synchronis{\'e} modulaire d'automates},
  year = {2003},
  missingmonth = {},
  missingnmonth = {},
  nonote = {See~\cite{CL-LP-ACSD04} for description. Written in C
                 (about 3700 lines)},
  nmnote = {J'ai commente la note ci-dessus car CL-LP-ACSD04 est 'ant' 
            (en fait, posterieur au depart de Laure)},
  nmothernote = {URL invalide...}
}
@inproceedings{verma:lpar03,
  address = {Almaty, Kazakhstan},
  month = sep,
  year = 2003,
  volume = 2850,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer},
  editor = {Vardi, Moshe Y. and Voronkov, Andrei},
  acronym = {{LPAR}'03},
  booktitle = {{P}roceedings of the 10th {I}nternational
               {C}onference on {L}ogic for {P}rogramming,
               {A}rtificial {I}ntelligence, and {R}easoning
               ({LPAR}'03)},
  author = {Verma, Kumar N.},
  title = {On Closure under Complementation of Equational Tree
                 Automata for Theories Extending~{AC}},
  pages = {183-195},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Verma-lpar03.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Verma-lpar03.ps}
}
@inproceedings{verma:rta03,
  address = {Valencia, Spain},
  month = jun,
  year = 2003,
  volume = 2706,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Nieuwenhuis, Robert},
  acronym = {{RTA}'03},
  booktitle = {{P}roceedings of the 14th {I}nternational
               {C}onference on {R}ewriting {T}echniques
               and {A}pplications
               ({RTA}'03)},
  author = {Verma, Kumar N.},
  title = {Two-Way Equational Tree Automata for {AC}-like
                 Theories: {D}ecidability and Closure Properties},
  pages = {180-196},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Ver-rta03.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Ver-rta03.ps}
}
@techreport{Averroes-4.2.2,
  author = {Duflot, Marie and Fribourg, Laurent and 
                 H{\'e}rault, {\relax Th}omas and 
                 Lassaigne, Richard and 
                 Magniette, Fr{\'e}d{\'e}ric and 
                 Messika, St{\'e}phane and 
                 Peyronnet, Sylvain and Picaronny, Claudine},
  title = {Probabilistic Model Checking of the {CSMA/CD} Protocol
                 Using {PRISM} and {APMC}},
  year = {2004},
  month = jun,
  type = {Contract Report},
  number = {(Lot 4.2 fourniture 2)},
  institution = {projet RNTL Averroes},
  oldhowpublished = {Lot 4.2 fourniture 2, du projet RNTL Averroes},
  note = {22~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Averroes-4.2.2.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Averroes-4.2.2.ps}
}
@inproceedings{B04sasyft,
  address = {Orl{\'e}ans, France},
  howpublished = {LIFO Technical Report 2004-11, Laboratoire d'Informatique Fondamentale d'Orl{\'e}ans, 
		France},
  month = jun,
  year = 2004,
  editor = {Anantharaman, Siva},
  acronym = {{SASYFT}'04},
  booktitle = {{P}roceedings of the {W}orkshop on {S}ecurity
           of {S}ystems: {F}ormalism and {T}ools
           ({SASYFT}'04)},
  author = {Baudet, Mathieu},
  title = {Random Polynomial-Time Attacks and {D}olev-{Y}ao
                 Models},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/B04sasyft.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/B04sasyft.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/B04sasyft.pdf},
  preliminary-version-of = {Baudet05jalc},
  abstract = {For several decades two different 
	communities have been working on the formal security of 
	cryptographic protocols. Many efforts have been made 
	recently to take benefit of both approaches, in brief: the 
	comprehensiveness of computational models and the 
	automatizability of formal methods. The purpose of this 
	paper is to investigate an original approach to relate the 
	two views, that is: to extend existing Dolev-Yao models to 
	account for random polynomial-time (Las Vegas) 
	computability. This is done first by noticing that 
	Dolev-Yao models can be seen as transition systems, 
	possibly infinite. We then extend these transition systems 
	with computation times and probabilities. The extended 
	models can account for normal Dolev-Yao transitions as 
	well as nonstandard operations such as inverting a one-way 
	function. Our main contribution consists of showing that 
	under sufficient realistic assumptions the extended models 
	are equivalent to standard Dolev-Yao models as far as 
	security is concerned. Thus our work enlarges the scope of 
	existing decision procedures.}
}
@misc{bouyer-movep2004,
  author = {Bouyer, Patricia},
  title = {Timed Automata~--- {F}rom Theory to Implementation},
  year = 2004,
  month = dec,
  note = {27~pages},
  howpublished = {Invited tutorial, 6th {W}inter {S}chool on
		{M}odelling and {V}erifying {P}arallel {P}rocesses
		({MOVEP}'04), Brussels, Belgium}
}
@misc{gastin-movep2004,
  author = {Gastin, Paul},
  title = {Basics of model checking},
  year = 2004,
  month = dec,
  nonote = {-- pages},
  howpublished = {Invited tutorial, 6th {W}inter {S}chool on
		{M}odelling and {V}erifying {P}arallel {P}rocesses
		({MOVEP}'04), Brussels, Belgium}
}
@misc{bouyer-epit32,
  author = {Bouyer, Patricia},
  title = {Timed Models for Concurrent Systems},
  year = 2004,
  month = apr,
  howpublished = {Invited lecture, 32nd {S}pring {S}chool on 
		{T}heoretical {C}omputer {S}cience ({C}oncurrency {T}heory), 
		Luminy, France}
}
@misc{gastin-epit32,
  author = {Gastin, Paul},
  title = {Specifications for distributed systems},
  year = 2004,
  month = apr,
  howpublished = {Invited lecture, 32nd {S}pring {S}chool on 
		{T}heoretical {C}omputer {S}cience ({C}oncurrency {T}heory), 
		Luminy, France}
}
@misc{bouyer-qest04,
  author = {Bouyer, Patricia},
  title = {Timed Automata~--- {F}rom Theory to Implementation},
  year = 2004,
  month = sep,
  howpublished = {Invited tutorial, 1st International Conference on the 
		Quantitative Evaluation of System (QEST'04), 
		Twente, The Netherlands}
}
@inproceedings{BBL-hscc2004,
  address = {Philadelphia, Pennsylvania, USA},
  month = mar,
  year = 2004,
  volume = 2993,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Alur, Rajeev and Pappas, George J.},
  acronym = {{HSCC}'04},
  booktitle = {{P}roceedings of the 7th {I}nternational {C}onference
               on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
               ({HSCC}'04)},
  author = {Bouyer, Patricia and Brinksma, Ed and 
                 Larsen, Kim G.},
  title = {Staying Alive As Cheaply As Possible},
  pages = {203-218},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBL-hscc04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBL-hscc04.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBL-hscc04.ps},
  abstract = {This paper is concerned with the 
	derivation of infinite schedules for timed automata 
	that are in some sense optimal. To cover a wide class 
	of optimality criteria we start out by introducing an 
	extension of the (priced) timed automata model that 
	includes both costs and rewards as separate modelling 
	features. A precise definition is then given of what 
	constitutes optimal infinite behaviours for this class 
	of models. We subsequently show that the derivation of 
	optimal non-terminating schedules for such 
	double-priced timed automata is computable. This is 
	done by a reduction of the problem to the determination 
	of optimal mean-cycles in finite graphs with weighted 
	edges. This reduction is obtained by introducing the 
	so-called corner-point abstraction, a powerful 
	abstraction technique of which we show that it 
	preserves optimal schedules. }
}
@inproceedings{BBLP-tacas04,
  address = {Barcelona, Spain},
  month = mar,
  year = 2004,
  volume = 2988,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Jensen, Kurt and Podelski, Andreas},
  acronym = {{TACAS}'04},
  booktitle = {{P}roceedings of the 10th {I}nternational 
               {C}onference on {T}ools and {A}lgorithms for
               {C}onstruction and {A}nalysis of {S}ystems
               ({TACAS}'04)},
  author = {Behrmann, Gerd and Bouyer, Patricia and 
                 Larsen, Kim G. and Pel{\'a}nek, Radek},
  title = {Lower and Upper Bounds in Zone Based Abstractions of
                 Timed Automata},
  pages = {312-326},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBLP-tacas04.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBLP-tacas04.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBLP-tacas04.pdf},
  abstract = {Timed automata have an infinite 
	semantics. For verification purposes, one usually 
	uses zone based abstractions w.r.t.~the maximal 
	constants to which clocks of the timed automaton are 
	compared. We show that by distinguishing maximal 
	lower and upper bounds, significantly coarser 
	abstractions can be obtained. We show soundness and 
	completeness of the new abstractions 
	w.r.t.~reachability. We demonstrate how information 
	about lower and upper bounds can be used to optimise 
	the algorithm for bringing a difference bound matrix 
	into normal form. Finally, we experimentally 
	demonstrate that the new techniques dramatically 
	increases the scalability of the real-time model 
	checker~{\scshape Uppaal}. }
}
@article{BBP-IJPR04,
  publisher = {Taylor \& Francis},
  journal = {International Journal of Production Research},
  author = {B{\'e}rard, B{\'e}atrice and Bouyer, Patricia and 
                  Antoine Petit},
  title = {Analysing the {PGM} Protocol with {U}ppaal},
  volume = {42},
  number = {14},
  pages = {2773-2791},
  year = {2004},
  month = jul,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBP-IJPR04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBP-IJPR04.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBP-IJPR04.ps},
  abstract = {Pragmatic General Multicast (PGM) 
	is a reliable multicast protocol, designed to 
	minimize both the probability of negative 
	acknowledgements~(NAK) implosion and the load 
	of the network due to retransmissions of lost 
	packets. This protocol was presented to the 
	Internet Engineering Task Force as an open 
	reference specification.\par
	    In this paper, we focus on the main 
	reliability property which PGM intends to 
	guarantee: a receiver either receives all data 
	packets from transmissions and repairs or is 
	able to detect unrecoverable data packet loss. 
	\par
	    We first propose a modelization of (a 
	simplified version of) PGM via a network of 
	timed automata. Using Uppaal model-checker, we 
	then study the validity of the reliability 
	property above, which turns out not to be 
	always verified but to depend on the values of 
	several parameters that we underscore.}
}
@inproceedings{BBS-afadl2004,
  address = {Besan{\c{c}}on, France},
  month = jun,
  year = 2004,
  editor = {Julliand, Jacques},
  acronym = {{AFADL}'04},
  booktitle = {{A}ctes du 6{\`e}me {A}telier sur les {A}pproches {F}ormelles
               dans l'{A}ssistance au {D}{\'e}veloppement de {L}ogiciels
               ({AFADL}'04)},
  author = {Ben{ }Gaid, Mongi and B{\'e}rard, B{\'e}atrice and 
                  De{~}Smet, Olivier},
  title = {Mod{\'e}lisation et v{\'e}rification d'un 
                  {\'e}vaporateur en {Uppaal}},
  pages = {223-238},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBS-afadl04.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBS-afadl04.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBS-afadl04.pdf}
}
@inproceedings{BCFL-gdv04,
  address = {Boston, Massachusetts, USA},
  month = feb,
  year = {2005},
  number = 1,
  volume = 119,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {De Alfaro, Luca},
  acronym = {{GDV}'04},
  booktitle = {{P}roceedings of the {W}orkshop on
               {G}ames in {D}esign and {V}erification
               ({GDV}'04)},
  author = {Bouyer, Patricia and Cassez, Franck and 
                 Fleury, Emmanuel and 
                 Larsen, Kim G.},
  title = {Synthesis of Optimal Strategies Using {HyTech}},
  pages = {11-31},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCFL-gdv04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCFL-gdv04.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BCFL-gdv04.ps},
  doi = {10.1016/j.entcs.2004.07.006},
  abstract = {Priced timed (game) automata extend timed 
	(game) automata with costs on both locations and 
	transitions. The problem of synthesizing an optimal 
	winning strategy for a priced timed game under some 
	hypotheses has been shown decidable in~[BCFL04]. In this 
	paper, we present an algorithm for computing the optimal 
	cost and for synthesizing an optimal strategy in case 
	there exists one. We also describe the implementation of 
	this algorithm with the tool HyTech and present an 
	example. }
}
@inproceedings{BDF-afadl2004,
  address = {Besan{\c{c}}on, France},
  month = jun,
  year = 2004,
  editor = {Julliand, Jacques},
  acronym = {{AFADL}'04},
  booktitle = {{A}ctes du 6{\`e}me {A}telier sur les {A}pproches {F}ormelles
               dans l'{A}ssistance au {D}{\'e}veloppement de {L}ogiciels
               ({AFADL}'04)},
  author = {Bardin, S{\'e}bastien and 
                  Darlot, {\relax Ch}ristophe and Finkel, Alain},
  title = {{FAST}: un model-checker pour syst{\`e}mes {\`a}
                 compteurs},
  pages = {377-380},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BDF-afadl04.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BDF-afadl04.ps},
  abstract = {FAST est un outil pour la 
	v\'erification de propri\'et\'es de s\^uret\'e 
	pour des syst\`emes \`a compteurs. 
	L'originalit\'e de l'outil tient dans 
	l'utilisation de repr\'esentations symboliques 
	pour repr\'esenter des ensembles infinis et de 
	techniques d'acc\'el\'eration pour augmenter 
	les chances de convergence. FAST a \'et\'e 
	appliqu\'e avec succ\`es \`a un grand nombre de 
	cas non triviaux.}
}
@article{BDFP04,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Bouyer, Patricia and Dufourd, Catherine and 
                  Fleury, Emmanuel and Petit, Antoine},
  title = {Updatable Timed Automata},
  volume = {321},
  number = {2-3},
  pages = {291-345},
  year = {2004},
  month = aug,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/uta-BDFP04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/uta-BDFP04.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/uta-BDFP04.ps},
  doi = {10.1016/j.tcs.2004.04.003},
  abstract = {We investigate extensions of Alur and 
	Dill's timed automata, based on the possibility to 
	update the clocks in a more elaborate way than simply 
	reset them to zero. We call these automata updatable 
	timed automata. They form an undecidable class of 
	models, in the sense that emptiness checking is not 
	decidable. However, using an extension of the region 
	graph construction, we exhibit interesting decidable 
	subclasses. In a surprising way, decidability depends 
	on the nature of the clock constraints which are 
	used, diagonal-free or not, whereas these constraints 
	play identical roles in timed automata. We thus 
	describe in a quite precise way the thin frontier 
	between decidable and undecidable classes of 
	updatable timed automata. \par 
	We also study the 
	expressive power of updatable timed automata. It 
	turns out that any updatable automaton belonging to 
	some decidable subclass can be effectively 
	transformed into an equivalent timed automaton 
	without updates but with silent transitions. The 
	transformation suffers from an enormous combinatorics 
	blow-up which seems unavoidable. Therefore, updatable 
	timed automata appear to be a concise model for 
	representing and analyzing large classes of timed 
	systems. }
}
@inproceedings{BF-atva04,
  address = {Taipei, Taiwan},
  month = oct # {-} # nov,
  year = {2004},
  volume = {3299},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Wang, Farn},
  acronym = {{ATVA}'04},
  booktitle = {{P}roceedings of the 2nd {I}nternational
               {S}ymposium on {A}utomated {T}echnology
               for {V}erification and {A}nalysis
               ({ATVA}'04)},
  author = {Bardin, S{\'e}bastien and Finkel, Alain},
  title = {Composition of accelerations to verify infinite
                 heterogeneous systems},
  pages = {248-262},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BF-atva04.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BF-atva04.ps},
  abstract = {Symbolic representations and 
	acceleration algorithms are emerging methods to 
	extend model-checking to infinite state space 
	systems. However until now, there is no general 
	theory of acceleration, and designing 
	acceleration algorithms for new data types is a 
	complex task. On the other hand, protocols 
	rarely manipulate new data types, rather new 
	combinations of well-studied data types. For 
	this reason, in this paper we focus on the 
	automatic construction of symbolic 
	representations and acceleration algorithms 
	from existing ones.}
}
@inproceedings{BFL-tacas04,
  address = {Barcelona, Spain},
  month = mar,
  year = 2004,
  volume = 2988,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Jensen, Kurt and Podelski, Andreas},
  acronym = {{TACAS}'04},
  booktitle = {{P}roceedings of the 10th {I}nternational 
               {C}onference on {T}ools and {A}lgorithms for
               {C}onstruction and {A}nalysis of {S}ystems
               ({TACAS}'04)},
  author = {Bardin, S{\'e}bastien and Finkel, Alain and 
                 Leroux, J{\'e}r{\^o}me},
  title = {{FAST}er Acceleration of Counter Automata in
                 Practice},
  pages = {576-590},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BFL-tacas04.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BFL-tacas04.ps},
  abstract = {We compute reachability sets of 
	counter automata. Even if the reachability set 
	is not necessarily recursive, we use symbolic 
	representation and acceleration to increase 
	convergence. For functions defined by 
	translations over a polyhedral domain, we give 
	a new acceleration algorithm which is 
	polynomial in the size of the function and 
	exponential in its dimension, while the more 
	generic algorithm is exponential in both the 
	size of the function and its dimension. This 
	algorithm has been implemented in the tool 
	FAST. We apply it to a complex industrial 
	protocol, the TTP membership algorithm. This 
	protocol has been widely studied. For the first 
	time, the protocol is automatically proved to 
	be correct for \(1\)~fault and \(N\)~stations, 
	and using abstraction we prove the correctness 
	for \(2\)~faults and \(N\)~stations also.}
}
@inproceedings{BFN-avis2004,
  address = {Barcelona, Spain},
  month = apr,
  year = 2004,
  editor = {Bharadwaj, Ramesh},
  acronym = {{AVIS}'04},
  booktitle = {{P}roceedings of the 3rd {I}nternational
               {W}orkshop on {A}utomated {V}erification
               of {I}nfinite-{S}tate {S}ystems
               ({AVIS}'04)},
  author = {Bardin, S{\'e}bastien and Finkel, Alain and 
                 Nowak, David},
  title = {Toward Symbolic Verification of Programs Handling
                 Pointers},
  nopages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BFN-avis2004.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BFN-avis2004.ps},
  abstract = {We aim at checking safety 
	properties on systems with pointers which are 
	naturally infinite state systems. In this 
	paper, we introduce Symbolic Memory States, a 
	new symbolic representation well suited to the 
	verification of systems with pointers. We show 
	SMS enjoys all the good properties needed to 
	check safety properties, such as closure under 
	union, canonicity of the representation and 
	decidable inclusion. We also introduce pointer 
	automata, a model for programs using dynamic 
	allocation of memory. We define the properties 
	we want to check in this model and we give 
	undecidability results. The verification part 
	is still work in progress.}
}
@inproceedings{BP-coast04,
  address = {Besan{\c{c}}on, France},
  month = jun,
  year = 2004,
  editor = {Julliand, Jacques},
  acronym = {{AFADL}'04},
  booktitle = {{A}ctes du 6{\`e}me {A}telier sur les {A}pproches {F}ormelles
               dans l'{A}ssistance au {D}{\'e}veloppement de {L}ogiciels
               ({AFADL}'04)},
  author = {Bardin, S{\'e}bastien and Petrucci, Laure},
  title = {{COAST}: des r{\'e}seaux de {P}etri {\`a} la
                 planification assist{\'e}e},
  pages = {285-298},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BP-afadl04.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BP-afadl04.ps},
  abstract = {COAST est un outil d'assistance 
	\`a la planification militaire. Son 
	architecture distribu\'ee comprend un serveur 
	constitu\'e d'un moteur d'analyse de r\'eseaux 
	de Petri tandis que l'interface graphique 
	fournie par le client permet de masquer 
	l'utilisation des m\'ethodes formelles. Les 
	synchronisations entre t\^aches \`a planifier 
	sont un aspect essentiel de COAST. Dans cet 
	article, apr\`es une pr\'esentation 
	g\'en\'erale de la probl\'ematique et de 
	l'outil, nous d\'ecrivons les synchronisations, 
	montrons comment elles sont mod\'elis\'ees et 
	implant\'ees.}
}
@inproceedings{BP-pnml2004,
  address = {Bologna, Italy},
  month = jun,
  year = {2004},
  editor = {Kindler, Ekkart},
  booktitle = {{P}roceedings of the {W}orkshop on
           {I}nterchange {F}ormat for {P}etri {N}ets},
  author = {Bardin, S{\'e}bastien and Petrucci, Laure},
  title = {From {PNML} to Counter Systems for Accelerating
                 {P}etri Nets with~{FAST}},
  pages = {26-40},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BP-pnml04.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BP-pnml04.ps},
  abstract = {We use the tool FAST to check 
	parameterized safety properties on Petri nets 
	with a large or infinite state space. Although 
	this tool is not dedicated to Petri nets, it 
	can be used for these as place\slash transition 
	nets (and some of their extensions) are 
	subcases of FAST input model. The originality 
	of the tool lies in the use of acceleration 
	techniques in order to compute the exact 
	reachability set for infinite systems.\par

	In this paper, we present the automatic 
	transformation of Petri nets written in PNML 
	(Petri Net Markup Language) into counter 
	systems. Then, FAST provides a simple but very 
	powerful language to express complex properties 
	and check these.}
}
@inproceedings{BCFL-fsttcs04,
  address = {Chennai, India},
  month = dec,
  year = 2004,
  volume = 3328,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Lodaya, Kamal and Mahajan, Meena},
  acronym = {{FSTTCS}'04},
  booktitle = {{P}roceedings of the 24th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'04)},
  author = {Bouyer, Patricia and Cassez, Franck and 
                 Fleury, Emmanuel and 
                 Larsen, Kim G.},
  title = {Optimal Strategies in Priced Timed Game Automata},
  pages = {148-160},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCFL-fsttcs04.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/
                  BCFL-fsttcs04.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCFL-fsttcs04.pdf},
  abstract = {Priced timed (game) automata extend 
	timed (game) automata with costs on both locations 
	and transitions. In this paper we focus on 
	reachability priced timed game automata and prove 
	that the optimal cost for winning such a game is 
	computable under conditions concerning the 
	non-zenoness of cost. Under stronger conditions 
	(strictness of constraints) we prove that in case an 
	optimal strategy exists, we can compute a 
	state-based winning optimal strategy.}
}
@inproceedings{BerSch-avis2004,
  address = {Barcelona, Spain},
  month = apr,
  year = 2004,
  editor = {Bharadwaj, Ramesh},
  acronym = {{AVIS}'04},
  booktitle = {{P}roceedings of the 3rd {I}nternational
               {W}orkshop on {A}utomated {V}erification
               of {I}nfinite-{S}tate {S}ystems
               ({AVIS}'04)},
  author = {Bertrand, Nathalie and 
                  Schnoebelen, {\relax Ph}ilippe},
  title = {Verifying Nondeterministic Channel Systems With
                 Probabilistic Message Losses},
  nopages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BerSch-avis04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BerSch-avis04.pdf},
  abstract = {Lossy channel systems (LCS's) are 
	systems of finite state automata that communicate 
	via unreliable unbounded fifo channels. In order to 
	circumvent the undecidability of model checking for 
	nondeterministic LCS's, probabilistic models have 
	been introduced, where it can be decided whether a 
	linear-time property holds almost surely. However, 
	such fully probabilistic systems are not a faithful 
	model of nondeterministic protocols.\par
	We study a hybrid model for LCS's where losses of 
	messages are seen as faults occurring with some 
	given probability, and where the internal behavior 
	of the system remains nondeterministic. Thus the 
	semantics is in terms of infinite-state reactive 
	Markov chains (equivalently, Markovian decision 
	processes). A similar model was introduced in the 
	second part of (Bertrand \& Schnoebelen, 
	FOSSACS'2003, LNCS 2620, pp.~120-135): we continue 
	this work and give a complete picture of the 
	decidability of qualitative model checking for 
	MSO-definable properties and some relevant 
	subcases.}
}
@book{CASL-LNCS,
  author = {Bidoit, Michel and Mosses, Peter D.},
  title = {{CASL} User Manual~--- Introduction to Using the 
                 Common
                 Algebraic Specification Language},
  volume = {2900},
  series = {Lecture Notes in Computer Science},
  year = {2004},
  publisher = {Springer},
  isbn10 = {3-540-20766-X},
  isbn = {978-3-540-20766-5},
  doi = {10.1007/b11968},
  url = {http://www.springer.com/978-3-540-20766-X},
  oldurl = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-20766-X}
}
@mastersthesis{Chevalier-dea,
  author = {Chevalier, Fabrice},
  title = {D{\'e}tection d'erreurs dans les syst{\`e}mes
                 temporis{\'e}s},
  year = {2004},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Algorithmique, Paris, France},
  note = {59~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FC-dea2004.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FC-dea2004.ps}
}
@article{ComonCortier-TCS1,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Comon, Hubert and Cortier, V{\'e}ronique},
  title = {Tree Automata with One Memory, Set Constraints and
                 Cryptographic Protocols},
  year = {2005},
  volume = 331,
  number = 1,
  pages = {143-214},
  month = feb,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComonCortierTCS1.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComonCortierTCS1.ps},
  doi = {10.1016/j.tcs.2004.09.036}
}
@article{ComonCortier04scp,
  publisher = {Elsevier Science Publishers},
  journal = {Science of Computer Programming},
  author = {Comon{-}Lundh, Hubert  and Cortier, V{\'e}ronique},
  title = {Security Properties: {T}wo Agents are Sufficient},
  volume = {50},
  number = {1-3},
  pages = {51-71},
  year = {2004},
  month = mar,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComonCortier-step2.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComonCortier-step2.ps}
}
@inproceedings{DCMM-hscc2004,
  address = {Philadelphia, Pennsylvania, USA},
  month = mar,
  year = 2004,
  volume = 2993,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Alur, Rajeev and Pappas, George J.},
  acronym = {{HSCC}'04},
  booktitle = {{P}roceedings of the 7th {I}nternational {C}onference
               on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
               ({HSCC}'04)},
  author = {Davoren, Jennifer M. and Coulthard, Vaughan and 
                 Markey, Nicolas and
                 Moor, {\relax Th}omas},
  title = {Non-deterministic Temporal Logics for General Flow
                 Systems},
  pages = {280-295},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HSCC04-DCMM.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/HSCC04-DCMM.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HSCC04-DCMM.pdf},
  abstract = {In this paper, we use the constructs of branching temporal logic to
	formalize reasoning about a class of general flow systems, including 
	discrete-time transition systems, continuous-time differential
	inclusions, 
	and hybrid-time
	systems such as hybrid automata. We introduce Full General Flow Logic, 
	GFL\(^*\),
	which has essentially the same syntax as the well-known Full Computation Tree
	Logic, CTL\(^*\), 
	but generalizes the semantics to general flow systems over arbitrary
	time-lines. We propose an axiomatic proof system for GFL\(^*\) and establish its
	soundness w.r.t. the general flow semantics.}
}
@inproceedings{DDMR-formats2004,
  address = {Grenoble, France},
  month = sep,
  year = 2004,
  volume = {3253},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Lakhnech, Yassine and Yovine, Sergio},
  acronym = {{FORMATS}'04/{FTRTFT}'04},
  booktitle = {{P}roceedings of the {J}oint {C}onferences
               {F}ormal {M}odelling and {A}nalysis of {T}imed
               {S}ystems ({FORMATS}'04) and
               {F}ormal {T}echniques in {R}eal-{T}ime and
               {F}ault-{T}olerant {S}ystems ({FTRTFT}'04)},
  author = {De{~}Wulf, Martin and Doyen, Laurent and 
                 Markey, Nicolas and 
                 Raskin, Jean-Fran{\c{c}}ois},
  title = {Robustness and Implementability of Timed Automata},
  pages = {118-133},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DDMR-formats2004.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DDMR-formats2004.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DDMR-formats2004.pdf},
  abstract = {In a former paper, we defined a new semantics for timed
	automata, the Almost ASAP semantics, which is parameterized by
	\(\Delta\)
	to cope with the reaction delay of the controller. We showed that this
	semantics is implementable provided there exists a strictly positive value
	for the parameter \(\Delta\) for which the strategy is correct. In this paper, we
	define the implementability problem to be the question of existence of
	such a \(\Delta\). We show that this question is closely related to a notion of
	robustness for timed automata defined in [Pur98] and prove that the
	implementability problem is decidable.}
}
@inproceedings{DFH-avocs2004,
  address = {London, UK},
  month = may,
  year = {2005},
  number = 6,
  volume = {128},
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Huth, Michael R. A.},
  acronym = {{AVoCS}'04},
  booktitle = {{P}roceedings of the 4th {I}nternational
               {W}orkshop on {A}utomated {V}erification
               of {C}ritical {S}ystems
               ({AVoCS}'04)},
  author = {Duflot, Marie and Fribourg, Laurent and 
                 H{\'e}rault, {\relax Th}omas and 
                 Lassaigne, Richard and Magniette, Fr{\'e}d{\'e}ric 
                 and Messika, St{\'e}phane and
                 Peyronnet, Sylvain and Picaronny, Claudine},
  title = {Probabilistic Model Checking of the {CSMA/CD} Protocol
                 Using {PRISM} and {APMC}},
  pages = {195-214},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DFH-avocs2004.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DFH-avocs2004.pdf},
  doi = {10.1016/j.entcs.2005.04.012}
}
@article{DFP-DISTCOMP,
  publisher = {Springer},
  journal = {Distributed Computing},
  author = {Duflot, Marie and Fribourg, Laurent and 
                  Picaronny, Claudine},
  title = {Randomized Dining Philosophers Without Fairness
                 Assumption},
  volume = {17},
  number = {1},
  pages = {65-76},
  year = {2004},
  month = feb,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DFP-DISCOMP.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DFP-DISCOMP.ps},
  doi = {10.1007/s00446-003-0102-z}
}
@inproceedings{DFV-avocs04,
  address = {London, UK},
  month = may,
  year = {2005},
  number = 6,
  volume = {128},
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Huth, Michael R. A.},
  acronym = {{AVoCS}'04},
  booktitle = {{P}roceedings of the 4th {I}nternational
               {W}orkshop on {A}utomated {V}erification
               of {C}ritical {S}ystems
               ({AVoCS}'04)},
  author = {Darlot, {\relax Ch}ristophe and Finkel, Alain and Van{~}Begin, Laurent},
  title = {About {F}ast and {TReX} Accelerations},
  pages = {87-103},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DFV-avocs04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DFV-avocs04.pdf},
  doi = {10.1016/j.entcs.2005.04.006}
}
@article{icomp-DG2004,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Diekert, Volker and Gastin, Paul},
  title = {Local temporal logic is expressively complete for 
		 cograph dependence alphabets},
  volume = {195},
  number = {1-2},
  pages = {30-52},
  year = 2004,
  month = nov,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG04-icomp.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DG04-icomp.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG04-icomp.pdf},
  doi = {10.1016/j.ic.2004.08.001},
  abstract = {Recently, local logics for Mazurkiewicz 
	traces are of increasing interest. This is mainly 
	due to the fact that the satisfiability problem has 
	the same complexity as in the word case. If we focus 
	on a purely local interpretation of formulae at 
	vertices (or events) of a trace, then the 
	satisfiability problem of linear temporal logics 
	over traces turns out to be PSPACE-complete. But 
	now the difficult problem is to obtain expressive 
	completeness results with respect to first order 
	logic. \par

	The main result of the paper shows such an 
	expressive completeness result, if the underlying 
	dependence alphabet is a cograph, \emph{i.e.} 
	if all 
	traces are series parallel posets. Moreover, we show 
	that this is the best we can expect in our setting: 
	If the dependence alphabet is not a cograph, then we 
	cannot express all first order properties.}
}
@inproceedings{Dem-fossacs2004,
  address = {Barcelona, Spain},
  month = mar,
  year = 2004,
  volume = 2987,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Walukiewicz, Igor},
  acronym = {{FoSSaCS}'04},
  booktitle = {{P}roceedings of the 7th {I}nternational 
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'04)},
  author = {Demri, St{\'e}phane},
  title = {{LTL} over Integer Periodicity Constraints},
  pages = {121-135},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Demri-fossacs04.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Demri-fossacs04.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Demri-fossacs04.pdf}
}
@misc{FAST-v1.5,
  author = {Bardin, S{\'e}bastien and Darlot, {\relax Ch}ristophe and
		 Finkel, Alain and Leroux, J{\'e}r{\^o}me and Van{~}Begin, Laurent},
  futureauthor = {Il en manque ? Plus maintenant...},
  title = {{FAST}~v1.5: {F}ast {A}cceleration of {S}ymbolic
                 {T}ransition Systems},
  year = {2004},
  month = jun,
  howpublished = {Available at \url{http://www.lsv.ens-cachan.fr/fast/}},
  url = {http://www.lsv.ens-cachan.fr/fast/}
}
@inproceedings{FGRV-express04,
  address = {London, UK},
  month = apr,
  year = 2005,
  number = 2,
  volume = 128,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Baeten, Jos and Corradini, Flavio},
  acronym = {{EXPRESS}'04},
  booktitle = {{P}roceedings of the 11th {I}nternational
               {W}orkshop on {E}xpressiveness in
               {C}oncurrency
               ({EXPRESS}'04)},
  author = {Finkel, Alain and Geeraerts, Gilles and Raskin, Jean-Fran{\c{c}}ois and
                 Van{~}Begin, Laurent},
  title = {On the Omega-Language Expressive Power of Extended
                 {P}etri Nets},
  pages = {87-101},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FGRV-express04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FGRV-express04.pdf},
  doi = {10.1016/j.entcs.2004.11.030}
}
@article{FL-IPL04,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Finkel, Alain and Leroux, J{\'e}r{\^o}me},
  title = {The Convex Hull of a Regular Set of Integer Vectors is 
		  Polyhedral and Effectively Computable},
  year = {2005},
  month = oct,
  volume = 96,
  number = 1,
  pages = {30-35},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FL-ipl05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FL-ipl05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FL-ipl05.ps},
  doi = {10.1016/j.ipl.2005.04.004},
  abstract = {Number Decision Diagrams (NDD) 
	provide a natural finite symbolic representation 
	for regular set of integer vectors encoded as 
	strings of digit vectors (least or most 
	significant digit first). The convex hull of the 
	set of vectors represented by a~NDD is proved to 
	be an effectively computable convex 
	polyhedron.}
}
@inproceedings{FL-cav04,
  address = {Boston, Massachusetts, USA},
  month = jul,
  year = 2004,
  volume = 3114,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Alur, Rajeev and Peled, Doron A.},
  acronym = {{CAV}'04},
  booktitle = {{P}roceedings of the 16th
               {I}nternational {C}onference on 
               {C}omputer {A}ided {V}erification
               ({CAV}'04)},
  author = {Finkel, Alain and Leroux, J{\'e}r{\^o}me},
  title = {Image Computation in Infinite State Model Checking},
  pages = {361-371},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FL-cav04.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FL-cav04.ps}
}
@inproceedings{FL-spin04,
  address = {Barcelona, Spain},
  month = apr,
  year = 2004,
  volume = 2989,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Graf, Susanne and Mounier, Laurent},
  acronym = {{SPIN}'04},
  booktitle = {{P}roceedings of the 11th {I}nternational
               {SPIN} {W}orkshop on {M}odel {C}hecking {S}oftware
               ({SPIN}'04)},
  author = {Finkel, Alain and Leroux, J{\'e}r{\^o}me},
  title = {Polynomial Time Image Computation With
                 Interval-Definable Counters Systems},
  pages = {182-197},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FL-spin04.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FL-spin04.ps}
}
@inproceedings{FMP-disc04,
  address = {Amsterdam, The Netherlands},
  month = oct,
  year = 2004,
  volume = 3274,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Guerraoui, Rachid},
  acronym = {{DISC}'04},
  booktitle = {{P}roceedings of the 18th {I}nternational
               {S}ymposium on {D}istributed {C}omputing
               ({DISC}'04)},
  author = {Fribourg, Laurent and Messika, St{\'e}phane and 
                  Picaronny, Claudine},
  title = {Coupling and Self-Stabilization},
  pages = {201-215},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FMP-disc04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FMP-disc04.pdf}
}
@article{FMP-wstsPN-icomp,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Finkel, Alain and McKenzie, Pierre and Picaronny, Claudine},
  title = {A Well-Structured Framework for Analysing {P}etri Net
                 Extensions},
  volume = {195},
  number = {1-2},
  pages = {1-29},
  year = {2004},
  month = nov,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FMP-wstsPN-icomp.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FMP-wstsPN-icomp.ps},
  doi = {10.1016/j.ic.2004.01.005}
}
@inproceedings{GLNZ-csl2004,
  address = {Karpacz, Poland},
  month = sep,
  year = 2004,
  volume = {3210},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Marcinkowski, Jerzy and Tarlecki, Andrzej},
  acronym = {{CSL}'04},
  booktitle = {{P}roceedings the 18th {I}nternational
               {W}orkshop on {C}omputer {S}cience {L}ogic
               ({CSL}'04)},
  author = {Goubault{-}Larrecq, Jean and Lasota, S{\l}awomir 
                 and Nowak, David and
                 Zhang, Yu},
  title = {Complete Lax Logical Relations for Cryptographic
                 Lambda-Calculi},
  pages = {400-414},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GLLNZ-csl04.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GLLNZ-csl04.ps}
}
@article{GLRV:acm,
  publisher = {Elsevier Science Publishers},
  journal = {Journal of Logic and Algebraic Programming},
  author = {Goubault{-}Larrecq, Jean and Roger, Muriel and 
                  Verma, Kumar N.},
  title = {Abstraction and Resolution Modulo~{AC}: {H}ow to 
                  Verify
                 {D}iffie-{H}ellman-like Protocols Automatically},
  volume = 64,
  number = 2,
  pages = {219-251},
  year = {2005},
  month = aug,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GLRV-acm.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GLRV-acm.ps},
  doi = {10.1016/j.jlap.2004.09.004}
}
@article{JGL:val:ext,
  publisher = {Cambridge University Press},
  journal = {Mathematical Structures in Computer Science},
  author = {Goubault{-}Larrecq, Jean},
  title = {Extensions of Valuations},
  year = {2005},
  volume = 15,
  number = 2,
  pages = {271-297},
  month = apr,
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2002-17.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2002-17.rr.ps},
  doi = {10.1017/S096012950400461X}
}
@inproceedings{KremerRyan2004,
  address = {London, UK},
  month = may,
  year = 2005,
  number = 5,
  volume = {128},
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Focardi, Riccardo and Zavattaro, Gianluigi},
  acronym = {{SecCo}'04},
  booktitle = {{P}roceedings of the 2nd {I}nternational
               {W}orkshop on {S}ecurity {I}ssues in
               {C}oordination {M}odels, {L}anguages and
               {S}ystems ({SecCo}'04)},
  author = {Kremer, Steve and Ryan, Mark D.},
  title = {Analysing the Vulnerability of Protocols to Produce 
                  Known-pair and Chosen-text Attacks},
  pages = {84-107},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Kremer-secco04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Kremer-secco04.pdf},
  doi = {10.1016/j.entcs.2004.11.043},
  abstract = {In this paper we report on an analysis 
	for finding known-pair and chosen-text attacks in 
	protocols. As these attacks are at the level of 
	blocks, we extend the attacker by special capabilities 
	related to block chaining techniques. The analysis is 
	automated using Blanchet's protocol verifier and 
	illustrated on two well-known protocols, the 
	Needham-Schroeder-Lowe public-key protocol as well as 
	the Needham-Schroeder symmetric-key protocol. On the 
	first protocol, we show how the special intruder 
	capabilities related to chaining may compromise the 
	secrecy of nonces and that chosen-ciphertext attacks 
	are possible. We propose two modified versions of the 
	protocol which strengthen its security. We then 
	illustrate known-pair and chosen-plaintext attacks on 
	the second protocol.}
}
@inproceedings{KucSch2004,
  address = {London, UK},
  month = aug,
  year = 2004,
  volume = 3170,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Gardner, {\relax Ph}ilippa and Yoshida, Nobuko},
  acronym = {{CONCUR}'04},
  booktitle = {{P}roceedings of the 15th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'04)},
  author = {Ku{\v c}era, Anton{\'\i}n and 
                  Schnoebelen, {\relax Ph}ilippe},
  title = {A General Approach to Comparing Infinite-State Systems
                 with Their Finite-State Specifications},
  pages = {372-386},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KS-concur2004.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KS-concur2004.pdf},
  doi = {10.1007/978-3-540-28644-8_24},
  abstract = {We introduce a generic family of behavioral relations for 
which the
problem of comparing an arbitrary transition system to some
finite-state specification can be reduced to a model checking problem
against simple modal formulae. As an application, we derive
decidability of several regular equivalence problems for well-known
families of infinite-state systems.}
}
@inproceedings{LMS-concur2004,
  address = {London, UK},
  month = aug,
  year = 2004,
  volume = 3170,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Gardner, {\relax Ph}ilippa and Yoshida, Nobuko},
  acronym = {{CONCUR}'04},
  booktitle = {{P}roceedings of the 15th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'04)},
  author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas and
                 Schnoebelen, {\relax Ph}ilippe},
  title = {Model Checking Timed Automata with One or Two Clocks},
  pages = {387-401},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMS-concur2004.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LMS-concur2004.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMS-concur2004.pdf},
  doi = {10.1007/978-3-540-28644-8_25},
  abstract = {In this paper, we study model checking of timed automata
	(TAs), and more precisely we aim at finding efficient model checking
	for subclasses of TAs. For this, we consider model checking TCTL and
	TCTL, over TAs with one clock or two clocks.\par
	First we show that the reachability problem is NLOGSPACE-complete
	for one clock TAs (i.e. as complex as reachability in classical graphs)
	and we give a polynomial time algorithm for model checking TCTL,
	over this class of TAs. Secondly we show that model checking becomes
	PSPACE-complete for full TCTL over one clock TAs. We also show that
	model checking CTL (without any timing constraint) over two clock TAs
	is PSPACE-complete and that reachability is NP-hard.}
}
@inproceedings{LS-concur04,
  address = {London, UK},
  month = aug,
  year = 2004,
  volume = 3170,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Gardner, {\relax Ph}ilippa and Yoshida, Nobuko},
  acronym = {{CONCUR}'04},
  booktitle = {{P}roceedings of the 15th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'04)},
  author = {Leroux, J{\'e}r{\^o}me and Sutre, Gr{\'e}goire},
  title = {On Flatness for 2-dimensional Vector Addition Systems
                 with States},
  pages = {402-416},
  nmnote = {Partially while J. Leroux was at LSV},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LS-concur04.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LS-concur04.ps},
  doi = {10.1007/978-3-540-28644-8_26}
}
@techreport{LSV:04:10,
  author = {Baclet, Manuel and Pacalet, Renaud and 
                  Petit, Antoine},
  title = {Register Transfer Level Simulation},
  type = {Research Report},
  number = {LSV-04-10},
  year = {2004},
  month = may,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {15~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2004-10.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2004-10.rr.ps}
}
@techreport{LSV:04:11,
  author = {Baclet, Manuel and Chevallier, R{\'e}my},
  title = {Using {UPPAAL} to Verify an On-Chip Memory},
  type = {Research Report},
  number = {LSV-04-11},
  year = {2004},
  month = may,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {12~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2004-11.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2004-11.rr.ps}
}
@techreport{LSV:04:12,
  author = {Fribourg, Laurent and Messika, St{\'e}phane and 
                  Picaronny, Claudine},
  title = {Mixing Time of the Asymmetric Simple Exclusion Problem
                 on a Ring with Two Particles},
  type = {Research Report},
  number = {LSV-04-12},
  year = {2004},
  month = jun,
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  note = {15~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2004-12.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2004-12.rr.ps}
}
@inproceedings{Ler-atva04,
  address = {Taipei, Taiwan},
  month = oct # {-} # nov,
  year = {2004},
  volume = {3299},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Wang, Farn},
  acronym = {{ATVA}'04},
  booktitle = {{P}roceedings of the 2nd {I}nternational
               {S}ymposium on {A}utomated {T}echnology
               for {V}erification and {A}nalysis
               ({ATVA}'04)},
  author = {Leroux, J{\'e}r{\^o}me},
  title = {Disjunctive Invariants for Numerical Systems},
  pages = {93-107},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Ler-atva04.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Ler-atva04.ps}
}
@inproceedings{Ler-inf03,
  address = {Marseilles, France},
  month = aug,
  year = 2004,
  volume = 98,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Schnoebelen, {\relax Ph}ilippe},
  acronym = {{INFINITY}'03},
  booktitle = {{P}roceedings of the 5th {I}nternational 
               {W}orkshop on {V}erification of {I}nfinite
               {S}tate {S}ystems
               ({INFINITY}'03)},
  author = { Leroux, J{\'e}r{\^o}me},
  title = {The Affine Hull of a Binary Automaton is Computable in
                 Polynomial Time},
  pages = {89-104},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Ler-inf03.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Ler-inf03.ps}
}
@phdthesis{messika-these2004,
  author = {Messika, St{\'e}phane},
  title = {M{\'e}thodes probabilistes pour la v{\'e}rification des 
		  syst{\`e}mes distribu{\'e}s},
  year = 2004,
  month = dec,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/messika-these.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/messika-these.pdf}
}
@inproceedings{MR-concur2004,
  address = {London, UK},
  month = aug,
  year = 2004,
  volume = 3170,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Gardner, {\relax Ph}ilippa and Yoshida, Nobuko},
  acronym = {{CONCUR}'04},
  booktitle = {{P}roceedings of the 15th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'04)},
  author = {Markey, Nicolas and Raskin, Jean-Fran{\c{c}}ois},
  title = {Model Checking Restricted Sets of Timed Paths},
  pages = {432-447},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MR-concur2004.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MR-concur2004.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MR-concur2004.pdf},
  doi = {10.1007/978-3-540-28644-8_28},
  abstract = {In this paper, we study the complexity of model-checking
	formulas of three important real-time logics (MTL, MITL, and TCTL)
	over restricted sets of timed paths. The classes of restricted sets of
	timed 
	paths that we consider are \textit{(i)} a single finite (or ultimately
	periodic) timed 
	path, \textit{(ii)} a infinite set of finite (or infinite) timed paths
	defined by a finite 
	(or ultimately periodic) path in a region graph, \textit{(iii)} a 
	infinite set of finite  
	(or infinite) timed paths defined by a finite (or ultimately periodic) path 
	in a zone graph.}
}
@inproceedings{MS-formats2004,
  address = {Grenoble, France},
  month = sep,
  year = 2004,
  volume = {3253},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Lakhnech, Yassine and Yovine, Sergio},
  acronym = {{FORMATS}'04/{FTRTFT}'04},
  booktitle = {{P}roceedings of the {J}oint {C}onferences
               {F}ormal {M}odelling and {A}nalysis of {T}imed
               {S}ystems ({FORMATS}'04) and
               {F}ormal {T}echniques in {R}eal-{T}ime and
               {F}ault-{T}olerant {S}ystems ({FTRTFT}'04)},
  author = {Markey, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title = {Symbolic Model Checking for Simply-Timed Systems},
  pages = {102-117},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MS-formats2004.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MS-formats2004.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MS-formats2004.pdf},
  abstract = {We describe OBDD-based symbolic model checking algorithms for
	simply-timed systems, i.e. finite state graphs where transitions 
	carry a duration. These durations can be arbitrary natural numbers. A
	simple and natural semantics for these systems opens the way for 
	improved efficiency. Our algorithms have been implemented in NuSMV
	and perform well in practice (on standard case studies).}
}
@inproceedings{MS-qest2004,
  address = {Enschede, The Netherlands},
  month = sep,
  year = 2004,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{QEST}'04},
  booktitle = {{P}roceedings of the 1st {I}nternational
               {C}onference on {Q}uantitative 
               {E}valuation of {S}ystems
               ({QEST}'04)},
  author = {Markey, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title = {{TSMV}: {A} Symbolic Model Checker for Quantitative
                 Analysis of Systems},
  pages = {330-331},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MS-qest2004.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MS-qest2004.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MS-qest2004.pdf},
  doi = {10.1109/QEST.2004.10028},
  abstract = {TSMV is an extension of NuSMV, the open-source
	symbolic model checker, aimed at dealing with timed versions
	of (models of) circuits, PLC controllers, protocols, etc. The
	underlying model is an extension of Kripke structures, where
	every transition carries an integer duration (possibly zero). This
	simple model supports efficient symbolic algorithms for RTCTL
	formulae.}
}
@inproceedings{Mar-afadl2004,
  address = {Besan{\c{c}}on, France},
  month = jun,
  year = 2004,
  editor = {Julliand, Jacques},
  acronym = {{AFADL}'04},
  booktitle = {{A}ctes du 6{\`e}me {A}telier sur les {A}pproches {F}ormelles
               dans l'{A}ssistance au {D}{\'e}veloppement de {L}ogiciels
               ({AFADL}'04)},
  author = {Markey, Nicolas},
  title = {{TSMV}: model-checking symbolique de syst{\`e}mes
                 simplement temporis{\'e}s},
  pages = {349-352},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Mar-afadl04.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Mar-afadl04.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Mar-afadl04.pdf}
}
@proceedings{PHS:INFINITY2003,
  title = {{P}roceedings of the 5th {I}nternational 
           {W}orkshop on {V}erification of {I}nfinite
           {S}tate {S}ystems
           ({INFINITY}'03)},
  booktitle = {{P}roceedings of the 5th {I}nternational 
               {W}orkshop on {V}erification of {I}nfinite
               {S}tate {S}ystems
               ({INFINITY}'03)},
  editor = {Schnoebelen, {\relax Ph}ilippe},
  volume = {98},
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  year = 2004,
  month = aug,
  doi = {10.1016/j.entcs.2003.10.001},
  address = {Marseilles, France},
  oldurl = {http://www.sciencedirect.com/science?_ob=IssueURL&
      _tockey=%23TOC%2313109%232004%23999019999%23512226%23FLP%23
      Volume_98,_(2_August_2004)%2BMProceedings_of_INFINITY_2003,
      _the_5th_International_Workshop_on_Verification_of_Infinite-State
      _Systems,_a_satellite_workshop_of_CONCUR_2003%2BMMarseille,_France,
      _2_September_2003%2BMEdited_by_P._Schnoebelen&_auth=y&view=c&
      _acct=C000051058&_version=1&_urlVersion=0&
      _userid=1052425&md5=c6eb616ae1aec31a577ad19b058bc540}
}
@techreport{Prouve:rap1,
  author = {Bozga, Liana and Delaune, St{\'e}phanie and 
                 Klay, Francis  and
                 Treinen, Ralf},
  title = {Sp{\'e}cification du protocole de porte-monnaie
                 {\'e}lectronique},
  year = {2004},
  month = jun,
  type = {Technical Report},
  number = 1,
  institution = {projet RNTL PROUV{\'E}},
  oldhowpublished = {Rapport Technique 1 du projet RNTL PROUV\'E},
  note = {12~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/prouve-rap1.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/prouve-rap1.ps},
  abstract = {Cette \'etude de cas a pour but de contribuer \`a une 
	premi\`ere \'evaluation des besoins pour l'aspect description formelle 
	des protocoles cryptographiques. Cet aspect est un pr\'ealable oblig\'e 
	avant d'aborder des points tels que la s\'emantique et la 
	v\'erification.  Le r\'esultat de ce travail a guid\'e la d\'efinition de 
	la syntaxe du langage de sp\'ecification d\'evelopp\'e dans la t\^ache~1 du 
	projet~: <<~S\'emantique des protocoles et des propri\'et\'es~>>.\par
	Parmi la multitude de protocoles existants celui qui a \'et\'e \'etudi\'e 
	est un porte-monnaie \'electronique \`a cl\'e publique d\'evelopp\'e
	r\'ecemment par France T\'el\'ecom R\&D car il refl\`ete fid\`element les 
	ambitions du projet.  Ce protocole, sortant sans surprise du 
	spectre de tous les outils d\'evelopp\'es \`a l'heure actuelle, notre 
	travail a consist\'e \`a mod\'eliser au mieux le porte-monnaie 
	\'electronique dans un sous ensemble repr\'esentatif d'outils 
	existants. Cette \'etude met \'evidence, sur un cas r\'eel, les carences 
	et les faiblesses des outils actuels et permet ainsi d'affiner et 
	de valider les objectifs du projet. D'un autre c\^ot\'e, ce travail 
	montre que des lacunes importantes peuvent parfois \^etre 
	raisonnablement contourn\'ees modulo un codage adapt\'e.}
}
@techreport{Prouve:rap2,
  author = {Cortier, V{\'e}ronique and Delaune, St{\'e}phanie 
                 and Lafourcade, Pascal},
  title = {A Survey of Algebraic Properties Used in Cryptographic
                 Protocols},
  year = {2004},
  month = jun,
  type = {Technical Report},
  number = 2,
  institution = {projet RNTL PROUV{\'E}},
  oldhowpublished = {Rapport Technique 2 du projet RNTL PROUV\'E},
  note = {19~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/prouve-rap2.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/prouve-rap2.ps},
  abstract = {Using the \emph{perfect encryption 
	assumption}, cryptographic primitives are often 
	represented by free function symbols. However some attacks 
	and even honest runs may use algebraic properties of the 
	operators like the exclusive or, the modular 
	exponentiation, the addition, etc.\par
	We give here a survey of protocols and attacks using such 
	algebraic properties.}
}
@techreport{Prouve:rap3,
  author = {Treinen, Ralf},
  title = {The {PROUV\'E} Specification Language},
  year = {2004},
  month = aug,
  number = 3,
  type = {Technical Report},
  institution = {Projet RNTL PROUV{\'E}},
  oldhowpublished = {Rapport Technique 3 du projet RNTL PROUV\'E},
  note = {10~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/prouve-rap3.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/prouve-rap3.ps}
}
@techreport{Prouve:rap4,
  author = {Bernat, Vincent and Comon{-}Lundh, Hubert and 
		  Cortier, V{\'e}ronique and Delaune, St{\'e}phanie and 
		  Jacquemard, Florent and Lafourcade, Pascal and 
		  Lakhnech, Yassine and Mazar{\'e}, Laurent},
  title = {Sufficient conditions on properties for an automated 
		  verification: theoretical report on the verification of 
		  protocols for an extended model of the intruder },
  year = {2004},
  month = dec,
  type = {Technical Report},
  number = 4,
  institution = {projet RNTL PROUV{\'E}},
  oldhowpublished = {Rapport Technique 4 du projet RNTL PROUV\'E},
  note = {33~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/prouve-rap4.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/prouve-rap4.ps},
  abstract = {Cryptographic protocols are 
	successfully analyzed using formal methods. 
	However, formal approaches usually consider 
	the encryption schemes as black boxes and 
	assume that an adversary cannot learn 
	anything from an encrypted message except 
	if he has the key. Such an assumption is 
	too strong in general since some attacks 
	exploit in a clever way the interaction 
	between protocol rules and properties of 
	cryptographic operators. Moreover, the 
	executability of some protocols relies 
	explicitly on some algebraic properties of 
	cryptographic primitives such as 
	commutative encryption. We first give an 
	overview of the existing methods in formal 
	approaches for analyzing cryptographic 
	protocols. Then we describe more precisely 
	the results obtained by the partners of the 
	RNTL project PROUV\'E.}
}
@mastersthesis{Ratti-dea,
  author = {Ratti, Benjamin},
  title = {Automates d'arbre d'ordre~deux},
  year = 2004,
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Programmation, Paris, France},
  note = {45~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BRatti-dea2004.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BRatti-dea2004.ps}
}
@mastersthesis{Reynier-dea,
  author = {Reynier, Pierre-Alain},
  title = {Analyse en avant des automates temporis{\'e}s},
  year = {2004},
  month = sep,
  type = {Rapport de {DEA}},
  school = {{DEA} Algorithmique, Paris, France},
  note = {68~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/PAR-dea2004.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/PAR-dea2004.ps}
}
@incollection{Sch-voss,
  year = 2004,
  volume = 2925,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Baier, {\relax Ch}ristel and Haverkort, Boudewijn R.
            and Hermanns, Holger and Katoen, Joost-Pieter and
            Siegle, Markus and Vaandrager, Frits},
  acronym = {{V}alidation of {S}tochastic {S}ystems},
  booktitle = {{V}alidation of {S}tochastic {S}ystems: {A} {G}uide
               to {C}urrent {R}esearch},
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {The Verification of Probabilistic Lossy Channel
                 Systems},
  pages = {445-465},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-voss.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Sch-voss.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-voss.pdf},
  abstract = {Lossy channel systems (LCS's) are 
	systems of finite state automata that 
	communicate via unreliable unbounded fifo 
	channels. Several probabilistic versions of 
	these systems have been proposed in recent 
	years, with the two aims of modeling more 
	faithfully the losses of messages, and 
	circumventing undecidabilities by some kind of 
	randomization. We survey these proposals and 
	the verification techniques they support.}
}
@inproceedings{bh-amast2004,
  address = {Stirling, UK},
  month = jul,
  year = 2004,
  volume = 3116,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Rattray, Charles and Maharaj, Savitri and Shankland, Carron},
  acronym = {{AMAST}'04},
  booktitle = {{P}roceedings of the 10th {I}nternational
               {C}onference on {A}lgebraic {M}ethodology and
               {S}oftware {T}echnology
               ({AMAST}'04)},
  author = {Bidoit, Michel and Hennicker, Rolf},
  title = {Glass Box and Black Box Views of State-Based System
                 Specifications},
  pages = {19},
  note = {Invited talk}
}
@inproceedings{bhkb-sefm2004,
  address = {Beijing, China},
  month = sep,
  year = 2004,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{SEFM}'04},
  booktitle = {{P}roceedings of the 2nd {IEEE} {I}nternational
               {C}onference on {S}oftware {E}ngineering and
               {F}ormal {M}ethods
               ({SEFM}'04)},
  author = {Bidoit, Michel and Hennicker, Rolf and 
                 Knapp, Alexander
                 and Baumeister, Hubert},
  title = {Glass-Box and Black-Box Views on Object-Oriented
                 Specifications},
  pages = {208-217},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bhkb-sefm2004.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bhkb-sefm2004.pdf},
  doi = {10.1109/SEFM.2004.10014}
}
@inproceedings{bj-strategies2004,
  address = {Cork, Ireland},
  month = jul,
  year = 2004,
  editor = {Bonacina, Maria Paola and 
            Boy{ }de{~}la{~}Tour, {\relax Th}ierry},
  acronym = {{STRATEGIES}'04},
  booktitle = {{P}roceedings of the 5th {W}orkshop
               on {S}trategies in {A}utomated {D}eduction
               ({STRATEGIES}'04)},
  author = {Bouhoula, Adel and Jacquemard, Florent},
  title = {Constrained Tree Grammars to Pilot Automated Proof 
                  by
                 Induction},
  pages = {64-78},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BJ-strategies04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BJ-strategies04.pdf}
}
@techreport{blueberries-TR1.3.2,
  author = {Baclet, Manuel and Chevallier, R{\'e}my},
  title = {Using {UPPAAL} to verify an on-chip memory},
  year = {2004},
  month = may,
  type = {Contract Report},
  number = {(Work Package~3.2 Fourniture~1)},
  institution = {projet T126 MEDEA+ Blueberries},
  oldhowpublished = {Fourniture 1 du Work Package 3.2 du projet T126 MEDEA+
                 Blueberries},
  note = {12~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/rr-lsv-2004-11.rr.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2004-11.rr.ps}
}
@article{bouyer-fmsd-2004,
  publisher = {Kluwer Academic Publishers},
  journal = {Formal Methods in System Design},
  author = {Bouyer, Patricia},
  title = {Forward Analysis of Updatable Timed Automata},
  volume = {24},
  number = {3},
  pages = {281-320},
  year = {2004},
  month = may,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bou-FMSD2004.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bou-FMSD2004.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bou-FMSD2004.ps},
  doi = {10.1023/B:FORM.0000026093.21513.31},
  abstract = {Timed automata are a widely studied 
	model. Its decidability has been proved using the 
	so-called region automaton construction. This 
	construction provides a correct abstraction for 
	the behaviours of timed automata, but it suffers 
	from a state explosion and is thus not used in 
	practice. Instead, algorithms based on the notion 
	of zones are implemented using adapted data 
	structures like~DBMs. When we focus on forward 
	analysis algorithms, the exact computation of all 
	the successors of the initial configurations does 
	not always terminate. Thus, some abstractions are 
	often used to ensure termination, among which, a 
	widening operator on zones.\par
	In this paper, we study in detail this widening 
	operator and the corresponding forward analysis 
	algorithm. This algorithm is most used and 
	implemented in tools like KRONOS and UPPAAL. One 
	of our main results is that it is hopeless to 
	find a forward analysis algorithm for general 
	timed automata, that uses such a widening 
	operator, and which is correct. This goes really 
	against what one could think. We then study in 
	detail this algorithm in the more general 
	framework of updatable timed automata, a model 
	which has been introduced as a natural syntactic 
	extension of classical timed automata. We 
	describe subclasses of this model for which a 
	correct widening operator can be found. }
}
@inproceedings{bst-monterey,
  address = {Venice, Italy},
  year = 2004,
  volume = 2941,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Wirsing, Martin and Knapp, Alexander and
            Balsamo, Simonetta},
  acronym = {{RISSEF}'02},
  booktitle = {{R}evised {P}apers of the 9th {I}nternational
               {W}orkshop on {R}adical {I}nnovations of {S}oftware
               and {S}ystems {E}ngineering in the {F}uture
               ({RISSEF}'02)},
  author = {Bidoit, Michel and Sannella, Donald and 
                 Tarlecki, Andrzej},
  title = {Toward Component-Oriented Formal Software 
                 Development:
                 {A}n Algebraic Approach},
  pages = {75-90},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BST-monterey.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BST-monterey.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BST-monterey.pdf}
}
@inproceedings{comon04fossacs,
  address = {Barcelona, Spain},
  month = mar,
  year = 2004,
  volume = 2987,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Walukiewicz, Igor},
  acronym = {{FoSSaCS}'04},
  booktitle = {{P}roceedings of the 7th {I}nternational 
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'04)},
  author = {Comon{-}Lundh, Hubert },
  title = {Intruder Theories (Ongoing Work)},
  pages = {1-4},
  note = {Invited talk}
}
@incollection{couvreur-chap04,
  author = {Br{\'e}ant, F. and Couvreur, Jean-Michel and 
                 Gilliers, Fr{\'e}d{\'e}ric and
                 Kordon, Fabrice and Mounier, Isabelle and 
                 Paviot{-}Adet, Emmanuel and
                 Poitrenaud, Denis and 
                 Regep, Dan M. and Sutre, Gr{\'e}goire},
  title = {Modeling and Verifying Behavioral Aspects},
  chapter = {6},
  editor = {Kordon, Fabrice and Lemoine, Michel},
  booktitle = {Formal Methods for Embedded Distributed Systems: {H}ow
                 to Master the Complexity},
  pages = {171-211},
  year = {2004},
  month = jun,
  publisher = {Kluwer Academic Publishers}
}
@inproceedings{couvreur-ciaa04,
  address = {Kingston, Ontario, Canada},
  month = jan,
  year = 2005,
  volume = 3317,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Domaratzki, Michael and Okhotin, Alexander and 
		  Salomaa, Kai and Yu, Sheng},
  acronym = {{CIAA}'04},
  booktitle = {{R}evised {S}elected {P}apers of the 9th {I}nternational 
               {C}onference on {I}mplementation and
               {A}pplication of {A}utomata
               ({CIAA}'04)},
  author = {Couvreur, Jean-Michel},
  title = {A {BDD}-like Implementation of an Automata Package},
  pages = {310-311},
  doi = {10.1007/b105090}
}
@inproceedings{dj-ccs-2004,
  address = {Washington, D.C., USA},
  month = oct,
  year = 2004,
  publisher = {ACM Press},
  editor = {Atluri, Vijayalakshmi and Pfitzmann, Birgit and 
                  McDaniel, Patrick},
  acronym = {{CCS}'04},
  booktitle = {{P}roceedings of the 11th {ACM} {C}onference
               on {C}omputer and {C}ommunications {S}ecurity
               ({CCS}'04)},
  author = {Delaune, St{\'e}phanie and Jacquemard, Florent},
  title = {A Decision Procedure for the Verification of Security
                 Protocols with Explicit Destructors},
  pages = {278-287},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DJ-ccs-2004.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DJ-ccs-2004.ps},
  abstract = {We present a non-deterministic polynomial 
	time procedure to decide the problem of insecurity, in the 
	presence of a bounded number of sessions, for 
	cryptographic protocols containing explicit destructor 
	symbols, like decryption and projection. These operators 
	are axiomatized by an arbitrary convergent rewrite system 
	satisfying some syntactic restrictions. This approach, 
	with parameterized semantics, allows us to weaken the 
	security hypotheses for verification, \emph{i.e.} to 
	address a larger class of attacks than for models based on 
	free algebra. Our procedure is defined by an inference 
	system based on basic narrowing techniques for deciding 
	satisfiability of combinations of first-order equations 
	and intruder deduction constraints.}
}
@inproceedings{dj-csfw2004,
  address = {Asilomar, Pacific Grove, California, USA},
  month = jun,
  year = 2004,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{CSFW}'04},
  booktitle = {{P}roceedings of the 
               17th {IEEE} {C}omputer {S}ecurity {F}oundations
               {W}orkshop ({CSFW}'04)},
  author = {Delaune, St{\'e}phanie and Jacquemard, Florent},
  title = {A Theory of Dictionary Attacks and its Complexity},
  pages = {2-15},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DJ-csfw2004.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DJ-csfw2004.ps},
  abstract = {We consider the problem of automating 
	proofs of cryptographic protocols when some data, like 
	poorly chosen passwords, can be guessed by dictionary 
	attacks. First, we define a theory of these attacks: we 
	introduce an inference system modeling the guessing 
	capabilities of an intruder. This system extends the 
	classical Dolev-Yao rules. Using proof rewriting 
	techniques, we show a locality lemma for our inference 
	system which yields the PTIME-completeness of the 
	deduction problem.\par
	This result is lifted to the simultaneous solving of 
	intruder deduction constraints with variables. 
	Constraint solving is the basis of a NP algorithm for 
	the protocol insecurity problem in the presence of 
	dictionary attacks, assuming a bounded number of 
	sessions. This extends the classical NP-completeness 
	result for the Dolev-Yao model.\par
	We illustrate the procedure with examples of published 
	protocols. The model and decision algorithm have been 
	validated on some examples in a prototype 
	implementation.}
}
@inproceedings{dk-jdir-2004,
  address = {Lannion, France},
  month = nov,
  year = 2004,
  acronym = {{JDIR}'04},
  booktitle = {{A}ctes des 6{\`e}mes {J}ourn{\'e}es {D}octorales
               {I}nformatique et {R}{\'e}seau
               ({JDIR}'04)},
  author = {Delaune, St{\'e}phanie and Klay, Francis},
  title = {V{\'e}rification automatique appliqu{\'e}e {\`a} un 
		 protocole de commerce {\'e}lectronique},
  pages = {260-269},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DK-jdir-2004.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DK-jdir-2004.pdf},
  abstract = {Le domaine de la mod{\'e}lisation et de la 
	v{\'e}rification est une activit{\'e} d{\'e}licate et importante qui a 
	connu une v{\'e}ritable explosion dans les ann{\'e}es 1990. On 
	dispose {\`a} l'entr{\'e}e des ann{\'e}es 2000 de toute une gamme de 
	mod{\`e}les et de m{\'e}thodes plus ou moins avanc{\'e}s en ce qui 
	concerne l'expressivit{\'e} et l'automatisation.\par	
	Afin de d{\'e}finir les besoins et les priorit{\'e}s {\`a} mettre sur 
	les outils consacr{\'e}s {\`a} la v{\'e}rification de protocoles 
	cryptographiques qui seront d{\'e}velopp{\'e}s au sein du projet 
	RNTL PROUV{\'E}, nous proposons de travailler en situation 
	r{\'e}elle, sur des protocoles plut{\^o}t <<~durs~>>, en effectuant le 
	cycle suivant~: mod{\'e}lisation, formalisation puis validation 
	dans des outils existants. Ce travail est effectu{\'e} ici pour 
	un protocole de porte-monnaie {\'e}lectronique, d{\'e}velopp{\'e} 
	r{\'e}cemment par une {\'e}quipe de France T{\'e}l{\'e}com. }
}
@misc{dn-fms04,
  author = {Nowak, David},
  title = {Logical Relations for Monadic Types},
  year = 2004,
  month = may,
  howpublished = {Invited talk, {I}nternational
           {W}orkshop on {F}ormal {M}ethods
           and {S}ecurity ({IWFMS}'04), Nanjing, China}
}
@misc{evtgen-v1.0,
  author = {Olivain, Julien},
  title = {{EVTGEN} v1.0: {A} Programmable Generic Generator of
                 Event Sequences},
  year = {2004},
  month = jul,
  note = {Written in C (about 5000 lines)},
  note-fr = {{\'E}crit en~C (environ 5000 lignes)},
  url = {http://www.lsv.ens-cachan.fr/~olivain/evtgen/}
}
@misc{netentropy-v1.0,
  author = {Olivain, Julien},
  title = {Net-entropy v1.0: {A}n entropy checker for
	  	 ciphered network connections},
  year = {2004},
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/~olivain/net-entropy/}
}
@inproceedings{GaLeZe04fsttcs,
  address = {Chennai, India},
  month = dec,
  year = 2004,
  volume = 3328,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Lodaya, Kamal and Mahajan, Meena},
  acronym = {{FSTTCS}'04},
  booktitle = {{P}roceedings of the 24th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'04)},
  author = {Gastin, Paul and Lerman, Benjamin and Zeitoun, Marc},
  title = {Distributed games with causal memory are decidable for
            series-parallel systems},
  pages = {275-286},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GLZ-fsttcs04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GLZ-fsttcs04.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GLZ-fsttcs04.ps},
  abstract = {This paper deals with distributed 
	control problems by means of distributed games 
	played on Mazurkiewicz traces. The main difference 
	with other notions of distributed games recently 
	introduced is that, instead of having a \emph{local} view, 
	strategies and controllers are able to use a more 
	accurate memory, based on their \emph{causal} view. Our 
	main result states that using the causal view makes 
	the control synthesis problem decidable for 
	series-parallel systems for \emph{all} recognizable winning 
	conditions on finite behaviors, while this problem 
	with local view was proved undecidable even for 
	reachability conditions.}
}
@phdthesis{jmc-hab-04,
  author = {Couvreur, Jean-Michel},
  title = {Contribution {\`a} l'algorithmique de la v{\'e}rification},
  year = {2004},
  month = jul,
  type = {M{\'e}moire d'habilitation},
  school = {Universit{\'e} de Bordeaux~I, Bordeaux, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/jmc-habile.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/jmc-habile.pdf}
}
@article{mar-ACTA2004,
  publisher = {Springer},
  journal = {Acta Informatica},
  author = {Markey, Nicolas},
  title = {Past is for Free: {O}n the Complexity of Verifying
                 Linear Temporal Properties with Past},
  volume = {40},
  number = {6-7},
  pages = {431-458},
  year = {2004},
  month = may,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Mar-ACTA2004.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Mar-ACTA2004.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Mar-ACTA2004.pdf},
  doi = {10.1007/s00236-003-0136-5},
  abstract = {We study the complexity of satisfiability 
	and model checking problems for fragments of 
	linear-time temporal logic with past (PLTL). 
	We consider many fragments of PLTL, obtained by restricting 
	the set of allowed temporal modalities, the use of negations or the
	nesting of future formulas into past formulas. Our results strengthen
	the widely accepted fact that {"}past is for free{"}, in the sense that 
	allowing symmetric past-time modalities does not bring additional 
	theoretical complexity. This result holds even for small fragments and
	even when nesting future formulas into past formulas.}
}
@inproceedings{mj-wmc2004,
  address = {Milano, Italy},
  month = jun,
  year = 2004,
  editor = {Paun, {\relax Gh}eorghe},
  acronym = {{WMC}'04},
  booktitle = {{P}roceedings of the 5th {W}orkshop
               on {M}embrane {C}omputing
               ({WMC}'04)},
  author = {Michel, Olivier and Jacquemard, Florent},
  title = {An Analysis of the {N}eedham-{S}chroeder Public-Key
                 Protocol with~{MGS}},
  pages = {295-315},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/mj-wmc05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/mj-wmc05.pdf},
  phsnote = {est prevu un lncs avec certains papiers revises},
  nmnote = {C'est LNCS3365, mais le papier n'est pas selectionne}
}
@article{ms-IPL2004,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Markey, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title = {A {PTIME}-Complete Matching Problem for
                 {SLP}-Compressed Words},
  volume = {90},
  number = {1},
  pages = {3-6},
  year = {2004},
  month = jan,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MarSch-IPL2004.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MarSch-IPL2004.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MarSch-IPL2004.pdf},
  doi = {10.1016/j.ipl.2004.01.002},
  abstract = {SLP-compressed words are words 
	given by simple deterministic grammars called 
	{"}straight-line programs{"}. We prove that the 
	problem of deciding whether an SLP-compressed 
	word is recognized by a FSA is complete for 
	polynomial-time.}
}
@mastersthesis{robin-dea,
  author = {Robin, Agn{\`e}s},
  title = {Aux fronti{\`e}res de la d{\'e}cidabilit{\'e}...},
  year = {2004},
  month = jul,
  type = {Rapport de {DEA}},
  school = {{DEA} Algorithmique, Paris, France},
  note = {33~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Robin-dea2004.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Robin-dea2004.ps}
}
@misc{rtaloop,
  author = {Treinen, Ralf},
  title = {{RTALOOP}: {T}he {RTA} List of Open Problems},
  year = {2004},
  howpublished = {Web site at \url{http://www.lsv.ens-cachan.fr/rtaloop/},
                 started 1997},
  note = {Size as of July 2004: 100 problems, 90 pages, 432
                 references},
  note-fr = {En juillet~2004: 100 probl{\`e}mes, 90~pages, 432
                 r{\'e}f{\'e}rences},
  url = {http://www.lsv.ens-cachan.fr/rtaloop/}
}
@misc{ssp,
  author = {Hugel, {\relax Th}omas},
  title = {{SSP}: {S}tochastic Shortest Paths},
  year = {2004},
  month = jul,
  note = {Written in Caml (about 500 lines)},
  note-fr = {{\'E}crit en Caml (environ 500 lignes)}
}
@article{ABRS-lossy,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Abdulla, Parosh Aziz and Bertrand, Nathalie and 
	    Rabinovich, Alexander and Schnoebelen, {\relax Ph}ilippe},
  title = {Verification of Probabilistic Systems with Faulty
	   Communication},
  year = 2005,
  month = nov,
  volume = 202,
  number = 2,
  pages = {141-165},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/InfComp-ABRS.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/InfComp-ABRS.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/InfComp-ABRS.ps},
  doi = {10.1016/j.ic.2005.05.008},
  abstract = {Many protocols are designed to 
	operate correctly even in the case where the 
	underlying communication medium is faulty. To 
	capture the behavior of such protocols, 
	\emph{Lossy Channel Systems}~(LCS's) have been 
	proposed. In an LCS the communication channels 
	are modeled as unbounded FIFO buffers which are 
	unreliable in the sense that they can 
	nondeterministically lose messages. \par
	Recently, several attempts have been made to 
	study \emph{Probabilistic Lossy Channel 
	Systems}~(PLCS's) in which the probability of 
	losing messages is taken into account. In this 
	article, we consider a variant of PLCS's which 
	is more realistic than those studied 
	previously. More precisely, we assume that 
	during each step in the execution of the 
	system, each message may be lost with a certain 
	predefined probability. We show that for such 
	systems the following model-checking problem is 
	decidable: to verify whether a linear-time 
	property definable by a finite-state 
	\(\omega\)-automaton holds with probability one. 
	We also consider other types of faulty 
	behavior, such as corruption and duplication of 
	messages, and insertion of new messages, and 
	show that the decidability results extend to 
	these models.}
}
@inproceedings{baudet-ccs2005,
  address = {Alexandria, Virginia, USA},
  month = nov,
  year = 2005,
  publisher = {ACM Press},
  acronym = {{CCS}'05},
  booktitle = {{P}roceedings of the 12th {ACM} {C}onference
               on {C}omputer and {C}ommunications {S}ecurity
               ({CCS}'05)},
  author = {Baudet, Mathieu},
  title = {Deciding Security of Protocols against Off-line Guessing 
		Attacks},
  pages = {16-25},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Baudet_CCS05revised.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Baudet_CCS05revised.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Baudet_CCS05revised.ps},
  doi = {10.1145/1102120.1102125},
  abstract = {We provide an effective procedure for 
	deciding the existence of off-line guessing attacks 
	on security protocols, for a bounded number of 
	sessions.\par
	The procedure consists of a constraint solving 
	algorithm for determining satisfiability and 
	equivalence of a class of second-order E-unification 
	problems, where the equational theory~E is presented 
	by a convergent subterm rewriting system.\par
	To the best of our knowledge, this is the first 
	decidability result to use the generic definition of 
	off-line guessing attacks due to Corin~\emph{et al.} 
	based on static equivalence in the applied 
	pi-calculus.}
}
@inproceedings{BCM05-fsttcs,
  address = {Hyderabad, India},
  month = dec,
  year = 2005,
  volume = 3821,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Ramanujam, R. and Sen, Sandeep},
  acronym = {{FSTTCS}'05},
  booktitle = {{P}roceedings of the 25th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'05)},
  author = {Bouyer, Patricia and Chevalier, Fabrice and
                 Markey, Nicolas},
  title = {On the Expressiveness of {TPTL} and~{MTL}},
  pages = {432-443},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCM-fsttcs05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCM-fsttcs05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BCM-fsttcs05.ps},
  doi = {10.1007/11590156_35},
  abstract = {TPTL and MTL are two classical timed extensions of LTL.
    In this paper, we positively answer a 15-year-old conjecture that TPTL
    is strictly more expressive than MTL. But we show that, surprisingly,
    the TPTL formula proposed by Alur and Henzinger for witnessing 
    this conjecture can be expressed in MTL. More generally, we show that 
    TPTL formulae using only the F modality can be translated into MTL.}
}
@inproceedings{BFLS05-atva,
  address = {Taipei, Taiwan},
  month = oct,
  year = {2005},
  volume = 3707,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Peled, Doron A. and Tsay, Yih-Kuen},
  acronym = {{ATVA}'05},
  booktitle = {{P}roceedings of the 3rd {I}nternational
               {S}ymposium on {A}utomated {T}echnology
               for {V}erification and {A}nalysis
               ({ATVA}'05)},
  author = {Bardin, S{\'e}bastien and Finkel, Alain and
		Leroux, J{\'e}r{\^o}me and Schnoebelen, {\relax Ph}ilippe},
  title = {Flat acceleration in symbolic model checking},
  pages = {474-488},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFLS05-atva.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFLS05-atva.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BFLS05-atva.ps},
  doi = {10.1007/11562948_35},
  abstract = {Symbolic model checking provides partially 
	effective verification procedures that can handle systems 
	with an infinite state space. So-called {"}acceleration 
	techniques{"} enhance the convergence of fixpoint 
	computations by computing the transitive closure of some 
	transitions. In this paper we develop a new framework for 
	symbolic model checking with accelerations. We also propose 
	and analyze new symbolic algorithms using accelerations to 
	compute reachability sets.}
}
@inproceedings{BBGRS-ETFA05,
  address = {Catania, Italy},
  month = sep,
  year = 2005,
  publisher = {{IEEE} Industrial Electronics Society},
  editor = {Lo Bello, Lucia and Sauter, Thilo},
  acronym = {{ETFA}'05},
  booktitle = {{P}roceedings of the 10th {IEEE} {I}nternational 
	{C}onference on {E}merging {T}echnologies and {F}actory 
	{A}utomation ({ETFA}'05)},
  author = {Bel{ }mokadem, Houda and B{\'e}rard, B{\'e}atrice and
		 Gourcuff, Vincent and Roussel, Jean-Marc and
		 De{~}Smet, Olivier},
  title = {Verification of a timed multitask system with {U}ppaal},
  pages = {347-354},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ETFA05-FV.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ETFA05-FV.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ETFA05-FV.ps},
  abstract = {Since it is an important issue for users and system designers,
  verification of PLC programs has already been studied in various
  contexts, mostly for untimed programs. More recently, timed features
  were introduced and modeled with timed automata. In this case study,
  we consider a part of the so-called MSS (Mecatronic Standard System)
  platform from Bosh Group, a framework where time aspects are
  combined with multitask programming.  Our model for station~2 of the
  MSS platform is a network of timed automata, including automata for
  the operative part and for the control program, written in
  \emph{Ladder Diagram}. This model is constrained with atomicity
  hypotheses concerning program execution and model
  checking of a reaction time property is performed with the 
  tool~{\scshape Uppaal}.}
}
@inproceedings{BC-icmtd05,
  address = {Giens, France},
  nmnote = {Informal proceedings. Selected papers to appear in a journal},
  month = may,
  year = 2005,
  acronym = {{ICMTD}'05},
  booktitle = {Proceedings of the 1st {I}nternational {C}onference on
   	      {M}emory {T}echnology and {D}esign
	      ({ICMTD}'05)},
  author = {Baclet, Manuel and Chevallier, R{\'e}my},
  title = {Timed Verification of the {SPSMALL} Memory},
  pages = {89-92},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BC05-spsmall.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BC05-spsmall.pdf},
  abstract = {The aim of the paper is to verify a small 
	synchronous memory component with the real-time
	model checker Uppaal, taking into account the 
	electrical propagation delays through gates and 
	along wires.},
  missingdoi = {}
}
@inproceedings{BH-ICTAC05,
  address = {Hanoi, Vietnam},
  month = oct,
  year = 2005,
  volume = 3722,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Hung, Dang Van and Wirsing, Martin},
  acronym = {{ICTAC}'05},
  booktitle = {{P}roceedings of the 2nd {I}nternational {C}olloquium on
	{T}heoretical {A}spects of {C}omputing ({ICTAC}'05)},
  author = {Bidoit, Michel and Hennicker, Rolf},
  title = {Externalized and Internalized Notions of Behavioral 
		Refinement},
  pages = {334-350},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ictac05-ID128.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ictac05-ID128.pdf},
  doi = {10.1007/11560647_22},
  abstract = {Many different behavioral refinement notions for algebraic
specifications have been proposed in the literature but the relationship
between the various concepts is still unclear. In this paper we provide a
classification and a comparative study of behavioral refinements according
to two directions, the externalized approach which uses an explicit
behavioral abstraction operator that is applied to the specification to
be implemented, and the internalized approach which uses a built-in
behavioral semantics of specifications. We show that both concepts are
equivalent under suitable conditions. The formal basis of our study is
provided by the COL institution (constructor-based observational logic).
Hence, as a side-effect of our study on internalized behavioral refinements,
we introduce also a novel concept of behavioral refinement for
COL-specifications.}
}
@misc{bouyer-jsi05,
  author = {Bouyer, Patricia},
  title = {Timed Automata and Extensions: Decidability Limits},
  year = 2005,
  month = mar,
  howpublished = {Invited talk, 5{\`e}mes Journ{\'e}es Syst{\`e}mes Infinis ({JSI}'05), 
		Cachan, France}
}
@misc{bouyer-games05,
  author = {Bouyer, Patricia},
  title = {Synthesis of Timed Systems},
  year = 2005,
  month = mar,
  howpublished = {Invited lecture, Spring School on Infinite Games and 
		Their Applications, Bonn, Germany}
}
@misc{bouyer-gdv05,
  author = {Bouyer, Patricia},
  title = {Partial Observation of Timed Systems},
  year = 2005,
  month = jul,
  howpublished = {Invited talk, 2nd Workshop on Games in Design and 
		Verification, Edinburgh, Scotland}
}
@misc{gastin-wpv05,
  author = {Gastin, Paul},
  title = {On the synthesis of distributed controllers},
  year = 2005,
  month = nov,
  howpublished = {Invited talk, Workshop Perspectives in  
		Verification, in honor of Wolfgang Thomas on the occasion of his
                Doctorate Honoris Causa, Cachan, France}
}
@inproceedings{BCD-fossacs05,
  address = {Edinburgh, Scotland, UK},
  month = apr,
  year = 2005,
  volume = 3441,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Sassone, Vladimiro},
  acronym = {{FoSSaCS}'05},
  booktitle = {{P}roceedings of the 8th {I}nternational 
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'05)},
  author = {Bouyer, Patricia and Chevalier, Fabrice and D'Souza, Deepak},
  title = {Fault Diagnosis Using Timed Automata},
  pages = {219-233},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/fossacs05-BCD.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/fossacs05-BCD.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/fossacs05-BCD.pdf},
  doi = {10.1007/b106850},
  abstract = {Fault diagnosis consists in 
	observing behaviours of systems, and in detecting 
	online whether an error has occurred or not. In the 
	context of discrete event systems this problem has 
	been well-studied, but much less work has been done 
	in the timed framework. In this paper, we consider 
	the problem of diagnosing faults in behaviours of 
	timed plants. We focus on the problem of 
	synthesizing fault diagnosers which are realizable 
	as deterministic timed automata, with the 
	motivation that such diagnosers would function as 
	efficient online fault detectors. We study two 
	classes of such mechanisms, the class of 
	deterministic timed automata~(DTA) and the class of 
	event-recording timed automata~(ERA). We show that 
	the problem of synthesizing diagnosers in each of 
	these classes is decidable, provided we are given a 
	bound on the resources available to the diagnoser. 
	We prove that under this assumption diagnosability 
	is 2EXPTIME-complete in the case of DTA's whereas 
	it becomes PSPACE-complete for ERA's.}
}
@inproceedings{BBBL-concur2005,
  address = {San Francisco, California, USA},
  month = aug,
  year = 2005,
  volume = 3653,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Abadi, Mart{\'\i}n and de Alfaro, Luca},
  acronym = {{CONCUR}'05},
  booktitle = {{P}roceedings of the 16th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'05)},
  author = {Bel{ }mokadem, Houda and B{\'e}rard, B{\'e}atrice and 
		 Bouyer, Patricia and Laroussinie, Fran{\c{c}}ois},
  title = {A New Modality for Almost Everywhere Properties in 
	 	 Timed Automata},
  pages = {110-124},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBL05-concur.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBL05-concur.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBBL05-concur.ps},
  doi = {10.1007/11539452_12},
  abstract = {The context of this study is timed temporal logics 
	for timed automata. In this paper, we propose an extension of the 
	classical logic TCTL with a new Until modality, called {"}Until 
	almost everywhere{"}. In the extended logic, it is possible, for 
	instance, to express that a property is true at all positions of 
	all runs, except on a negligible set of positions. Such 
	properties are very convenient, for example in the framework of 
	boolean program verification, where transitions result from 
	changing variable values. We investigate the expressive power of 
	this modality and in particular, we prove that it cannot be 
	expressed with classical TCTL modalities. However, we show that 
	model-checking the extended logic remains PSPACE-complete as 
	for~TCTL.}
}
@inproceedings{BCL-concur2005,
  address = {San Francisco, California, USA},
  month = aug,
  year = 2005,
  volume = 3653,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Abadi, Mart{\'\i}n and de Alfaro, Luca},
  acronym = {{CONCUR}'05},
  booktitle = {{P}roceedings of the 16th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'05)},
  author = {Bouyer, Patricia and Cassez, Franck and Laroussinie, 
		  Fran{\c{c}}ois},
  title = {Modal Logics for Timed Control},
  pages = {81-94},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCL05-concur.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCL05-concur.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BCL05-concur.ps},
  doi = {10.1007/11539452_10},
  abstract = {In this paper we use the timed 
	modal logic \(L_{\nu}\) to specify control 
	objectives for timed plants. We show that the 
	control problem for a large class of objectives 
	can be reduced to a model-checking problem for 
	an extension (\(L_{\nu}^{\mathrm{\small cont}}\)) 
	of the logic \(L_{\nu}\) with a new modality.
	\par
	More precisely we define a fragment of~\(L_{\nu}\),
	namely \(L_{\nu}^{\mathrm{\small det}}\), 
	such that any control objective 
	of~\(L_{\nu}^{\mathrm{\small det}}\)
	can be translated into an \(L_{\nu}^{\mathrm{\small cont}}\) 
	formula that holds for the plant if and only if 
	there is a controller that can enforce the 
	control objective.
	\par
	We also show that the new modality
	of~\(L_{\nu}^{\mathrm{\small cont}}\)
	strictly increases the expressive power 
	of~\(L_{\nu}\), while model-checking 
	of~\(L_{\nu}^{\mathrm{\small cont}}\) remains 
	EXPTIME-complete. }
}
@inproceedings{BLR-formats2005,
  address = {Uppsala, Sweden},
  month = nov,
  year = 2005,
  volume = 3829,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Pettersson, Paul and Yi, Wang},
  acronym = {{FORMATS}'05},
  booktitle = {{P}roceedings of the 3rd {I}nternational {C}onference
           on {F}ormal {M}odelling and {A}nalysis of {T}imed
           {S}ystems ({FORMATS}'05)},
  author = {Bouyer, Patricia and Laroussinie, Fran{\c{c}}ois and 
		Reynier, Pierre-Alain},
  title = {Diagonal Constraints in Timed Automata: Forward 
		Analysis of Timed Systems},
  pages = {112-126},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLR05-DBM.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLR05-DBM.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BLR05-DBM.ps},
  doi = {10.1007/11603009_10},
  abstract = {Timed automata (TA) are a 
	widely used model for real-time systems. Several 
	tools are dedicated to this model, and they mostly 
	implement a forward analysis for checking 
	reachability properties. Though diagonal 
	constraints do not add expressive power to 
	classical~TA, the standard forward analysis 
	algorithm is not correct for this model. In this 
	paper we survey several approaches to handle 
	diagonal constraints and propose a 
	refinement-based method for patching the usual 
	algorithm: erroneous traces found by the classical 
	algorithm are analyzed, and used for refining the 
	model.}
}
@inproceedings{BCK-ICALP2005,
  address = {Lisboa, Portugal},
  month = jul,
  year = 2005,
  volume = {3580},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Caires, Lu{\'\i}s and Italiano, Giuseppe F. and
	    Monteiro, Lu{\'\i}s and Palamidessi, Catuscia and Yung, Moti},
  acronym = {{ICALP}'05},
  booktitle = {{P}roceedings of the 32nd {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming
               ({ICALP}'05)},
  author = {Baudet, Mathieu and Cortier, V{\'e}ronique and Kremer,Steve},
  title = {Computationally Sound Implementations of Equational 
		 Theories against Passive Adversaries},
  pages = {652-663},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCK-icalp05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCK-icalp05.pdf},
  doi = {10.1007/11523468_53},
  abstract = {In this paper we study the link between formal and
    cryptographic models for security protocols in the presence of a passive
    adversary. In contrast to other works, we do not consider a fixed set of
    primitives but aim at results for an arbitrary equational theory. We
    define a framework for comparing a cryptographic implementation and its
    idealization w.r.t.\ various security notions. In particular, we
    concentrate on the computationnal soundness of static equivalence, a
    standard tool in cryptographic \(\pi\)-calculi. We present a soundness
    criterion, which for many theories is not only sufficient but also
    necessary. Finally, we establish new soundness results for the Exclusive
    Or, as well as a theory of ciphers and lists.}
}
@book{lncs3426,
  editor = {Bouyssonouse, Bruno and Sifakis, Joseph},
  title = {Embedded Systems Design: The {ARTIST} Roadmap for Research and 
		Development},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  volume = 3436,
  year = 2005,
  url = {http://www.springer.com/978-3-540-25107-3},
  olderurl = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-25107-3},
  isbn = {3-540-25107-3},
  doi = {10.1007/b106761}
}
@inproceedings{ComDel-rta2005,
  address = {Nara, Japan},
  month = apr,
  year = 2005,
  volume = 3467,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Giesl, J{\"u}rgen},
  acronym = {{RTA}'05},
  booktitle = {{P}roceedings of the 16th {I}nternational
               {C}onference on {R}ewriting {T}echniques
               and {A}pplications
               ({RTA}'05)},
  author = {Comon{-}Lundh, Hubert and Delaune, St{\'e}phanie},
  title = {The finite variant property: {H}ow to get rid of some 
	 	 algebraic properties},
  pages = {294-307},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/rta05-CD.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/rta05-CD.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/rta05-CD.pdf},
  doi = {10.1007/b135673},
  abstract = {We consider the following problem: Given a term
             \(t\), a rewrite system \(\mathcal{R}\), a finite set
             of equations \(E'\) such that \(\mathcal{R}\) is
             convergent modulo~\(E'\), compute finitely many
             instances of~\(t\): \(t_1,\ldots,t_n\) such that, for
             every substitution~\(\sigma\), there is an index
             \(i\) and a substitution~\(\theta\) such that \(
             t\sigma\mathord{\downarrow}=_{E'} t_i\theta\) (where
             \(t\sigma\mathord{\downarrow}\) is the normal form of
             \(t\sigma\) w.r.t.~\(\mathcal{R}/E'\)). \par 

             The goal of this paper is to give equivalent (resp.
             sufficient) conditions for the finite variant
             property and to systematically investigate this
             property for equational theories, which are relevant
             to security protocols verification. For instance, we
             prove that the finite variant property holds for
             Abelian Groups, and a theory of modular
             exponentiation and does not hold for the
             theory~\textit{ACUNh} (Associativity, Commutativity,
             Unit, Nilpotence, homomorphism).}
}
@article{CF-icomp05,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {C{\'e}c{\'e}, G{\'e}rard and Finkel, Alain},
  title = {Verification of Programs with Half-Duplex Communication},
  year = 2005,
  month = nov,
  volume = 202,
  number = 2,
  pages = {166-190},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CF-icomp05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CF-icomp05.pdf},
  doi = {10.1016/j.ic.2005.05.006},
  abstract = {We consider the analysis of infinite 
	\emph{half-duplex systems} made of finite state machines 
	that communicate over unbounded channels. The 
	half-duplex property for two machines and two 
	channels (one in each direction) says that each 
	reachable configuration has at most one channel 
	non-empty. We prove in this paper that such 
	half-duplex systems have a recognizable 
	reachability set. We show how to compute, in 
	polynomial time, a symbolic representation of this 
	reachability set and how to use that description to 
	solve several verification problems. Furthermore, 
	though the model of communicating finite state 
	machines is Turing-powerful, we prove that 
	membership of the class of half-duplex systems is 
	decidable. Unfortunately, the natural 
	generalization to systems with more than two 
	machines is Turing-powerful. We also prove that the 
	model-checking of those systems against PLTL 
	(Propositional Linear Temporal Logic) or CTL 
	(Computational Tree Logic) is undecidable. Finally, 
	we show how to apply the previous decidability 
	results to the Regular Model Checking. We propose a 
	new symbolic reachability semi-algorithm with 
	accelerations which successfully terminates on 
	half-duplex systems of two machines and some 
	interesting non-half-duplex systems.}
}
@misc{cortos05,
  author = {Bouyer, Patricia and others},
  title = {{ACI} {S}{\'e}curit{\'e} {I}nformatique {CORTOS} 
	  <<~{C}ontrol and {O}bservation of {R}eal-{T}ime {O}pen 
	  {S}ystems~>>~--- Rapport {\`a} mi-parcours},
  year = 2005,
  month = apr,
  type = {Contract Report},
  note = {6~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/cortos-MP.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/cortos-MP.pdf},
  missingdoi = {}
}
@inproceedings{Cortos-MSR05-impl,
  address = {Autrans, France},
  month = oct,
  year = 2005,
  publisher = {Herm{\`e}s},
  editor = {Alla, Hassane and Rutten, {\'E}ric},
  acronym = {{MSR}'05},
  booktitle = {{A}ctes du 5{\`e}me {C}olloque sur la 
               {M}od{\'e}lisation des {S}yst{\`e}mes
               {R}{\'e}actifs
               ({MSR}'05)},
  author = {Altisen, Karine and Markey, Nicolas and Reynier, Pierre-Alain and
            Tripakis, Stavros},
  title = {Impl{\'e}mentabilit{\'e} des automates temporis{\'e}s},
  pages = {395-406},
  nonote = {Invited paper},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MSR05-impl.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MSR05-impl.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MSR05-impl.ps},
  abstract = {In this paper, we present the problem 
	of the implementability of timed automata. The 
	theoretical semantics of timed automata can not be 
	exactly implemented in practice, because computers 
	are digital and more or less precise; the properties 
	verified on a timed automaton are not necessarily 
	preserved when implementing it. We deal with two 
	approaches: the first one is based on the modeling of 
	the execution platform and the second studies an 
	enlarged semantics for timed automata that takes the 
	imprecision into account.}
}
@inproceedings{Cortos-MSR05-obs,
  address = {Autrans, France},
  month = oct,
  year = 2005,
  publisher = {Herm{\`e}s},
  editor = {Alla, Hassane and Rutten, {\'E}ric},
  acronym = {{MSR}'05},
  booktitle = {{A}ctes du 5{\`e}me {C}olloque sur la 
               {M}od{\'e}lisation des {S}yst{\`e}mes
               {R}{\'e}actifs
               ({MSR}'05)},
  author = {Bouyer, Patricia and Chevalier, Fabrice and Krichen, Moez and
            Tripakis, Stavros},
  title = {Observation partielle des syst{\`e}mes temporis{\'e}s},
  pages = {381-393},
  nonote = {Invited paper},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MSR05-obs.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MSR05-obs.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MSR05-obs.ps},
  abstract = {In this paper, we present the partial 
	observability constraint, which naturally appears when 
	modeling real-time systems. We have selected three 
	problems in which this hypothesis is fundamental but 
	leads to more difficult problems: control of timed 
	systems, fault diagnosis, and conformance testing. We 
	describe methods which can be used for solving such 
	problems. }
}
@inproceedings{Cortos-MSR05-control,
  address = {Autrans, France},
  month = oct,
  year = 2005,
  publisher = {Herm{\`e}s},
  editor = {Alla, Hassane and Rutten, {\'E}ric},
  acronym = {{MSR}'05},
  booktitle = {{A}ctes du 5{\`e}me {C}olloque sur la 
               {M}od{\'e}lisation des {S}yst{\`e}mes
               {R}{\'e}actifs
               ({MSR}'05)},
  author = {Altisen, Karine and Bouyer, Patricia and Cachat, Thierry and 
            Cassez, Franck and Gardey, Guillaume},
  title = {Introduction au contr{\^o}le des syst{\`e}mes temps-r{\'e}el},
  pages = {367-380},
  nonote = {Invited paper},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MSR05-control.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MSR05-control.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MSR05-control.ps},
  abstract = {In this paper we give a quick overview 
	of the area of control of real-time systems.}
}
@misc{demri-RSFDGrC05,
  author = {Demri, St{\'e}phane},
  title = {On the complexity of information logics},
  year = 2005,
  month = aug,
  howpublished = {Invited talk, Workshop on Logical and Algebraic 
		Foundations of Rough Sets, Regina, Canada}
}
@article{demri-JLC05,
  publisher = {Oxford University Press},
  journal = {Journal of Logic and Computation},
  author = {Demri, St{\'e}phane},
  title = {A reduction from {DLP} to~{PDL}},
  year = 2005,
  month = oct,
  volume = 15,
  number = 5,
  pages = {767-785},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/demri-jlc05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/demri-jlc05.pdf},
  doi = {10.1093/logcom/exi043},
  abstract = {We present a reduction from a new logic extending van der Meyden's
dynamic logic of permission~(DLP) into propositional dynamic logic (PDL),
providing a 2EXPTIME decision procedure and showing that all the machinery 
for~PDL can be reused for reasoning about dynamic policies. As a 
side-effect, we establish that DLP is EXPTIME-complete. The logic we introduce
extends the logic~DLP so that the policy set can be updated depending on its
current value and such an update corresponds to add\slash delete transitions 
in the model, showing similarities with van Benthem's sabotage modal logic.}
}
@article{ddn-jlli05,
  publisher = {Kluwer Academic Publishers},
  journal = {Journal of Logic, Language and Information},
  author = {Demri, St{\'e}phane and de Nivelle, Hans},
  title = {Deciding Regular Grammar Logics with Converse through 
		  First-Order Logic},
  volume = 14,
  number = 3,
  pages = {289-319},
  year = {2005},
  month = jun,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ddn-gf-issue.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ddn-gf-issue.pdf},
  oldnote = {special issue dedicated to guarded logics.},
  doi = {10.1007/s10849-005-5788-9},
  abstract = {We provide a simple translation of the satisfiability problem for regular
grammar logics with converse into GF2 , which is the intersection of the guarded
fragment and the 2-variable fragment of first-order logic. The translation is theoretically 
interesting because it translates modal logics with certain frame conditions into
first-order logic, without explicitly expressing the frame conditions. It is practically
relevant because it makes it possible to use a decision procedure for the guarded
fragment in order to decide regular grammar logics with converse. The class of
regular grammar logics includes numerous logics from various application domains.\par
A consequence of the translation is that the general satisfiability problem for
every regular grammar logics with converse is in~EXPTIME. This extends a previous
result of the first author for grammar logics without converse. Other logics that
can be translated into GF2 include nominal tense logics and intuitionistic logic.
In our view, the results in this paper show that the natural first-order fragment
corresponding to regular grammar logics is simply GF2 without extra machinery
such as fixed point-operators.}
}
@inproceedings{DZG05-aplas,
  address = {Tsukuba, Japan},
  month = nov,
  year = 2005,
  volume = 3780,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Yi, Kwangkeun},
  acronym = {{APLAS}'05},
  booktitle = {{P}roceedings of the 3rd {A}sian {S}ymposium
               on {P}rogramming {L}anguages and {S}ystems
               ({APLAS}'05)},
  author = {Dal Zilio, Silvano and Gascon, R{\'e}gis},
  title = {Resource Bound Certification for a Tail-Recursive
                  Virtual Machine},
  pages = {247-263},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DZG-APLAS05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DZG-APLAS05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DZG-APLAS05.ps},
  doi = {10.1007/11575467_17},
  abstract = {We define a method to statically bound the size of values
computed during the execution of a program as a function of the size
of its parameters. More precisely, we consider bytecode programs that
should be executed on a simple stack machine with support for algebraic 
data types, pattern-matching and tail-recursion. Our size verification 
method is expressed as a static analysis, performed at the level
of the bytecode, that relies on machine-checkable certificates. We follow
here the usual assumption that code and certificates may be forged and
should be checked before execution.\par
Our approach extends a system of static analyses based on the notion
of quasi-interpretations that has already been used to enforce resource
bounds on first-order functional programs. This paper makes two additional 
contributions. First, we are able to check optimized programs,
containing instructions for unconditional jumps and tail-recursive calls,
and remove restrictions on the structure of the bytecode that was imposed 
in previous works. Second, we propose a direct algorithm that
depends only on solving a set of arithmetical constraints.}
}
@inproceedings{DG-concur2005,
  address = {San Francisco, California, USA},
  month = aug,
  year = 2005,
  volume = 3653,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Abadi, Mart{\'\i}n and de Alfaro, Luca},
  acronym = {{CONCUR}'05},
  booktitle = {{P}roceedings of the 16th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'05)},
  author = {Demri, St{\'e}phane and Gascon, R{\'e}gis},
  title = {Verification of Qualitative 
		 {\(\mathbb{\MakeUppercase{Z}}\)}-Constraints},
  pages = {518-532},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-Concur05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-Concur05.pdf},
  doi = {10.1007/11539452_39},
  abstract = {We introduce an LTL-like logic with atomic formulae built
over a constraint language interpreting variables in~\(\mathbb{Z}\). The constraint
language includes periodicity constraints, comparison constraints of the
form \(x = y\) and \(x < y\), it is closed under Boolean operations and it
admits a restricted form of existential quantification. This is the largest
set of qualitative constraints over~\(\mathbb{Z}\) known so far, shown to admit a
decidable LTL extension. Such constraints are those used for instance
in calendar formalisms or in abstractions of counter automata by using
congruences modulo some power of two. Indeed, various programming
languages perform arithmetic operators modulo some integer. We show
that the satisfiability and model-checking problems (with respect to an
appropriate class of constraint automata) for this logic are decidable in
polynomial space improving significantly known results about its strict
fragments. As a by-product, LTL model-checking over integral relational
automata is proved complete for polynomial space which contrasts with
the known undecidability of its CTL counterpart.}
}
@inproceedings{DKR-FEE2005,
  address = {Milan, Italy},
  month = sep,
  year = 2005,
  optaddress = {},
  acronym = {{FEE} 2005},
  booktitle = {{P}roceedings of the {W}orkshop {F}rontiers in {E}lectronic 
	   {E}lections ({FEE} 2005)},
  author = {Delaune, St{\'e}phanie and Kremer, Steve and 
		   Ryan, Mark D.},
  title = {Receipt-Freeness: Formal Definition and Fault 
		   Attacks (Extended Abstract)},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-fee05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-fee05.pdf},
  preliminary-version-of = {DKR-csfw06}
}
@inproceedings{DLN-time05,
  address = {Burlington, Vermont, USA},
  month = jun,
  year = 2005,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{TIME}'05},
  booktitle = {{P}roceedings of the 12th {I}nternational {S}ymposium on 
	       {T}emporal {R}epresentation and {R}easoning
	       ({TIME}'05)},
  author = {Demri, St{\'e}phane and Lazi{\'c}, Ranko and  
		 Nowak, David},
  title = {On the Freeze Quantifier in Constraint {LTL}: 
		Decidability and Complexity},
  pages = {113-121},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-03.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2005-03.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-03.pdf},
  doi = {10.1109/TIME.2005.28},
  abstract = {Constraint LTL, a generalization of LTL over Presburger
constraints, is often used as a formal language to specify the
behavior of operational models with constraints. The freeze
quantifier can be part of the language, as in some real-time
logics, but this variable-binding mechanism is quite general
and ubiquitous in many logical languages (first-order temporal 
logics, hybrid logics, logics for sequence diagrams,
navigation logics, etc.). We show that Constraint LTL over
the simple domain \(\langle \mathbb{N}, = \rangle\) augmented 
with the freeze operator is undecidable which is a 
surprising result regarding the
poor language for constraints (only equality tests). Many
versions of freeze-free Constraint LTL are decidable over
domains with qualitative predicates and our undecidability
result actually establishes \(\Sigma_{1}^{1}\)-completeness. 
On the positive side, we provide complexity results when the domain is
finite (EXPSPACE-completeness) or when the formulae are
flat in a sense introduced in the paper. Our undecidability
results are quite sharp (\emph{i.e.}~with restrictions on the 
number of variables) and all our complexity characterizations
insure completeness with respect to some complexity class
(mainly PSPACE and~EXPSPACE).}
}
@inproceedings{DN-atva05,
  address = {Taipei, Taiwan},
  month = oct,
  year = {2005},
  volume = 3707,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Peled, Doron A. and Tsay, Yih-Kuen},
  acronym = {{ATVA}'05},
  booktitle = {{P}roceedings of the 3rd {I}nternational
               {S}ymposium on {A}utomated {T}echnology
               for {V}erification and {A}nalysis
               ({ATVA}'05)},
  author = {Demri, St{\'e}phane and Nowak, David},
  title = {Reasoning about transfinite sequences (extended abstract)},
  pages = {248-262},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DN-atva2005.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DN-atva2005.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DN-atva2005.ps},
  doi = {10.1007/11562948_20},
  abstract = {We introduce a family of temporal logics to specify the 
behavior of systems with Zeno behaviors. We extend linear-time temporal
logic LTL to authorize models admitting Zeno sequences of actions and
quantitative temporal operators indexed by ordinals replace the standard 
next-time and until future-time operators. Our aim is to control
such systems by designing controllers that safely work on \(\omega\)-sequences
but interact synchronously with the system in order to restrict their behaviors. 
We show that the satisfiability problem for the logics working
on \(\omega^{k}\)-sequences is EXPSPACE-complete when the integers are represented
in binary, and PSPACE-complete with a unary representation. To do so,
we substantially extend standard results about LTL by introducing a
new class of succinct ordinal automata that can encode the interaction
between the different quantitative temporal operators.}
}
@inproceedings{FM-podc05,
  address = {Las Vegas, Nevada, USA},
  month = jul,
  year = 2005,
  publisher = {ACM Press},
  editor = {Aguilera, Marcos Kawazoe and Aspnes, James},
  acronym = {{PODC}'05},
  booktitle = {{P}roceedings of the {T}wenty-{F}ourth {A}nnual 
	  {ACM} {SIGACT}-{SIGOPS} {S}ymposium 
	  on {P}rinciples of {D}istributed {C}omputing
	  ({PODC}'05)},
  author = {Fribourg, Laurent and Messika, St{\'e}phane},
  title = {Brief Announcement: Coupling for {M}arkov Decision 
	Processes~--- {A}pplication to Self-Stabilization with Arbitrary 
	Schedulers},
  pages = {322},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ba173-messika.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ba173-messika.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ba173-messika.ps},
  doi = {10.1145/1073814.1073875}
}
@inproceedings{Gascon-m4m2005,
  address = {Berlin, Germany},
  month = dec,
  year = 2005,
  volume = 194,
  series = {Informatik Bericht},
  publisher = {Humboldt Universit{\"a}t zu Berlin},
  editor = {Schlingloff, Holger},
  acronym = {{M4M-4}},
  booktitle = {{P}roceedings of the 4th
               {W}orkshop on {M}ethods for {M}odalities
               ({M4M-4})},
  author = {Gascon, R{\'e}gis},
  title = {Verifying qualitative and quantitative properties with~{LTL} 
                 over concrete domains},
  pages = {54-61},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Gascon-M4M05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Gascon-M4M05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Gascon-M4M05.ps},
  abstract = {We introduce different 
	extensions of LTL where propositional 
	variables are replaced by constraints 
	interpreted in~\(\mathbb{Z}\). We show 
	different decidability and complexity results 
	for the satisfiability and model checking 
	problems of these logics. The extension of 
	LTL over a wide set of qualitative 
	constraints is shown to be PSPACE-complete. 
	When introducing some quantitative 
	constraints, we must consider strong 
	restrictions to regain decidability.}
}
@inproceedings{Gastin-ICALP2005,
  address = {Lisboa, Portugal},
  month = jul,
  year = 2005,
  volume = {3580},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Caires, Lu{\'\i}s and Italiano, Giuseppe F. and
	    Monteiro, Lu{\'\i}s and Palamidessi, Catuscia and Yung, Moti},
  acronym = {{ICALP}'05},
  booktitle = {{P}roceedings of the 32nd {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming
               ({ICALP}'05)},
  author = {Droste, Manfred and Gastin, Paul},
  title = {Weighted Automata and Weighted Logics},
  pages = {513-525},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/icalp05dg-final.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/icalp05dg-final.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/icalp05dg-final.pdf},
  doi = {10.1007/11523468_42},
  abstract = {Weighted automata are used to 
	describe quantitative properties in various 
	areas such as probabilistic systems, image 
	compression, speech-to-text processing. The 
	behaviour of such an automaton is a mapping, 
	called a formal power series, assigning to 
	each word a weight in some semiring. We 
	generalize B{\"{u}}chi's and Elgot's 
	fundamental theorems to this quantitative 
	setting. We introduce a weighted version of 
	MSO~logic and prove that, for commutative 
	semirings, the behaviours of weighted 
	automata are precisely the formal power 
	series definable with our weighted logic. We 
	also consider weighted first-order logic and 
	show that aperiodic series coincide with the 
	first-order definable ones, if the semiring 
	is locally finite, commutative and has some 
	aperiodicity property.}
}
@inproceedings{GLP:VMCAI,
  address = {Paris, France},
  month = jan,
  year = 2005,
  volume = 3385,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Cousot, Radhia},
  acronym = {{VMCAI}'05},
  booktitle = {{P}roceedings of the 6th {I}nternational {C}onference on
   	       {V}erification, {M}odel {C}hecking and {A}bstract {I}nterpretation
	       ({VMCAI}'05)},
  author = {Goubault{-}Larrecq, Jean and Parrennes, Fabrice},
  title = {Cryptographic Protocol Analysis on Real {C}~Code},
  pages = {363-379},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GouPar-VMCAI2005.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GouPar-VMCAI2005.pdf},
  doi = {10.1007/b105073},
  abstract = {Implementations of 
	cryptographic protocols, such as OpenSSL for 
	example, contain bugs affecting security, 
	which cannot be detected by just analyzing 
	abstract protocols (e.g., SSL or TLS). We 
	describe how cryptographic protocol 
	verification techniques based on solving 
	clause sets can be applied to detect 
	vulnerabilities of C programs in the 
	Dolev-Yao model, statically. This involves 
	integrating fairly simple pointer analysis 
	techniques with an analysis of which messages 
	an external intruder may collect and forge. 
	This also involves relating concrete run-time 
	data with abstract, logical terms 
	representing messages. To this end, we make 
	use of so-called trust assertions.

	The output of the analysis is a set of 
	clauses in the decidable class H1, which can 
	then be solved independently. This can be 
	used to establish secrecy properties, and to 
	detect some other bugs. }
}
@article{JGL-ipl2005,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Goubault{-}Larrecq, Jean},
  title = {Deciding {\(\mathcal{\MakeUppercase{H}}_1\)} 
                    by Resolution},
  year = {2005},
  volume = 95,
  number = 3,
  pages = {401-408},
  month = aug,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Goubault-h1.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Goubault-h1.pdf},
  doi = {10.1016/j.ipl.2005.04.007},
  abstract = {Nielson, Nielson and Seidl's 
	class \(\mathcal{H}_1\) is a decidable class 
	of first-order Horn clause sets, describing 
	strongly regular relations.  We give 
	another proof of decidability, and of the 
	regularity of the defined languages, based 
	on fairly standard automated deduction 
	techniques. }
}
@article{VGL-dmtcs05,
  journal = {Discrete Mathematics \& Theoretical Computer Science},
  author = {Verma, Kumar N. and Goubault{-}Larrecq, Jean},
  title = {{K}arp-{M}iller Trees for a Branching Extension of~{VASS}},
  volume = 7,
  number = 1,
  pages = {217-230},
  year = 2005,
  month = nov,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/VGL-dmtcs05.pdf},
  secondurl = {http://www.dmtcs.org/volumes/abstracts/dm070113.abs.html},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/VGL-dmtcs05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/VGL-dmtcs05.ps},
  abstract = {We study BVASS (Branching VASS) 
	which extend VASS (Vector Addition Systems with 
	States) by allowing addition transitions that 
	merge two configurations. Runs in BVASS are 
	tree-like structures instead of linear ones as 
	for VASS. We show that the construction of 
	Karp-Miller trees for VASS can be extended to 
	BVASS. This entails that the coverability set 
	for BVASS is computable. This allows us to 
	obtain decidability results for certain classes 
	of equational tree automata with an 
	associative-commutative symbol. Recent 
	independent work by de Groote \emph{et al.} implies 
	that decidability of reachability in BVASS is 
	equivalent to decidability of provability in 
	MELL (multiplicative exponential linear logic), 
	which is still an open problem. Hence our 
	results are also a step towards answering this 
	question in the affirmative.}
}
@inproceedings{MukhamedovKremerRitter2005,
  address = {Roseau, The Commonwealth Of Dominica},
  month = aug,
  year = 2005,
  volume = 3570,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Patrick, Andrew S. and Yung, Moti},
  acronym = {{FC}'05},
  booktitle = {{R}evised {P}apers from the 9th {I}nternational {C}onference
               on {F}inancial {C}ryptography and {D}ata {S}ecurity
               ({FC}'05)},
  author = {Mukhamedov, Aybek and Kremer, Steve and
                   Ritter, Eike},
  title = {Analysis of a Multi-Party Fair Exchange Protocol and
                   Formal Proof of Correctness in the Strand Space
                   Model},
  pages = {255-269},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MKR-fcrypto05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MKR-fcrypto05.pdf},
  doi = {10.1007/11507840_23},
  abstract = {A multi-party fair 
	exchange protocol is a cryptographic 
	protocol allowing several parties to 
	exchange commodities in such a way that 
	everyone gives an item away if and only 
	if it receives an item in return. In this 
	paper we discuss a multi-party fair 
	exchange protocol originally proposed by 
	Franklin and Tsudik, and subsequently 
	shown to have flaws and fixed by Gonz\'alez 
	and Markowitch. We identify flaws in the 
	fixed version of the protocol, propose a 
	corrected version, and give a formal 
	proof of correctness in the strand space 
	model.}
}
@inproceedings{KremerRyan2005,
  address = {Edinburgh, Scotland, UK},
  month = apr,
  year = 2005,
  volume = 3444,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Sagiv, Mooly},
  acronym = {{ESOP}'05},
  booktitle = {{P}rogramming {L}anguages and {S}ystems~---
               {P}roceedings of the 14th
               {E}uropean {S}ymposium on {P}rogramming
               ({ESOP}'05)},
  author = {Kremer, Steve and Ryan, Mark D.},
  title = {Analysis of an Electronic Voting Protocol in the
           Applied Pi-Calculus},
  pages = {186-200},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Kremer-esop05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Kremer-esop05.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Kremer-esop05.pdf},
  doi = {10.1007/b107380},
  abstract = {Electronic voting promises the 
	possibility of a convenient, efficient and 
	secure facility for recording and tallying votes 
	in an election.  Recently highlighted 
	inadequacies of implemented systems have 
	demonstrated the importance of formally 
	verifying the underlying voting protocols.  The 
	applied pi calculus is a formalism for modelling 
	such protocols, and allows us to verify 
	properties by using automatic tools, and to rely 
	on manual proof techniques for cases that 
	automatic tools are unable to handle.  We model 
	a known protocol for elections known as FOO~92 
	in the applied pi calculus, and we formalise 
	three of its expected properties, namely 
	fairness, eligibility, and privacy. We use the 
	ProVerif tool to prove that the first two 
	properties are satisfied. In the case of the 
	third property, ProVerif is unable to prove it 
	directly, because its ability to prove 
	observational equivalence between processes is 
	not complete.  We provide a manual proof of the 
	required equivalence.}
}
@inproceedings{GK-concur05,
  address = {San Francisco, California, USA},
  month = aug,
  year = 2005,
  volume = 3653,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Abadi, Mart{\'\i}n and de Alfaro, Luca},
  acronym = {{CONCUR}'05},
  booktitle = {{P}roceedings of the 16th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'05)},
  author = {Gastin, Paul and Kuske, Dietrich},
  title = {Uniform Satisfiability Problem for Local Temporal Logics
		 over {M}azurkiewicz Traces},
  pages = {533-547},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/concur05gk-final.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/concur05gk-final.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/concur05gk-final.ps},
  doi = {10.1007/11539452_40},
  abstract = {We continue our study of the complexity 
	of temporal logics over concurrent systems that can be 
	described by Mazurkiewicz traces. In a previous paper 
	(CONCUR~2003), we investigated the class of local and 
	MSO definable temporal logics that capture all known 
	temporal logics and we showed that the satisfiability 
	problem for any such logic is in PSPACE (provided the 
	dependence alphabet is fixed). In this paper, we 
	concentrate on the uniform satisfiability problem: we 
	consider the dependence alphabet (\emph{i.e.}, the 
	architecture of the distributed system) as part of the 
	input. We prove lower and upper bounds for the uniform 
	satisfiability problem that depend on the number of 
	monadic quantifier alternations present in the chosen 
	MSO-modalities.}
}
@inproceedings{LLT-rta2005,
  address = {Nara, Japan},
  month = apr,
  year = 2005,
  volume = 3467,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Giesl, J{\"u}rgen},
  acronym = {{RTA}'05},
  booktitle = {{P}roceedings of the 16th {I}nternational
               {C}onference on {R}ewriting {T}echniques
               and {A}pplications
               ({RTA}'05)},
  author = {Lafourcade, Pascal and Lugiez, Denis and Treinen, Ralf},
  title = {Intruder Deduction for {AC}-like Equational Theories 
		 with Homomorphisms},
  pages = {308-322},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/rta05-LLT.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/rta05-LLT.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/rta05-LLT.ps},
  doi = {10.1007/b135673},
  abstract = {Cryptographic protocols are 
	small programs which involve a high level 
	of concurrency and which are difficult to 
	analyze by hand. The most successful 
	methods to verify such protocols rely on 
	rewriting techniques and automated 
	deduction in order to implement or mimic 
	the process calculus describing the 
	protocol execution. \par 
	We focus on the 
	intruder deduction problem, that is the 
	vulnerability to passive attacks, in 
	presence of several variants of 
	\textit{AC}-like axioms (from \textit{AC} 
	to Abelian groups, including the theory 
	of \emph{exclusive or}) and homomorphism 
	which are the most frequent axioms 
	arising in cryptographic protocols. 
	Solutions are known for the cases of 
	\emph{exclusive or}, of Abelian groups, 
	and of homomorphism alone. In this paper 
	we address the combination of these 
	\textit{AC}-like theories with the law of 
	homomorphism which leads to much more 
	complex decision problems.\par 
	We prove 
	decidability of the intruder deduction 
	problem in all cases considered. Our 
	decision procedure is in EXPTIME, except 
	for a restricted case in which we have 
	been able to get a PTIME decision 
	procedure using a property of one-counter 
	and pushdown automata.}
}
@inproceedings{Laroussinie-m4m05,
  address = {Berlin, Germany},
  month = dec,
  year = 2005,
  volume = 194,
  series = {Informatik Bericht},
  publisher = {Humboldt Universit{\"a}t zu Berlin},
  editor = {Schlingloff, Holger},
  acronym = {{M4M-4}},
  booktitle = {{P}roceedings of the 4th
               {W}orkshop on {M}ethods for {M}odalities
               ({M4M-4})},
  author = {Laroussinie, Fran{\c{c}}ois},
  title = {Timed modal logics for the verification of real-time systems},
  pages = {293-305},
  nonote = {Invited paper},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Lar-M4M05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Lar-M4M05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Lar-M4M05.ps},
  abstract = {The timed modal logic \(L_{\nu}\) has 
	been proposed in order to express timed properties 
	over real-time systems modeled as (compositions of) 
	timed automata. In this paper, we present a short 
	survey of results about~\(L_{\nu}\): complexity of 
	model checking, expressivity, compositional methods, 
	relationship with strong timed bisimulation etc. We 
	also show how \(L_{\nu}\) can be extended in order to 
	express new properties. }
}
@inproceedings{LS-fossacs05,
  address = {Edinburgh, Scotland, UK},
  month = apr,
  year = 2005,
  volume = 3441,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Sassone, Vladimiro},
  acronym = {{FoSSaCS}'05},
  booktitle = {{P}roceedings of the 8th {I}nternational 
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'05)},
  author = {Laroussinie, Fran{\c{c}}ois and Sproston, Jeremy},
  title = {Model Checking Durational Probabilistic Systems},
  pages = {140-154},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/fossacs05-FS.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/fossacs05-FS.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/fossacs05-FS.ps},
  doi = {10.1007/b106850},
  abstract = {We consider model-checking algorithms for durational probabilistic
systems, which are systems exhibiting nondeterministic, probabilistic and
discrete-timed behaviour. We present two semantics for durational probabilistic
systems, and show how formulae of the probabilistic and timed temporal logic
PTCTL can be verified on such systems. We also address complexity issues, in
particular identifying the cases in which model checking durational probabilistic
systems is harder than verifying non-probabilistic durational systems.}
}
@inproceedings{LNZ-appsem05,
  address = {Frauenchiemsee, Germany},
  month = sep,
  year = 2005,
  editor = {Hofmann, Martin and Loidl, Hans-Wolfgang},
  acronym = {{APPSEM}'05},
  booktitle = {{P}roceedings of the 3rd {APPSEM~II} Workshop
           ({APPSEM}'05)},
  author = {Lasota, S{\l}awomir and Nowak, David and
		 Zhang, Yu},
  title = {On completeness of logical relations for monadic types},
  nopages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LNZ-monad-complete.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LNZ-monad-complete.pdf},
  abstract = {Interesting properties of programs can be expressed using
contextual equivalence. The latter is difficult to prove directly, hence 
(pre-)logical relations are often used as a tool to prove it.
Whereas pre-logical relations are complete at all types, logical 
relations are only complete up to first-order types. We propose a 
notion of contextual equivalence for Moggi's computational lambda calculus, 
and define pre-logical and logical relations for this calculus. Monads 
introduce new difficulties: in particular the usual proofs of completeness 
up to first-order types do not go through. We prove completeness up to 
first order for several of Moggi's monads. In the case of the non-determinism 
monad we obtain, as a corollary, completness of strong bisimulation 
w.r.t.~contextual equivalence in lambda calculus with monadic non-determinism.}
}
@techreport{rr-LSV:05:11,
  author = {Bouhoula, Adel and Jacquemard, Florent},
  title = {Automated Induction for Complex Data Structures},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = {2005},
  month = jul,
  type = {Research Report},
  number = {LSV-05-11},
  note = {24~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-11.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-11.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2005-11.ps},
  abstract = {We develop a new approach for mechanizing induction
                   on complex data structures (like sets, sorted lists,
                   trees, powerlists...). The key idea is to compute a
                   tree grammar with constraints which describes exactly
                   the initial model of the given specification, unlike
                   test sets or cover sets which are approximative
                   induction schemes when the constructors are not free.
                   This grammar is used for the generation of subgoals
                   during the proof by induction. Our procedure is sound
                   and refutationally complete even with constrained
                   axioms for constructors. it subsumes all test set
                   induction techniques, and yields very natural proofs
                   for several examples on which other approaches
                   failed.}
}
@techreport{rr-LSV:05:17,
  author = {Bouhoula, Adel and Jacquemard, Florent},
  title = {Automatic Verification of Sufficient Completeness for Specifications 
                  of Complex Data Structures},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2005,
  month = aug,
  type = {Research Report},
  number = {LSV-05-17},
  note = {14~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-17.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-17.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		  rr-lsv-2005-17.ps},
  abstract = {We present a new procedure for testing sufficient
                  completeness for conditional and constrained term
                  rewriting systems in presence of constrained axioms
                  for constructors. Such axioms allow to specify
                  complex data structures like e.g. sets or sorted lists. 
                  Our approach is based on tree grammars with
                  constraints, a formalism which permits an exact
                  representation of languages of ground constructor
                  terms in normal form. The procedure is sound and
                  complete and has been successfully used for checking
                  the sufficient completeness of several
                  specifications where related former techniques fail.}
}
@techreport{LSV:05:19,
  author = {Lafourcade, Pascal and Lugiez, Denis and Treinen, Ralf},
  title = {Intruder Deduction for the Equational Theory of Exclusive-or
		  with Distributive Encryption},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2005,
  month = oct,
  type = {Research Report},
  number = {LSV-05-19},
  note = {39~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-19.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-19.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
	rr-lsv-2005-19.ps},
  abstract = {Cryptographic protocols are small programs which involve a high
  level of concurrency and which are difficult to analyze by hand. The
  most successful methods to verify such protocols are based on
  rewriting techniques and automated deduction in order to implement
  or mimic the process calculus describing the execution of a 
  protocol.\par
  We are interested in the intruder deduction problem, that is the
  vulnerability to passive attacks, in presence of the theory of an
  encryption
  operator which distributes over the \emph{exclusive-or}. This
  equational
  theory describes very common properties of cryptographic primitives.
  Solutions to the intruder deduction problem modulo an equational theory
  are known for the cases of \emph{exclusive-or}, of Abelian groups, of a
  homomorphism symbol alone, and of combinations of these theories. In
  this paper we consider the case where the encryption distributes over
  \emph{exclusive-or}. The interaction of the distributive law of the
  encryption with the cancellation law of \emph{exclusive-or} leads to a
  much more complex decision problem. We prove decidability of the intruder
  deduction problem for an encryption which distributes over
  \emph{exclusive-or} with an EXPTIME procedure and we give a PTIME
  decision
  procedure relying on prefix rewrite systems for a restricted case, the
  \emph{binary} case.}
}
@article{LugSch-IC,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Lugiez, Denis and Schnoebelen, {\relax Ph}ilippe},
  title = {Decidable first-order transition logics for
	 {PA}-processes},
  year = 2005,
  month = nov,
  volume = 203,
  number = 1,
  pages = {75-113},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/InfComp-C2707.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/InfComp-C2707.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/InfComp-C2707.ps},
  doi = {10.1016/j.ic.2005.02.003},
  abstract = {We show the decidability of 
	model checking PA-processes against 
	several first-order logics
	based upon the reachability predicate. 
	The main tool for this result is the
	recognizability by tree automata of the 
	reachability relation. The tree
	automata approach and the transition 
	logics we use allow a smooth and
	general treatment of parameterized model 
	checking for PA. This approach is
	extended to handle a quite general notion 
	of costs of PA-steps.
	In particular, when costs are Parikh 
	images of traces, we show decidability
	of a transition logic extended by some 
	form of first-order reasoning over
	costs.}
}
@inproceedings{Orchids-cav05,
  address = {Edinburgh, Scotland, UK},
  month = jul,
  year = 2005,
  volume = 3576,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Etessami, Kousha and Rajamani, Sriram},
  acronym = {{CAV}'05},
  booktitle = {{P}roceedings of the 17th
               {I}nternational {C}onference on 
               {C}omputer {A}ided {V}erification
               ({CAV}'05)},
  author = {Olivain, Julien and Goubault{-}Larrecq, Jean},
  title = {The {O}rchids Intrusion Detection Tool},
  pages = {286-290},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/OG-cav05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/OG-cav05.pdf},
  doi = {10.1007/11513988_28}
}
@misc{PERSEE-RC1,
  author = {Bardin, S{\'e}bastien and Herbreteau, Fr{\'e}d{\'e}ric 
		and Sighireanu, Mihaela and Sutre, Gr{\'e}goire
                  and Vincent, Aymeric},
  title = {Int{\'e}gration des outils {PERS\'EE} (Proposition
		d'architecture)},
  howpublished = {D\'elivrable~3.1~--- Partie~1 du Projet PERS\'EE de 
		l'ACI S\'ecurit\'e Informatique},
  year = 2005,
  month = jun,
  url = {http://www.labri.fr/perso/herbrete/persee/downloads/integration/deliverable3.1.pdf},
  pdf = {http://www.labri.fr/perso/herbrete/persee/downloads/integration/deliverable3.1.pdf},
  note = {35~pages}
}
@misc{persee-miparcours05,
  author = {Schnoebelen, {\relax Ph}ilippe and others},
  title = {{ACI} {S}{\'e}curit{\'e} {I}nformatique {PERS{\'E}E}~--- 
	    Rapport {\`a} mi-parcours},
  year = 2005,
  month = nov,
  type = {Contract Report},
  note = {8~pages}
}
@techreport{Prouve:rap5,
  author = {Bozga, Liana and Delaune, St{\'e}phanie and 
		 Klay, Francis and Vigneron, Laurent},
  title = {Retour d'exp{\'e}rience sur la validation du 
		 porte-monnaie {\'e}lectronique},
  institution = {projet RNTL PROUV{\'E}},
  month = mar,
  year = 2005,
  type = {Technical Report},
  number = 5,
  note = {29~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/prouve-rap5.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/prouve-rap5.ps},
  abstract = {Le domaine de la 
	mod{\'e}lisation et de la v{\'e}rification 
	est une activit{\'e} d{\'e}licate et 
	importante qui a connu une v{\'e}ritable 
	explosion dans les ann{\'e}es~1990. On 
	dispose {\`a} l'entr{\'e}e des 
	ann{\'e}es~2000 de toute une gamme de 
	mod{\`e}les et de m{\'e}thodes plus ou moins 
	avanc{\'e}s en ce qui concerne 
	l'expressivit{\'e} et l'automatisation.
	\par
	Afin de d{\'e}finir les besoins et les 
	priorit{\'e}s {\`a} mettre sur les outils 
	consacr{\'e}s {\`a} la v{\'e}rification de 
	protocoles cryptographiques qui seront 
	d{\'e}velopp{\'e}s au sein du projet RNTL 
	PROUV{\'E}, nous proposons de travailler en 
	situation r{\'e}elle, sur des protocoles 
	plut{\^o}t <<~durs~>>, en effectuant le cycle 
	suivant: mod{\'e}lisation, formalisation puis 
	validation dans des outils existants.  Ce 
	travail est effectu{\'e} ici pour deux 
	versions d'un protocole de porte-monnaie 
	{\'e}lectronique, dont l'une a {\'e}t{\'e} 
	d{\'e}velopp{\'e}e r{\'e}cemment par une 
	{\'e}quipe de France T{\'e}l{\'e}com.  Les 
	outils retenus pour la r{\'e}alisation de 
	cette {\'e}tude sont ProVerif, Hermes et 
	Casrul, en raison de leurs 
	caract{\'e}ristiques tr{\`e}s 
	diff{\'e}rentes.}
}
@techreport{Prouve:rap6,
  author = {Delaune, St{\'e}phanie and 
		 Klay, Francis and Kremer, Steve},
  title = {Sp{\'e}cification du protocole de vote  
		 {\'e}lectronique},
  institution = {projet RNTL PROUV{\'E}},
  month = nov,
  year = 2005,
  type = {Technical Report},
  number = 6,
  note = {19~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Prouve-rap6.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Prouve-rap6.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Prouve-rap6.ps},
  abstract = {Cette nouvelle \'etude de cas a pour 
	but de tester les limites du 
	langage~{\scshape Prouv\'e}.  En effet, le 
	protocole que nous avons choisi d'\'etudier est 
	volontairement complexe tant au niveau de la 
	mod\'elisation des propri\'et\'es de s\'ecurit\'e que de la 
	description du protocole lui-m\^eme en raison de la 
	manipulation de structures de donn\'ees telles que 
	les listes.\par
	Notre \'etude de cas est un protocole de vote qui a 
	\'et\'e mis au point par J.~Traor\'e, ing\'enieur de 
	recherche chez France~T\'el\'ecom. Ce protocole est 
	bas\'e sur le m\'ecanisme de signature en aveugle et 
	peut \^etre consid\'er\'e comme un d\'eriv\'e du protocole 
	de Fujioka, Okamoto et~Ohta.  Ce document 
	introduit dans un premier temps le probl\`eme du 
	vote \'electronique en g\'en\'eral avant de d\'ecrire le 
	protocole en lui-m\^eme et sa formalisation dans le 
	langage~{\scshape Prouv\'e}.}
}
@techreport{Prouve:rap7,
  author = {Kremer, Steve and Lakhnech, Yassine and Treinen, Ralf},
  title = {The {P}{\scshape rouv\'e} Manual: Specifications, Semantics, and Logics},
  institution = {projet RNTL PROUV{\'E}},
  month = dec,
  year = 2005,
  type = {Technical Report},
  number = 7,
  note = {49~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Prouve-rap7.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Prouve-rap7.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Prouve-rap7.ps},
  abstract = { In this report we describe the {\scshape Prouv\'e}
	specification language for cryptographic protocols. A main 
	feature of the language is that it separates the roles of a 
	protocol, which are defined in a simple imperative 
	programming language, from the scenario which defines how 
	instances of the roles are created.\par
	We give a formal semantics of the protocol specification 
	language, and define both an expressive logics for safety 
	conditions of protocols and a more limited assertion 
	language.\par
	This version of the report~(2.0.x) describes version~2.0 of 
	the {\scshape Prouv\'e} language.}
}
@inproceedings{PinchinatRiedweg05,
  address = {Portland, Oregon, USA},
  month = jun,
  year = 2005,
  publisher = {IEEECSP},
  editor = {Balakrishnan, S. N.},
  acronym = {{ACC}'05},
  booktitle = {{P}roceedings of the 24th {A}merican {C}ontrol 
	       {C}onference ({ACC}'05)},
  author = {Pinchinat, Sophie and Riedweg, St{\'e}phane},
  title = {You Can Always Compute Maximally Permissive 
		Controllers Under Partial Observation When They Exist},
  pages = {2287-2292},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PR-ACC05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PR-ACC05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/PR-ACC05.ps},
  abstract = {The maximal permissivity property of controllers
is an optimal criterion that is often taken for granted as the
result of synthesis algorithms: the algorithms are designed
for frameworks where the existence and the uniqueness of
a maximal permissive controller is demonstrated apart, as
it fulfills sufficient hypotheses; these algorithms precisely
compute this object. Still, maximally permissive solutions
might exist in circumstances which do not fall into such
identified frameworks, but there is no way to ensure that
the algorithms deliver an optimal solution. In this paper, we
propose a general synthesis procedure which always computes
a maximal permissive controller when it exists.}
}
@inproceedings{PR-cdc05,
  address = {Seville, Spain},
  month = dec,
  year = 2005,
  publisher = {{IEEE} Control System Society},
  acronym = {{CDC-ECC}'05},
  booktitle = {{P}roceedings of the 44th {IEEE} {C}onference on Decision 
		and Control and European Control Conference 
		({CDC-ECC}'05)},
  author = {Pinchinat, Sophie and Riedweg, St{\'e}phane},
  title = {On the Architectures in Decentralized Supervisory 
		Control},
  pages = {12-17},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PR-cdc05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PR-cdc05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/PR-cdc05.ps},
  abstract = {In this paper, we clarify the notion of architecture in 
decentralized control, in order to investigate the realizability problem: 
given a discrete-event system, a desired behavior and an architecture for 
a decentralized control, can the desired behavior be achieved by 
decentralized controllers in accordance with the given architecture? We 
consider the problem for any mu-calculus definable behavior and for 
classic architectures from the literature. The method consists in 
compiling in a single formula both the desired behavior and the 
architecture. Applications of this approach are a single synthesis 
algorithm of decentralized controllers (with full observation) for the 
whole considered family of architectures, and the development of a 
convenient mathematical framework for a theory of decentralized control 
architectures.}
}
@article{PR-IPL05,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Pinchinat, Sophie and Riedweg, St{\'e}phane},
  title = {A Decidable Class of Problems for Control under Partial Observation},
  year = 2005,
  month = aug,
  volume = 95,
  number = 4,
  pages = {454-465},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PR-IPL05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PR-IPL05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/PR-IPL05.ps},
  doi = {10.1016/j.ipl.2005.04.011}
}
@phdthesis{THESE-bardin05,
  author = {Bardin, S{\'e}bastien},
  title = {Vers un model checking avec acc{\'e}l{\'e}ration plate 
		 de syst{\`e}mes h{\'e}t{\'e}rog{\`e}nes},
  year = 2005,
  month = oct,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bardin-THESE.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bardin-THESE.pdf}
}
@phdthesis{THESE-zhang05,
  author = {Zhang, Yu},
  title = {Cryptographic logical relations~-- What is the 
		contextual equivalence for 
		cryptographic protocols and how to prove~it?},
  year = 2005,
  month = oct,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/zy-thesis.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/zy-thesis.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/zy-thesis.ps}
}
@phdthesis{THESE-baclet05,
  author = {Baclet, Manuel},
  title = {Applications du model-checking {\`a} des probl{\`e}mes de
		v{\'e}rification de syst{\`e}mes sur puce},
  year = 2005,
  month = dec,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-baclet.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-baclet.pdf}
}
@phdthesis{treinen-hab2005,
  author = {Treinen, Ralf},
  title = {R{\'e}solution symbolique de contraintes},
  year = 2005,
  month = nov,
  type = {M{\'e}moire d'habilitation},
  school = {Universit{\'e} Paris-Sud~11, Orsay, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/RT-habil.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/RT-habil.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/RT-habil.ps}
}
@phdthesis{FL-hab2005,
  author = {Laroussinie, Fran{\c{c}}ois},
  title = {Model checking temporis{\'e}~--- Algorithmes efficaces et complexit{\'e}},
  year = 2005,
  month = dec,
  type = {M{\'e}moire d'habilitation},
  school = {Universit{\'e} Paris~7, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FL-habil.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FL-habil.pdf}
}
@mastersthesis{pinot-master,
  author = {Pinot, Simon},
  title = {Analyse de stabilit{\'e} d'algorithme 
		 distribu{\'e}s probabilistes},
  school = {{M}aster de {L}ogique {M}ath{\'e}matique
	et {F}ondements de l'{I}nformatique, Paris, France},
  type = {Rapport de {M}aster},
  year = 2005,
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Pinot-M2.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Pinot-M2.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Pinot-M2.ps}
}
@mastersthesis{sznajder-master,
  author = {Sznajder, Nathalie},
  title = {Synth{\`e}se de contr{\^o}leur pour les
		syst{\`e}mes distribu{\'e}s synchrones},
  school = {{M}aster {P}arisien de {R}echerche en 
	{I}nformatique, Paris, France},
  type = {Rapport de {M}aster},
  year = 2005,
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sznajder-M2.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sznajder-M2.pdf}
}
@article{FL-ACMtecs05,
  publisher = {ACM Press},
  journal = {ACM Transactions in Embedded Computing Systems},
  author = {{The Artist Education Group}},
  fullauthor = {Caspi, Paul and
               Sangiovanni-Vincentelli, Alberto L. and
               Almeida Lu{\'\i}s and
               Benveniste, Albert and
               Bouyssounouse, Bruno and
               Buttazzo, Giorgio C. and
               Crnkovic, Ivica and
               Damm, Werner and
               Engblom, Jakob and
               Fohler, Gerhard and
               Garc{\'\i}a-Valls, Marisol and
               Kopetz, hermann and
               Lakhnech, Yassine and
               Laroussinie, Fran{\c{c}}ois and
               Lavagno, Luciano and
               Lipari, Guiseppe and
               Maraninchi, Florence and
               Peti, Philipp and
               Antonio de la Puente, Juan and
               Scaife, Norman and
               Sifakis, Joseph and
               de{ }Simone, Robert and
               T{\"o}rngren, Martin and
               Ver{\'\i}ssimo, Paulo and
               Wellings, Andy J. and
               Wilhelm, Reinhard and
               Willemse, Tim A. C. and
               Yi, Wang},
  title = {Guidelines for a graduate curriculum on embedded software
               and systems},
  volume = 4,
  number = 3,
  year = 2005,
  month = aug,
  pages = {587-611},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Artist-tecs05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Artist-tecs05.pdf},
  doi = {10.1145/1086519.1086526},
  abstract = {The design of embedded real-time systems requires skills from
multiple specific disciplines, including, but not limited to, control,
computer science, and electronics. This often involves experts from differing
backgrounds, who do not recognize that they address similar, if not identical,
issues from complementary angles. Design methodologies are lacking in rigor
and discipline so that demonstrating correctness of an embedded design, if at
all possible, is a very expensive proposition that may delay significantly the
introduction of a critical product. While the economic importance of embedded
systems is widely acknowledged, academia has not paid enough attention to the
education of a community of high-quality embedded system designers, an obvious
difficulty being the need of interdisciplinarity in a period where
specialization has been the target of most education systems. This paper
presents the reflections that took place in the European Network of Excellence
Artist leading us to propose principles and structured contents for building
curricula on embedded software and systems.}
}
@techreport{FGRV-ulb05,
  author = {Finkel, Alain and Geeraerts, Gilles and Raskin, Jean-Fran{\c{c}}ois and
 	       Van{~}Begin, Laurent},
  title = {A counter-example the the minimal coverability tree algorithm},
  institution = {Universit\'e Libre de Bruxelles, Belgium},
  year = {2005},
  number = {535},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/FGRV-ulb05.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FGRV-ulb05.pdf},
  abstract = {In [Finkel, 1993], an~algorithm to compute a minimal
    coverability tree for Petri nets has been presented. This document
    demonstrates, thanks to a simple counter-example, that this algorithm may
    compute an under-approximation of a coverability tree, i.e., a~tree whose
    set of nodes is not sufficient to cover all the reachable markings.}
}
@article{CL-tsi06,
  publisher = {Herm{\`e}s},
  journal = {Technique et Science Informatiques},
  author = {Cassez, Franck and Laroussinie, Fran{\c{c}}ois},
  editor = {Cassez, Franck and Laroussinie, Fran{\c{c}}ois},
  title = {Contr{\^o}le des applications temps-r{\'e}el~: mod{\`e}les
                  temporis{\'e}s et hybrides},
  volume = 25,
  number = 3,
  year = 2006,
  url = {http://www.lavoisier.fr/notice/fr2746214830.html}
}
@incollection{jgl-encyc06,
  author = {Goubault{-}Larrecq, Jean},
  title = {Preuve et v{\'e}rification pour la s{\'e}curit{\'e} 
	  et la s{\^u}ret{\'e}},
  booktitle = {Encyclop{\'e}die de l'informatique et des syst{\`e}mes 
	  d'information},
  editor = {Akoka, Jacky and Comyn-Wattiau, Isabelle},
  pages = {683-703},
  publisher = {Vuibert},
  year = 2006,
  month = dec,
  chapter = {I.6},
  url = {http://www.vuibert.com/livre12401.html},
  abstract = {La s\^uret\'e, comme la s\'ecurit\'e, \'enonce qu'un mal n'arrive
  jamais.  Le but de cet article est de d\'efinir la notion de propri\'et\'e
  de s\^uret\'e, et d'en d\'ecrire quelques techniques de v\'erification et de
  preuve~: model-checking, interpr\'etation abstraite notamment.  Apr\`es
  avoir remarqu\'e qu'il n'y avait pas de s\'ecurit\'e sans s\^uret\'e, il est
  expliqu\'e que l'analyse de s\'ecurit\'e d'un syst\`eme repose sur un
  mod\`ele, des hypoth\`eses, des propri\'et\'es \`a v\'erifier, et une
  architecture de s\'ecurit\'e.  Finalement, il est donn\'e un aper\c{c}u de
  quelques mod\`eles et m\'ethodes de preuve de protocoles
  cryptographiques.}
}
@inproceedings{BJ-secret06,
  address = {Venice, Italy},
  month = jul,
  year = 2006,
  editor = {Fern{\'a}ndez, Maribel and Kirchner, Claude},
  acronym = {{SecReT}'06},
  booktitle = {{P}reliminary {P}roceedings of the 1st 
           {I}nternational {W}orkshop on {S}ecurity and {R}ewriting {T}echniques
           ({SecReT}'06)},
  author = {Bouhoula, Adel and Jacquemard, Florent},
  title = {Security Protocols Verification with Implicit Induction and 
		  Explicit Destructors},
  pages = {37-44},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BJ-secret06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BJ-secret06.pdf},
  abstract = {We present a new method for automatic implicit induction theorem
proving, and its application for the verification of a key distribution
cryptographic protocol. The~method can handle axioms between constructor
terms, a~feature generally not supported by other induction procedure. We~use
such axioms in order to specify explicit destructors representing
cryptographic operators.}
}
@inproceedings{BBS-forte06,
  address = {Paris, France},
  month = sep,
  year = 2006,
  volume = 4229,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Najm, Elie and Pradat{-}Peyre, Jean-Fran{\c{c}}ois and
             Vigui{\'e} Donzeau-Gouge, V{\'e}ronique},
  acronym = {{FORTE}'06},
  booktitle = {{P}roceedings of 26th {IFIP} {WG6.1} 
           {I}nternational {C}onference on {F}ormal
           {T}echniques for {N}etworked and {D}istributed {S}ystems
	   ({FORTE}'06)},
  author = {Baier, Christel and Bertrand, Nathalie and Schnoebelen, {\relax Ph}ilippe},
  title = {Symbolic verification of communicating systems with
		  probabilistic message losses: liveness and fairness},
  pages = {212-227},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBS-forte06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBS-forte06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBS-forte06.ps},
  doi = {10.1007/11888116_17},
  abstract = {NPLCS's are a new model for nondeterministic channel systems
	where unreliable communication is modeled by probabilistic message losses.
	We~show that, for \(\omega\)-regular linear-time properties and finite-memory
	schedulers, qualitative model-checking is decidable. The~techniques extend
	smoothly to questions where fairness restrictions are imposed on the
	schedulers. The~symbolic procedure underlying our decidability proofs has been
	implemented and used to study a simple protocol handling two-way transfers in
	an unreliable setting.}
}
@inproceedings{BC-asian06,
  address = {Tokyo, Japan},
  month = jan,
  year = 2008,
  volume = 4435,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Okada, Mitsu and Satoh, Ichiro},
  acronym = {{ASIAN}'06},
  booktitle = {{R}evised {S}elected {P}apers of the 11th {A}sian
               {C}omputing {S}cience {C}onference
               ({ASIAN}'06)},
  author = {Bernat, Vincent and Comon{-}Lundh, Hubert},
  title = {Normal proofs in intruder theories},
  pages = {151-166},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BC-asian06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BC-asian06.pdf},
  doi = {10.1007/978-3-540-77505-8_12},
  abstract = {Given an arbitrary intruder deduction capability, modeled as an
              inference system~\(\mathcal{S}\) and a protocol, we show how to
              compute an inference system~\(\widehat{\mathcal{S}}\) such that
              the security problem for an unbounded number of sessions is
              equivalent to the deducibility of some message
              in~\(\widehat{\mathcal{S}}\). Then, assuming that
              \(\mathcal{S}\)~has some subformula property, we lift such a
              property to~\(\widehat{\mathcal{S}}\), thanks to a proof
              normalisation theorem. In~general, for an unbounded number of
              sessions, this provides with a complete deduction strategy. In
              case of a bounded number of sessions, our theorem implies that
              the security problem is co-NP-complete. As an instance of our
              result we get a decision algorithm for the theory of
              blind-signatures, which, to our knowledge, was not known
              before.}
}
@inproceedings{LNZ-asian06,
  address = {Tokyo, Japan},
  month = jan,
  year = 2008,
  volume = 4435,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Okada, Mitsu and Satoh, Ichiro},
  acronym = {{ASIAN}'06},
  booktitle = {{R}evised {S}elected {P}apers of the 11th {A}sian
               {C}omputing {S}cience {C}onference
               ({ASIAN}'06)},
  author = {Lasota, S{\l}awomir and Nowak, David and Yu, Zhang},
  title = {On completeness of logical relations for monadic types},
  pages = {223-230},
  nmnote = {autc parce que c'est un short paper, pas ant pour Zhang Yu},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LNZ-monad-complete.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LNZ-monad-complete.pdf},
  doi = {10.1007/978-3-540-77505-8_17},
  abstract = {Software security can be ensured by specifying and verifying
                  security properties of software using formal methods with
                  strong theoretical bases. In~particular, programs can be
                  modeled in the framework of lambda-calculi, and interesting
                  properties can be expressed formally by contextual
                  equivalence (a.k.a.~observational equivalence). Furthermore,
                  imperative features, which exist in most real-life software,
                  can be nicely expressed in the so-called computational
                  lambda-calculus. Contextual equivalence is difficult to
                  prove directly, but we can often use logical relations as a
                  tool to establish it in lambda-calculi. We~have already
                  defined logical relations for the computational
                  lambda-calculus in previous work. We~devote this paper to
                  the study of their completeness w.r.t.~contextual
                  equivalence in the computational lambda-calculus.}
}
@inproceedings{BP06,
  address = {Taipei, Taiwan},
  month = aug,
  year = 2006,
  volume = 4094,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer-Verlag},
  editor = {Ibarra, Oscar H. and Yen, Hsu-Chun},
  acronym = {{CIAA}'06},
  booktitle = {{P}roceedings of the 11th {I}nternational 
           {C}onference on {I}mplementation and
           {A}pplication of {A}utomata
           ({CIAA}'06)},
  author = {Baclet, Manuel and Pagetti, Claire},
  title = {Around {H}opcroft's Algorithm},
  pages = {114-125},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BP-ciaa06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BP-ciaa06.pdf},
  doi = {10.1007/11812128_12},
  abstract = {In this paper, a reflection is made on an indeterminism inherent
to Hopcroft's minimization algorithm: the splitter choice. We have implemented
two natural policies (FIFO and~FILO) for managing the set of splitters for
which we obtain the following practical results: the FILO strategy performs
better than the FIFO strategy, in the case of a one letter alphabet, the FILO
practical complexity never exceeds a linear one and our implementation is more
efficient than the minimization algorithm of the FSM tool. This implementation
is being integrated in a finite automata library, the Dash library. Thus, we
present an efficient manner to manipulate automata by using canonical minimal
automata.}
}
@inproceedings{abw-fossacs2006,
  address = {Vienna, Austria},
  month = mar,
  year = 2006,
  volume = 3921,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Aceto, Luca and Ing{\'o}lfsd{\'o}ttir, Anna},
  acronym = {{FoSSaCS}'06},
  booktitle = {{P}roceedings of the 9th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'06)},
  author = {Abadi, Mart{\'\i}n and Baudet, Mathieu and 
		Warinschi, Bogdan},
  title = {Guessing Attacks and the Computational Soundness of 
		Static Equivalence},
  pages = {398-412},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABW_Fossacs06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABW_Fossacs06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ABW_Fossacs06.ps},
  doi = {10.1007/11690634_27},
  abstract = {The indistinguishability of two pieces of 
	data (or two lists of pieces of data) can be 
	represented formally in terms of a relation called 
	static equivalence. Static equivalence depends on an 
	underlying equational theory. The choice of an 
	inappropriate equational theory can lead to overly 
	pessimistic or overly optimistic notions of 
	indistinguishability, and in turn to security criteria 
	that require protection against impossible attacks 
	or ---worse yet--- that ignore feasible ones.  In this 
	paper, we define and justify an equational theory for 
	standard, fundamental cryptographic operations. This 
	equational theory yields a notion of static equivalence 
	that implies computational indistinguishability. Static 
	equivalence remains liberal enough for use in 
	applications. In particular, we develop and analyze a 
	principled formal account of guessing attacks in terms 
	of static equivalence.}
}
@inproceedings{BKRS-fsttcs2006,
  address = {Kolkata, India},
  month = dec,
  year = 2006,
  volume = 4337,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Garg, Naveen and Arun-Kumar, S.},
  acronym = {{FSTTCS}'06},
  booktitle = {{P}roceedings of the 26th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'06)},
  author = {Bozzelli, Laura and K{\v{r}}et{\'\i}nsk{\'y}, Mojm{\'\i}r and
                 {\v{R}}eh{\'a}k, Vojt{\v{e}}ch and Strej{\v c}ek, Jan},
  title = {On Decidability of {LTL} Model Checking for Process Rewrite Systems},
  pages = {248-259},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKRS-fsttcs06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKRS-fsttcs06.pdf},
  doi = {10.1007/11944836_24}
}
@inproceedings{BLMR-fsttcs2006,
  address = {Kolkata, India},
  month = dec,
  year = 2006,
  volume = 4337,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Garg, Naveen and Arun-Kumar, S.},
  acronym = {{FSTTCS}'06},
  booktitle = {{P}roceedings of the 26th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'06)},
  author = {Bouyer, Patricia and Larsen, Kim G. and Markey, Nicolas and
		 Rasmussen, Jacob Illum},
  title = {Almost Optimal Strategies in One-Clock Priced Timed Automata},
  pages = {345-356},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLMR-fsttcs06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLMR-fsttcs06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BLMR-fsttcs06.ps},
  doi = {10.1007/11944836_32},
  abstract = {We consider timed games extended with cost information, and
      prove computability of the optimal cost and of \(\epsilon\)-optimal memoryless
      strategies in timed games with one~clock. In~contrast, this problem has
      recently been proved undecidable for timed games with three clocks.}
}
@proceedings{GDV06,
  editor = {Bouyer, Patricia and Madhusudan, P.},
  title = {Proceedings of the 3rd Workshop on Games in Design and Verification
		({GDV}'06)},
  booktitle = {Proceedings of the 3rd Workshop on Games in Design and Verification
		({GDV}'06)},
  address = {Seattle, Washington, USA},
  year = 2006,
  month = aug
}
@inproceedings{BBBL-atva06,
  address = {Beijing, China},
  month = oct,
  year = {2006},
  volume = 4218,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Graf, Susanne and Zhang, Wenhui},
  acronym = {{ATVA}'06},
  booktitle = {{P}roceedings of the 4th {I}nternational
               {S}ymposium on {A}utomated {T}echnology
               for {V}erification and {A}nalysis
               ({ATVA}'06)},
  author = {Bel{ }mokadem, Houda and B{\'e}rard, B{\'e}atrice and Bouyer, Patricia 
		 and Laroussinie, Fran{\c{c}}ois},
  title = {Timed temporal logics for abstracting transient states},
  pages = {337-351},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBL-atva06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBL-atva06.pdf},
  doi = {10.1007/11901914_26},
  abstract = {In previous work, the timed logic TCTL was extended with an
{"}almost everywhere{"} Until modality which abstracts negligible sets of
positions (i.e.,~with a null duration) along a run of a timed automaton. 
We~propose here an extension of this logic with more powerful modalities, in 
order to specify properties abstracting transient states, which are events
that last for less than k time units. Our main result is that modelchecking
is still decidable and PSPACE-complete for this extension. On the other
hand, a second semantics is defined, in which we consider the total duration
where the property does not hold along a run. In~this case, we prove that
model-checking is undecidable.}
}
@inproceedings{BBC-concur06,
  address = {Bonn, Germany},
  month = aug,
  year = 2006,
  volume = 4137,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Baier, Christel and Hermanns, Holger},
  acronym = {{CONCUR}'06},
  booktitle = {{P}roceedings of the 17th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'06)},
  author = {Bouyer, Patricia and Bozzelli, Laura and Chevalier, Fabrice},
  title = {Controller Synthesis for {MTL} Specifications},
  pages = {450-464},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBC-concur06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBC-concur06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBC-concur06.ps},
  doi = {10.1007/11817949_30},
  abstract = {We consider the control problem for timed automata
  against specifications given as MTL formulas. The logic MTL is a
  linear-time timed temporal logic which extends LTL with timing
  constraints on modalities, and recently, its model-checking has been
  proved decidable in several cases. We investigate these decidable
  fragments of MTL (full MTL when interpreted over finite timed
  words, and SafetyMTL when interpreted over infinite timed words),
  and prove two kinds of results. (1)~We first prove that,
  contrary to model-checking, the control problem is
  undecidable. Roughly, the computation of a lossy channel system
  could be encoded as a model-checking problem, and we prove here that
  a perfect channel system can be encoded as a control
  problem. (2)~We then prove that if we fix the resources
  of the controller (by resources we mean clocks and constants that
  the controller can use), the control problem becomes decidable. This
  decidability result relies on properties of well (and better)
  quasi-orderings.}
}
@article{BBLP-STTT05,
  publisher = {Springer},
  journal = {International Journal on Software Tools 
             for Technology Transfer},
  author = {Behrmann, Gerd and Bouyer, Patricia and Larsen, Kim G.
		   and Pel{\'a}nek, Radek},
  title = {Lower and Upper Bounds in Zone-Based Abstractions of 
		  Timed Automata},
  year = 2006,
  month = jun,
  pages = {204-215},
  number = 3,
  volume = 8,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBLP-STTT05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBLP-STTT05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBLP-STTT05.ps},
  doi = {10.1007/s10009-005-0190-0},
  abstract = {The semantics of timed automata is 
	defined using an infinite-state transition system. 
	For verification purposes, one usually uses zone 
	based abstractions w.r.t.~the maximal constants to 
	which clocks of the timed automaton are compared. 
	We show that by distinguishing maximal lower and 
	upper bounds, significantly coarser abstractions 
	can be obtained. We show soundness and 
	completeness of the new abstractions 
	w.r.t.~reachability. We demonstrate how 
	information about lower and upper bounds can be 
	used to optimise the algorithm for bringing a 
	difference bound matrix into normal form. Finally, 
	we experimentally demonstrate that the new 
	techniques dramatically increases the scalability 
	of the real-time model checker~{\scshape 
	Uppaal}.}
}
@article{BC06-beatcs,
  publisher = {European Association for 
                 Theoretical Computer Science},
  journal = {EATCS Bulletin},
  author = {Bouyer, Patricia and Chevalier, Fabrice},
  title = {On the Control of Timed and Hybrid Systems},
  volume = 89,
  year = {2006},
  month = jun,
  pages = {79-96},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BC-beatcs89.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BC-beatcs89.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BC-beatcs89.ps},
  abstract = {In this paper, we survey some of the results which have
	been obtained the last ten years on the control of hybrid and timed
	systems.}
}
@inproceedings{BBC-lics2006,
  address = {Seattle, Washington, USA},
  month = aug,
  year = 2006,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'06},
  booktitle = {{P}roceedings of the 21st
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'06)},
  author = {Bouyer, Patricia and Brihaye, {\relax Th}omas and 
		  Chevalier, Fabrice},
  title = {Control in o-Minimal Hybrid Systems},
  pages = {367-378},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBC-lics06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBC-lics06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBC-lics06.ps},
  doi = {10.1109/LICS.2006.22},
  abstract = {In this paper, we consider 
	the control of general hybrid systems. In 
	this context we show that time-abstract 
	bisimulation is not adequate for solving 
	such a problem. That is why we consider 
	an other equivalence, namely the suffix 
	equivalence based on the encoding of 
	trajectories through words. We show that 
	this suffix equivalence is in general a 
	correct abstraction for control problems. 
	We apply this result to o-minimal hybrid 
	systems, and get decidability and 
	computability results in this framework.}
}
@inproceedings{BLP-cav06,
  address = {Seattle, Washington, USA},
  month = aug,
  year = 2006,
  volume = 4144,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Ball, {\relax Th}omas and Jones, Robert B.},
  acronym = {{CAV}'06},
  booktitle = {{P}roceedings of the 18th
               {I}nternational {C}onference on 
               {C}omputer {A}ided {V}erification
               ({CAV}'06)},
  author = {Bardin, S{\'e}bastien and Leroux, J{\'e}r{\^o}me and Point, G{\'e}rald},
  title = {{FAST} {E}xtended {R}elease},
  pages = {63-66},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLP-cav06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLP-cav06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BLP-cav06.ps},
  doi = {10.1007/11817963_9},
  abstract = {{\scshape Fast} is a tool designed for the analysis of
counter systems, \emph{i.e.}~automata extended with unbounded integer variables.
Despite the reachability set is not recursive in general, Fast implements
several innovative techniques such as acceleration and circuit selection to
solve this problem in practice. In its latest version, the tool is built upon
an open architecture: the Presburger library is manipulated through a clear
and convenient interface, thus any Presburger arithmetics package can be
plugged to the tool. We provide four implementations of the interface using
Lash, Mona, Omega and a new shared automata package with computation cache.
Finally new features are available, like different acceleration algorithms.}
}
@inproceedings{BFLS-avis06,
  address = {Vienna, Austria},
  month = apr,
  year = 2006,
  editor = {Bharadwaj, Ramesh},
  acronym = {{AVIS}'06},
  booktitle = {{P}roceedings of the 5th {I}nternational
               {W}orkshop on {A}utomated {V}erification
               of {I}nfinite-{S}tate {S}ystems
               ({AVIS}'06)},
  author = {Bardin, S{\'e}bastien and Finkel, Alain and Lozes, {\'E}tienne
		 and Sangnier, Arnaud},
  title = {From Pointer Systems to Counter Systems Using Shape Analysis},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFLS-AVIS-06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFLS-AVIS-06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BFLS-AVIS-06.ps},
  abstract = {We aim at checking safety properties on systems 
	manipulating dynamic linked lists. First we prove that every 
	pointer system is bisimilar to an effectively constructible 
	counter system. We then deduce a two-step analysis procedure. 
	We first build an over-approximation of the reachability set 
	of the pointer system. If this over-approximation is too 
	coarse to conclude, we then extract from it a bisimilar 
	counter system which is analyzed via efficient symbolic 
	techniques developed for general counter systems.}
}
@inproceedings{edos2006wsl,
  address = {Porto Allegre, Brazil},
  month = apr,
  year = 2006,
  editor = {Berger, Olivier},
  acronym = {{IWFS}'06},
  booktitle = {{P}roceedings of the {I}nternational
           {W}orkshop on {F}ree {S}oftware
           ({IWFS}'06)},
  author = {Boender, Jaap and Di Cosmo, Roberto and Durak, Berke and Leroy, Xavier
            and Mancinelli, Fabio and Morgado, Mario and Pinheiro, David and
	   Treinen, Ralf and  Trezentos, Paulo and Vouillon, J{\'e}r{\^o}me},
  title = {News from the {EDOS} project: improving the maintenance of free
               software distributions},
  pages = {199-207},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/wsl06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/wsl06.pdf},
  abstract = {The EDOS research project aims 
	at contributing to the quality assurance of free software 
	distributions. This is a major technical and engineering 
	challenge, due to the size and complexity of these 
	distributions (tens of thousands of software packages). We 
	present here some of the challenges that we have tackled so 
	far, and some of the advanced tools that are already 
	available to the community as an outcome of the first year 
	of work. }
}
@inproceedings{edos2006ase,
  address = {Tokyo, Japan},
  month = sep,
  year = 2006,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{ASE}'06},
  booktitle = {{P}roceedings of the 21st {IEEE}/{ACM} {I}nternational
           {C}onference on {A}utomated {S}oftware {E}ngineering
           ({ASE}'06)},
  author = {Mancinelli, Fabio and Boender, Jaap and Di Cosmo, Roberto and
            Vouillon, J{\'e}r{\^o}me and Durak, Berke and Leroy, Xavier 
	    and Treinen, Ralf},
  title = {Managing the Complexity of Large Free and Open Source
           Package-Based Software Distributions},
  pages = {199-208},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/edos-ase06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/edos-ase06.pdf},
  doi = {10.1109/ASE.2006.49},
  abstract = {The widespread adoption of Free and Open Source Software~(FOSS)
in many strategic contexts of the information technology society has drawn the
attention on the issues regarding how to handle the complexity of assembling
and managing a huge number of (packaged) components in a consistent and
effective~way. FOSS~distributions (and~in particular GNU\slash Linux-based~ones)
have always provided tools for managing the tasks of installing, removing and
upgrading the (packaged) components they were made~of. While these tools
provide a (not always effective) way to handle these tasks on the client side,
there is still a lack of tools that could help the distribution editors to
maintain, on the server side, large and high-quality distributions. In~this
paper we present our research whose main goal is to fill this gap: we~show our
approach, the tools we have developed and their application with experimental
results. Our~contribution provides an effective and automatic way to support
distribution editors in handling those issues that were, until now, mostly
addressed using ad-hoc tools and manual techniques.}
}
@inproceedings{BKSS-tacas06,
  address = {Vienna, Austria},
  month = mar,
  year = 2006,
  volume = {3920},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Hermanns, Holger and Palsberg, Jens},
  acronym = {{TACAS}'06},
  booktitle = {{P}roceedings of the 12th {I}nternational 
               {C}onference on {T}ools and {A}lgorithms for
               {C}onstruction and {A}nalysis of {S}ystems
               ({TACAS}'06)},
  author = {Bollig, Benedikt and Kern, Carsten and 
		 Schl{\"u}tter, Markus and Stolz, Volker},
  title = {{MSC}an: A Tool for Analyzing {MSC} Specifications},
  pages = {455-458},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MSCan.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MSCan.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MSCan.ps},
  doi = {10.1007/11691372_32},
  abstract = {We present the tool MSCan, which supports MSC-based 
  system development. In particular, it automatically checks 
  high-level MSC specifications for implementability.}
}
@article{BBM-ipl06,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Bouyer, Patricia and Brihaye, {\relax Th}omas and
                Markey, Nicolas},
  title = {Improved Undecidability Results on Weighted Timed
                 Automata},
  year = 2006,
  month = jun,
  volume = 98,
  number = 5,
  pages = {188-194},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/IPL-BBM06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/IPL-BBM06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/IPL-BBM06.ps},
  doi = {10.1016/j.ipl.2006.01.012},
  abstract = {In this paper, we improve two recent undecidability
        results of Brihaye, Bruy{\`e}re and Raskin about
        weighted timed automata, an extension of timed automata with a
        cost variable. Our results rely on a new encoding of the two
        counters of a Minsky machine that only require three clocks and 
	one stopwatch cost, while previous reductions required five clocks 
	and one stopwatch cost.}
}
@inproceedings{BBS-lpar06,
  address = {Phnom Penh, Cambodia},
  month = nov,
  year = 2006,
  volume = 4246,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer},
  editor = {Hermann, Miki and Voronkov, Andrei},
  acronym = {{LPAR}'06},
  booktitle = {{P}roceedings of the 13th {I}nternational
               {C}onference on {L}ogic for {P}rogramming,
               {A}rtificial {I}ntelligence, and {R}easoning
               ({LPAR}'06)},
  author = {Baier, Christel and Bertrand, Nathalie and
                   Schnoebelen, {\relax Ph}ilippe},
  title = {On Computing Fixpoints in Well-Structured Regular Model
		Checking, with Applications to Lossy Channel Systems},
  pages = {347-361},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBS-lpar06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBS-lpar06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBS-lpar06.ps},
  doi = {10.1007/11916277_24},
  abstract = {We prove a general finite convergence theorem for
{"}upward-guarded{"} fixpoint expressions over a well-quasi-ordered~set. This
has immediate applications in regular model checking of well-structured
systems, where a main issue is the eventual convergence of fixpoint
computations. In~particular, we are able to directly obtain several new
decidability results on lossy channel systems.}
}
@article{BBS-ipl05,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Baier, Christel and Bertrand, Nathalie and
                   Schnoebelen, {\relax Ph}ilippe},
  title = {A note on the attractor-property of infinite-state {M}arkov chains},
  year = 2006,
  month = jan,
  number = 2,
  volume = 97,
  pages = {58-63},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/IPL-BBS.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/IPL-BBS.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/IPL-BBS.ps},
  doi = {10.1016/j.ipl.2005.09.011},
  abstract = {In the past five years, a series of verification algorithms
                  has been proposed for infinite Markov chains that have a
                  finite attractor, \emph{i.e.}, a set that will be visited
                  infinitely often almost surely starting from any state. \par
                  In this paper, we establish a sufficient criterion for
                  the existence of an attractor. We show that if the states
                  of a Markov chain can be given levels (positive integers)
                  such that the expected next level for states at some
                  level \(n > 0\) is less than \(n-\Delta\) for some positive
                  \(\Delta\), then the states at level~\(0\) constitute an
                  attractor for the chain. As an application, we obtain a
                  direct proof that some probabilistic channel systems
                  combining message losses with duplication and insertion
                  errors have a finite attractor.}
}
@inproceedings{BG-lpar06,
  address = {Phnom Penh, Cambodia},
  month = nov,
  year = 2006,
  volume = 4246,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer},
  editor = {Hermann, Miki and Voronkov, Andrei},
  acronym = {{LPAR}'06},
  booktitle = {{P}roceedings of the 13th {I}nternational
               {C}onference on {L}ogic for {P}rogramming,
               {A}rtificial {I}ntelligence, and {R}easoning
               ({LPAR}'06)},
  author = {Bozzelli, Laura and Gascon, R{\'e}gis},
  title = {Branching Time Temporal Logic Extended with {P}resburger Constraints},
  pages = {197-211},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BG-LPAR06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BG-LPAR06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BG-LPAR06.ps},
  doi = {10.1007/11916277_14},
  abstract = {Recently, \(\mathrm{LTL}\) extended with atomic formulas built
over a constraint language interpreting variables in~\(\mathbb{Z}\) has been
shown to have a decidable satisfiability and model-checking problem.
This~language allows to compare the variables at different states of the model
and include periodicity constraints, comparison constraints, and a restricted
form of quantification. On the other hand, the \(\mathrm{CTL}\) counterpart of
this logic (and hence also its \(\mathrm{CTL}^{*}\) counterpart which subsumes
both \(\mathrm{LTL}\) and~\(\mathrm{CTL}\)) has an undecidable model-checking
problem. In~this paper, we substantially extend the decidability border, by
considering a meaningful fragment of \(\mathrm{CTL}^{*}\) extended with such
constraints (which subsumes both the universal and existential fragments, as
well as the \(\mathrm{EF}\)-like fragment) and show that satisfiability and
model-checking over relational automata that are abstraction of counter
machines are decidable. The~correctness and the termination of our algorithm
rely on a suitable well quasi-ordering defined over the set of variable
valuations.}
}
@misc{chevalier-prefsttcs06,
  author = {Chevalier, Fabrice},
  title = {Decision procedures for timed logics},
  year = 2006,
  month = dec,
  howpublished = {Invited talk, Advances and Issues in Timed Systems,
                  Kolkata, India}
}
@misc{gastin-prefsttcs06,
  author = {Gastin, Paul},
  title = {Refinements and Abstractions of Signal-Event (Timed) Languages},
  year = 2006,
  month = dec,
  howpublished = {Invited talk, Advances and Issues in Timed Systems,
                  Kolkata, India}
}
@misc{gastin-wata06,
  author = {Gastin, Paul},
  title = {Weigthed logics and weighted automata},
  year = 2006,
  month = mar,
  howpublished = {Invited talk, Workshop Weighted Automata: Theory and Applications,
		Leipzig, Germany}
}
@misc{gastin-epit06,
  author = {Gastin, Paul},
  title = {Distributed synthesis: synchronous and asynchronous semantics},
  year = 2006,
  month = may,
  howpublished = {Invited talk, 34{\`e}me {\'E}cole de Printemps en 
		Informatique Th{\'e}orique, Ile de R{\'e}, France}
}
@misc{gastin-mfps22,
  author = {Gastin, Paul},
  title = {Refinements and Abstractions of Signal-Event (Timed) Languages},
  year = 2006,
  month = may,
  howpublished = {Invited talk, 22nd {C}onference on 
        {M}athematical {F}oundations of {P}rogramming 
        {S}emantics ({MFPS}'06)}
}
@inproceedings{Bouyer-MFPS22,
  address = {Genova, Italy},
  month = may,
  year = 2006,
  volume = 158,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Brookes, Steve and Mislove, Michael},
  acronym = {{MFPS}'06},
  booktitle = {{P}roceedings of the 22nd {C}onference on 
	{M}athematical {F}oundations of {P}rogramming 
	{S}emantics ({MFPS}'06)},
  author = {Bouyer, Patricia},
  title = {Weighted Timed Automata: {M}odel-Checking and Games},
  pages = {3-17},
  note = {Invited paper},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bouyer-mfps06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bouyer-mfps06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/bouyer-mfps06.ps},
  doi = {10.1016/j.entcs.2006.04.002},
  abstract = {In this paper, we present weighted\slash priced 
	timed automata, an extension of timed automaton with 
	costs, and solve several interesting problems on that model.}
}
@article{bid-hen-JLAP-2005,
  publisher = {Elsevier Science Publishers},
  journal = {Journal of Logic and Algebraic Programming},
  author = {Bidoit, Michel and Hennicker, Rolf},
  title = {Constructor-Based Observational Logic},
  year = {2006},
  month = apr # {-} # may,
  number = {1-2},
  volume = 67,
  pages = {3-51},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BID-HEN-JLAP.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BID-HEN-JLAP.pdf},
  doi = {10.1016/j.jlap.2005.09.002},
  abstract = {This paper focuses on the integration of reachability and
observability concepts within an algebraic,
institution-based framework. In the first part of this work,  
we develop the essential ingredients that are needed to define the 
constructor-based observational logic institution, called
COL, which takes into account both 
the generation- and observation-oriented aspects of software systems. The 
underlying paradigm of our approach is that the semantics of a specification should be as
loose as possible to capture all its correct realizations. We also consider the {"}black
box{"} semantics of a specification which is useful to study the behavioral properties
a user can observe when he\slash she is experimenting with the system.\par
   In the second part of this work, we develop proof techniques for structured
COL-specifications. For this purpose we introduce an
institution encoding from the COL 
institution to the institution of many-sorted first-order logic with equality
and sort-generation constraints. Using this institution
encoding, we can then reduce proofs of 
consequences of structured specifications built over COL to proofs of consequences
of structured specifications written in a simple subset of the algebraic specification
language {\scshape Casl}. This means, in particular, that any inductive theorem prover, such
as \emph{e.g.} the Larch Prover or PVS, can be used to prove theorems over structured
COL-specifications.}
}
@inproceedings{BH-Goguen06,
  address = {San Diego, California, USA},
  month = jun,
  year = 2006,
  volume = 4060,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Futatsugi, Kokichi and Jouannaud, Jean-Pierre and 
	   Meseguer, Jos{\'e}},
  acronym = {{A}lgebra, {M}eaning and {C}omputation},
  booktitle = {{A}lgebra, {M}eaning and {C}omputation~--- Essays dedicated to 
	   Joseph~A.~Goguen on the Occasion of His 65th~Birthday},
  author = {Bidoit, Michel and Hennicker, Rolf},
  title = {Proving Behavioral Refinements of {COL}-Specifications},
  pages = {333-354},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BH-Goguen06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BH-Goguen06.pdf},
  doi = {10.1007/11780274_18},
  abstract = {The COL institution (constructor-based 
	observational logic) has been introduced as a formal 
	framework to specify both generation- and 
	observation-oriented properties of software systems. In 
	this paper we consider behavioral refinement relations 
	between COL-specifications taking into account 
	implementation constructions. We propose a general 
	strategy for proving the correctness of such 
	refinements by reduction to (standard) first-order 
	theorem proving with induction. Technically our 
	strategy relies on appropriate proof rules and on a 
	lifting construction to encode the reachability and 
	observability notions of the COL institution.}
}
@inproceedings{BHR06-acsd,
  address = {Turku, Finland},
  month = jun,
  year = 2006,
  publisher = {{IEEE} Computer Society Press},
  editor = {Goossens, Kees and Petrucci, Laure},
  acronym = {{ACSD}'06},
  booktitle = {{P}roceedings of the 6th {I}nternational
               {C}onference on {A}pplication of {C}oncurrency
               to {S}ystem {D}esign
               ({ACSD}'06)},
  author = {Bouyer, Patricia and Haddad, Serge and 
                  Reynier, Pierre-Alain},
  title = {Extended Timed Automata and Time {P}etri Nets},
  pages = {91-100},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2006-01.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2006-01.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
        rr-lsv-2006-01.ps},
  doi = {10.1109/ACSD.2006.6},
  abstract = {Timed Automata (TA) and Time Petri Nets (TPN) are two
 well-established formal models for real-time systems. Recently, a
 linear transformation of TA to TPNs preserving reachability
 properties and timed languages has been proposed, which does however
 not extend to larger classes of TA which would allow diagonal
 constraints or more general resets of clocks. Though these features
 do not add expressiveness, they yield exponentially more concise
 models. \par
 In this work, we propose two translations: one from extended TA to
 TPNs whose size is either linear or quadratic in the size of the
 original TA, depending on the features which are allowed; another
 one from a parallel composition of TA to TPNs, which is also linear.
 As a consequence, we get that TPNs are exponentially more concise
 than~TA.}
}
@inproceedings{BHR-ICALP2006,
  address = {Venice, Italy},
  month = jul,
  year = 2006,
  volume = 4052,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Buglesi, Michele and Preneel, Bart and Sassone, Vladimiro and Wegener, Ingo},
  acronym = {{ICALP}'06},
  booktitle = {{P}roceedings of the 33rd {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming ({ICALP}'06)~--- {P}art~{II}},
  author = {Bouyer, Patricia and Haddad, Serge and Reynier, Pierre-Alain},
  title = {Timed {P}etri Nets and Timed Automata: On the Discriminating Power of
            {Z}eno Sequences},
  pages = {420-431},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-icalp06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-icalp06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BHR-icalp06.ps},
  doi = {10.1007/11787006_36},
  abstract = {Timed Petri nets and timed 
	automata are two standard models for the 
	analysis of real-time systems. In this 
	paper, we prove that they are incomparable 
	for the timed language equivalence. Thus we 
	propose an extension of timed Petri nets 
	with read-arcs~(RA-TdPN), whose coverability 
	problem is decidable. We also show that this 
	model unifies timed Petri nets and timed 
	automata. Then, we establish numerous 
	expressiveness results and prove that Zeno 
	behaviours discriminate between several 
	sub-classes of RA-TdPNs. This has surprising 
	consequences on timed automata, 
	\emph{e.g.}~on the power of 
	non-deterministic clock resets.}
}
@inproceedings{BHR-atva06,
  address = {Beijing, China},
  month = oct,
  year = {2006},
  volume = 4218,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Graf, Susanne and Zhang, Wenhui},
  acronym = {{ATVA}'06},
  booktitle = {{P}roceedings of the 4th {I}nternational
               {S}ymposium on {A}utomated {T}echnology
               for {V}erification and {A}nalysis
               ({ATVA}'06)},
  author = {Bouyer, Patricia and Haddad, Serge and Reynier, Pierre-Alain},
  title = {Timed Unfoldings for Networks of Timed Automata},
  pages = {292-306},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-atva06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-atva06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BHR-atva06.ps},
  doi = {10.1007/11901914_23},
  abstract = {Whereas partial order methods have proved their efficiency for
the analysis of discrete-event systems, their application to
timed systems remains a challenging research topic. Here, we
design a verification algorithm for networks of timed automata
with invariants. Based on the unfolding technique, our method
produces a branching process as an acyclic Petri net extended
with read arcs. These arcs verify conditions on tokens without
consuming them, thus expressing concurrency between conditions
checks. They are useful for avoiding the explosion of the size
of the unfolding due to clocks which are compared with constants
but not reset. Furthermore, we attach zones to events, in addition
to markings. We~then compute a complete finite prefix of the
unfolding. The~presence of invariants goes against the concurrency
since it entails a global synchronization on time. The use of read
arcs and the analysis of the clock constraints appearing in
invariants will help increasing the concurrency relation between
events. Finally, the finite prefix we compute can be used to decide
reachability properties, and transition enabling.}
}
@incollection{BL-VAT06,
  author = {Bouyer, Patricia and Laroussinie, Fran{\c{c}}ois},
  title = {V{\'e}rification par automates temporis{\'e}s},
  booktitle = {Syst{\`e}mes temps-r{\'e}el~1~: techniques de description 
		et de v{\'e}rification},
  editor = {Navet, Nicolas},
  publisher = {Herm{\`e}s},
  year = 2006,
  month = jun,
  pages = {121-150},
  url = {http://www.lavoisier.fr/fr/livres/index.asp?texte=2746213030&select=isbn&from=Hermes},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BL-VAT06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BL-VAT06.ps},
  isbn = {2-7462-1303-6}
}
@inproceedings{BMR-latin06,
  address = {Valdivia, Chile},
  month = mar,
  year = 2006,
  volume = 3887,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Correa, Jose R. and Hevia, Alejandro and Kiwi, Marcos},
  acronym = {{LATIN}'06},
  booktitle = {{P}roceedings of the 7th {L}atin {A}merican
               {S}ymposium on {T}heoretical {I}nformatics
               ({LATIN}'06)},
  author = {Bouyer, Patricia and Markey, Nicolas and Reynier, Pierre-Alain},
  title = {Robust Model-Checking of Linear-Time Properties in Timed Automata},
  pages = {238-249},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BMR-latin06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BMR-latin06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BMR-latin06.ps},
  doi = {10.1007/11682462_25},
  abstract = {Formal verification of timed systems 
	is well understood, but their 
	\emph{implementation} is still challenging. Recent 
	works by Raskin \emph{et al.} have brought out a 
	model of parameterized timed automata that can be 
	used to prove \emph{implementability} of timed 
	systems for safety properties. We define here a 
	more general notion of robust model-checking for 
	linear-time properties, which consists in 
	verifying whether a property still holds even if 
	the transitions are slightly delayed or expedited. 
	We provide PSPACE algorithms for the robust 
	model-checking of B{\"u}chi-like and LTL 
	properties. We also verify bounded-response-time 
	properties. }
}
@book{Bollig06,
  author = {Bollig, Benedikt},
  title = {Formal Models of Communicating Systems~--- Languages, Automata, 
		and Monadic Second-Order Logic},
  year = {2006},
  month = jun,
  publisher = {Springer},
  isbn = {3-540-32922-6},
  otherurl = {http://www.springer.com/978-3-540-32922-6},
  url = {http://www.lsv.ens-cachan.fr/~bollig/fmcs/},
  abstract = {This book studies the relationship between automata and 
monadic second-order logic, focusing on classes of automata that 
describe the concurrent behavior of distributed systems.\par
It provides a unifying theory of communicating automata and their 
logical properties. Based on Hanf's Theorem and Thomas's graph 
acceptors, it develops a result that allows us to characterize many 
popular models of distributed computation in terms of the existential 
fragment of monadic second-order logic. In particular, the book covers 
finite automata, asynchronous (cellular) automata, communicating 
finite-state machines, and lossy channel systems. Model behavior is 
described using graphs and partial orders, leading to the notions of 
Mazurkiewicz traces, message sequence charts, and live sequence 
charts.\par
This book is suitable for senior undergraduate and graduate courses on 
advanced automata theory, concurrency and communication issues. It can 
also be used as a reference by researchers concerned with the formal 
modeling of concurrent systems. Some knowledge of automata theory is a 
prerequisite. Numerous exercises, chapter summaries, and suggested 
reading allow for self-study, while the book is supported with a website 
containing course material and solutions.}
}
@inproceedings{BS05-express,
  address = {San Francisco, California, USA},
  month = jul,
  year = 2006,
  number = 3,
  volume = 154,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Baeten, Jos and Phillips, Iain},
  acronym = {{EXPRESS}'05},
  booktitle = {{P}roceedings of the 12th {I}nternational
               {W}orkshop on {E}xpressiveness in
               {C}oncurrency
               ({EXPRESS}'05)},
  author = {Bertrand, Nathalie and Schnoebelen, {\relax Ph}ilippe},
  title = {A short visit to the {STS} hierarchy},
  pages = {59-69},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BS05-express.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BS05-express.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BS05-express.ps},
  doi = {10.1016/j.entcs.2006.05.007},
  abstract = {The hierarchy of Symbolic 
	Transition Systems, introduced by Henzinger,
	Majumdar and Raskin, is an elegant 
	classification  
	tool for some families of infinite-state
	operational models that support some variants of 
	a symbolic {"}backward closure{"}
	verification algorithm. It was first used and 
	illustrated with families of hybrid 
	systems.\par 
	  In this paper we investigate whether the STS 
	hierarchy can account for classical
	families of infinite-state systems outside of 
	timed or hybrid systems.}
}
@inproceedings{TED-hldvt06,
  address = {Monterey, California, USA},
  month = nov,
  year = 2006,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{HLDVT}'06},
  booktitle = {{P}roceedings of the {IEEE} {H}igh {L}evel {D}esign 
		 {V}erification and {T}est Workshop ({HLDVT}'06)},
  author = {Taktak, Sami and Encrenaz, Emmanuelle and Desbarbieux, Jean-Lou},
  title = {A Tool for Automatic Detection of Deadlock in Wormhole Networks
	on Chip},
  pages = {203-210},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/TED-hldvt06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/TED-hldvt06.pdf},
  doi = {10.1109/HLDVT.2006.319992},
  abstract = {We present an extension of Duato's necessary and
sufficient condition a routing function must satisfy in order to
be deadlock-free, to support environment constraints inducing
extra-dependencies between messages. We also present an original
algorithm to automatically check the deadlock-freeness of a
network with a given routing function. A~prototype tool has
been developed and automatic deadlock checking of large scale
networks with various routing functions have been successfully
achieved.}
}
@inproceedings{BE-rsp06,
  address = {Chania, Crete},
  month = jun,
  year = 2006,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{RSP}'06},
  booktitle = {{P}roceedings of the 17th {I}nternational {W}orkshop
           on {R}apid {S}ystem {P}rototyping ({RSP}'06)},
  author = {Braunstein, C{\'e}cile and Encrenaz, Emmanuelle},
  title = {Formalizing the incremental design and verification process of
		a pipelined protocol converter},
  pages = {103-109},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BE-rsp06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BE-rsp06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BE-rsp06.ps},
  doi = {10.1109/RSP.2006.19},
  abstract = {This work studies the relations between pipeline 
	architectures and their specification expressed in~CTL. We 
	propose a method to build pipeline structures incrementally
	from a simple one (already verified) to a more complex one.
	Moreover, we show how each increment can be integrated
	in a CTL specification. We define increments to model 
	treatment delay and treatment abortion of a pipeline flow, and
	we formalize the composition of the different increments. In
	order to represent the increments added to an architecture,
	we derive a set of CTL formulae transformations. Finally
	we model a control flow of a protocol converter by 
	composition of these increments. We show how CTL properties
	of the complex architecture are built by applying automatic
	transformations on the set of CTL properties of the simplest
	architecture.}
}
@inproceedings{GSZ-fsttcs2006,
  address = {Kolkata, India},
  month = dec,
  year = 2006,
  volume = 4337,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Garg, Naveen and Arun-Kumar, S.},
  acronym = {{FSTTCS}'06},
  booktitle = {{P}roceedings of the 26th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'06)},
  author = {Gastin, Paul and Sznajder, Nathalie and Zeitoun, Marc},
  title = {Distributed synthesis for well-connected architectures},
  pages = {321-332},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GSZ-fsttcs2006.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GSZ-fsttcs2006.pdf},
  doi = {10.1007/11944836_30},
  abstract = {We study the synthesis problem for external linear or branching
specifications and distributed, synchronous architectures with arbitrary
delays on processes. External means that the specification only relates input
and output variables. We~introduce the subclass of uniformly
well-connected~(UWC) architectures for which there exists a routing allowing
each output process to get the values of all inputs it is connected to, as
soon as possible. We~prove that the distributed synthesis problem is decidable
on UWC architectures if and only if the set of all sets of input variables
visible by output variables is totally ordered, under set inclusion. We~also
show that if we extend this class by letting the routing depend on the output
process, then the previous decidability result fails. Finally, we provide a
natural restriction on specifications under which the whole class of~UWC
architectures is decidable.}
}
@proceedings{AB-lncs4202,
  title = {{P}roceedings of the 4th {I}nternational {C}onference
           on {F}ormal {M}odelling and {A}nalysis of {T}imed
           {S}ystems ({FORMATS}'06)},
  booktitle = {{P}roceedings of the 4th {I}nternational {C}onference
           on {F}ormal {M}odelling and {A}nalysis of {T}imed
           {S}ystems ({FORMATS}'06)},
  editor = {Asarin, Eug{\`e}ne and Bouyer, Patricia},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = 4202,
  year = 2006,
  month = sep,
  address = {Paris, France},
  isbn = {3-540-45026-2},
  url = {http://www.springer.com/978-3-540-45026-2},
  doi = {10.1007/11867340}
}
@inproceedings{BGP1-formats06,
  address = {Paris, France},
  month = sep,
  year = 2006,
  volume = 4202,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Asarin, Eug{\`e}ne and Bouyer, Patricia},
  acronym = {{FORMATS}'06},
  booktitle = {{P}roceedings of the 4th {I}nternational {C}onference
           on {F}ormal {M}odelling and {A}nalysis of {T}imed
           {S}ystems ({FORMATS}'06)},
  author = {B{\'e}rard, B{\'e}atrice and Gastin, Paul and Petit, Antoine},
  title = {Refinements and abstractions of signal-event (timed) languages},
  pages = {67-81},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGP1-formats06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGP1-formats06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BGP1-formats06.ps},
  doi = {10.1007/11867340_6},
  abstract = {In the classical framework of formal languages, a refinement
operation is modeled by a substitution and an abstraction by an inverse
substitution. These mechanisms have been widely studied, because they describe
a change in the specification level, from an abstract view to a more concrete
one, or conversely. For~timed systems, there is up to now no uniform notion of
substitutions. In~this paper, we study the timed substitutions in the general
framework of signal-event languages, where both signals and events are taken
into account. We~prove that regular signal-event languages are closed under
substitutions and inverse substitutions. }
}
@inproceedings{BGP2-formats06,
  address = {Paris, France},
  month = sep,
  year = 2006,
  volume = 4202,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Asarin, Eug{\`e}ne and Bouyer, Patricia},
  acronym = {{FORMATS}'06},
  booktitle = {{P}roceedings of the 4th {I}nternational {C}onference
           on {F}ormal {M}odelling and {A}nalysis of {T}imed
           {S}ystems ({FORMATS}'06)},
  author = {B{\'e}rard, B{\'e}atrice and Gastin, Paul and Petit, Antoine},
  title = {Intersection of regular signal-event (timed) languages},
  pages = {52-66},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGP2-formats06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGP2-formats06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BGP2-formats06.ps},
  doi = {10.1007/11867340_5},
  abstract = {We propose in this paper a construction for a {"}well known{"}
result: regular signal-event languages are closed by intersection. In~fact,
while this result is indeed trivial for languages defined by Alur and Dill's
timed automata (the proof is an immediate extension of the one in the untimed
case), it turns out that the construction is much more tricky when considering
the most involved model of signal-event automata. While several constructions
have been proposed in particular cases, it is the first time, up to our
knowledge, that a construction working on finite and infinite signal-event
words and taking into account signal stuttering, unobservability of
zero-duration \(\tau\)-signals and Zeno runs is proposed.}
}
@inproceedings{CDP-fsttcs2006,
  address = {Kolkata, India},
  month = dec,
  year = 2006,
  volume = 4337,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Garg, Naveen and Arun-Kumar, S.},
  acronym = {{FSTTCS}'06},
  booktitle = {{P}roceedings of the 26th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'06)},
  author = {Chevalier, Fabrice and D'Souza, Deepak and Prabhakar, Pavithra},
  title = {On continuous timed automata with input-determined guards},
  pages = {369-380},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDP-fsttcs06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDP-fsttcs06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CDP-fsttcs06.ps},
  doi = {10.1007/11944836_34},
  abstract = {We consider a general class of timed automata parameterized by a
  set of {"}input-determined{"} operators, in a continuous time setting. We show
  that for any such set of operators, we have a monadic second order logic
  characterization of the class of timed languages accepted by the corresponding
  class of automata. Further, we consider natural timed temporal logics based on
  these operators, and show that they are expressively equivalent to the
  first-order fragment of the corresponding MSO logics. As~a~corollary of these
  general results we obtain an expressive completeness result for the continuous
  version of MTL.}
}
@inproceedings{CKKW-fsttcs2006,
  address = {Kolkata, India},
  month = dec,
  year = 2006,
  volume = 4337,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Garg, Naveen and Arun-Kumar, S.},
  acronym = {{FSTTCS}'06},
  booktitle = {{P}roceedings of the 26th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'06)},
  author = {Cortier, V{\'e}ronique and Kremer, Steve and 
		 K{\"u}sters, Ralf and Warinschi, Bogdan},
  title = {Computationally Sound Symbolic Secrecy in the Presence of Hash Functions},
  pages = {176-187},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CKKW-fsttcs06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CKKW-fsttcs06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CKKW-fsttcs06.ps},
  doi = {10.1007/11944836_18},
  abstract = {The standard symbolic, deducibility-based notions of secrecy are
in general insufficient from a cryptographic point of view, especially in
presence of hash functions. In~this paper we devise and motivate a more
appropriate secrecy criterion which exactly captures a standard cryptographic
notion of secrecy for protocols involving public-key enryption and hash
functions: protocols that satisfy it are computationally secure while any
violation of our criterion directly leads to an attack. Furthermore, we prove
that our criterion is decidable via an NP decision procedure. Our~results hold
for standard security notions for encryption and hash functions modeled as
random oracles.}
}
@article{CDL05-survey,
  publisher = {{IOS} Press},
  journal = {Journal of Computer Security},
  author = {Cortier, V{\'e}ronique and Delaune, St{\'e}phanie
                 and Lafourcade, Pascal},
  title = {A Survey of Algebraic Properties Used in Cryptographic
                 Protocols},
  year = {2006},
  volume = 14,
  number = 1,
  pages = {1-43},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/surveyCDL.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/surveyCDL.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/surveyCDL.ps},
  abstract = {Cryptographic protocols are 
	successfully analyzed using formal methods. 
	However, formal approaches usually consider the 
	encryption schemes as black boxes and assume that 
	an adversary cannot learn anything from an 
	encrypted message except if he has the key. Such an 
	assumption is too strong in general since some 
	attacks exploit in a clever way the interaction 
	between protocol rules and properties of 
	cryptographic operators. Moreover, the executability of some 
	protocols relies explicitly on some algebraic 
	properties of cryptographic primitives such as 
	commutative encryption. We give a list of some 
	relevant algebraic properties of cryptographic 
	operators, and for each of them, we provide 
	examples of protocols or attacks using these 
	properties. We also give an overview of the 
	existing methods in formal approaches for analyzing 
	cryptographic protocols.}
}
@inproceedings{CEFX-formats06,
  address = {Paris, France},
  month = sep,
  year = 2006,
  volume = 4202,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Asarin, Eug{\`e}ne and Bouyer, Patricia},
  acronym = {{FORMATS}'06},
  booktitle = {{P}roceedings of the 4th {I}nternational {C}onference
           on {F}ormal {M}odelling and {A}nalysis of {T}imed
           {S}ystems ({FORMATS}'06)},
  author = {Chevallier, R{\'e}my and Encrenaz{-}Tiph{\`e}ne, Emmanuelle and
		  Fribourg, Laurent and Xu, Weiwen},
  title = {Verification of the Generic Architecture of a Memory Circuit Using 
		  Parametric Timed Automata},
  pages = {113-127},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CEFX-formats06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CEFX-formats06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CEFX-formats06.ps},
  econtrat = {MEDEA+ Blueberries},
  doi = {10.1007/11867340_9},
  abstract = {Using a variant of Clariso-Cortadella's parametric method
for verifying asynchronous circuits, we formally derive a set of linear
constraints that ensure the correctness of some crucial timing behaviours
of the architecture of SPSMALL memory. This allows us to check two
different implementations of this architecture.}
}
@article{CEFX-wseas06,
  publisher = {World Scientific and Engineering Academy and Society},
  journal = {WSEAS Transactions on Circuits and Systems},
  author = {Chevallier, R{\'e}my and Encrenaz{-}Tiph{\`e}ne, Emmanuelle and
		  Fribourg, Laurent and Xu, Weiwen},
  title = {Timing analysis of an embedded memory: {SPSMALL}},
  pages = {973-978},
  volume = 5,
  number = 7,
  year = 2006,
  month = jul,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CEFX-wseas06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CEFX-wseas06.pdf},
  abstract = {This paper proposes a high-level formalism, called
    Abstract Functional and Timing Graph~(AFTG), for describing a memory
    architecture, which combines logical functionality and timing. After
    translation of the~AFTG into the form a timed automaton, we are able to
    compute the response times of the modeled memory, and check their consistency
    with the values specified in the datasheet. We also address the problem of
    finding optimal values of setup timings.}
}
@inproceedings{DDFG-atva06,
  address = {Beijing, China},
  month = oct,
  year = {2006},
  volume = 4218,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Graf, Susanne and Zhang, Wenhui},
  acronym = {{ATVA}'06},
  booktitle = {{P}roceedings of the 4th {I}nternational
               {S}ymposium on {A}utomated {T}echnology
               for {V}erification and {A}nalysis
               ({ATVA}'06)},
  author = {Demri, St{\'e}phane and Finkel, Alain
		and Goranko, Valentin and van Drimmelen, Govert},
  title = {Towards a model-checker for counter systems},
  pages = {493-507},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DDFG-atva06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DDFG-atva06.pdf},
  doi = {10.1007/11901914_36},
  abstract = {This paper deals with model-checking of fragments and extensions
of~\(\mathrm{CTL}^{*}\) on infinite-state Presburger counter systems, where
the states are vectors of integers and the transitions are determined by means
of relations definable within Presburger arithmetic. We have identified a
natural class of admissible counter systems~(ACS) for which we show that the
quantification over paths in~\(\mathrm{CTL}^{*}\) can be simulated by
quantification over tuples of natural numbers, eventually allowing translation
of the whole Presburger-\(\mathrm{CTL}^{*}\) into Presburger arithmetic,
thereby enabling effective model checking. We have provided evidence that our
results are close to optimal with respect to the class of counter systems
described above. Finally, we design a complete semi-algorithm to verify
first-order~\(\mathrm{LTL}\) properties over trace-flattable counter systems,
extending the previous underlying FAST semi-algorithm to verify reachability
questions over flattable counter systems. }
}
@inproceedings{DL-lics2006,
  address = {Seattle, Washington, USA},
  month = aug,
  year = 2006,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'06},
  booktitle = {{P}roceedings of the 21st
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'06)},
  author = {Demri, St{\'e}phane and Lazi{\'c}, Ranko},
  title = {{LTL} with the freeze quantifier and register automata},
  pages = {17-26},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DL-lics2006.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DL-lics2006.pdf},
  doi = {10.1109/LICS.2006.31},
  abstract = {Temporal logics, first-order logics, and automata over data
words have recently attracted considerable attention. A~data word is a word
over a finite alphabet, together with a datum (an element of an infinite
domain) at each position. Examples include timed words and XML documents. To
refer to the data, temporal logics are extended with the freeze quantifier,
first-order logics with predicates over the data domain, and automata with
registers or pebbles.\par
    We investigate relative expressiveness and complexity of standard decision
problems for~\(\mathrm{LTL}\) with the freeze
quantifier~(\(\mathrm{LTL}^{\downarrow}\)), 2-variable first-order logic
(\(\mathrm{FO}^{2}\)) over data words, and register automata. The only
predicate available on data is equality. Previously undiscovered connections
among those formalisms, and to counter automata with in- crementing errors,
enable us to answer several questions left open in recent literature.\par
    We show that the future-time fragment of~\(\mathrm{LTL}^{\downarrow}\)
which corresponds to \(\mathrm{FO}^{2}\) over finite data words can be
extended considerably while preserving decidability, but at the expense of
non-primitive recursive complexity, and that most of further extensions are
undecidable. We also prove that surprisingly, over infinite data words,
\(\mathrm{LTL}^{\downarrow}\) without the `until' operator, as well as
nonemptiness of one-way universal register automata, are undecidable even when
there is only one register.}
}
@inproceedings{DL-ijcar06,
  address = {Seattle, Washington, USA},
  month = aug,
  year = 2006,
  volume = 4130,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer-Verlag},
  editor = {Furbach, Ulrich and Shankar, Natarajan},
  acronym = {{IJCAR}'06},
  booktitle = {{P}roceedings of the 3rd {I}nternational {J}oint
           {C}onference on {A}utomated {R}easoning
           ({IJCAR}'06)},
  author = {Demri, St{\'e}phane and Lugiez, Denis},
  title = {{P}resburger Modal Logic is Only {PSPACE}-complete},
  pages = {541-556},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-25.pdf},
  doi = {10.1007/11814771_44},
  abstract = {We introduce a Presburger modal logic PML with regularity
constraints and full Presburger constraints on the number of children that
generalize graded modalities, also known as number restrictions in description
logics. We~show that PML satisfiability is only PSPACE-complete by designing a
Ladner-like algorithm that can be turned into an analytic proof system 
algorithm. This extends a well-known and non-trivial PSPACE upper bound for
graded modal logic. Furthermore, we provide a detailed comparison with logics
that contain Presburger constraints and that are dedicated to query XML
documents. As~an application, we show that satisfiability for Sheaves Logic SL
is PSPACE-complete, improving significantly its best known upper bound.}
}
@article{delaune-tcs06,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Delaune, St{\'e}phanie},
  title = {An Undecidability Result for~{\textsf{\MakeUppercase{AG}h}}},
  volume = 368,
  number = {1-2},
  pages = {161-167},
  year = 2006,
  month = dec,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/delaune-tcs06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/delaune-tcs06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/delaune-tcs06.ps},
  doi = {10.1016/j.tcs.2006.08.018},
  abstract = {We present an undecidability result for 
	the verification of security protocols. Since the 
	\emph{perfect cryptography assumption} is unrealistic 
	for cryptographic primitives with visible algebraic 
	properties, several recent works relax this assumption, 
	allowing the intruder to exploit these properties. We 
	are interested in the \emph{Abelian groups} theory in 
	combination with the homomorphism axiom. We show that 
	satisfaisability of symbolic deducibility constraints 
	is undecidable, obtaining in this way the first 
	undecidability result concerning a theory for which 
	unification is known to be decidable~[F.~Baader, Unification 
        in commutative theories, Hilbert's basis theorem, and 
        Gr{\"{o}}bner 
        bases, J.~ACM~40(3) (1993)~477-503].}
}
@inproceedings{DKR-wote06,
  address = {Cambridge, UK},
  month = jun,
  year = 2006,
  acronym = {{WOTE}'06},
  booktitle = {{P}roceedings of the {IAVoSS} {W}orkshop {O}n {T}rustworthy {E}lections
               ({WOTE}'06)},
  author = {Delaune, St{\'e}phanie and Kremer, Steve and 
		 Ryan, Mark D.},
  title = {Verifying Properties of Electronic Voting Protocols},
  pages = {45-52},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-wote06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-wote06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DKR-wote06.ps},
  abstract = {In this paper we report on some recent work to formally specify
and verify electronic voting protocols. In particular, we use the formalism of
the applied pi calculus: the applied pi calculus is a formal language
similar to the pi calculus but with useful extensions for modelling
cryptographic protocols. We model several important properties, namely
fairness, eligibility, privacy, receipt-freeness and coercion-resistance.
Verification of these properties is illustrated on two cases studies and has
been partially automated using the Blanchet's ProVerif tool.}
}
@inproceedings{DKR-csfw06,
  address = {Venice, Italy},
  month = jul,
  year = 2006,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{CSFW}'06},
  booktitle = {{P}roceedings of the 
               19th {IEEE} {C}omputer {S}ecurity {F}oundations
               {W}orkshop ({CSFW}'06)},
  author = {Delaune, St{\'e}phanie and Kremer, Steve and 
		 Ryan, Mark D.},
  title = {Coercion-Resistance and Receipt-Freeness in
		Electronic Voting},
  pages = {28-39},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-csfw06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-csfw06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DKR-csfw06.ps},
  doi = {10.1109/CSFW.2006.8},
  abstract = {In this paper we formally study 
	important properties of electronic voting protocols. 
	In particular we are interested in 
	coercion-resistance and receipt-freeness. 
	Intuitively, an election protocol is 
	coercion-resistant if a voter \(A\) cannot prove to a 
	potential coercer~\(C\) that she voted in a particular 
	way.  We assume that \(A\) cooperates with~\(C\) in an 
	interactive way. Receipt-freeness is a weaker 
	property, for which we assume that \(A\) and~\(C\) 
	cannot interact during the protocol, but \(A\) later 
	provides evidence (the receipt) of how she voted. 
	While receipt-freeness can be expressed using 
	observational equivalence from the applied pi 
	calculus, we need to introduce a new relation to 
	capture coercion-resistance. Our formalization of 
	coercion-resistance and receipt-freeness are quite 
	different. Nevertheless, we show in accordance with 
	intuition that coercion-resistance implies 
	receipt-freeness, which implies privacy, the basic 
	anonymity property of voting protocols, as defined 
	in previous work. Finally we illustrate the 
	definitions on a simplified version of the 
	Lee~\emph{et~al.}\ voting protocol.}
}
@inproceedings{DLLT-ICALP2006,
  address = {Venice, Italy},
  month = jul,
  year = 2006,
  volume = 4052,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Buglesi, Michele and Preneel, Bart and Sassone, Vladimiro and Wegener, Ingo},
  acronym = {{ICALP}'06},
  booktitle = {{P}roceedings of the 33rd {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming ({ICALP}'06)~--- {P}art~{II}},
  author = {Delaune, St{\'e}phanie and Lafourcade, Pascal and 
		Lugiez, Denis and Treinen, Ralf},
  title = {Symbolic Protocol Analysis in Presence of a Homomorphism 
		Operator and {\emph{Exclusive~Or}}},
  pages = {132-143},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLLT-icalp06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLLT-icalp06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DLLT-icalp06.ps},
  doi = {10.1007/11787006_12},
  abstract = {Security of a cryptographic 
	protocol for a bounded number of sessions is 
	usually expressed as a symbolic trace 
	reachability problem. We show that symbolic 
	trace reachability for well-defined protocols 
	is decidable in presence of the exclusive or 
	theory in combination with the homomorphism 
	axiom. These theories allow us to model basic 
	properties of important cryptographic 
	operators. This trace reachability problem 
	can be expressed as a system of symbolic 
	deducibility constraints for a certain 
	inference system describing the capabilities 
	of the attacker. One main step of our proof 
	consists in reducing deducibility constraints 
	to constraints for deducibility in one step 
	of the inference system. This constraint 
	system, in turn, can be expressed as a system 
	of quadratic equations of a particular form 
	over \(\mathbb{Z}/2\mathbb{Z}[h]\), the ring 
	of polynomials in one indeterminate over the 
	finite field \(\mathbb{Z}/2\mathbb{Z}\). We 
	show that satisfiability of such systems is 
	decidable. }
}
@proceedings{CK-fcc2006,
  editor = {Cortier, V{\'e}ronique and Kremer, Steve},
  booktitle = {{P}roceedings of the 2nd {W}orkshop on {F}ormal and
		 {C}omputational {C}ryptography ({FCC}'06)},
  title = {{P}roceedings of the 2nd {W}orkshop on {F}ormal and
		 {C}omputational {C}ryptography ({FCC}'06)},
  address = {Venice, Italy},
  year = 2006,
  month = jul,
  url = {http://hal.inria.fr/FCC2006/}
}
@article{CKS-jar2005,
  publisher = {Springer},
  journal = {Journal of Automated Reasoning},
  author = {Chadha, Rohit and Kremer, Steve and Scedrov, Andre},
  title = {Formal Analysis of Multi-Party Contract Signing},
  volume = 36,
  number = {1-2},
  pages = {39-83},
  year = 2006,
  month = jan,
  nmnote = {Special Issue on Automated Reasoning for Security Protocol Analysis},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/mpcs-CKS.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/mpcs-CKS.pdf},
  doi = {10.1007/s10817-005-9019-5},
  abstract = {We analyze the multi-party contract-signing protocols
   of Garay and MacKenzie (GM) and of Baum and Waidner
   (BW). We use a finite-state tool, {\scshape Mocha},
   which allows specification of protocol properties in
   a branching-time temporal logic with game semantics.
   While our analysis does not reveal any errors in the
   BW protocol, in the GM protocol we discover serious
   problems with fairness for four signers and an
   oversight regarding abuse-freeness for three signers.
   We propose a complete revision of the GM subprotocols
   in order to restore fairness.}
}
@article{dj-jar05,
  publisher = {Springer},
  journal = {Journal of Automated Reasoning},
  author = {Delaune, St{\'e}phanie and Jacquemard, Florent},
  title = {Decision Procedures for the Security of
		Protocols with Probabilistic Encryption against 
		Offline Dictionary Attacks},
  volume = 36,
  number = {1-2},
  year = 2006,
  month = jan,
  pages = {85-124},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DJ-jar05.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DJ-jar05.ps},
  doi = {10.1007/s10817-005-9017-7},
  abstract = {We consider the problem of formal 
	automatic verification of cryptographic protocols 
	when some data, like poorly chosen passwords, can 
	be guessed by dictionary attacks. First, we define 
	a theory of these attacks and propose an inference 
	system modeling the deduction capabilities of an 
	intruder. This system extends a set of well 
	studied deduction rules for symmetric and public 
	key encryption often called Dolev-Yao rules with 
	the introduction of a probabilistic encryption 
	operator and guessing abilities for the intruder. 
	Then, we show that the intruder deduction problem 
	in this extended model is decidable in~PTIME. The 
	proof is based on a locality lemma for our 
	inference system. This first result yields to an 
	NP decision procedure for the protocol insecurity 
	problem in presence of a passive intruder. In the 
	active case, the same problem is proved to be 
	NP-complete: we give a procedure for 
	simultaneously solving symbolic constraints with 
	variables which represent intruder deductions. We 
	illustrate the procedure with examples of 
	published protocols and compare our model to other 
	recent formal definitions of dictionary attacks.}
}
@article{SD-ipl05,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Delaune, St{\'e}phanie},
  title = {Easy Intruder Deduction Problems with Homomorphisms},
  volume = 97,
  number = 6,
  pages = {213-218},
  month = mar,
  year = 2006,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/SD-ipl05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/SD-ipl05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/SD-ipl05.ps},
  doi = {10.1016/j.ipl.2005.11.008},
  abstract = {We present complexity results for 
	the verification of security protocols. Since 
	the perfect cryptography assumption is 
	unrealistic for cryptographic primitives with 
	visible algebraic properties, we extend the 
	classical \emph{Dolev-Yao} model by permitting 
	the intruder to exploit these properties. More 
	precisely, we are interested in theories such 
	as \emph{Exclusive or} and \emph{Abelian 
	groups} in combination with the homomorphism 
	axiom. We show that the intruder deduction 
	problem is in PTIME in both cases, improving 
	the EXPTIME complexity results presented 
	in~(Lafourcade, Lugiez, Treinen,~2005).}
}
@article{Demri06,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Demri, St{\'e}phane},
  title = {{LTL} over integer periodicity constraints},
  year = {2006},
  volume = 360,
  number = {1-3},
  pages = {96-123},
  month = aug,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/demri-tcs06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/demri-tcs06.pdf},
  doi = {10.1016/j.tcs.2006.02.019},
  abstract = {Periodicity constraints are used 
	in many logical formalisms, in fragments of Presburger~LTL, 
	in calendar logics, and in  logics for access 
	control, to quote a few examples. In the paper, we 
	introduce the logic PLTL\(^{\mathrm{mod}}\), an 
	extension of Linear-Time Temporal Logic LTL with 
	past-time operators whose atomic formulae are defined 
	from a first-order constraint language dealing with 
	periodicity. Although the underlying constraint language 
	is a fragment of Presburger arithmetic shown to admit a 
	{\scshape pspace}-complete satisfiability problem, we establish 
	that PLTL\(^{\mathrm{mod}}\) model-checking and 
	satisfiability problems remain in {\scshape pspace} as plain~LTL 
	(full Presburger LTL is known to be highly undecidable). 
	This is particularly interesting for dealing with 
	periodicity constraints since the language of 
	PLTL\(^{\mathrm{mod}}\) has a language more concise than 
	existing languages and the temporalization of our 
	first-order language of periodicity constraints has the 
	same worst case complexity as the underlying constraint 
	language. Finally, we show examples of introduction the 
	quantification in the logical language that provide to 
	PLTL\(^{\mathrm{mod}}\), {\scshape expspace}-complete 
	problems. As another application, we establish that the 
	equivalence problem for extended single-string automata, 
	known to express the equality of time granularities, is 
	{\scshape pspace}-complete by designing a reduction from~QBF and by 
	using our results for PLTL\(^{\mathrm{mod}}\). }
}
@article{DLS-jcss-param,
  publisher = {Elsevier Science Publishers},
  journal = {Journal of Computer and System Sciences},
  author = {Demri, St{\'e}phane and Laroussinie, Fran{\c{c}}ois
        and Schnoebelen, {\relax Ph}ilippe},
  title = {A Parametric Analysis of the State Explosion Problem in
		Model Checking},
  year = 2006,
  month = jun,
  volume = 72,
  number = 4,
  pages = {547-575},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLS-jcss-param.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLS-jcss-param.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DLS-jcss-param.ps},
  doi = {10.1016/j.jcss.2005.11.003},
  abstract = {In model checking, the 
	state-explosion problem occurs when one checks a 
	non-flat system, \emph{i.e.}, a system implicitly 
	described as a synchronized product of elementary 
	subsystems. In this paper, we investigate the 
	complexity of a wide variety of model checking 
	problems for non-flat systems under the light of 
	parameterized complexity, taking the number of 
	synchronized components as a parameter.  We provide 
	precise complexity measures (in the parameterized 
	sense) for most of the problems we investigate, and 
	evidence that the results are robust.}
}
@article{FGRV-tcs05,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Finkel, Alain and Geeraerts, Gilles and Raskin, Jean-Fran{\c{c}}ois and
                 Van{~}Begin, Laurent},
  title = {On the \(\omega\)-Language Expressive Power of Extended
                 {P}etri Nets},
  year = 2006,
  month = may,
  volume = 356,
  number = 3,
  pages = {374-386},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FGRV-TCS04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FGRV-TCS04.pdf},
  doi = {10.1016/j.tcs.2006.02.008},
  abstract = {In this paper, we study the expressive power of several
monotonic extensions of Petri
nets. We compare the expressive power of Petri nets, Petri nets extended 
with \emph{non-blocking arcs} and Petri nets extended with \emph{transfer arcs}, 
in terms of \(\omega\)-languages.
We show that the hierarchy of expressive powers of those models is strict. To prove
these results, we propose \emph{original techniques} that rely on 
well-quasi orderings and monotonicity properties.}
}
@article{FMP-dc05,
  publisher = {Springer},
  journal = {Distributed Computing},
  author = {Fribourg, Laurent and Messika, St{\'e}phane and 
                  Picaronny, Claudine},
  title = {Coupling and Self-Stabilization},
  year = 2006,
  month = feb,
  volume = 18,
  number = 3,
  pages = {221-232},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/dcmessika.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/dcmessika.ps},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/dcmessika.pdf},
  doi = {10.1007/s00446-005-0142-7},
  abstract = {A randomized self-stabilizing algorithm~\(\mathcal{A}\)
is an algorithm that, whatever the initial configuration
is, reaches a set~\(\mathcal{L}\) of \emph{legal configurations} in finite time
with probability~1. The proof of convergence towards~\(\mathcal{L}\)
is generally done by exhibiting a potential function~\(\varphi\),
which measures the {"}vertical{"} distance of any configuration 
to~\(\mathcal{L}\), such that \(\varphi\) decreases with non-null probability
at each step of~\(\mathcal{A}\). We propose here a method, based on
the notion of coupling, which makes use of a {"}horizontal{"}
distance~\(\delta\) between any pair of configurations, such that \(\delta\)
decreases in expectation at each step of~\(\mathcal{A}\). In contrast
with classical methods, our coupling method does not
require the knowledge of~\(\mathcal{L}\). In addition to the proof of
convergence, the method allows us to assess the convergence 
rate according to two different measures. Proofs
produced by the method are often simpler or give better
upper bounds than their classical counterparts, as 
examplified here on Herman's mutual exclusion and Iterated 
Prisoner's Dilemma algorithms in the case of cyclic
graphs.}
}
@inproceedings{BGM-atva2006,
  address = {Beijing, China},
  month = oct,
  year = {2006},
  volume = 4218,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Graf, Susanne and Zhang, Wenhui},
  acronym = {{ATVA}'06},
  booktitle = {{P}roceedings of the 4th {I}nternational
               {S}ymposium on {A}utomated {T}echnology
               for {V}erification and {A}nalysis
               ({ATVA}'06)},
  author = {Bhateja, Puneet and Gastin, Paul and Mukund, Madhavan},
  title = {A fresh look at testing for asynchronous communication},
  pages = {369-383},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGM-atva06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGM-atva06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BGM-atva06.ps},
  doi = {10.1007/11901914_28},
  abstract = {Testing is one of the fundamental techniques for verifying if a
computing system conforms to its specification. We~take a fresh look at the
theory of testing for message-passing systems based on a natural notion of
observability in terms of input-output relations. We~propose two notions of
test equivalence: one which corresponds to presenting all test inputs up front
and the other which corresponds to interactively feeding inputs to the system
under test. We compare our notions with those studied earlier, notably the
equivalence proposed by Tretmans. In~Tretmans' framework, asynchrony is
modelled using synchronous communication by augmenting the state space of the
system with queues. We~show that the first equivalence we consider is strictly
weaker than Tretmans' equivalence and undecidable, whereas the second notion
is incomparable. We~also establish (un)decidability results for these
equivalences.}
}
@article{DG-icomp2006,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Diekert, Volker and Gastin, Paul},
  title = {Pure future local temporal logics are expressively complete for 
                   {M}azurkiewicz traces},
  pages = {1597-1619},
  year = 2006,
  month = nov,
  volume = 204,
  number = 11,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-icomp06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-icomp06.pdf},
  doi = {10.1016/j.ic.2006.07.002},
  abstract = {The paper settles a long standing problem for Mazurkiewicz
traces: the pure future local temporal logic defined with the basic modalities
exists-next and until is expressively complete. This means every first-order
definable language of Mazurkiewicz traces can be defined in a pure future
local temporal logic. The~analogous result with a global interpretation has
been known, but the treatment of a local interpretation turned out to be much
more involved. Local logics are interesting because both the satisfiability
problem and the model checking problem are solvable in PSPACE for these logics
whereas they are non-elementary for global logics. Both, the (previously
known) global and the (new) local results generalize Kamp's Theorem for words,
because for sequences local and global viewpoints coincide. }
}
@article{DG06-TCS,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Diekert, Volker and Gastin, Paul},
  title = {From local to global temporal logics over {M}azurkiewicz traces},
  year = 2006,
  month = may,
  volume = 356,
  number = {1-2},
  pages = {126-135},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG06-TCS.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG06-TCS.pdf},
  doi = {10.1016/j.tcs.2006.01.035},
  abstract = {We review some results on global and local temporal logic on
Mazurkiewicz traces. Our~main contribution is to show how to derive the
expressive completeness of global temporal logic with respect to first-order
logic [V.~Diekert, P.~Gastin, LTL~is expressively complete for Mazurkiewicz
traces, J.~Comput. System Sci.~64 (2002) 396-418] from the similar result on
local temporal logic [V.~Diekert, P.~Gastin, Pure future local temporal logics
are expressively complete for Mazurkiewicz traces, in: M.~Farach-Colton~(Ed.),
Proc.~LATIN'04, Lecture Notes in Computer Science, Vol.~2976, Springer,
Berlin, 2004, pp.~232-241, Full version available as Research Report
LSV-05-22, Laboratoire Sp\'ecification et V\'erification, ENS Cachan, France].}
}
@inproceedings{JRV-ijcar06,
  address = {Seattle, Washington, USA},
  month = aug,
  year = 2006,
  volume = 4130,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer-Verlag},
  editor = {Furbach, Ulrich and Shankar, Natarajan},
  acronym = {{IJCAR}'06},
  booktitle = {{P}roceedings of the 3rd {I}nternational {J}oint
           {C}onference on {A}utomated {R}easoning
           ({IJCAR}'06)},
  author = {Jacquemard, Florent and Rusinowitch, Micha{\"e}l
            and Vigneron, Laurent},
  title = {Tree automata with equality constraints modulo equational
                theories},
  pages = {557-571},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2006-07.pdf},
  doi = {10.1007/11814771_45},
  abstract = {This paper presents new classes
        of tree automata combining automata with
        equality test and automata modulo equational
        theories. We believe that this class has a
        good potential for application in
        \emph{e.g.}~software verification. These tree
        automata are obtained by extending the
        standard Horn clause representations with
        equational conditions and rewrite systems.
        We show in particular that a generalized
        membership problem (extending the emptiness
        problem) is decidable by proving that the
        saturation of tree automata presentations
        with suitable paramodulation strategies
        terminates. Alternatively our results can be
        viewed as new decidable classes of
        first-order formula.}
}
@misc{markey-SynthVerif06,
  author = {Markey, Nicolas},
  title = {Verification of Multi-Agent Systems with~{ATL}},
  year = 2006,
  month = oct,
  howpublished = {Invited talk, FNRS meeting on {"}Synthesis and 
	Verification{"}}
}
@article{KucSch-TCS,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Ku{\v c}era, Anton{\'\i}n and 
         	  Schnoebelen, {\relax Ph}ilippe},
  title = {A General Approach to Comparing Infinite-State Systems
                   with Their Finite-State Specifications},
  number = {2-3},
  volume = {358},
  pages = {315-333},
  month = aug,
  year = 2006,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KucSch-TCS.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KucSch-TCS.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/KucSch-TCS.ps},
  doi = {10.1016/j.tcs.2006.01.021},
  abstract = {We introduce a generic family of 
	behavioral relations for which the regular 
	equivalence problem (\emph{i.e.}, comparing an arbitrary 
	transition system to some finite-state 
	specification) can be reduced to the model 
	checking problem against simple modal formulae. 
	As an application, we derive decidability of 
	several regular equivalence problems for 
	well-known families of infinite-state systems. }
}
@inproceedings{Laf-secret06,
  address = {Venice, Italy},
  month = jul,
  year = 2007,
  number = 4,
  volume = 171,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Fern{\'a}ndez, Maribel and Kirchner, Claude},
  acronym = {{SecReT}'06},
  booktitle = {{P}roceedings of the 1st 
           {I}nternational {W}orkshop on {S}ecurity and {R}ewriting {T}echniques
           ({SecReT}'06)},
  author = {Lafourcade, Pascal},
  title = {Intruder Deduction for the Equational Theory of 
                {\emph{Exclusive-or}}
                with Commutative and Distributive Encryption},
  pages = {37-57},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Laf-secret06-long.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Laf-secret06-long.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Laf-secret06-long.ps},
  nomorelongpdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/
        rr-lsv-2005-21.pdf},
  nomorelongps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
        rr-lsv-2005-21.ps},
  nomorelongpsgz = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PSGZ/
        rr-lsv-2005-21.ps.gz},
  doi = {10.1016/j.entcs.2007.02.054},
  abstract = {The first step in the verification of cryptographic protocols is
    to decide the intruder deduction problem, that is the vulnerability to a
    so-called passive attacker. We~extend the Dolev-Yao model in order to
    model this problem in presence of the equational theory of a commutative
    encryption operator which distributes over the \emph{exclusive-or}
    operator. The~interaction between the commutative distributive law of the
    encryption and \emph{exclusive-or} offers more possibilities to decrypt an
    encrypted message than in the non-commutative case, which imply a more
    careful analysis of the proof system. We~prove decidability of the
    intruder deduction problem for a commutative encryption which distributes
    over \emph{exclusive-or} with a DOUBLE-EXPTIME procedure. And~we obtain
    that this problem is EXPSPACE-hard in the binary case.}
}
@inproceedings{LLT-unif2006,
  address = {Seattle, Washington, USA},
  month = aug,
  year = 2006,
  editor = {Levy, Jordi},
  acronym = {{UNIF}'06},
  booktitle = {{P}roceedings of the 20th {I}nternational
               {W}orkshop on {U}nification
               ({UNIF}'06)},
  author = {Lafourcade, Pascal and Lugiez, Denis and Treinen, Ralf},
  title = {{ACUNh}: Unification and Disunification Using Automata Theory},
  pages = {6-20},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LLT-unif06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LLT-unif06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LLT-unif06.ps},
  abstract = {We show several results about unification problems in the
equational theory~ACUNh consisting of the theory of exclusive or with one
homomorphism. These results are shown using only techniques of automata and
combinations of unification problems. We~show how to construct a most-general
unifier for ACUNh-unification problems with constants using automata. We also
prove that the first-order theory of ground terms modulo~ACUNh is decidable if
the signature does not contain free non-constant function symbols, and that
the existential fragment is decidable in the general case. Furthermore, we
show a technical result about the set of most-general unifiers obtained for
general unification problems.}
}
@inproceedings{BJ-unif2006,
  address = {Seattle, Washington, USA},
  month = aug,
  year = 2006,
  editor = {Levy, Jordi},
  acronym = {{UNIF}'06},
  booktitle = {{P}roceedings of the 20th {I}nternational
               {W}orkshop on {U}nification
               ({UNIF}'06)},
  author = {Bouhoula, Adel and Jacquemard, Florent},
  title = {Automating Sufficient Completeness Check for Conditional 
                and Constrained~{TRS}},
  nopages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BJ-unif06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BJ-unif06.pdf},
  abstract = {We present a procedure for checking sufficient completeness for
conditional and constrained term rewriting systems containing axioms for
constructors which may be constrained (by~e.g.~equalities, disequalities,
ordering, membership...). Such axioms allow to specify complex data structures
like e.g.~sets, sorted lists or powerlists. Our approach is integrated in a
framework for inductive theorem proving based on tree grammars with
constraints, a formalism which permits an exact representation of languages of
ground constructor terms in normal form. The key technique used in the
procedure is a generalized form of narrowing where, given a term, instead of
unifying it with left members of rewrite rules, we instantiate it, at selected
variables, following the productions of a constrained tree grammar, and test
whether it can be rewritten. Our~procedure is sound and complete and has been
successfully applied to several examples, yielding very natural proofs and, in
case of negative answer, a counter example suggesting how to complete the
specification. Moreover, it is a decision procedure when the TRS is
unconditional but constrained, for a large class of constrained constructor
axioms.}
}
@inproceedings{LMO-formats06,
  address = {Paris, France},
  month = sep,
  year = 2006,
  volume = 4202,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Asarin, Eug{\`e}ne and Bouyer, Patricia},
  acronym = {{FORMATS}'06},
  booktitle = {{P}roceedings of the 4th {I}nternational {C}onference
           on {F}ormal {M}odelling and {A}nalysis of {T}imed
           {S}ystems ({FORMATS}'06)},
  author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas and
                 Oreiby, Ghassan},
  title = {Model Checking Timed {ATL} for Durational Concurrent
	         Game Structures},
  pages = {245-259},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMO-formats06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMO-formats06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LMO-formats06.ps},
  doi = {10.1007/11867340_18},
  abstract = {We extend the framework of ATL model-checking to {"}simply
	timed{"} concurrent game structures, i.e., multi-agent structures where
	each transition carry an integral duration (or interval thereof). While
	the case of single durations is easily handled from the semantics point of
	view, intervals of durations raise several interesting questions. Moreover
	subtle algorithmic problems have to be handled when dealing with model
	checking. We propose a semantics for which we develop efficient (PTIME)
	algorithms for timed ATL without equality constraints, while the general
	case is shown to be EXPTIME-complete.}
}
@article{LMS-tcs05,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas
		 and Schnoebelen, {\relax Ph}ilippe},
  title = {Efficient Timed Model Checking for Discrete-Time 
		Systems},
  volume = 353,
  number = {1-3},
  pages = {249-271},
  month = mar,
  year = 2006,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMS-TCS05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMS-TCS05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LMS-TCS05.ps},
  doi = {10.1016/j.tcs.2005.11.020},
  abstract = {We consider model checking of timed 
	temporal formulae in \emph{durational transition 
	graphs} (DTGs), \emph{i.e.}, Kripke structures where 
	transitions have integer durations. Two semantics for 
	DTGs are presented and motivated. We consider timed 
	versions of CTL where subscripts put quantitative 
	constraints on the time it takes before a property is 
	satisfied. \par
	We exhibit an important gap between logics where 
	subscripts of the form {"}\(= c\){"} (exact duration) are 
	allowed, and simpler logics that only allow subscripts 
	of the form {"}\(\leq c\){"} or {"}\(\geq c\){"} (bounded 
	duration).\par
	Without exact durations, model checking can be done in 
	polynomial time, but with exact durations, it becomes 
	\(\Delta_{2}^{P}\)-complete or PSPACE-complete 
	depending on the considered semantics.}
}
@inproceedings{MOJ-aisc2006,
  address = {Beijing, China},
  month = sep,
  year = 2006,
  volume = 4120,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer},
  editor = {Calmet, Jacques and Ida, Tetsuo and Wang, Dongming},
  acronym = {{AISC}'06},
  booktitle = {{P}roceedings of the 8th {I}nternational {C}onference
           on {A}rtificial {I}ntelligence and {S}ymbolic {C}omputation
           ({AISC}'06)},
  author = {Mitsuhashi, Ichiro and Oyamaguchi, Michio and Jacquemard, Florent},
  title = {The Confluence Problem for Flat~{TRSs}},
  pages = {68-81},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MOJ-aisc06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MOJ-aisc06.pdf},
  doi = {10.1007/11856290_8},
  abstract = {We prove that the properties of reachability, joinability and
confluence are undecidable for flat~TRSs. Here, a~TRS is flat if the heights
of the left and right-hand sides of each rewrite rule are at most one.}
}
@article{MR-TCS05,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Markey, Nicolas and Raskin, Jean-Fran{\c{c}}ois},
  title = {Model Checking Restricted Sets of Timed Paths},
  year = {2006},
  month = aug,
  volume = 358,
  number = {2-3},
  pages = {273-292},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Markey-Raskin-TCS05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Markey-Raskin-TCS05.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/
		 Markey-Raskin-TCS05.ps},
  doi = {10.1016/j.tcs.2006.01.019},
  abstract = {In this paper, we study the complexity of 
	model-checking formulas of four important real-time 
	logics (TPTL, MTL, MITL, and TCTL) over restricted sets 
	of timed paths. The classes of restricted sets of timed 
	paths that we consider are \textit{(i)}~a~single finite 
	(or ultimately periodic) timed path, 
	\textit{(ii)}~an~infinite set of finite (or infinite) 
	timed paths defined by a finite (or ultimately periodic) 
	path in a region graph, \textit{(iii)}~an~infinite set of 
	finite (or infinite) timed paths defined by a finite (or 
	ultimately periodic) path in a zone graph.
	\par
	Several results are quite negative: TPTL and MTL 
	remain undecidable along
	region- and zone-paths. On the other hand, 
	we obtained PTIME algorithms for
	model checking TCTL along a region path, 
	and for MTL along a single timed path.}
}
@article{MS05-IPL,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Markey, Nicolas and Schnoebelen, {\relax Ph}ilippe},
  title = {Mu-Calculus Path Checking},
  volume = 97,
  number = 6,
  month = mar,
  year = 2006,
  pages = {225-230},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MS05-IPL.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/MS05-IPL.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/MS05-IPL.ps},
  doi = {10.1016/j.ipl.2005.11.010},
  abstract = {We investigate the path model 
	checking problem for the \(\mu\)-calculus. 
	Surprisingly, restricting to deterministic 
	structures does not allow for more efficient model 
	checking algorithm, as we prove that it can encode 
	any instance of the standard model checking problem 
	for the \(\mu\)-calculus. }
}
@article{RS-btl2,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Rabinovich, Alexander and 
		   Schnoebelen, {\relax Ph}ilippe},
  title = {{\(\mathit{\MakeUppercase{BTL}}_2\)} and the expressive 
		   power of {\(\mathit{\MakeUppercase{ECTL}}^+\)}},
  year = 2006,
  month = jul,
  volume = 204,
  number = 7,
  pages = {1023-1044},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BTL2-InfComp.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BTL2-InfComp.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BTL2-InfComp.ps},
  doi = {10.1016/j.ic.2005.07.006},
  abstract = {We show that \(\mathit{ECTL}^+\), the 
	classical extension of \(\mathit{CTL}\) with fairness 
	properties, is expressively equivalent to 
	\(\mathit{BTL}_2\), a natural fragment of the monadic 
	logic of order. \(\mathit{BTL}_2\)~is the branching-time 
	logic with arbitrary quantification over paths, and 
	where path formulae are restricted to quantifier 
	depth~\(2\) first-order formulae in the monadic logic of 
	order. This result, linking \(\mathit{ECTL}^+\) to a 
	natural fragment of the monadic logic of order, provides 
	a characterization that other branching-time logics, 
	\emph{e.g.}, \(\mathit{CTL}\), lack. \par
	We then go on to show that \(\mathit{ECTL}^+\) and 
	\(\mathit{BTL}_2\) are not finitely based (\emph{i.e.}, 
	they cannot be defined by a finite set of temporal 
	modalities) and that their model-checking problems are 
	of the same complexity. }
}
@misc{phs-lipn2006,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {De nouvelles applications pour le model-checking},
  year = {2006},
  month = nov,
  howpublished = {Invited lecture, Journ{\'e}es {\`a} l'occasion des
                  20~ans du~LIPN, Villetaneuse, France}
}
@phdthesis{THESE-bernat06,
  author = {Bernat, Vincent},
  title = {Th{\'e}ories de l'intrus pour la v{\'e}rification 
                 des protocoles cryptographiques},
  year = 2006,
  month = jun,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-bernat.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-bernat.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/these-bernat.ps}
}
@phdthesis{THESE-delaune06,
  author = {Delaune, St{\'e}phanie},
  title = {V{\'e}rification des protocoles cryptographiques 
                 et propri{\'e}t{\'e}s alg{\'e}briques},
  year = 2006,
  month = jun,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-delaune.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-delaune.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/these-delaune.ps},
  abstract = {Cryptographic protocols are small concurrent programs designed
to guarantee the security of exchanges between participants using non-secure
medium. Establishing the correctness of these protocols is crucial given the
increasing number of applications, such as electronic commerce, that exchange
information on the Internet. Unfortunately, the existence of cryptographic
primitives such as encryption is not sufficient to ensure security. The
security of exchanges is ensured by cryptographic protocols which are
notoriously error-prone.\par
The formal verification of cryptographic protocols is a difficult problem that
can be seen as a particular model-checking problem in an hostile environment.
To verify such protocols, a line of research consists in considering
encryption as a black box and assuming that an adversary can't learn anything
from an encrypted message except if he has the key. This is called the
\emph{perfect cryptography} assumption. Many results have been obtained under
this assumption, but such an assumption is too strong in general. Some attacks
exploit in a clever way the interaction between protocol rules and properties
of cryptographic operators. \par
In this thesis, we relax the perfect cryptography assumption by taking into
account some algebraic properties of cryptographic primitives. We give
decision procedures for the security problem in presence of several algebraic
operators.}
}
@phdthesis{THESE-lafourcade06,
  author = {Lafourcade, Pascal},
  title = {V{\'e}rification des protocoles cryptographiques 
                 en pr{\'e}sence de th{\'e}ories {\'e}quationnelles},
  year = 2006,
  month = sep,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-lafourcade.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-lafourcade.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/these-lafourcade.ps},
  note = {209~pages},
  abstract = {The rise of the internet of new technologies has reinforced the
key role of computer science in communication technology. The recent progress
in these technologies has brought a dramatic change in the ways how we
communicate and consume. All these communication activities are subject to
complex communication protocols that a user does not control completely. Users
of communication protocols require that their communications are {"}secure{"}.
The developers of these communication protocols aim to secure communications
in a hostile environment by cryptographic means. Such an environment consists
of a dishonest communication participant, called an {"}intruder{"} or
{"}attacker{"}... We suppose that the intruder controls the network on which
the messages are exchanged.\par
The verification of a cryptographic protocol either ensures that no attack is
possible against the execution of the protocol in presence of a certain
intruder, or otherwise exhibits an attack. One important assumption in the
verification of cryptographic protocols is the so-called {"}perfect
cryptography assumption{"}, which states that the only way to obtain knowledge
about an encrypted message is to know its decryption key. This hypothesis is
not sufficient to guarantee security in reality. It is possible that certain
properties used in the protocol allow the intruder to obtain some
information.\par
One way to weaken this perfect cryptography assumption is to take into account
in the model certain algebraic properties. We develop a formal approach for
verifying the so-called secrecy property of cryptographic protocols in the
presence of equational theories and of homomorphism.}
}
@phdthesis{THESE-belmokadem06,
  author = {Bel{ }mokadem, Houda},
  title = {V{\'e}rification des propri{\'e}t{\'e}s temporis{\'e}es des 
                 automates programmables industriels},
  year = 2006,
  month = sep,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-mokadem.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-mokadem.pdf}
}
@phdthesis{THESE-bertrand06,
  author = {Bertrand, Nathalie},
  title = {Mod{\`e}les stochastiques pour les pertes de messages dans les 
                 protocoles asynchrones et techniques de v{\'e}rification automatique},
  year = 2006,
  month = oct,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-bertrand.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-bertrand.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/these-bertrand.ps}
}
@mastersthesis{naves-master,
  author = {Naves, Guyslain},
  title = {Accessibilit{\'e} dans les automates temporis{\'e}s {\`a} deux horloges},
  school = {{M}aster {P}arisien de {R}echerche en 
	{I}nformatique, Paris, France},
  type = {Rapport de {M}aster},
  year = 2006,
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/master-naves.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/master-naves.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/master-naves.ps}
}
@mastersthesis{akshay-master,
  author = {Akshay, S.},
  title = {Formal Specification and Verification of Timed Communicating Systems},
  school = {{M}aster {P}arisien de {R}echerche en 
	{I}nformatique, Paris, France},
  type = {Rapport de {M}aster},
  month = sep,
  year = 2006,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Akshay-M2.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Akshay-M2.pdf}
}
@mastersthesis{brochenin-master,
  author = {Brochenin, R{\'e}mi},
  title = {Techniques d'automates pour raisonner sur la m{\'e}moire},
  school = {{M}aster {R}echerche {I}nformatique de {L}yon~--- 
        {I}nformatique {F}ondamentale, Lyon, France},
  type = {Rapport de {M}aster},
  month = jun,
  year = 2006,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Brochenin-M2.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Brochenin-M2.ps}
}
@mastersthesis{bursuc-master,
  author = {Bursuc, Sergiu},
  title = {Contraintes de d{\'e}ductibilit{\'e} modulo
                 Associativit{\'e}-Commutativit{\'e}},
  school = {{M}aster {P}arisien de {R}echerche en 
	{I}nformatique, Paris, France},
  type = {Rapport de {M}aster},
  month = sep,
  year = 2006,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bursuc-M2.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bursuc-M2.pdf}
}
@techreport{LSV:06:11,
  author = {Bollig, Benedikt and Kuske, Dietrich},
  title = {Distributed {M}uller Automata and Logics},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2006,
  month = may,
  type = {Research Report},
  number = {LSV-06-11},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2006-11.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2006-11.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
        rr-lsv-2006-11.ps},
  note = {23~pages},
  abstract = {We consider Muller asynchronous cellular automata running on
infinite dags over distributed alphabets. We show that they have the same
expressive power as the existential fragment of a monadic second-order logic
featuring a first-order quantifier to express that there are infinitely many
elements satisfying some property. Our result is based on an extension of the
classical Ehrenfeucht-Fra{\"\i}ss{\'e} game to cope with infinite structures
and the new first-order quantifier. As a byproduct, we obtain a logical
characterization of unbounded Muller message-passing automata running on
infinite message sequence charts.}
}
@techreport{LSV:06:13,
  author = {Olivain, Julien and Goubault{-}Larrecq, Jean},
  title = {Detecting Subverted Cryptographic Protocols by Entropy Checking},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2006,
  month = jun,
  type = {Research Report},
  number = {LSV-06-13},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2006-13.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2006-13.pdf},
  note = {19~pages},
  abstract = {What happens when your implementation of SSL or some other
  cryptographic protocol is subverted through a buffer overflow
  attack?  You have been hacked, right.  Unfortunately, you may be
  unaware of~it: since normal traffic is encrypted, most IDSs cannot
  monitor~it.  We propose a simple, yet efficient technique to detect
  such attacks, by computing the entropy of the flow and comparing it
  against known thresholds.  This was implemented in the Net-Entropy
  sensor.}
}
@inproceedings{DLS-fossacs08,
  address = {Budapest, Hungary},
  month = mar # {-} # apr,
  year = 2008,
  volume = 4962,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Amadio, Roberto},
  acronym = {{FoSSaCS}'08},
  booktitle = {{P}roceedings of the 11th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'08)},
  author = {Demri, St{\'e}phane and Lazi{\'c}, Ranko and Sangnier, Arnaud},
  title = {Model checking  freeze {LTL} over one-counter automata},
  pages = {490-504},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLS-fossacs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLS-fossacs08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DLS-fossacs08.ps},
  doi = {10.1007/978-3-540-78499-9_34},
  abstract = {We study complexity issues related to the model-checking
    problem for LTL with registers (a.k.a. freeze LTL) over
    one-counter automata. We~consider several classes of one-counter
    automata (mainly deterministic vs.~nondeterministic) and several
    syntactic fragments (restriction on the number of registers and on
    the use of propositional variables for control
    locations). The~logic has the ability to store a counter value and
    to test it later against the current counter value. By~introducing
    a non-trivial abstraction on counter values, we~show that model
    checking LTL with registers over deterministic one-counter
    automata is PSPACE-complete with infinite accepting
    runs. By~constrast, we prove that model checking LTL with
    registers over nondeterministic one-counter automata is
    \(\Sigma_{1}^{1}\)-complete [resp. \(\Sigma_{1}^{0}\)-complete] in
    the infinitary [resp. finitary] case even if only one register is
    used and with no propositional variable. This makes a difference
    with the facts that several verification problems for one-counter
    automata are known to be decidable with relatively low complexity,
    and that finitary satisfiability for LTL with a unique register is
    decidable. Our~results pave the way for model-checking LTL with
    registers over other classes of operational models, such as
    reversal-bounded counter machines and deterministic pushdown
    systems.}
}
@inproceedings{HIV-fossacs08,
  address = {Budapest, Hungary},
  month = mar # {-} # apr,
  year = 2008,
  volume = 4962,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Amadio, Roberto},
  acronym = {{FoSSaCS}'08},
  booktitle = {{P}roceedings of the 11th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'08)},
  author = {Habermehl, Peter and Iosif, Radu and Vojnar, Tom{\'a}{\v{s}}},
  title = {What else is decidable about arrays?},
  pages = {474-489},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hiv07-TR.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hiv07-TR.pdf},
  doi = {10.1007/978-3-540-78499-9_33},
  abstract = {We introduce a new decidable logic for reasoning about infinite
    arrays of integers. The logic is in the \(\exists^{*}\forall^{*}\)
    first-order fragment and allows (1)~Presburger constraints on
    existentially quantified variables, (2)~difference constraints as well as
    periodicity constraints on universally quantified indices, and
    (3)~difference constraints on values. In~particular, using our logic, one
    can express constraints on consecutive elements of arrays
    (\emph{e.g.}~\(\forall i.\ 0 \leq i < n \rightarrow a[i + 1] = a[i] - 1\))
    as well as periodic facts (\emph{e.g.}~\(\forall i.\ i \equiv_2 0
    \rightarrow a[i] = 0\)). The decision procedure follows the
    automata-theoretic approach: we~translate formulae into a special class of
    B{\"u}chi counter automata such that any model of a formula corresponds to
    an accepting run of the automaton, and vice versa. The~emptiness problem
    for this class of counter automata is shown to be decidable, as a
    consequence of earlier results on counter automata with a flat control
    structure and transitions based on difference constraints. We~show
    interesting program properties expressible in our logic, and give an
    example of invariant verification for programs that handle integer
    arrays.}
}
@inproceedings{BMR-fossacs08,
  address = {Budapest, Hungary},
  month = mar # {-} # apr,
  year = 2008,
  volume = 4962,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Amadio, Roberto},
  acronym = {{FoSSaCS}'08},
  booktitle = {{P}roceedings of the 11th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'08)},
  author = {Bouyer, Patricia and Markey, Nicolas and Reynier, Pierre-Alain},
  title = {Robust Analysis of Timed Automata {\em via} Channel Machines},
  pages = {157-171},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BMR-fossacs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BMR-fossacs08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BMR-fossacs08.ps},
  doi = {10.1007/978-3-540-78499-9_12},
  abstract = {Whereas formal verification of timed systems has become a very
    active field of research, the idealised mathematical semantics of timed
    automata cannot be faithfully implemented. Several works have thus focused
    on a modified semantics of timed automata which ensures implementability,
    and robust model-checking algorithms for safety, and later LTL properties
    have been designed. Recently, a~new approach has been proposed, which
    reduces (standard) model-checking of timed automata to other verification
    problems on channel machines. Thanks to a new encoding of the modified
    semantics as a network of timed systems, we propose an original
    combination of both approaches, and prove that robust model-checking for
    coFlat-MTL, a large fragment of~MTL, is EXPSPACE-Complete.}
}
@inproceedings{CS-fossacs08,
  address = {Budapest, Hungary},
  month = mar # {-} # apr,
  year = 2008,
  volume = 4962,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Amadio, Roberto},
  acronym = {{FoSSaCS}'08},
  booktitle = {{P}roceedings of the 11th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'08)},
  author = {Chambart, Pierre and Schnoebelen, {\relax Ph}ilippe},
  title = {The \(\omega\)-Regular {P}ost Embedding Problem},
  pages = {97-111},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CS-fossacs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CS-fossacs08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CS-fossacs08.ps},
  doi = {10.1007/978-3-540-78499-9_8},
  abstract = {Post's Embedding Problem is a new variant of Post's
    Correspondence Problem where words are compared with embedding rather than
    equality. It~has been shown recently that adding regular constraints on
    the form of admissible solutions makes the problem highly non-trivial, and
    relevant to the study of lossy channel systems. Here we consider the
    infinitary version and its application to recurrent reachability in lossy
    channel systems.}
}
@inproceedings{Gou-fossacs08b,
  address = {Budapest, Hungary},
  month = mar # {-} # apr,
  year = 2008,
  volume = 4962,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Amadio, Roberto},
  acronym = {{FoSSaCS}'08},
  booktitle = {{P}roceedings of the 11th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'08)},
  author = {Goubault{-}Larrecq, Jean},
  title = {Simulation Hemi-Metrics Between Infinite-State Stochastic Games},
  pages = {50-65},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-34.pdf},
  doi = {10.1007/978-3-540-78499-9_5},
  abstract = {We investigate simulation hemi-metrics between certain forms
    of turn-based \(2\frac{1}{2}\)-player games played on infinite 
    topological spaces. They have the desirable property of bounding the
    difference in payoffs obtained by starting from one state or another. 
    All 
    constructions are described as the special case of a unique one, which we 
    call the Hutchinson hemi-metric on various spaces of continuous 
    previsions. We show a directed form of the Kantorovich-Rubinstein theorem, 
    stating that the Hutchinson hemi-metric on spaces of continuous 
    probability valuations coincides with a notion of trans-shipment 
    hemi-metric. We also identify the class of so-called sym-compact spaces as 
    the right class of topological spaces, where the theory works out as 
    nicely as possible.}
}
@inproceedings{Gou-fossacs08a,
  address = {Budapest, Hungary},
  month = mar # {-} # apr,
  year = 2008,
  volume = 4962,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Amadio, Roberto},
  acronym = {{FoSSaCS}'08},
  booktitle = {{P}roceedings of the 11th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'08)},
  author = {Goubault{-}Larrecq, Jean},
  title = {Prevision Domains and Convex Powercones},
  pages = {318-333},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-33.pdf},
  doi = {10.1007/978-3-540-78499-9_23},
  abstract = {Two recent semantic families of models for mixed 
probabilistic and non-deterministic choice over a space~\(X\) are the 
convex powercone models, due independently to Mislove, and to Tix, 
Keimel, and Plotkin, and the continuous prevision model of the 
author. We show that, up to some minor details, these models are 
isomorphic whenever \(X\) is a continuous, coherent cpo, and whether 
the particular brand of non-determinism we focus on is demonic, 
angelic, or chaotic. The construction also exhibits domains of 
continuous previsions as retracts of well-known continuous cpos, 
providing simple bases for the various continuous cpos of continuous 
previsions. This has practical relevance to computing approximations 
of operations on previsions.}
}
@inproceedings{Kremer-tgc07,
  address = {Sophia-Antipolis, France},
  year = 2008,
  volume = 4912,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Barthe, Gilles and Fournet, C{\'e}dric},
  acronym = {{TGC}'07},
  booktitle = {{R}evised {S}elected {P}apers from the 3rd {S}ymposium on {T}rustworthy {G}lobal 
	   {C}omputing ({TGC}'07)},
  author = {Kremer, Steve},
  title = {Computational soundness of equational theories (Tutorial)},
  pages = {363-382},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Kremer-tgc07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Kremer-tgc07.pdf},
  doi = {10.1007/978-3-540-78663-4},
  abstract = {We study the link between formal and cryptographic models for
    security protocols in the presence of passive and adaptive adversaries. We
    first describe the seminal result by Abadi and Rogaway and shortly discuss
    some of its extensions. Then we describe a general model for reasoning
    about the soundness of implementations of equational theories. We
    illustrate this model on several examples of computationally sound
    implementations of equational theories.}
}
@article{JRV-jlap07,
  publisher = {Elsevier Science Publishers},
  journal = {Journal of Logic and Algebraic Programming},
  author = {Jacquemard, Florent and Rusinowitch, Micha{\"e}l and Vigneron, Laurent},
  title = {Tree automata with equality constraints modulo equational
		  theories},
  year = 2008,
  month = apr,
  volume = 75,
  number = 2,
  pages = {182-208},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JRV-jlap08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JRV-jlap08.pdf},
  doi = {10.1016/j.jlap.2007.10.006},
  abstract = {This paper presents new classes of tree automata combining 
    automata with equality test and automata modulo equational theories. 
    We believe that these classes have a good potential for application in 
    \emph{e.g.} software verification. These tree automata are obtained by 
    extending the standard Horn clause representations with equational 
    conditions and rewrite systems. We~show in particular that a 
    generalized membership problem (extending the emptiness problem) is 
    decidable by proving that the saturation of tree automata 
    presentations with suitable paramodulation strategies terminates. 
    Alternatively our results can be viewed as new decidable classes of 
    first-order formula.}
}
@inproceedings{BJ-arspa07,
  address = {Wroc{\l}aw, Poland},
  month = jul,
  year = 2007,
  editor = {Degano, Pierpaolo and K{\"u}sters, Ralf and Vigan{\`o}, Luca and
                  Zdancewic, Steve},
  acronym = {{FCS-ARSPA}'07},
  booktitle = {{P}roceedings of the {J}oint {W}orkshop on {F}oundations of
                  {C}omputer {S}ecurity  and {A}utomated {R}easoning 
		  for {S}ecurity {P}rotocol {A}nalysis ({FCS-ARSPA}'07)},
  author = {Adel Bouhoula and Florent Jacquemard},
  title = {Verifying Regular Trace Properties of Security Protocols
		  with Explicit Destructors and Implicit Induction},
  pages = {27-44},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BJ-arspa07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BJ-arspa07.pdf},
  abstract = {We present a procedure for the verification of
    cryptographic protocols based on a new method for automatic implicit
    induction theorem proving for specifications made of conditional and
    constrained rewrite rules. The~method handles axioms between constructor
    terms which are used to introduce explicit destructor symbols for the
    specification of cryptographic operators. Moreover, it can deal with
    non-confluent rewrite systems. This is required in the context of the
    verification of security protocols because of the non-deterministic
    behavior of attackers. Our~induction method makes an intensive use of
    constrained tree grammars, which are used in proofs both as induction
    schemes and as oracles for checking validity and redundancy criteria by
    reduction to an emptiness problem. The grammars make possible the
    development of a generic framework for the specification and verification
    of protocols, where the specifications can be parametrized with (possibly
    infinite) regular sets of user names or attacker's initial knowledge and
    complex security properties can be expressed, referring to some fixed
    regular sets of bad traces representing potential vulnerabilities. 
    We present some case studies giving very promising results, for the detection
    of attacks (our~procedure is complete for refutation), and also for the
    validation of protocols.}
}
@mastersthesis{chambart-master,
  author = {Chambart, Pierre},
  title = {Canaux fiables et non-fiables~: fronti{\`e}res de la d{\'e}cidabilit{\'e}},
  school = {{M}aster {P}arisien de {R}echerche en 
	{I}nformatique, Paris, France},
  type = {Rapport de {M}aster},
  year = 2007,
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/chambart-m2.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/chambart-m2.pdf}
}
@phdthesis{gascon-these2007,
  author = {Gascon, R{\'e}gis},
  title = {Sp{\'e}cification et v{\'e}rification de propri{\'e}t{\'e}s 
		 quantitatives sur des automates {\`a} contraintes},
  year = 2007,
  month = nov,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-RG07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-RG07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/these-RG07.ps},
  futureslides = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/SLIDES/
                these-FC07-slides.pdf}
}
@inproceedings{BMOSW-stacs08,
  address = {Bordeaux, France},
  month = feb,
  year = 2008,
  volume = 1,
  series = {Leibniz International Proceedings in Informatics},
  publisher = {Leibniz-Zentrum f{\"u}r Informatik},
  editor = {Albers, Susanne and Weil, Pascal},
  acronym = {{STACS}'08},
  booktitle = {{P}roceedings of the 25th {A}nnual
               {S}ymposium on {T}heoretical {A}spects of
               {C}omputer {S}cience
               ({STACS}'08)},
  author = {Bouyer, Patricia and Markey, Nicolas and Ouaknine, Jo{\"e}l
                  and Schnoebelen, {\relax Ph}ilippe and Worrell, James},
  title = {On Termination for Faulty Channel Machines},
  pages = {121-132},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bmosw-stacs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bmosw-stacs08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/bmosw-stacs08.ps},
  abstract = {A channel machine consists of a finite controller together with
    several fifo channels; the controller can read messages from the head of a
    channel and write messages to the tail of a channel. In this paper, we
    focus on channel machines with \emph{insertion errors}, \textit{i.e.},
    machines in whose channels messages can spontaneously appear. Such devices
    have been previously introduced in the study of Metric Temporal Logic.
    We~consider the termination problem: are all the computations of a given
    insertion channel machine finite? We~show that this problem has
    non-elementary, yet primitive recursive complexity.}
}
@inproceedings{FLS-ilc07,
  address = {Cape Town, South Africa},
  month = oct,
  year = 2009,
  volume = 5489,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer-Verlag},
  editor = {Archibald, Margaret and Brattka, Vasco and
	  Goranko, Valentin and L{\"o}we, Benedikt},
  acronym = {{ILC}'07},
  booktitle = {{R}evised {S}elected {P}apers of the 
		 {I}nternational {C}onference on {I}nfinity
		 in {L}ogic {\&} {C}omputation ({ILC}'07)},
  author = {Finkel, Alain and Lozes, {\'E}tienne and Sangnier, Arnaud},
  title = {Towards Model Checking Pointer Systems},
  pages = {56-82},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FLS-ilc07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FLS-ilc07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FLS-ilc07.ps},
  doi = {10.1007/978-3-642-03092-5_6},
  abstract = {We aim at checking safety and temporal properties over models
    representing the behavior of programs manipulating dynamic singly-linked
    lists. The properties we consider not only allow to perform a classical
    shape analysis, but we also want to check quantitative aspect on the
    manipulated memory heap. We first explain how a translation of programs
    into counter systems can be used to check safety problems and temporal
    properties. We then study the decidability of these two problems
    considering some restricted classes of programs, namely flat programs
    without destructive update. We obtain the following results: (1)~the
    model-checking problem is decidable if the considered program works over
    acyclic lists; (2)~the safety problem is decidable for programs without
    alias test. We finally explain the limit of our decidability results,
    showing that relaxing one of the hypothesis leads to undecidability
    results.}
}
@inproceedings{Bur-nordsec07,
  address = {Reykjavik, Iceland},
  month = oct,
  year = 2007,
  editor = {Erlingsson, {\'U}lfar and Sabelfeld, Andrei},
  acronym = {{NordSec}'07},
  booktitle = {{P}roceedings of the 12th {N}ordic {W}orkshop on {S}ecure {IT}
                  {S}ystems ({NordSec}'07)},
  author = {Bursztein, Elie},
  title = {Time has something to tell us about network address
                  translation},
  nopages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bur-nordsec07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bur-nordsec07.pdf},
  abstract = { In this paper we introduce a new technique to count the number
    of host behind a~NAT. This technique based on TCP timestamp option, work
    with Linux and BSD system and therefore is complementary to the previous
    one base on IPID than does not work for those systems. Our~implementation
    demonstrates the practicability of this method.}
}
@article{CEFX-fmsd08,
  publisher = {Springer},
  journal = {Formal Methods in System Design},
  author = {Chevallier, R{\'e}my and Encrenaz{-}Tiph{\`e}ne, Emmanuelle and
                  Fribourg, Laurent and Xu, Weiwen},
  title = {Timed Verification of the Generic Architecture of a Memory
                  Circuit Using Parametric Timed Automata},
  volume = 34,
  number = 1,
  pages = {59-81},
  year = 2009,
  month = feb,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CEFX-fmsd08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CEFX-fmsd08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CEFX-fmsd08.ps},
  doi = {10.1007/s10703-008-0061-x},
  abstract = {Using a variant of Clariso-Cortadella's parametric
    method for verifying asynchronous circuits, we analyse some crucial timing
    behaviors of the architecture of SPSMALL memory, a~commercial product of
    STMicroelectronics. Using the model of parametric timed automata and model
    checker HYTECH, we~formally derive a set of linear constraints that ensure
    the correctness of the response times of the memory. We are also able to
    infer the constraints characterizing the optimal setup timings of input
    signals. We have checked, for two different implementations of this
    architecture, that the values given by our model match remarkably with the
    values obtained by the designer through electrical simulation. }
}
@article{TED-todaes08,
  publisher = {ACM Press},
  journal = {ACM Transactions on Design Automation of Electronic Systems},
  author = {Taktak, Sami and Encrenaz, Emmanuelle and Desbarbieux, Jean-Lou},
  title = {A tool for automatic detection of deadlocks in wormhole networks on chip},
  nopages = {},
  volume = 13,
  number = 1,
  year = 2008,
  month = jan,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/TED-todaes07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/TED-todaes07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/TED-todaes07.ps},
  doi = {10.1145/1297666.1297672},
  abstract = {We present an extension of Duato's necessary and sufficient
    condition a routing function must satisfy in order to be deadlock-free, to
    support environment constraints inducing \emph{extra-dependencies} between
    messages. We~also present an original algorithm to automatically check the
    deadlock-freeness of a network with a given routing function. A~prototype
    tool has been developed and automatic deadlock checking of large scale
    networks with various routing functions have been successfully achieved.
    We~provide comparative results with standard approach, highlighting the
    benefits of our method.}
}
@inproceedings{BE-acsd07,
  address = {Bratislava, Slovak Republik},
  month = jul,
  year = 2007,
  publisher = {{IEEE} Computer Society Press},
  editor = {Basten, Twan and Shukla, Sandeep},
  acronym = {{ACSD}'07},
  booktitle = {{P}roceedings of the 7th {I}nternational
               {C}onference on {A}pplication of {C}oncurrency
               to {S}ystem {D}esign
               ({ACSD}'07)},
  author = {Braunstein, C{\'e}cile and Encrenaz, Emmanuelle},
  title = {Using {CTL} formulae as component abstraction in a design and
                  verification flow},
  pages = {80-89},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BE-acsd07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BE-acsd07.pdf},
  doi = {10.1109/ACSD.2007.76},
  abstract = {The verification of global properties (involving several
    components) is difficult to achieve, due to combinatorial explosion
    problem, while the verification of each component is easier to perform.
    Following the idea of~[F.~Xie and J.~Browne. \textit{Verified Systems by
    Composition from Verified Components}. In~ESEC/FSE'03, pages~277-286,
    Helsinki, Finland, 2003. ACM~Press], we~propose to build an abstraction
    of a component already verified, starting from a subset of its
    specification described as CTL formulae. This abstraction replaces the
    concrete component in the context of global properties verification. }
}
@inproceedings{EF-infinity07,
  optaddress = {Lisbon, Portugal},
  month = jul,
  year = 2009,
  volume = 239,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  realeditor = {Madhusudan, P. and Kahlon, Vineet},
  editor = {Habermehl, Peter and Vojnar, Tom{\'a}{\v{s}}},
  acronym = {{INFINITY}'06,'07,'08},
  booktitle = {{J}oint {P}roceedings of the 8th, 9th and 10th {I}nternational 
               {W}orkshops on {V}erification of {I}nfinite
               {S}tate {S}ystems
               ({INFINITY}'06,'07,'08)},
  author = {Encrenaz, Emmanuelle and Finkel, Alain},
  title = {Automatic verification of counter systems with ranking functions},
  pages = {85-103},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EF-infinity07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EF-infinity07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/EF-infinity07.ps},
  doi = {10.1016/j.entcs.2009.05.032},
  abstract = {The verification of final termination for counter systems is
    undecidable. For non flattable counter systems, the verification of this
    type of property is generally based on the exhibition of a ranking
    function. Proving the existence of a ranking function for general counter
    systems is also undecidable. We~provide a framework in which the
    verification whether a given function is a ranking function is decidable.
    This framework is applicable to convex counter systems which admit a
    Presburger or a LPDS ranking function. This extends the results of
    [A.~Bradley, Z.~Manna, and B.~Sipma. \textit{Termination analysis of
    integer linear loops}. In~CONCUR'05, LNCS~3653, p.~488-502. Springer].
    From this framework, we derive a model-checking algorithm to verify
    whether a final termination property is satisfied or not. This approach
    has been successfully applied to the verification of a parametric version
    of the ZCSP protocol.}
}
@inproceedings{Bouyer-M4M5,
  address = {Cachan, France},
  month = mar,
  year = 2009,
  volume = 231,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Areces, Carlos and Demri, St{\'e}phane},
  acronym = {{M4M-5}},
  booktitle = {{P}roceedings of the 4th
               {W}orkshop on {M}ethods for {M}odalities
               ({M4M-5})},
  author = {Bouyer, Patricia},
  title = {Model-Checking Timed Temporal Logics},
  pages = {323-341},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bouyer-M4M5.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bouyer-M4M5.pdf},
  doi = {10.1016/j.entcs.2009.02.044},
  abstract = {In this paper, we present several timed extensions of temporal
                  logics, that can be used for model-checking real-time
                  systems. We give different formalisms and the corresponding
                  decidability/complexity results. We also give intuition to
                  explain these results.}
}
@proceedings{M4M5-AD,
  editor = {Areces, Carlos and Demri, St{\'e}phane},
  title = {{P}roceedings of the 5th {I}nternational {W}orkshop on
 		{M}ethods for {M}odalities  ({M4M-5})},
  booktitle = {{P}roceedings of the 5th {I}nternational {W}orkshop on
 		{M}ethods for {M}odalities  ({M4M-5})},
  publisher = {Elsevier Science Publishers},
  series = {Electronic Notes in Theoretical Computer Science},
  volume = 231,
  year = 2009,
  month = mar,
  address = {Cachan, France},
  url = {http://www.sciencedirect.com/science/journal/15710661/231},
  doi = {10.1016/j.entcs.2009.02.025}
}
@techreport{Prouve:rap10,
  author = {Delaune, St{\'e}phanie and Klay, Francis},
  title = {Synth{\`e}se des exp{\'e}rimentations},
  institution = {projet RNTL PROUV{\'E}},
  month = may,
  year = 2007,
  type = {Technical Report},
  number = 10,
  note = {10~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/prouve-rap10.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/prouve-rap10.pdf},
  abstract = {Dans ce document nous pr{\'e}sentons une synth{\`e}se des deux
    cas d'{\'e}tude trait{\'e}s durant le projet. Rappelons qu'il s'agit d'une
    part d'un protocole de commerce {\'e}lectronique et d'autre part d'un
    protocole de vote. Pour chacun de ces protocoles, nous analysons les
    r{\'e}sultats obtenus afin de d{\'e}gager l'apport des travaux issus du
    projet et les aspects qui n'ont pas pu etre compl{\`e}tement trait{\'e}s.
    Compte tenu des enseignements tir{\'e}s, dans la derni{\`e}re partie nous
    mettons en perspectives les axes de recherches envisageables pour traiter
    compl{\`e}tement des protocoles aussi complexes que celui du vote
    {\'e}lectronique.}
}
@techreport{Prouve:rap9,
  author = {Klay, Francis and Bozga, Liana and Lakhnech, Yassine and
		 Mazar{\'e}, Laurent and Delaune, St{\'e}phanie and 
		 Kremer, Steve},
  title = {Retour d'exp{\'e}rience sur la validation du vote {\'e}lectronique},
  institution = {projet RNTL PROUV{\'E}},
  month = nov,
  year = 2006,
  type = {Technical Report},
  number = 9,
  note = {47~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/prouve-rap9.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/prouve-rap9.pdf},
  abstract = {Dans ce rapport, nous pr{\'e}sentons le travail de
    v{\'e}rification qui a {\'e}t{\'e} r{\'e}alis{\'e} sur le protocole de
    vote {\'e}lectronique que nous avons introduit et formalis{\'e} dans le
    rapport RNTL Prouv{\'e} num{\'e}ro~\(6\). Ce protocole a {\'e}t{\'e} mis au
    point par J.~Traor{\'e}, ing{\'e}nieur de recherche chez France
    T{\'e}l{\'e}com. Il est bas{\'e} sur le m{\'e}canisme de signature en
    aveugle et peut {\^e}tre consid{\'e}r{\'e} comme un d{\'e}riv{\'e} du
    protocole de Fujioka, Okamoto et~Ohta.\par
    La formalisation de ce protocole {\`a} mis en {\'e}vidence une grande
    complexit{\'e} due en particulier aux structures de donn{\'e}es et aux
    primitives cryptographiques manipul{\'e}es. D'un autre c{\^o}t{\'e} ce
    travail a {\'e}galement r{\'e}v{\'e}l{\'e} que les propri{\'e}t{\'e}s de
    s{\^u}ret{\'e} {\`a} garantir sont particuli{\`e}rement subtiles.
    Ce~document pr{\'e}sente les r{\'e}sultats qui ont {\'e}t{\'e} obtenus
    lors de la v{\'e}rification de ce protocole. En particulier nous montrons
    que certaines propri{\'e}t{\'e}s de s{\^u}ret{\'e} ont pu {\^e}tre
    prouv{\'e}es automatiquement alors que pour d'autres une preuve manuelle
    s'est av{\'e}r{\'e}e n{\'e}cessaire.}
}
@techreport{LSV:07:31,
  author = {Jacquemard, Florent and Rusinowitch, Micha{\"e}l},
  title = {Rewrite Closure of {H}edge-Automata Languages},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2007,
  month = oct,
  type = {Research Report},
  number = {LSV-07-31},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-31.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-31.pdf},
  note = {22~pages},
  abstract = {We investigate some preservation properties for classes of
    regular languages of unranked ordered terms under an appropriate
    generalization of term rewriting subsuming both standard term rewriting
    and word rewriting.\par
    The considered classes include languages of hedge automata (HA) and some
    extension (called CF-HA) with context-free languages in transitions,
    instead of regular languages. In~particular, we~show, with a HA completion
    procedure, that the set of unranked terms reachable from a given HA
    language, using a so called inverse context-free rewrite system, is an HA
    language. Moreover, we~prove, using different techniques, the closure of
    CF-HA languages with respect to context-free rewrite systems, the
    symmetric case of the above rewrite systems. As~a consequence,
    the~problems of ground reachability and regular hedge model checking are
    decidable in both cases. We~give several several counter examples showing
    that we cannot relax the restrictions.}
}
@mastersthesis{dacosta-master,
  author = {Da{~}Costa, Arnaud},
  title = {Propri{\'e}t{\'e}s de jeux multi-agents},
  school = {{M}aster de {L}ogique {M}ath{\'e}matique
	et {F}ondements de l'{I}nformatique, Paris, France},
  type = {Rapport de {M}aster},
  year = 2007,
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/dacosta-m2.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/dacosta-m2.pdf}
}
@article{BHR-ietc07,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Bouyer, Patricia and Haddad, Serge and Reynier, Pierre-Alain},
  title = {Timed {P}etri Nets and Timed Automata: On the Discriminating
           Power of {Z}eno Sequences},
  year = {2008},
  month = jan,
  volume = 206,
  number = 1,
  pages = {73-107},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-ic07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-ic07.pdf},
  doi = {10.1016/j.ic.2007.10.004},
  abstract = {Timed Petri nets and timed automata are two standard models for
    the analysis of real-time systems. We~study in this paper their
    relationship, and prove in particular that they are incomparable w.r.t.
    language equivalence. In~fact, we~study the more general model of timed
    Petri nets with read-arcs (RA-TdPN), already introduced in~[Ji{\v{r}}{\'\i}~Srba,
                  \textit{Timed-arc petri nets vs. networks of timed
                  automata}, Proc.\ ICATPN'05, LNCS~3536, Springer], which
    unifies both models of timed Petri nets and of timed automata, and prove
    that the coverability problem remains decidable for this model. Then, we
    establish numerous expressiveness results and prove that Zeno behaviours
    discriminate between several sub-classes of RA-TdPNs. This has surprising
    consequences on timed automata, for~instance on the power of
    non-deterministic clock resets.}
}
@mastersthesis{villard-master,
  author = {Villard, Jules},
  title = {Logique spatiale pour le pi-calcul appliqu{\'e}},
  school = {{M}aster {P}arisien de {R}echerche en 
	{I}nformatique, Paris, France},
  type = {Rapport de {M}aster},
  year = 2007,
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/villard-m2.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/villard-m2.pdf}
}
@mastersthesis{vacher-master,
  author = {Vacher, Camille},
  title = {Accessibilit{\'e} inverse dans les automates d'arbres {\`a}
	 	 m{\'e}moire d'ordre sup{\'e}rieur},
  school = {{M}aster {P}arisien de {R}echerche en 
	{I}nformatique, Paris, France},
  type = {Rapport de {M}aster},
  year = 2007,
  month = sep,
  oldurl = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/vacher-m2.pdf},
  oldpdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/vacher-m2.pdf},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-35.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-35.pdf}
}
@inproceedings{CL-avocs07,
  address = {Oxford, UK},
  month = sep,
  year = {2007},
  editor = {Goldsmith, Michael and Roscoe, Bill},
  acronym = {{AVoCS}'07},
  booktitle = {{P}re-proceedings of the 7th {I}nternational
               {W}orkshop on {A}utomated {V}erification
               of {C}ritical {S}ystems
               ({AVoCS}'07)},
  author = {Cremers, Cas and Lafourcade, Pascal},
  title = {Comparing State Spaces in Automatic Security Protocol Verification},
  nmnote = {Pas paru dans les proceedings ENTCS},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CL-avocs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CL-avocs07.pdf},
  abstract = {Many tools exist for automatic security protocol verification,
    and most of them have their own particular language for specifying
    protocols and properties. Several protocol specification models and
    security properties have been already formally related to each other.
    However, there is a further difference between verification tools, which
    has not been investigated in depth before: the~explored state space. Some
    tools explore all possible behaviors, whereas others explore strict
    subsets, often by using so-called scenarios. Ignoring such differences can
    lead to wrong interpretations of the output of a tool. We~relate the
    explored state spaces to each other and find previously unreported
    differences between the various approaches. We~apply our study of state
    space relations in a performance comparison of several well-known
    automatic tools for security protocol verification. We~model a set of
    protocols and their properties as homogeneous as possible for each tool.
    We~analyze the performance of the tools over comparable state spaces. This
    work allows us for the first time to compare these automatic tools fairly,
    i.e.,~using the same protocol description and exploring the same state
    space. We~also propose some explanations for our experimental results,
    leading to a better understanding of the tools.}
}
@inproceedings{BG-asian07,
  address = {Doha, Qatar},
  month = dec,
  year = 2007,
  volume = 4846,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Cervesato, Iliano},
  acronym = {{ASIAN}'07},
  booktitle = {{P}roceedings of the 12th {A}sian
               {C}omputing {S}cience {C}onference
               ({ASIAN}'07)},
  author = {Bursztein, Elie and Goubault{-}Larrecq, Jean},
  title = {A Logical Framework for Evaluating Network Resilience Against
                  Faults and Attacks},
  pages = {212-227},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGL-asian07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGL-asian07.pdf},
  doi = {10.1007/978-3-540-76929-3_20},
  abstract = {We present a logic-based framework to evaluate the resilience of
                  computer networks in the face of incidents, i.e., attacks
                  from malicious intruders as well as random faults. Our model
                  uses a two-layered presentation of dependencies between
                  files and services, and of timed games to represent not just
                  incidents, but also the dynamic responses from
                  administrators and their respective delays. We demonstrate
                  that a variant TATL\(\Diamond\) of timed alternating-time temporal
                  logic is a convenient language to express several desirable
                  properties of networks, including several forms of
                  survivability. We illustrate this on a simple redundant Web
                  service architecture, and show that checking such timed
                  games against the so-called TATL\(\Diamond\) variant of the timed
                  alternating time temporal logic TATL is EXPTIME-complete.}
}
@inproceedings{HIRV-atva2007,
  address = {Tokyo, Japan},
  month = oct,
  year = {2007},
  volume = 4762,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Namjoshi, Kedar and Yoneda, Tomohiro},
  acronym = {{ATVA}'07},
  booktitle = {{P}roceedings of the 5th {I}nternational
               {S}ymposium on {A}utomated {T}echnology
               for {V}erification and {A}nalysis
               ({ATVA}'07)},
  author = {Habermehl, Peter and Iosif, Radu and Rogalewicz, Adam and
                  Vojnar, Tom{\'a}{\v{s}}},
  title = {Proving Termination of Tree Manipulating Programs},
  pages = {145-161},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HIRV-atva07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HIRV-atva07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/HIRV-atva07.ps},
  doi = {10.1007/978-3-540-75596-8_12},
  abstract = {We consider the termination problem of programs manipulating
    tree-like dynamic data structures. Our~approach is based on a
    counter-example guided abstraction refinement loop. We use abstract
    regular tree model-checking to infer invariants of the program. Then,
    we~translate the program to a counter automaton~(CA) which simulates~it.
    If~the CA can be shown to terminate using existing techniques, the~program
    terminates. If~not, we analyse the possible counterexample given by a~CA
    termination checker and either conclude that the program does not
    terminate, or else refine the abstraction and repeat. We~show that the
    spuriousness problem for lasso-shaped counterexamples is decidable in some
    non-trivial cases. We~applied the method successfully on several
    interesting case studies. }
}
@inproceedings{BHJS-fct07,
  address = {Budapest, Hungary},
  month = aug,
  year = 2007,
  volume = 4639,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Csuhaj-Varj{\'u}, Erzs{\'e}bet and {\'E}sik, Zolt{\'a}n},
  acronym = {{FCT}'07},
  booktitle = {{P}roceedings of the 16th {I}nternational {S}ymposium
	  on {F}undamentals of {C}omputation {T}heory
	  ({FCT}'07)},
  author = {Bouajjani, Ahmed and Habermehl, Peter and 
           Jurski, Yan and Sighireanu, Mihaela},
  title = {Rewriting Systems with Data~-- {A} Framework for Reasoning About Systems with Unbounded 
		Structures over Infinite Data Domains},
  pages = {1-22},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHJS-fct07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHJS-fct07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BHJS-fct07.ps},
  doi = {10.1007/978-3-540-74240-1_1},
  abstract = {We introduce a uniform framework for reasoning about
    infinite-state systems with unbounded control structures and unbounded
    data domains. Our~framework is based on constrained rewriting systems on
    words over an infinite alphabet. We~consider several rewriting semantics:
    factor, prefix, and multiset rewriting. Constraints are expressed in a
    logic on such words which is parametrized by a first-order theory on the
    considered data domain. We show that our framework is suitable for
    reasoning about various classes of systems such as recursive sequential
    programs, multithreaded programs, parametrized and dynamic networks of
    processes,~etc. Then, we provide generic results (1)~for the decidability
    of the satisfiability problem of the fragment of this logic provided that
    the underlying logic on data is decidable, and (2)~for proving inductive
    invariance and for carrying out Hoare style reasoning within this
    fragment. We also show that the reachability problem if decidable for a
    class of prefix rewriting systems with integer data.}
}
@inproceedings{GPT-aplas07,
  address = {Singapore},
  month = nov # {-} # dec,
  year = 2007,
  volume = 4807,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Shao, Zhong},
  acronym = {{APLAS}'07},
  booktitle = {{P}roceedings of the 5th {A}sian {S}ymposium
               on {P}rogramming {L}anguages and {S}ystems
               ({APLAS}'07)},
  author = {Goubault{-}Larrecq, Jean and Palamidessi, Catuscia and
                  Troina, Angelo},
  title = {A Probabilistic Applied Pi-Calculus},
  pages = {175-290},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GPT-aplas07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GPT-aplas07.pdf},
  doi = {10.1007/978-3-540-76637-7_12},
  abstract = {We propose an extension of the Applied Pi-calculus by
    introducing nondeterministic and probabilistic choice operators. The
    semantics of the resulting model, in which probability and nondeterminism
    are combined, is given by Segala's Probabilistic Automata driven by
    schedulers which resolve the nondeterministic choice among the probability
    distributions over target states. Notions of static and observational
    equivalence are given for the enriched calculus. In order to model the
    possible interaction of a process with its surrounding environment a
    labeled semantics is given together with a notion of weak bisimulation
    which is shown to coincide with the observational equivalence. Finally, we
    prove that results in the probabilistic framework are preserved in a
    purely nondeterministic setting.}
}
@inproceedings{ABG-fsttcs07,
  address = {New~Delhi, India},
  month = dec,
  year = 2007,
  volume = 4855,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Arvind, V. and Prasad, Sanjiva},
  acronym = {{FSTTCS}'07},
  booktitle = {{P}roceedings of the 27th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'07)},
  author = {Akshay, S. and Bollig, Benedikt and Gastin, Paul},
  title = {Automata and Logics for Timed Message Sequence Charts},
  pages = {290-302},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABG-fsttcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABG-fsttcs07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ABG-fsttcs07.ps},
  doi = {10.1007/978-3-540-77050-3_24},
  abstract = {We provide a framework for distributed systems that impose timing constraints 
    on their executions. We~propose a timed model of communicating finite-state machines, 
    which communicate by exchanging messages through channels and use event clocks to 
    generate collections of timed message sequence charts~(T-MSCs). As~a specification 
    language, we~propose a monadic second-order logic equipped with timing predicates and 
    interpreted over~T-MSCs. We establish expressive equivalence of our automata and logic. 
    Moreover, we prove that, for (existentially) bounded channels, emptiness and 
    satisfiability are decidable for our automata and logic.}
}
@inproceedings{CS-fsttcs07,
  address = {New~Delhi, India},
  month = dec,
  year = 2007,
  volume = 4855,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Arvind, V. and Prasad, Sanjiva},
  acronym = {{FSTTCS}'07},
  booktitle = {{P}roceedings of the 27th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'07)},
  author = {Chambart, Pierre and Schnoebelen, {\relax Ph}ilippe},
  title = {{P}ost Embedding Problem is not Primitive Recursive, 
		 with Applications to Channel Systems},
  pages = {265-276},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CS-fsttcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CS-fsttcs07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CS-fsttcs07.ps},
  doi = {10.1007/978-3-540-77050-3_22},
  abstract = {We introduce \textsf{PEP}, the Post Embedding Problem, a variant
    of \textsf{PCP} where one compares strings with the subword relation, and
    \textsf{PEP}\textsuperscript{reg}, a further variant where solutions are
    constrained and must belong to a given regular language.
    \textsf{PEP}\textsuperscript{reg} is decidable but not primitive
    recursive. This entails the decidability of reachability for
    unidirectional systems with one reliable and one lossy channel. }
}
@inproceedings{CDD-fsttcs07,
  address = {New~Delhi, India},
  month = dec,
  year = 2007,
  volume = 4855,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Arvind, V. and Prasad, Sanjiva},
  acronym = {{FSTTCS}'07},
  booktitle = {{P}roceedings of the 27th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'07)},
  author = {Cortier, V{\'e}ronique and Delaitre, J{\'e}r{\'e}mie and
                  Delaune, St{\'e}phanie},
  title = {Safely Composing Security Protocols},
  pages = {352-363},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDD-fsttcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDD-fsttcs07.pdf},
  addendumpdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/
  		CDD-fsttcs07-addendum.pdf},
  doi = {10.1007/978-3-540-77050-3_29},
  abstract = {Security protocols are small programs that are executed in
    hostile environments. Many results and tools have been developed to
    formally analyze the security of a protocol in the presence of active
    attackers that may block, intercept and send new messages. However even
    when a protocol has been proved secure, there is absolutely no guarantee
    if the protocol is executed in an environment where other protocols,
    possibly sharing some common identities and keys like public keys or
    long-term symmetric keys, are executed.\par
    In this paper, we show that security of protocols can be easily composed.
    More precisely, we show that whenever a protocol is secure, it remains
    secure even in an environment where arbitrary protocols are executed,
    provided each encryption contains some tag identifying each protocol, like
    e.g.~the name of the protocol.}
}
@inproceedings{BBBBG-fsttcs07,
  address = {New~Delhi, India},
  month = dec,
  year = 2007,
  volume = 4855,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Arvind, V. and Prasad, Sanjiva},
  acronym = {{FSTTCS}'07},
  booktitle = {{P}roceedings of the 27th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'07)},
  author = {Baier, Christel and Bertrand, Nathalie and Bouyer, Patricia
                  and Brihaye, {\relax Th}omas and Gr{\"o}{\ss}er, Marcus},
  title = {Probabilistic and Topological Semantics for Timed Automata},
  pages = {179-191},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBBG-fsttcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBBG-fsttcs07.pdf},
  doi = {10.1007/978-3-540-77050-3_15},
  abstract = {Like most models used in model-checking, timed automata are an
    idealized mathematical model used for representing systems with strong
    timing requirements. In~such mathematical models, properties can be
    violated, due to unlikely (sequences~of) events. We~propose two new
    semantics for the satisfaction of LTL formulas, one based on
    probabilities, and the other one based on topology, to rule out these
    sequences. We~prove that the two semantics are equivalent and lead to a
    PSPACE-Complete model-checking problem for LTL over finite executions.}
}
@inproceedings{BKM-fsttcs07,
  address = {New~Delhi, India},
  month = dec,
  year = 2007,
  volume = 4855,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Arvind, V. and Prasad, Sanjiva},
  acronym = {{FSTTCS}'07},
  booktitle = {{P}roceedings of the 27th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'07)},
  author = {Bollig, Benedikt and Kuske, Dietrich and Meinecke, Ingmar},
  title = {Propositional Dynamic Logic for Message-Passing Systems},
  pages = {303-315},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKM-fsttcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKM-fsttcs07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BKM-fsttcs07.ps},
  doi = {10.1007/978-3-540-77050-3_25},
  abstract = {We examine a bidirectional Propositional Dynamic Logic~(PDL) for message 
    sequence charts~(MSCs) extending LTL and~TLC\textsuperscript{-}.
    Every formula is translated into an equivalent communicating finite-state
    machine~(CFM) of exponential size. This synthesis problem is solved in full generality, 
    i.e.,~also for MSCs with unbounded channels. The model checking problems for CFMs and 
    for HMSCs against PDL formulas are shown to be in PSPACE for existentially 
    bounded~MSCs. It~is shown that CFMs are to weak to capture the semantics of PDL with 
    intersection.}
}
@inproceedings{DKR-fsttcs07,
  address = {New~Delhi, India},
  month = dec,
  year = 2007,
  volume = 4855,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Arvind, V. and Prasad, Sanjiva},
  acronym = {{FSTTCS}'07},
  booktitle = {{P}roceedings of the 27th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'07)},
  author = {Delaune, St{\'e}phanie and Kremer, Steve and Ryan, Mark D.},
  title = {Symbolic Bisimulation for the Applied Pi-Calculus},
  pages = {133-145},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-fsttcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-fsttcs07.pdf},
  doi = {10.1007/978-3-540-77050-3_11},
  abstract = {We propose a symbolic semantics for the finite applied pi
    calculus, which is a variant of the pi calculus with extensions for
    modelling cryptgraphic protocols. By~treating inputs symbolically, our
    semantics avoids potentially infinite branching of execution trees due to
    inputs from the environment. Correctness is maintained by associating with
    each process a set of constraints on symbolic terms. Based on the
    semantics, we~define a sound symbolic labelled bisimulation relation.
    This~is an important step towards automation of observational equivalence
    for the finite applied pi calculus, \emph{e.g.}, for verification of
    anonymity or strong secrecy properties of protocols with a bounded number
    of sessions.}
}
@inproceedings{DR-lpar07,
  address = {Yerevan, Armenia},
  month = oct,
  year = 2007,
  volume = 4790,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer},
  editor = {Dershowitz, Nachum and Voronkov, Andrei},
  acronym = {{LPAR}'07},
  booktitle = {{P}roceedings of the 14th {I}nternational
               {C}onference on {L}ogic for {P}rogramming,
               {A}rtificial {I}ntelligence, and {R}easoning
               ({LPAR}'07)},
  author = {Demri, St{\'e}phane and Rabinovich, Alexander},
  title = {The complexity of temporal logic with until and since over ordinals},
  pages = {531-545},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DR-lpar07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DR-lpar07.pdf},
  doi = {10.1007/978-3-540-75560-9_38},
  abstract = {We consider the temporal logic with since and until 
    modalities. This temporal logic is expressively equivalent over the 
    class of ordinals to first-order logic thanks to Kamp's theorem. 
    We~show that it has a PSPACE-complete satisfiability problem over the 
    class of ordinals. Among the consequences of our proof, we show that 
    given the code of some countable ordinal~\(\alpha\) and a formula, we 
    can decide in PSPACE whether the formula has a model over~\(\alpha\). 
    In~order to show these results, we~introduce a class of simple ordinal 
    automata, as expressive as B{\"u}chi ordinal automata. The PSPACE 
    upper bound for the satisfiability problem of the temporal logic is 
    obtained through a reduction to the nonemptiness problem for the 
    simple ordinal automata.}
}
@inproceedings{DLL-lpar07,
  address = {Yerevan, Armenia},
  month = oct,
  year = 2007,
  volume = 4790,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer},
  editor = {Dershowitz, Nachum and Voronkov, Andrei},
  acronym = {{LPAR}'07},
  booktitle = {{P}roceedings of the 14th {I}nternational
               {C}onference on {L}ogic for {P}rogramming,
               {A}rtificial {I}ntelligence, and {R}easoning
               ({LPAR}'07)},
  author = {Delaune, St{\'e}phanie and Lin, Hai and Lynch, {\relax Ch}ristopher},
  title = {Protocol verification via rigid{\slash}flexible resolution},
  pages = {242-256},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLL-lpar07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLL-lpar07.pdf},
  doi = {10.1007/978-3-540-75560-9_19},
  abstract = {In this paper we propose a decision procedure, 
	i.e., an~inference system for clauses containing rigid and 
	flexible variables. Rigid variables are only allowed to have 
	one instantiation, whereas flexible variables are allowed as 
	many instantiations as desired. We~assume a set of clauses 
	containing only rigid variables together with a set of clauses 
	containing only flexible variables. When the flexible clauses 
	fall into a particular class, we propose an inference system 
	based on ordered resolution that is sound and complete and for 
	which the inference procedure will halt.\par
	    An interest in this form of problem is for cryptographic 
	protocol verification for a bounded number of protocol 
	instances. Our class allows us to obtain a generic decidability 
	result for a large class of cryptographic protocols that may 
	use for instance~CBC (Cipher Block Chaining) encryption and 
	blind signature. }
}
@inproceedings{CD-lpar07,
  address = {Yerevan, Armenia},
  month = oct,
  year = 2007,
  volume = 4790,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer},
  editor = {Dershowitz, Nachum and Voronkov, Andrei},
  acronym = {{LPAR}'07},
  booktitle = {{P}roceedings of the 14th {I}nternational
               {C}onference on {L}ogic for {P}rogramming,
               {A}rtificial {I}ntelligence, and {R}easoning
               ({LPAR}'07)},
  author = {Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
  title = {Deciding Knowledge in Security Protocols for 
		 Monoidal Equational Theories},
  pages = {196-210},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CD-lpar07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CD-lpar07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CD-lpar07.ps},
  doi = {10.1007/978-3-540-75560-9_16},
  abstract = {In formal approaches, messages sent over a 
	network are usually modeled by terms together with an 
	equational theory, axiomatizing the properties of the 
	cryptographic functions (encryption, exclusive or,~...). 
	The~analysis of cryptographic protocols requires a 
	precise understanding of the attacker knowledge. Two 
	standard notions are usually used: deducibility and 
	indistinguishability. Only few results have been obtained 
	(in~an ad-hoc~way) for equational theories with 
	associative and commutative properties, especially in the 
	case of static equivalence. The~main contribution of this 
	paper is to propose a general setting for solving 
	deducibility and indistinguishability for an important 
	class (called monoidal) of these theories. Our~setting 
	relies on the correspondence between a monoidal 
	theory~{\(E\)} and a semiring~{\(S_E\)} which allows us 
	to give an algebraic characterization of the deducibility 
	and indistinguishability problems. As~a consequence we 
	recover easily existing decidability results and obtain 
	several new ones.}
}
@article{DLLT-IC07,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Delaune, St{\'e}phanie and Lafourcade, Pascal and 
		 Lugiez, Denis and Treinen, Ralf},
  title = {Symbolic protocol analysis for monoidal equational theories},
  pages = {312-351},
  volume = 206,
  number = {2-4},
  year = 2008,
  month = feb # {-} # apr,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLLT-ic07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLLT-ic07.pdf},
  doi = {10.1016/j.ic.2007.07.005},
  abstract = {We are interested in the design of 
	automated procedures for analyzing the (in)security of 
	cryptographic protocols in the Dolev-Yao model for a 
	bounded number of sessions when we take into account some 
	algebraic properties satisfied by the operators involved 
	in the protocol. This~leads to a more realistic model 
	than what we get under the perfect cryptography 
	assumption, but it implies that protocol analysis deals 
	with terms modulo some equational theory instead of terms 
	in a free algebra. The main goal of this paper is to set 
	up a general approach that works for a whole class of 
	monoidal theories which contains many of the specific 
	cases that have been considered so far in an ad-hoc way 
	(e.g.~exclusive~or, Abelian groups, exclusive or in 
	combination with the homomorphism axiom). We~follow a 
	classical schema for cryptographic protocol analysis 
	which proves first a locality result and then reduces the 
	insecurity problem to a symbolic constraint solving 
	problem. This approach strongly relies on the 
	correspondence between a monoidal theory~{\(E\)} and a 
	semiring~{\(S_E\)} which we use to deal with the symbolic 
	constraints. We~show that the well-defined symbolic 
	constraints that are generated by reasonable protocols 
	can be solved provided that unification in the monoidal 
	theory satisfies some additional properties. 
	The~resolution process boils down to solving particular 
	quadratic Diophantine equations that are reduced to 
	linear Diophantine equations, thanks to linear algebra 
	results and the well-definedness of the problem. Examples 
	of theories that do not satisfy our additional properties 
	appear to be undecidable, which suggests that our 
	characterization is reasonably tight.}
}
@proceedings{secret2007-pre,
  title = {{P}reliminary {P}roceedings of the 2nd 
           {I}nternational {W}orkshop on {S}ecurity and {R}ewriting {T}echniques
           ({SecReT}'07)},
  booktitle = {{P}reliminary {P}roceedings of the 2nd 
           {I}nternational {W}orkshop on {S}ecurity and {R}ewriting {T}echniques
           ({SecReT}'07)},
  editor = {Nesi, Monica and Treinen, Ralf},
  year = 2007,
  month = jul,
  address = {Paris, France}
}
@inproceedings{phs-time07,
  address = {Alicante, Spain},
  month = jun,
  year = 2007,
  publisher = {{IEEE} Computer Society Press},
  editor = {Goranko, Valentin and Wang, X. Sean},
  acronym = {{TIME}'07},
  booktitle = {{P}roceedings of the 14th {I}nternational {S}ymposium on 
	       {T}emporal {R}epresentation and {R}easoning
	       ({TIME}'07)},
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {Model Checking Branching-Time Logics},
  pages = {5},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/phs-time07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/phs-time07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/phs-time07.ps},
  doi = {10.1109/TIME.2007.52}
}
@inproceedings{CDP-formats07,
  address = {Salzburg, Austria},
  month = oct,
  year = 2007,
  volume = 4763,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Raskin, Jean-Fran{\c{c}}ois and Thiagarajan, P. S.},
  acronym = {{FORMATS}'07},
  booktitle = {{P}roceedings of the 5th {I}nternational {C}onference
           on {F}ormal {M}odelling and {A}nalysis of {T}imed
           {S}ystems ({FORMATS}'07)},
  author = {Chevalier, Fabrice and D'Souza, Deepak and Prabhakar,
                  Pavithra},
  title = {Counter-free Input Determined Timed Automata},
  pages = {82-97},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDP-formats07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDP-formats07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CDP-formats07.ps},
  doi = {10.1007/978-3-540-75454-1_8},
  abstract = {We identify a class of timed automata, which we call
                  counter-free input-determined automata, which characterize
                  the class of timed languages definable by several timed
                  temporal logics in the literature, including~MTL. We~make
                  use of this characterization to show that MTL+Past satisfies
                  an {"}ultimate stability{"} property with respect to periodic
                  sequences of timed words. Our results hold for both the
                  pointwise and continuous semantics. Along the way we
                  generalize the result of McNaughton-Papert to show a
                  counter-free automata characterization of FO-definable
                  finitely varying functions.}
}
@inproceedings{BM-formats07,
  address = {Salzburg, Austria},
  month = oct,
  year = 2007,
  volume = 4763,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Raskin, Jean-Fran{\c{c}}ois and Thiagarajan, P. S.},
  acronym = {{FORMATS}'07},
  booktitle = {{P}roceedings of the 5th {I}nternational {C}onference
           on {F}ormal {M}odelling and {A}nalysis of {T}imed
           {S}ystems ({FORMATS}'07)},
  author = {Bouyer, Patricia and Markey, Nicolas},
  title = {Costs are Expensive!},
  pages = {53-68},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BM-formats07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BM-formats07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BM-formats07.ps},
  doi = {10.1007/978-3-540-75454-1_6},
  abstract = {We study the model-checking problem for WMTL, 
    a~cost-extension of the linear-time timed temporal logic MTL, that is
    interpreted over weighted timed automata. We~draw a complete picture of
    the decidability for that problem: it~is decidable only for the class of
    one-clock weighted timed automata with a restricted stopwatch cost, and
    any slight extension of this model leads to undecidability. We~finally
    give some consequences on the undecidability of linear hybrid automata.}
}
@inproceedings{BCD-jouannaud,
  address = {Cachan, France},
  month = jun,
  year = 2007,
  volume = 4600,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  acronym = {{R}ewriting, {C}omputation and {P}roof},
  booktitle = {{R}ewriting, {C}omputation and {P}roof~--- {E}ssays {D}edicated to
                  {J}ean-{P}ierre {J}ouannaud on the {O}ccasion of his 60th {B}irthday},
  editor = {Comon{-}Lundh, Hubert and Kirchner, Claude and Kirchner,
                  H{\'e}l{\`e}ne},
  author = {Bursuc, Sergiu and Comon{-}Lundh, Hubert and Delaune,
                  St{\'e}phanie},
  title = {Deducibility Constraints, Equational Theory and Electronic Money},
  pages = {196-212},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BCD-jpj07.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BCD-jpj07.ps},
  doi = {10.1007/978-3-540-73147-4_10},
  abstract = {The starting point of this work is a case study (from France
    T\'el\'ecom) of an electronic purse protocol. The~goal was to prove that
    the protocol is secure or that there is an attack. Modeling the protocol
    requires algebraic properties of a fragment of arithmetic, typically
    containing modular exponentiation. The~usual equational theories described
    in papers on security protocols are too weak: the~protocol cannot even be
    executed in these models. We~consider here an equational theory which is
    powerful enough for the protocol to be executed, and for which unification
    is still decidable.\par
    Our main result is the decidability of the so-called intruder deduction
    problem, i.e.,~security in presence of a passive attacker, taking the
    algebraic properties into account. Our~equational theory is a combination
    of several equational theories over non-disjoint signatures.}
}
@proceedings{CLKK-jouannaud07,
  editor = {Comon{-}Lundh, Hubert and Kirchner, Claude and Kirchner,
                  H{\'e}l{\`e}ne},
  booktitle = {Rewriting, Computation and Proof~--- Essays Dedicated to
                  Jean-Pierre Jouannaud on the Occasion of his 60th Birthday},
  title = {Rewriting, Computation and Proof~--- Essays Dedicated to
                  Jean-Pierre Jouannaud on the Occasion of his 60th Birthday},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = 4600,
  year = 2007,
  month = jun,
  address = {Cachan, France},
  url = {http://www.springerlink.com/content/p0p40764x486/},
  doi = {10.1007/978-3-540-73147-4},
  isbn = {978-3-540-73146-7}
}
@phdthesis{chevalier-these2007,
  author = {Chevalier, Fabrice},
  title = {Logiques pour les syst{\`e}mes temporis{\'e}s~: contr{\^o}le et expressivit{\'e}},
  year = 2007,
  month = jun,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-FC07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-FC07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/these-FC07.ps}
}
@phdthesis{reynier-these2007,
  author = {Reynier, Pierre-Alain},
  title = {V{\'e}rification de syst{\`e}mes temporis{\'e}s et
                  distribu{\'e}s~: mod{\`e}les, algorithmes et impl{\'e}mentabilit{\'e}},
  year = 2007,
  month = jun,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-reynier.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-reynier.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/these-reynier.ps}
}
@phdthesis{demri-hab2007,
  author = {Demri, St{\'e}phane},
  title = {Logiques pour la sp{\'e}cification et v{\'e}rification},
  year = 2007,
  month = jun,
  type = {M{\'e}moire d'habilitation},
  school = {Universit{\'e} Paris~7, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/SD-habil07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/SD-habil07.pdf},
  futureslides = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/SLIDES/
                SD-habil-slides.ps.gz}
}
@phdthesis{encrenaz-hab2007,
  author = {Encrenaz{-}Tiph{\`e}ne, Emmanuelle},
  title = {Contributions pour la conception et la v{\'e}rification de
		syst{\`e}mes mat{\'e}riels embarqu{\'e}s},
  year = 2007,
  month = jun,
  type = {M{\'e}moire d'habilitation},
  school = {Universit{\'e} Paris~6, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EE-habil07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EE-habil07.pdf},
  futureslides = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/SLIDES/
                EE-habil-slides.ps.gz}
}
@techreport{LSV:07:21,
  author = {Chamseddine, Najla and Duflot, Marie and Fribourg, Laurent and Picaronny, Claudine},
  title = {Determinate Probabilistic Timed Automata as {M}arkov Chains with
                  Parametric Costs},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2007,
  month = may,
  type = {Research Report},
  number = {LSV-07-21},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-21.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-21.pdf},
  note = {17~pages},
  abstract = {We consider probabilistic systems modeled under the form of a
    special class of probabilistic timed automata. Such automata have {"}no
    choice{"}: when the automaton arrives at a node, the time at which it will
    leave it is determined; and when the automaton leaves the node, there is
    just one distribution of target nodes.\par
    In the paper, we give a method for computing the expected time~\(A\) for
    the automaton to reach an {"}absorbing{"} node. Roughly speaking, the
    method consists in putting the automaton under the form of a Markov chain
    with costs (corresponding to durations). Under certain conditions, the
    method is parametric in the sense that \(A\)~is computed as a function of
    the constants appearing in the outgoing conditions and the invariants of
    nodes, but does not assume known their explicit values.\par
    We illustrate the method on the CSMA/CD protocol.}
}
@techreport{LSV:07:20,
  author = {Bresciani, Riccardo},
  title = {The {ZRTP} Protocol~--- Security Considerations},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2007,
  month = may,
  type = {Research Report},
  number = {LSV-07-20},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-20.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-20.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
        rr-lsv-2007-20.ps},
  note = {23~pages},
  abstract = {ZRTP is draft of key agreement protocol by Phil~Zimmermann,
    which relies on a Diffie-Hellman exchange to generate SRTP session
    parameters, providing confidentiality and protecting against
    \emph{Man-in-the-Middle} attacks even without a public key infrastructure or
    endpoint certificates. This is an analysis of the protocol performed with
    AVISPA and ProVerif, which tests security properties of ZRTP; in~order to
    perform the analysis, the protocol has been modeled in HLPSL (for~AVISPA)
    and in the applied \(\pi\)-calculus (for~Proverif). An improvement to gather
    some extra resistance against \emph{Man-in-the-Middle} attacks is also proposed.}
}
@inproceedings{AMN-concur07,
  address = {Lisbon, Portugal},
  month = sep,
  year = 2007,
  volume = 4703,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Caires, Lu{\'\i}s and Vasconcelos, Vasco T.},
  acronym = {{CONCUR}'07},
  booktitle = {{P}roceedings of the 18th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'07)},
  author = {Akshay, S. and Mukund, Madhavan and Narayan Kumar, K.},
  title = {Checking Coverage for Infinite Collections of Timed Scenarios},
  pages = {181-196},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AMN-concur07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AMN-concur07.pdf},
  doi = {	10.1007/978-3-540-74407-8_13},
  abstract = {We consider message sequence charts enriched with timing
    constraints between pairs of events. As in the untimed setting, an
    infinite family of time-constrained message sequence charts~(TC-MSCs) is
    generated using an HMSC ---a finite-state automaton whose nodes are
    labelled by TC-MSCs. A~timed MSC is an MSC in which each event is assigned
    an explicit time-stamp. A~timed MSC covers a TC-MSC if it satisfies all
    the time constraints of the~TC-MSC. A~natural recognizer for timed MSCs is
    a message-passing automaton~(MPA) augmented with clocks. The~question we
    address is the following: given a timed system specified as a
    time-constrained HMSC H and an implementation in the form of a timed
    MPA~\(A\), is~every TC-MSC generated by~\(H\) covered by some timed MSC
    recognized by~\(A\)? We~give a complete solution for locally synchronized
    time-constrained HMSCs, whose underlying behaviour is always regular.
    We~also describe a restricted solution for the general case.}
}
@inproceedings{ACD-frocos07,
  address = {Liverpool, UK},
  month = sep,
  year = 2007,
  volume = 4720,
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer},
  editor = {Wolter, Franck},
  acronym = {{FroCoS}'07},
  booktitle = {{P}roceedings of the 6th {I}nternational {S}ymposium on {F}rontiers of
                  {C}ombining {S}ystems ({FroCoS}'07)},
  author = {Arnaud, Mathilde and Cortier, V{\'e}ronique and Delaune,
                  St{\'e}phanie},
  title = {Combining algorithms for deciding knowledge in security
                  protocols},
  pages = {103-117},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACD-frocos07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACD-frocos07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ACD-frocos07.ps},
  doi = {10.1007/978-3-540-74621-8_7},
  abstract = {In formal approaches, messages sent over a network are
                  usually modeled by terms together with an equational theory,
                  axiomatizing the properties of the cryptographic functions
                  (encryption, exclusive or,~...). The analysis of
                  cryptographic protocols requires a precise understanding of
                  the attacker knowledge. Two standard notions are usually
                  used: deducibility and indistinguishability. Those notions
                  are well-studied and a lot of decidability results already
                  exist to deal with a variety of equational theories.\par
                  We~show that decidability results can be easily combined for
                  any disjoint equational theories: if the deducibility and
                  indistinguishability relations are decidable for two
                  disjoint theories, they are also decidable for their union.
                  As~an application, new decidability results can be obtained
                  using this combination theorem.}
}
@inproceedings{KM-esorics07,
  address = {Dresden, Germany},
  month = sep,
  year = 2007,
  volume = 4734,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Biskup, Joachim and Lopez, Javier},
  acronym = {{ESORICS}'07},
  booktitle = {{P}roceedings of the 12th {E}uropean {S}ymposium on
		{R}esearch in {C}omputer {S}ecurity ({ESORICS}'07)},
  author = {Kremer, Steve and Mazar{\'e}, Laurent},
  title = {Adaptive Soundness of Static Equivalence},
  pages = {610-625},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KM-esorics07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KM-esorics07.pdf},
  doi = {10.1007/978-3-540-74835-9_40},
  abstract = {We define a framework to reason about implementations of 
   equational theories in the presence of an adaptive adversary. We 
   particularly focus on soundess of static equivalence. We illustrate our 
   framework on several equational theories: symmetric encryption, XOR, 
   modular exponentiation and also joint theories of encryption and modular 
   exponentiation. This last example relies on a combination result for 
   reusing proofs for the separate theories. Finally, we~define a model for 
   symbolic analysis of dynamic group key exchange protocols, and show its 
   computational soundness.}
}
@inproceedings{BLMO-concur07,
  address = {Lisbon, Portugal},
  month = sep,
  year = 2007,
  volume = 4703,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Caires, Lu{\'\i}s and Vasconcelos, Vasco T.},
  acronym = {{CONCUR}'07},
  booktitle = {{P}roceedings of the 18th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'07)},
  author = {Brihaye, {\relax Th}omas and Laroussinie, Fran{\c{c}}ois and
		 Markey, Nicolas and Oreiby, Ghassan},
  title = {Timed Concurrent Game Structures},
  pages = {445-459},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLMO-concur07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLMO-concur07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BLMO-concur07.ps},
  doi = {10.1007/978-3-540-74407-8_30},
  abstract = {We propose a new model for timed games, based on concurrent game
    structures~(CGSs). Compared to the classical \emph{timed game automata}
    of~Asarin \emph{et~al.}, our timed~CGSs are {"}more concurrent{"}, in the
    sense that they always allow all the agents to act on the system,
    independently of the delay they want to elapse before their action. Timed
    CGSs weaken the {"}element of surprise{"} of timed game automata reported
    by de~Alfaro \emph{et~al.}\par
    We prove that our model has nice properties, in particular that
    model-checking timed CGSs against timed \(\textsf{ATL}\) is decidable
    \emph{via} region abstraction, and in particular that strategies are
    {"}region-stable{"} if winning objectives are. We also propose a new
    extension of \(\textsf{TATL}\), containing~\(\textsf{ATL}^{*}\), which we
    call~\(\textsf{TALTL}\). We~prove that model-checking this logic remains
    decidable on timed CGSs. Last, we explain how our algorithms can be
    adapted in order to rule out Zeno (co-)strategies, based on the ideas of
    Henzinger \emph{et~al.}}
}
@inproceedings{Gou-csl07,
  address = {Lausanne, Switzerland},
  month = sep,
  year = 2007,
  volume = 4646,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Duparc, Jacques and Henzinger, {\relax Th}omas A.},
  acronym = {{CSL}'07},
  booktitle = {{P}roceedings of the 16th {A}nnual {EACSL} {C}onference on
                  {C}omputer {S}cience {L}ogic ({CSL}'07)},
  author = {Goubault{-}Larrecq, Jean},
  title = {Continuous Previsions},
  pages = {542-557},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-csl07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-csl07.pdf},
  doi = {10.1007/978-3-540-74915-8_40},
  abstract = {We define strong monads of continuous (lower, upper) previsions,
    and of forks, modeling both probabilistic and non-deterministic choice.
    This is an elegant alternative to recent proposals by Mislove, Tix,
    Keimel, and Plotkin. We show that our monads are sound and complete, in
    the sense that they model exactly the interaction between probabilistic
    and (demonic, angelic, chaotic) choice.}
}
@article{bozzelli-tcs07,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Bozzelli, Laura},
  title = {Complexity results on branching-time pushdown model checking},
  year = 2007,
  volume = 379,
  number = {1-2},
  pages = {286-297},
  month = jun,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bozzelli-tcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bozzelli-tcs07.pdf},
  doi = {10.1016/j.tcs.2007.03.049},
  abstract = {The model checking problem of pushdown systems (PMC~problem,
    for~short) against standard branching temporal logics has been intensively
    studied in the literature. In particular, for the modal \(\mu\)-calculus,
    the most powerful branching temporal logic used for verification, the
    problem is known to be EXPTIME-complete (even~for a fixed~formula).
    The~problem remains EXPTIME-complete also for the logic~CTL, which
    corresponds to a fragment of the alternation-free modal \(\mu\)-calculus.
    For~the logic~CTL\(^{*}\), the problem is known to be in 2EXPTIME. In~this
    paper, we~show that the complexity of the PMC problem for CTL\(^{\*}\) is
    in fact 2EXPTIME-complete. Moreover, we give a new optimal algorithm to
    solve this problem based on automata theoretic techniques. Finally, we
    prove that the program complexity of the PMC problem against CTL
    (i.e.,~the complexity of the problem in terms of the size of the~system)
    is EXPTIME-complete.}
}
@inproceedings{BGMN-fct07,
  address = {Budapest, Hungary},
  month = aug,
  year = 2007,
  volume = 4639,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Csuhaj-Varj{\'u}, Erzs{\'e}bet and {\'E}sik, Zolt{\'a}n},
  acronym = {{FCT}'07},
  booktitle = {{P}roceedings of the 16th {I}nternational {S}ymposium
	  on {F}undamentals of {C}omputation {T}heory
	  ({FCT}'07)},
  author = {Bhateja, Puneet and Gastin, Paul and Mukund, Madhavan and Narayan
                  Kumar, K.},
  title = {Local testing of message sequence charts is difficult},
  pages = {76-87},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGMN-fct07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGMN-fct07.pdf},
  doi = {10.1007/978-3-540-74240-1_8},
  abstract = {Message sequence charts are an attractive visual formalism used
    to specify distributed communicating systems. One~way to test such a
    system is to substitute a component by a test process and observe its
    interaction with the rest of the system. We~study the question of whether
    we can characterize the distributed behaviour of the system based on such
    local observations. The~main difficulty is that local observations can
    combine in unexpected ways to define implied scenarios not present in the
    original specification. It~is known that checking whether a scenario
    specification is closed with respect to implied scenarios is undecidable
    when observations are made one process at a time, even for regular
    specifications. We~show that this undecidability holds even if we have
    only two processes in the system. We then strengthen the observer to be
    able to observe multiple processes simultaneously. Even in this stronger
    framework, the problem remains undecidable. In~fact, undecidability
    continues to hold even without message labels, provided we observe two or
    more processes simultaneously. On~the other hand, if we do not have
    message labels and we restrict observations to one process at a time, the
    problem of checking for implied scenarios is decidable.}
}
@inproceedings{GM-spin07,
  address = {Berlin, Germany},
  month = jul,
  year = 2007,
  volume = 4595,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Bo{\v{s}}nacki, Dragan and Edelkamp, Stefan},
  acronym = {{SPIN}'07},
  booktitle = {{P}roceedings of the 14th {I}nternational
               {SPIN} {W}orkshop on {M}odel {C}hecking {S}oftware
               ({SPIN}'07)},
  author = {Gastin, Paul and Moro, Pierre},
  title = {Minimal counter-example generation for {SPIN}},
  pages = {24-38},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GM-spin07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GM-spin07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/GM-spin07.ps},
  doi = {10.1007/978-3-540-73370-6_4},
  abstract = {In this paper, we propose an algorithm to compute a counter-example of
  minimal size to some property in a finite state program, using the same
  programmation constraints than~SPIN. This algorithm uses nested
  Breadth-first searches guided by priority queues.
  This algorithm works in quadratic time and is linear in memory.}
}
@misc{versydis-final,
  author = {Gastin, Paul and others},
  title = {{ACI} {S}{\'e}curit{\'e} {I}nformatique {VERSYDIS}~--- 
            Rapport final},
  year = 2006,
  month = oct,
  type = {Contract Report},
  note = {10~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Versydis-final.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Versydis-final.pdf}
}
@article{GK-fi07,
  publisher = {{IOS} Press},
  journal = {Fundamenta Informaticae},
  author = {Gastin, Paul and Kuske, Dietrich},
  title = {Uniform satisfiability in {PSPACE} for local temporal logics
	  over {M}azurkiewicz traces},
  volume = 80,
  number = {1-3},
  pages = {169-197},
  year = 2007,
  month = nov,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GK-fi07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GK-fi07.pdf},
  abstract = {We study the complexity of temporal logics over
  concurrent systems that can be described by Mazurkiewicz traces. We
  develop a general method to prove that the uniform satisfiability
  problem of local temporal logics is in~PSPACE. We~also
  demonstrate that this method applies to all known local temporal
  logics.}
}
@misc{cortos-final,
  author = {Bouyer, Patricia and others},
  title = {{ACI} {S}{\'e}curit{\'e} {I}nformatique {CORTOS}~--- 
            Rapport final},
  year = 2006,
  month = nov,
  type = {Contract Report},
  note = {17~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Cortos-final.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Cortos-final.pdf}
}
@misc{persee-final,
  author = {Schnoebelen, {\relax Ph}ilippe and Bouajjani, Ahmed and Sutre, Gr{\'e}goire},
  title = {{ACI} {S}{\'e}curit{\'e} {I}nformatique {PERS{\'E}E}~--- 
            Rapport final},
  year = 2006,
  month = nov,
  type = {Contract Report},
  note = {12~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Persee-final.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Persee-final.pdf}
}
@techreport{DGA:rap3,
  author = {Lafourcade, Pascal},
  title = {Rapport final d'activit{\'e} {\`a}~{\(11\)}~mois, contrat~{CNRS/DGA} 
         r{\'e}f{\'e}rence~: 06~60~019~00~470~75~01
         <<~{U}tilisation et exploitation des th{\'e}ories {\'e}quationnelles 
	    dans l'analyse des protocoles cryptographiques~>>},
  type = {Contract Report},
  institution = {DGA},
  year = {2007},
  month = oct,
  note = {6~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PS/DGA-rap3.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PS/DGA-rap3.ps}
}
@techreport{DGA:rap2,
  author = {Lafourcade, Pascal},
  title = {Rapport d'activit{\'e}s {\`a}~{\(6\)}~mois, contrat~{CNRS/DGA} 
         r{\'e}f{\'e}rence~: 06~60~019~00~470~75~01
         <<~{U}tilisation et exploitation des th{\'e}ories {\'e}quationnelles 
	    dans l'analyse des protocoles cryptographiques~>>},
  type = {Contract Report},
  institution = {DGA},
  year = {2007},
  month = apr,
  note = {5~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PS/DGA-rap2.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PS/DGA-rap2.ps}
}
@techreport{DGA:rap1,
  author = {Lafourcade, Pascal},
  title = {Rapport d'activit{\'e}s {\`a}~{\(3\)}~mois, contrat~{CNRS/DGA} 
         r{\'e}f{\'e}rence~: 06~60~019~00~470~75~01
         <<~{U}tilisation et exploitation des th{\'e}ories {\'e}quationnelles 
	    dans l'analyse des protocoles cryptographiques~>>},
  type = {Contract Report},
  institution = {DGA},
  year = {2007},
  month = jan,
  note = {3~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PS/DGA-rap1.ps},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PS/DGA-rap1.ps}
}
@inproceedings{DG-time07,
  address = {Alicante, Spain},
  month = jun,
  year = 2007,
  publisher = {{IEEE} Computer Society Press},
  editor = {Goranko, Valentin and Wang, X. Sean},
  acronym = {{TIME}'07},
  booktitle = {{P}roceedings of the 14th {I}nternational {S}ymposium on 
	       {T}emporal {R}epresentation and {R}easoning
	       ({TIME}'07)},
  author = {Demri, St{\'e}phane and Gascon, R{\'e}gis},
  title = {The Effects of Bounding Syntactic Resources on {P}resburger
		  {LTL} (Extended Abstract)},
  pages = {94-104},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-time07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-time07.pdf},
  doi = {10.1109/TIME.2007.63},
  abstract = {We study decidability and complexity issues for fragments of LTL
    with Presburger constraints by restricting the syntactic resources of the
    formulae (the~class of constraints, the number of variables and the
    distance between two states for which counters can be compared) while
    preserving the strength of the logical operators. We provide a complete
    picture refining known results from the literature, in some cases pushing
    forward the known decidability limits. By~way of example, we show that
    model-checking formulae from LTL with quantifier-free Presburger
    arithmetic over one-counter automata is only PSPACE-complete. In~order to
    establish the PSPACE upper bound, we show that the nonemptiness problem
    for Buchi one-counter automata taking values in~\(\mathbb{Z}\) and
    allowing zero tests and sign tests, is only NLOGSPACE-complete.}
}
@article{BGP-fmsd07,
  publisher = {Springer},
  journal = {Formal Methods in System Design},
  author = {B{\'e}rard, B{\'e}atrice and Gastin, Paul and Petit,
                  Antoine},
  title = {Timed substitutions for regular signal-event languages},
  volume = 31,
  number = 2,
  pages = {101-134},
  year = 2007,
  month = oct,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGP-fmsd07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGP-fmsd07.pdf},
  doi = {10.1007/s10703-007-0034-5},
  abstract = {In the classical framework of formal languages, a refinement
   operation is modeled by a substitution and an abstraction by an inverse
   substitution. These mechanisms have been widely studied, because they
   describe a change in the specification level, from an abstract view to a
   more concrete one, or conversely. For timed systems, there is up to now no
   uniform notion of substitution. In~this paper, we~study timed substitutions
   in the general framework of signal-event languages, where both signals and
   events are taken into account. We prove that regular signal-event languages
   are closed under substitution and inverse substitution.\par
   To obtain these results, we use in a crucial way a {"}well known{"} result:
   regular signal-event languages are closed under intersection. In fact,
   while this result is indeed easy for languages defined by Alur and Dill's
   timed automata, it turns out that the construction is much more tricky when
   considering the most involved model of signal-event automata. We give here
   a construction working on finite and infinite signal-event words and taking
   into account signal stuttering, unobservability of zero-duration \(\tau\)-signals
   and Zeno runs. Note that if several constructions have been proposed in
   particular cases, it is the first time that a general construction is
   provided.}
}
@inproceedings{JGL-icalp07,
  address = {Wroc{\l}aw, Poland},
  month = jul,
  year = 2007,
  volume = 4596,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Arge, Lars and Cachin, {\relax Ch}ristian and Jurdzi{\'n}ski, Tomasz
	 	and Tarlecki, Andrzej},
  acronym = {{ICALP}'07},
  booktitle = {{P}roceedings of the 34th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming ({ICALP}'07)},
  author = {Goubault{-}Larrecq, Jean},
  title = {Continuous Capacities on Continuous State Spaces},
  pages = {764-776},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-icalp07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-icalp07.pdf},
  doi = {10.1007/978-3-540-73420-8_66},
  abstract = {We propose axiomatizing some stochastic games, in a
    continuous state
    space setting, using continuous belief functions, resp.
    plausibilities, instead of measures.  Then, stochastic games are
    just variations on continuous Markov chains.  We argue that drawing
    at random along a belief function is the same as letting the
    probabilistic player~\(P\) play first, then letting the
    non-deterministic player~\(C\) play demonically.  The same
    holds for an angelic~\(C\), using plausibilities instead.
    We then define a simple modal logic, and characterize simulation in
    terms of formulae of this logic.  Finally, we show that (discounted)
    payoffs are defined and unique, where in the demonic case, 
    \(P\)~maximizes payoff, while \(C\)~minimizes it}
}
@inproceedings{BHPR-icalp07,
  address = {Wroc{\l}aw, Poland},
  month = jul,
  year = 2007,
  volume = 4596,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Arge, Lars and Cachin, {\relax Ch}ristian and Jurdzi{\'n}ski, Tomasz
	 	and Tarlecki, Andrzej},
  acronym = {{ICALP}'07},
  booktitle = {{P}roceedings of the 34th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming ({ICALP}'07)},
  author = {Brihaye, {\relax Th}omas and Henzinger, {\relax Th}omas A. and
                  Prabhu, Vinayak and Raskin, Jean-Fran{\c{c}}ois},
  title = {Minimum-Time Reachability in Timed Games},
  pages = {825-837},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHPR-icalp07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHPR-icalp07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BHPR-icalp07.ps},
  doi = {10.1007/978-3-540-73420-8_71},
  abstract = {We consider the minimum-time reachability problem in concurrent
    two-player timed automaton game structures. We~show how to compute the
    minimum time needed by a player to reach a location against all possible
    choices of the opponent. We~do not put any syntactic restriction on the
    game structure, nor do we require any player to guarantee time divergence.
    We~only require players to use physically realizable strategies.
    The~minimal time is computed in part using a fixpoint expression which we
    show can be used on equivalence classes of a non-trivial extension of the
    region equivalence relation.}
}
@inproceedings{CDS-csf07,
  address = {Venice, Italy},
  month = jul,
  year = 2007,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{CSF}'07},
  booktitle = {{P}roceedings of the 
               20th {IEEE} {C}omputer {S}ecurity {F}oundations
               {S}ymposium ({CSF}'07)},
  author = {Cortier, V{\'e}ronique and Delaune, St{\'e}phanie and Steel, Graham},
  title = {A Formal Theory of Key Conjuring},
  pages = {79-93},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDS-csf07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDS-csf07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CDS-csf07.ps},
  doi = {10.1109/CSF.2007.5},
  abstract = {We describe a formalism for \emph{key conjuring}, the process by
    which an attacker obtains an unknown, encrypted key by repeatedly calling
    a cryptographic API function with random values in place of keys. This
    technique has been used to attack the security APIs of several Hardware
    Security Modules~(HSMs), which are widely deployed in the ATM (cash
    machine) network. We~propose a formalism for detecting computationally
    feasible key conjuring operations, incorporated into a Dolev-Yao style
    model of the security~API. We~show that security in the presence of key
    conjuring operations is decidable for a particular class of~APIs, which
    includes the key management~API of IBM's Common Cryptographic
    Architecture~(CCA).}
}
@inproceedings{Gou-lics07,
  address = {Wroc{\l}aw, Poland},
  month = jul,
  year = 2007,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'07},
  booktitle = {{P}roceedings of the 22nd
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'07)},
  author = {Goubault{-}Larrecq, Jean},
  title = {On {N}oetherian Spaces},
  pages = {453-462},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-lics07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-lics07.pdf},
  doi = {10.1109/LICS.2007.34},
  abstract = {A topological space is Noetherian iff every open is compact.
  Our~starting point is that this notion generalizes that of
  well-quasi order, in the sense that an Alexandroff-discrete space is
  Noetherian iff its specialization quasi-ordering is well.  For~more
  general spaces, this opens the way to verifying infinite transition
  systems based on non-well quasi ordered sets, but where the preimage
  operator satisfies an additional continuity assumption.  The
  technical development rests heavily on techniques arising from
  topology and domain theory, including sobriety and the de Groot dual
  of a stably compact space.  We~show that the category Nthr of
  Noetherian spaces is finitely complete and finitely cocomplete.
  Finally, we note that if \(X\)~is a Noetherian space, then the set of
  all (even infinite) subsets of~\(X\) is again Noetherian, a~result
  that fails for well-quasi orders.}
}
@inproceedings{BMOW-lics07,
  address = {Wroc{\l}aw, Poland},
  month = jul,
  year = 2007,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'07},
  booktitle = {{P}roceedings of the 22nd
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'07)},
  author = {Bouyer, Patricia and Markey, Nicolas and Ouaknine, Jo{\"e}l and
	    Worrell, James},
  title = {The Cost of Punctuality},
  pages = {109-118},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BMOW-lics07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BMOW-lics07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BMOW-lics07.ps},
  doi = {10.1109/LICS.2007.49},
  abstract = {In an influential paper titled {"}The Benefits of
      Relaxing Punctuality{"}, Alur, Feder, and~Henzinger introduced
      Metric Interval Temporal Logic~(MITL) as a fragment of the real-time
      logic Metric Temporal Logic~(MTL) in which exact or punctual timing
      constraints are banned. Their main result showed that model checking and
      satisfiability for~MITL are both EXPSPACE-Complete.\par
      Until recently, it was widely believed that admitting even the simplest
      punctual specifications in any linear-time temporal logic would
      automatically lead to undecidability. Although this was recently
      disproved, until now no punctual fragment of~MTL was known to have even
      primitive recursive complexity (with certain decidable fragments having
      provably non-primitive recursive complexity).\par
      In this paper we identify a `co-flat' subset of~MTL that is capable of
      expressing a large class of punctual specifications and for which model
      checking (although not satisfiability) has no complexity cost over~MITL.
      Our logic is moreover qualitatively different from~MITL in that it can
      express properties that are not timed-regular. Correspondingly, our
      decision procedures do not involve translating formulas into
      finite-state automata, but rather into certain kinds of reversal-bounded
      Turing machines. Using this translation we show that the model checking
      problem for our logic is EXPSPACE-Complete, and is even PSPACE-Complete
      if timing constraints are encoded in unary.}
}
@inproceedings{BDL-hav07,
  address = {Braga, Portugal},
  month = mar,
  year = 2007,
  editor = {Berdine, Josh and Sagiv, Mooly},
  acronym = {{HAV}'07},
  booktitle = {{P}roceedings of the 1st {W}orkshop on {H}eap {A}nalysis and 
		{V}erification ({HAV}'07)},
  author = {Brochenin, R{\'e}mi and Demri, St{\'e}phane and Lozes, {\'E}tienne},
  title = {Reasoning about Sequences of Memory States},
  preliminary-version-of = {BDL-lfcs2007},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDL-hav07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDL-hav07.pdf},
  abstract = {In order to verify programs with pointer variables, 
    we introduce a temporal logic LTL\textsuperscript{mem} whose 
    underlying 
    assertion language is the 
    quantifier-free fragment of separation logic and the temporal logic on 
    the 
    top of it is  the standard linear-time temporal logic~LTL. We~state 
    the 
    complexity of various model-checking and satisfiability problems for 
    LTL\textsuperscript{mem} , considering various  
    fragments of separation logic (including pointer arithmetic), various 
    classes of models (with or without constant heap), and the influence  
    of fixing the initial memory state.
    Our main decidability result is PSPACE-completeness of the 
    satisfiability problems on the record fragment and on a classical 
    fragment allowing pointer arithmetic. 
    \(\Sigma^{0}_{1}\)-completeness or \(\Sigma^{1}_{1}\)-completeness 
    results 
    are established for various problems, and underline the tightness of 
    our decidability results.}
}
@techreport{LSV:07:10,
  author = {Bouhoula, Adel and Jacquemard, Florent},
  title = {Tree Automata, Implicit Induction and Explicit Destructors for 
	    Security Protocol Verification},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2007,
  month = feb,
  type = {Research Report},
  number = {LSV-07-10},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-10.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-10.pdf},
  note = {21~pages},
  abstract = {We present a new method for automatic implicit induction theorem
    proving, and its application for the verification of cryptographic
    protocols. The~method is based on constrained tree grammars and handles
    non-confluent rewrite systems which are required in the context of the
    verification of security protocols because of the non-deterministic
    behavior of attackers. It~also handles axioms between constructor terms
    which allows us to specify explicit destructors representing cryptographic
    operators. Constrained tree grammars are used in our procedure both as
    induction schemes and as oracles for checking validity and redundancy by
    reduction to an emptiness problem. They also permit to characterize
    security failure of cryptographic protocols as sets of execution traces
    corresponding to an attack. This~way, we obtain a generic framework for
    the verification of protocols, in~which we can verify reachability
    properties like confidentiality, but also more complex properties like
    authentication. We present three case studies which gave very promising
    results.}
}
@techreport{KL-eth07,
  author = {Ksi{\k e}{\. z}opolski, Bogdan and Lafourcade, Pascal},
  title = {Attack and Revison of an Electronic Auction Protocol using~{OFMC}},
  institution = {Department of Computer Science, ETH Zurich, Switzerland},
  year = 2007,
  month = feb,
  type = {Technical Report},
  number = {549},
  note = {13~pages},
  nmnote = {on peut pas dire que ce soit un papier du labo... Si en fait,
                  car Pascal etait la-bas sur un contrat gere par le LSV},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KL-eth549.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KL-eth549.pdf},
  abstract = {In the article we show an attack on the cryptographic protocol
                  of electronic auction with extended requirements
                  [Ksiezopolski and Kotulski, \textit{Cryptographic protocol
                  for electronic auctions with extended requirements},~2004].
                  The found attack consists of authentication breach and
                  secret retrieval. It~is a kind of {"}man-in-the-middle
                  attack{"}. The intruder impersonates an agent and learns some
                  secret information. We have discovered this flaw unsing OFMC
                  an automatic tool of cryptographic protocol verification.
                  After a description of this attack, we propose a new version
                  of the e-auction protocol. We also check with OFMC the
                  secrecy for the new protocol and give an informal proof of
                  the other properties that this new e-auction protocol has to
                  guarantee.}
}
@inproceedings{Maz-wits07,
  address = {Braga, Portugal},
  month = mar,
  year = 2007,
  editor = {Focardi, Riccardo},
  acronym = {{WITS}'07},
  booktitle = {{P}reliminary {P}roceedings of the 7th {I}nternational {W}orkshop 
           on {I}ssues in the {T}heory of {S}ecurity ({WITS}'07)},
  author = {Mazar{\'e}, Laurent},
  title = {Computationally Sound Analysis of Protocols using Bilinear Pairings},
  pages = {6-21},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Maz-wits07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Maz-wits07.pdf},
  abstract = {In this paper, we introduce a symbolic model to analyse
    protocols that use a bilinear pairing between two cyclic groups. This
    model consists in an extension of the Abadi-Rogaway logic and we prove
    that the logic is still computationally sound: symbolic
    indistinguishability implies computational indistinguishability provided
    that the Bilinear Decisional Diffie-Hellman assumption is verified and
    that the encryption scheme is IND-CPA secure. We~illustrate our results on
    classical protocols using bilinear pairing like Joux tripartite
    Diffie-Hellman protocol or the TAK-2 and TAK-3 protocols.}
}
@inproceedings{BDL-lfcs2007,
  address = {New~York, New~York, USA},
  month = jun,
  year = 2007,
  volume = 4514,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Artemov, Sergei N. and Nerode, Anil},
  acronym = {{LFCS}'07},
  booktitle = {{P}roceedings of the {S}ymposium on {L}ogical {F}oundations of
	{C}omputer {S}cience ({LFCS}'07)},
  author = {Brochenin, R{\'e}mi and Demri, St{\'e}phane and Lozes, {\'E}tienne},
  title = {Reasoning about sequences of memory states},
  pages = {100-114},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDL-lfcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDL-lfcs07.pdf},
  doi = {	10.1007/978-3-540-72734-7_8},
  abstract = {Motivated by the verification of programs with pointer
    variables, we introduce a temporal logic LTL\textsuperscript{mem} whose
    underlying assertion language is the quantifier-free fragment of
    separation logic and the temporal logic on the top of it is the standard
    linear-time temporal logic~LTL. We analyze the complexity of various
    model-checking and satisfiability problems for LTL\textsuperscript{mem},
    considering various fragments of separation logic (including pointer
    arithmetic), various classes of models (with or without constant heap),
    and the influence of fixing the initial memory state. We~provide a
    complete picture based on these criteria. Our main decidability result is
    PSPACE-completeness of the satisfiability problems on the record fragment
    and on a classical fragment allowing pointer arithmetic. 
    \(\Sigma^{0}_{1}\)-completeness or \(\Sigma^{1}_{1}\)-completeness
    results are established for various problems by reducing standard problems
    for Minsky machines, and underline the tightness of our decidability
    results.}
}
@inproceedings{BK-lata2007,
  address = {Tarragona, Spain},
  month = mar # {-} # apr,
  year = 2007,
  futureseries = {Lecture Notes in Computer Science},
  nmnote = {published as Report 35/07 Research Group on Mathematical
                  Linguistics, Universitat Rovira i Virgili, Tarragona},
  editor = {{\'E}sik, Zolt{\'a}n and Mart{\'\i}n-Vide, Carlos and 
                  Mitrana, Victor},
  acronym = {{LATA}'07},
  booktitle = {{P}reliminary {P}roceedings of the 1st {I}nternational {C}onference on {L}anguage 
	    and {A}utomata {T}heory and {A}pplications ({LATA}'07)},
  author = {Bollig, Benedikt and Kuske, Dietrich},
  title = {{M}uller Message-Passing Automata and Logics},
  nopages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BK-lata07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BK-lata07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BK-lata07.ps},
  abstract = {We study nonterminating message-passing automata whose behavior
    is described by infinite message sequence charts. As~a~first result, we
    show that Muller, B{\"u}chi, and termination-detecting Muller acceptance are
    equivalent for these devices. To describe the expressive power of these
    automata, we give a logical characterization. More precisely, we show that
    they have the same expressive power as the existential fragment of a
    monadic second-order logic featuring a first-order quantifier to express
    that there are infinitely many elements satisfying some property. Our
    result is based on a new extension of the classical Ehrenfeucht-Fra{\"\i}ss{\'e}
    game to cope with infinite structures and the new first-order quantifier.}
}
@techreport{LSV:07:03,
  author = {Goubault{-}Larrecq, Jean},
  title = {Believe It Or Not, {GOI}~is a Model of Classical Linear Logic},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2007,
  month = jan,
  type = {Research Report},
  number = {LSV-07-03},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-03.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-03.pdf},
  note = {18~pages},
  othernote = {a draft of the longer version of this report is available at 
          http://www.lsv.ens-cachan.fr/~goubault/isg.pdf},
  abstract = {We introduce the Danos-R\'egnier category \(\mathcal{DR}(M)\) of a linear
  inverse monoid~\(M\), a categorical description of geometries of
  interaction~(GOI).  The usual setting for GOI is that of a weakly
  Cantorian linear inverse monoid.  It is well-known that GOI is
  perfectly suited to describe the multiplicative fragment of linear
  logic, and indeed \(\mathcal{DR}(M)\) will be a \(*\)-autonomous category in this
  case.  It is also well-known that the categorical interpretation of
  the other linear connectives conflicts with GOI interpretations.  We
  make this precise, and show that \(\mathcal{DR}(M)\) has no terminal object, no
  cartesian product, and no exponential---whatever \(M\) is, unless \(M\)
  is trivial.  However, a form of coherence completion of~\(\mathcal{DR}(M)\) \`a
  la Hu-Joyal provides a model of full classical linear logic, as soon
  as \(M\) is weakly Cantorian.}
}
@article{LS-ipl07,
  publisher = {Elsevier Science Publishers},
  journal = {Information Processing Letters},
  author = {Laroussinie, Fran{\c{c}}ois and Sproston, Jeremy},
  title = {State Explosion in Almost-Sure Probabilistic Reachability},
  year = 2007,
  volume = {102},
  number = {6},
  pages = {236-241},
  month = jun,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LS-ipl07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LS-ipl07.pdf},
  doi = {10.1016/j.ipl.2007.01.003},
  abstract = {We show that the problem of reaching a state set with
    probability~\(1\) in probabilistic-nondeterministic systems operating in
    parallel is EXPTIME-complete. We then show that this probabilistic
    reachability problem is EXPTIME-complete also for probabilistic timed
    automata.}
}
@article{DO-fi2007,
  publisher = {{IOS} Press},
  journal = {Fundamenta Informaticae},
  author = {Demri, St{\'e}phane and Or{\l}owska, Ewa},
  title = {Relative Nondeterministic Information Logic is 
		  {EXPTIME}-complete},
  year = {2007},
  volume = {75},
  number = {1-4},
  pages = {163-178},
  nmnote = {Special issue in memory of Z.~Paw{\l}ak},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DO-fi07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DO-fi07.pdf},
  abstract = {We define a relative version of the logic NIL introduced by
                  Or{\l}owska, Paw{\l}ak and Vakarelov and we show that its
                  satisfiability is not only decidable but also
                  EXPTIME-complete. Such a logic combines two ingredients that
                  are seldom present simultaneously in information logics:
                  frame conditions involving more than one information
                  relation and relative frames. The~EXPTIME upper bound is
                  obtained by designing a well-suited decision procedure based
                  on the nonemptiness problem of B{\"u}chi automata on
                  infinite trees. The paper provides evidence that B{\"u}chi
                  automata on infinite trees are crucial language acceptors
                  even for relative information logics with multiple types of
                  relations.}
}
@techreport{LSV:07:02,
  author = {Reynier, Pierre-Alain},
  title = {Diagonal constraints handled efficiently in~{UPPAAL}},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2007,
  month = jan,
  type = {Research Report},
  number = {LSV-07-02},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-02.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-02.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
	rr-lsv-2007-02.ps},
  note = {4~pages},
  abstract = {Timed automata (TA) are widely used to model real-time systems,
and UPPAAL is one of the most popular model-checker for this framework which
has been successfully applied over numerous industrial case studies. Diagonal
constraints are a natural extension of TA, that does not increase expressive
power, but gives conciseness. Unfortunately the classical forward algorithm
for reachability analysis cannot be used to deal directly with diagonal
constraints. Thus the current method implemented consists in removing them
on-the-fly, which implies a complexity blow-up. In~[P.~Bouyer, F.~Laroussinie,
and P.-A.~Reynier. \textit{Diagonal constraints in timed automata: Forward analysis of
timed systems}. Proceedings of FORMATS'06, LNCS~3829, p.~112-126, Springer], a
counter-example guided refinement algorithm has been proposed. In~this paper,
we present its implementation, and give some benchmarks on a variant of
Fischer's protocol. }
}
@phdthesis{THESE-baudet07,
  author = {Baudet, Mathieu},
  title = {S{\'e}curit{\'e} des protocoles cryptographiques~: 
	 	  aspects logiques et calculatoires},
  year = 2007,
  month = jan,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-baudet.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-baudet.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/these-baudet.ps},
  abstract = {This thesis is dedicated to the automatic verification of
    cryptographic protocols in the logical and computational settings. \par
    The~first part concerns the security of procotols in the logical
    ({"}formal{"}) framework. To~begin with, we show how to specify various
    security properties of protocols in a concurrent language, and how to
    analyze them automatically for a bounded number of sessions.
    The~properties under consideration include notably simple secrecy,
    authentication and resistance to dictionary attacks. \par
    The~second part deals with the computational soundness of logical models.
    The~main question here is to what extent the fact that no logical attack
    exists on a protocol implies that it is provably secure in the usual
    cryptographic model (called the computational model). We~concentrate on
    static equivalence, applied notably to several kinds of encryption and
    data vulnerable to dictionary attacks (such as passwords). We~show that
    under simple conditions, any (logical) proof of static equivalence between
    two messages implies their (computational) indistinguishability. This
    entails computational soundness in the passive case for the notion of
    dictionary attacks developped in the first part.}
}
@inproceedings{BM-lfcs2007,
  address = {New~York, New~York, USA},
  month = jun,
  year = 2007,
  volume = 4514,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Artemov, Sergei N. and Nerode, Anil},
  acronym = {{LFCS}'07},
  booktitle = {{P}roceedings of the {S}ymposium on {L}ogical {F}oundations of
	{C}omputer {S}cience ({LFCS}'07)},
  author = {Bollig, Benedikt and Meinecke, Ingmar},
  title = {Weighted Distributed Systems and Their Logics},
  pages = {54-68},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BM-lfcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BM-lfcs07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BM-lfcs07.ps},
  doi = {10.1007/978-3-540-72734-7_5},
  abstract = {We provide a model of weighted distributed systems and give a
    logical characterization thereof. Distributed systems are represented as
    weighted asynchronous cellular automata. Running over directed acyclic
    graphs, Mazurkiewicz traces, or (lossy) message sequence charts, they
    allow for modeling several communication paradigms in a unifying
    framework, among them probabilistic shared-variable and probabilistic
    lossy-channel systems. We~show that any such system can be described by a
    weighted existential MSO formula and, vice versa, any formula gives rise
    to a weighted asynchronous cellular automaton.}
}
@inproceedings{DDG-lfcs2007,
  address = {New~York, New~York, USA},
  month = jun,
  year = 2007,
  volume = 4514,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Artemov, Sergei N. and Nerode, Anil},
  acronym = {{LFCS}'07},
  booktitle = {{P}roceedings of the {S}ymposium on {L}ogical {F}oundations of
	{C}omputer {S}cience ({LFCS}'07)},
  author = {Demri, St{\'e}phane and D'Souza, Deepak and Gascon, R{\'e}gis},
  title = {Decidable Temporal Logic with Repeating Values},
  pages = {180-194},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DDG-lfcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DDG-lfcs07.pdf},
  doi = {10.1007/978-3-540-72734-7_13},
  abstract = {Various logical formalisms with the freeze quantifier have been
    recently considered to model computer systems even though this is a
    powerful mechanism that often leads to undecidability. In~this paper, we
    study a linear-time temporal logic with past-time operators such that the
    freeze operator is only used to express that some value from an infinite
    set is repeated in the future or in the past. Such a restriction has been
    inspired by a recent work on spatio-temporal logics. We~show decidability
    of finitary and infinitary satisfiability by reduction into the
    verification of temporal properties in Petri nets. This is a surprising
    result since the logic is closed under negation, contains future-time and
    past-time temporal operators and can express the nonce property and its
    negation. These ingredients are known to lead to undecidability with a
    more liberal use of the freeze quantifier. The~paper contains also
    insights about the relationships between temporal logics with the freeze
    operator and counter automata.}
}
@inproceedings{BBC-lfcs2007,
  address = {New~York, New~York, USA},
  month = jun,
  year = 2007,
  volume = 4514,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Artemov, Sergei N. and Nerode, Anil},
  acronym = {{LFCS}'07},
  booktitle = {{P}roceedings of the {S}ymposium on {L}ogical {F}oundations of
	{C}omputer {S}cience ({LFCS}'07)},
  author = {Bouyer, Patricia and Brihaye, {\relax Th}omas and 
		  Chevalier, Fabrice},
  title = {Weighted O-Minimal Hybrid Systems are more 
		   Decidable than Weighted Timed Automata!},
  pages = {69-83},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBC-lfcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBC-lfcs07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBC-lfcs07.ps},
  doi = {10.1007/978-3-540-72734-7_6},
  abstract = {We consider weighted o-minimal hybrid systems, which
extend classical o-minimal hybrid systems with cost functions. These cost
functions are {"}observer variables{"} which increase while the system evolves
but do not constrain the behaviour of the system. In this paper, we prove
two main results: (i)~optimal o-minimal hybrid games are decidable; (ii)~the
model-checking of~WCTL, an extension of CTL which can constrain the cost
variables, is decidable over that model. This has to be compared with the
same problems in the framework of timed automata where both problems are
undecidable in general, while they are decidable for the restricted class of
one-clock timed automata. }
}
@article{VG-icomp2007,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Verma, Kumar N. and Goubault{-}Larrecq, Jean},
  title = {Alternating Two-Way {AC}-Tree Automata},
  pages = {817-869},
  year = {2007},
  month = jun,
  volume = 205,
  number = 6,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/VG-icomp07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/VG-icomp07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/VG-icomp07.ps},
  doi = {10.1016/j.ic.2006.12.006},
  abstract = {We explore the notion of alternating two-way tree automata
                  modulo the theory of finitely many associative-commutative
                  (AC) symbols. This was prompted by questions arising in
                  cryptographic protocol verification, in~particular in
                  modeling group key agreement schemes based on
                  Diffie-Hellman-like functions, where the emptiness question
                  for intersections of such automata is fundamental. This also
                  has independent interest. We~show that the use of general
                  push clauses, or of alternation, leads to undecidability,
                  already in the case of one AC symbol, with only functions of
                  arity zero. On~the other hand, emptiness is decidable in the
                  general case of several function symbols, including several
                  AC symbols, provided push clauses are unconditional and
                  intersection clauses are final. This class of automata is
                  also shown to be closed under intersection.}
}
@inproceedings{JLS-tacas07,
  address = {Braga, Portugal},
  month = mar,
  year = 2007,
  volume = {4424},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Grumberg, Orna and Huth, Michael},
  acronym = {{TACAS}'07},
  booktitle = {{P}roceedings of the 13th {I}nternational 
               {C}onference on {T}ools and {A}lgorithms for
               {C}onstruction and {A}nalysis of {S}ystems
               ({TACAS}'07)},
  author = {Jurdzi{\'n}ski, Marcin and Laroussinie, Fran{\c{c}}ois and
                  Sproston, Jeremy},
  title = {Model Checking Probabilistic Timed Automata with One or Two Clocks},
  pages = {170-184},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JLS-tacas07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JLS-tacas07.pdf},
  doi = {10.1007/978-3-540-71209-1_15},
  abstract = {Probabilistic timed automata are an extension of timed automata
	with discrete probability distributions. We~consider model-checking
	algorithms for the subclasses of probabilistic timed automata which
	have one or two clocks. Firstly, we show that PCTL probabilistic
	model-checking problems (such~as determining whether a set of target
	states can be reached with probability at least~0.99 re- gardless of
	how nondeterminism is resolved) are PTIME-complete for one clock
	probabilistic timed automata, and are EXPTIME-complete for
	probabilistic timed automata with two clocks. Secondly, we show that
	the model-checking problem for the probabilistic timed temporal logic
	PTCTL is EXPTIME-complete for one clock probabilistic timed automata.
	However, the corresponding model-checking problem for the subclass of
	PTCTL which does not permit both (1)~punctual tim- ing bounds, which
	require the occurrence of an event at an exact time point, and
	(2)~comparisons with probability bounds other than 0 or~1, is
	PTIME-complete.}
}
@inproceedings{DADSS-tacas07,
  address = {Braga, Portugal},
  month = mar,
  year = 2007,
  volume = {4424},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Grumberg, Orna and Huth, Michael},
  acronym = {{TACAS}'07},
  booktitle = {{P}roceedings of the 13th {I}nternational 
               {C}onference on {T}ools and {A}lgorithms for
               {C}onstruction and {A}nalysis of {S}ystems
               ({TACAS}'07)},
  author = {D'Aprile, Davide and Donatelli, Susanna and Sangnier, 
		  Arnaud and Sproston, Jeremy},
  title = {From Time {P}etri Nets to Timed Automata: An Untimed 
		  Approach},
  pages = {216-230},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DADSS-tacas07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DADSS-tacas07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DADSS-tacas07.ps},
  doi = {10.1007/978-3-540-71209-1_18},
  abstract = {Time Petri Nets~(TPN) and Timed Automata~(TA) are widely-used
              formalisms for the modeling and analysis of timed systems. A
              recently-developed approach for the analysis of TPNs concerns
              their translation to~TAs, at which point efficient analysis
              tools for TAs can then be applied. One~feature of much of this
              previous work has been the use of timed reachability analysis on
              the TPN in order to construct the~TA. In this paper we present a
              method for the translation from TPNs to~TAs which bypasses the
              timed reachability analysis step. Instead, our method relies on
              the reachability graph of the underlying untimed Petri~net. We
              show that our approach is competitive for the translation of a
              wide class of TPNs to~TAs in comparison with previous
              approaches, both with regard to the time required to perform the
              translation, and with regard to the number of locations and
              clocks of the produced~TA.}
}
@inproceedings{BKKL-tacas07,
  address = {Braga, Portugal},
  month = mar,
  year = 2007,
  volume = {4424},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Grumberg, Orna and Huth, Michael},
  acronym = {{TACAS}'07},
  booktitle = {{P}roceedings of the 13th {I}nternational 
               {C}onference on {T}ools and {A}lgorithms for
               {C}onstruction and {A}nalysis of {S}ystems
               ({TACAS}'07)},
  author = {Bollig, Benedikt and Katoen, Joost-Pieter and Kern, Carsten
                  and Leucker, Martin},
  title = {Replaying Play in and Play out: Synthesis of Design Models
                  from Scenarios by Learning},
  pages = {435-450},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-tacas07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-tacas07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BKKL-tacas07.ps},
  doi = {10.1007/978-3-540-71209-1_33},
  abstract = {This paper is concerned with bridging the
    gap between requirements, provided
    as a set of scenarios, and conforming design models. The~novel aspect
    of our approach is to exploit learning for the synthesis of design
    models. In particular, we present a procedure that infers a
    message-passing automaton~(MPA) from a given set of positive and 
    negative scenarios of the systems behavior provided as message 
    sequence 
    charts~(MSCs). The~paper investigates which classes of regular MSC 
    languages and corresponding MPAs can (not) be learned, and presents a 
    dedicated tool based on the learning library LearnLib that supports 
    our approach.}
}
@inproceedings{CJP-fossacs07,
  address = {Braga, Portugal},
  month = mar,
  year = 2007,
  volume = 4423,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Seidl, Helmut},
  acronym = {{FoSSaCS}'07},
  booktitle = {{P}roceedings of the 10th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'07)},
  author = {Comon{-}Lundh, Hubert and Jacquemard, Florent and
		  Perrin, Nicolas},
  title = {Tree Automata with Memory, Visibility and Structural 
		  Constraints},
  pages = {168-182},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CJP-fossacs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CJP-fossacs07.pdf},
  doi = {10.1007/978-3-540-71389-0_13},
  abstract = {Tree automata with one memory have been introduced in~2001. They
generalize both pushdown (word) automata and the tree automata with
constraints of equality between brothers of Bogaert and Tison. Though it has a
decidable emptiness problem, the main weakness of this model is its lack of
good closure properties. We~propose a generalization of the visibly pushdown
automata of Alur and Madhusudan to a family of tree recognizers which carry
along their (bottom-up) computation an auxiliary unbounded memory with a tree
structure (instead of a symbol stack). In~other words, these recognizers,
called visibly Tree Automata with Memory~(VTAM) define a subclass of tree
automata with one memory enjoying Boolean closure properties. We show in
particular that they can be determinized and the problems like emptiness,
inclusion and universality are decidable for~VTAM. Moreover, we propose an
extension of VTAM whose transitions may be constrained by structural equality
and disequality tests between memories, and show that this extension preserves
the good closure and decidability properties. }
}
@inproceedings{LMO-fossacs07,
  address = {Braga, Portugal},
  month = mar,
  year = 2007,
  volume = 4423,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Seidl, Helmut},
  acronym = {{FoSSaCS}'07},
  booktitle = {{P}roceedings of the 10th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'07)},
  author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas and Oreiby, Ghassan},
  title = {On the Expressiveness and Complexity of~{ATL}},
  pages = {243-257},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMO-fossacs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LMO-fossacs07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LMO-fossacs07.ps},
  corrigendumpdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LMO-lmcs08-erratum.pdf},
  doi = {10.1007/978-3-540-71389-0_18},
  abstract = {ATL is a temporal logic geared towards the specification and
verification of properties in multi-agents systems. It allows to reason on the
existence of strategies for coalitions of agents in order to enforce a given
property. We prove that the standard definition of~ATL (built on modalities
{"}Next{"}, {"}Always{"} and~{"}Until{"}) has to be completed in order to express the
duals of its modalities: it~is necessary to add the modality {"}Release{"}.
We~then precisely characterize the complexity of ATL model-checking when the
number of agents is not fixed. We prove that it is \(\Delta_{2}^{P}\) and
\(\Delta_{3}^{P}\)-complete, depending on the underlying multi-agent model
(ATS and CGS,~resp.). We also prove that~ATL\({}^{+}\) model-checking is
\(\Delta_{3}^{P}\)-complete over both models, even with a fixed number of
agents.}
}
@inproceedings{BLM-fossacs07,
  address = {Braga, Portugal},
  month = mar,
  year = 2007,
  volume = 4423,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Seidl, Helmut},
  acronym = {{FoSSaCS}'07},
  booktitle = {{P}roceedings of the 10th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'07)},
  author = {Bouyer, Patricia and Larsen, Kim G. and Markey, Nicolas},
  title = {Model-Checking One-Clock Priced Timed Automata},
  pages = {108-122},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLM-fossacs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLM-fossacs07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BLM-fossacs07.ps},
  doi = {10.1007/978-3-540-71389-0_9},
  abstract = {We consider the model of priced (a.k.a.~weighted) timed
automata, an extension of timed automata with cost information on both
locations and transitions. We prove that model-checking this class of models
against the logic~WCTL, CTL~with cost-constrained modalities, is
PSPACE-complete under the {"}single-clock{"} assumption. In~contrast, it~has been
recently proved that the model-checking problem is undecidable for this model
as soon as the system has three clocks. We also prove that the model-checking
of~WCTL becomes undecidable, even under this {"}single-clock{"} assumption. }
}
@article{DLN-icomp2006,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Demri, St{\'e}phane and Lazi{\'c}, Ranko and Nowak, David},
  title = {On the freeze quantifier in constraint~{LTL}: Decidability
		   and complexity},
  pages = {2-24},
  year = {2007},
  month = jan,
  volume = 205,
  number = 1,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLN-icomp06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLN-icomp06.pdf},
  doi = {10.1016/j.ic.2006.08.003},
  abstract = {Constraint LTL, a generalisation of LTL over Presburger
constraints, is often used as a formal language to specify the behavior of
operational models with constraints. The freeze quantifier can be part of the
language, as in some real-time logics, but this variable-binding mechanism is
quite general and ubiquitous in many logical languages (first-order temporal
logics, hybrid logics, logics for sequence diagrams, navigation logics, logics
with \(\lambda\)-abstraction,~etc.). We show that Constraint~LTL over the
simple domain~\(\langle\mathbb{N}, =\rangle\) augmented with the freeze
quantifier is undecidable which is a surprising result in view of the poor
language for constraints (only equality tests). Many versions of freeze-free
Constraint LTL are decidable over domains with qualitative predicates and our
undecidability result actually establishes \(\Sigma_{1}^{1}\)-completeness. On
the positive side, we provide complexity results when the domain is finite
({\scshape ExpSpace}-completeness) or when the formulae are flat in a sense
introduced in the paper. Our undecidability results are sharp
(\emph{i.e.}~with restrictions on the number of variables) and all our
complexity characterisations ensure completeness with respect to some
complexity class (mainly {\scshape PSpace} and {\scshape ExpSpace}).}
}
@article{DN-ijfcs07,
  publisher = {World Scientific},
  journal = {International Journal of Foundations of Computer Science},
  author = {Demri, St{\'e}phane and Nowak, David},
  title = {Reasoning about transfinite sequences},
  year = 2007,
  volume = {18},
  number = {1},
  pages = {87-112},
  month = feb,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DN-ijfcs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DN-ijfcs07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DN-ijfcs07.ps},
  doi = {10.1142/S0129054107004589},
  abstract = {We introduce a family of temporal logics to specify the behavior
of systems with Zeno behaviors. We~extend linear-time temporal logic LTL to
authorize models admitting Zeno sequences of actions and quantitative temporal
operators indexed by ordinals replace the standard next-time and until
future-time operators. Our aim is to control such systems by designing
controllers that safely work on \(\omega\)-sequences but interact
synchronously with the system in order to restrict their behaviors. We show
that the satisfiability and model-checking for the logics working on
\(\omega^{k}\)-sequences is \textsc{expspace}-complete when the integers are
represented in binary, and pspace-complete with a unary representation. To do
so, we substantially extend standard results about LTL by introducing a new
class of succinct ordinal automata that can encode the interaction between the
different quantitative temporal operators. }
}
@inproceedings{BCD-stacs2007,
  address = {Aachen, Germany},
  month = feb,
  year = 2007,
  volume = 4393,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Thomas, Wolfgang and Weil, Pascal},
  acronym = {{STACS}'07},
  booktitle = {{P}roceedings of the 24th {A}nnual
               {S}ymposium on {T}heoretical {A}spects of
               {C}omputer {S}cience
               ({STACS}'07)},
  author = {Bursuc, Sergiu and Comon{-}Lundh, Hubert and Delaune,
                  St{\'e}phanie},
  title = {Associative-Commutative Deducibility Constraints},
  pages = {634-645},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCD-stacs07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCD-stacs07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BCD-stacs07.ps},
  doi = {10.1007/978-3-540-70918-3_54},
  abstract = {We consider deducibility constraints, which are equivalent to
  particular Diophantine systems, arising in the automatic verification of
  security protocols, in presence of associative and commutative symbols. We
  show that deciding such Diophantine systems is, in general, undecidable. Then,
  we consider a simple subclass, which we show decidable. Though the solutions
  of these problems are not necessarily semi-linear sets, we show that there are
  (computable) semi-linear sets whose minimal solutions are not too far from the
  minimal solutions of the system. Finally, we consider a small variant of the
  problem, for which there is a much simpler decision algorithm. }
}
@article{BBBR-fmsd06,
  publisher = {Springer},
  journal = {Formal Methods in System Design},
  author = {Bouyer, Patricia and Brihaye, {\relax Th}omas and
                 Bruy{\`e}re, V{\'e}ronique and Raskin, Jean-Fran{\c{c}}ois},
  title = {On the optimal reachability problem on weighted timed 
		automata},
  volume = 31,
  number = 2,
  year = 2007,
  month = oct,
  pages = {135-175},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBR-FMSD06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBR-FMSD06.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBBR-FMSD06.ps},
  doi = {10.1007/s10703-007-0035-4},
  abstract = {We study the cost-optimal reachability problem for weighted 
timed automata such that positive and negative costs are allowed on edges 
and locations. By~optimality, we mean an infimum cost as well as a 
supremum cost. We show that this problem is PSPACE-complete. Our~proof 
uses techniques of linear programming, and thus exploits an important 
property of optimal runs : their time-transitions use a time which is 
arbitrarily closed to an integer. We~then propose an extension of the 
region graph, the weighted discrete graph, whose structure gives light on 
the way to solve the cost-optimal reachability problem. We~also give an 
application of the cost-optimal reachability problem in the context of 
timed games.}
}
@article{BBL-fmsd06,
  publisher = {Springer},
  journal = {Formal Methods in System Design},
  author = {Bouyer, Patricia and Brinksma, Ed and Larsen, Kim G.},
  title = {Optimal Infinite Scheduling for Multi-Priced 
                   Timed Automata},
  volume = {32},
  number = {1},
  pages = {2-23},
  year = 2008,
  month = feb,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBL-FMSD04.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBL-FMSD04.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BBL-FMSD04.ps},
  doi = {10.1007/s10703-007-0043-4},
  abstract = {This paper is concerned with the derivation of infinite
schedules for timed automata that are in some sense optimal. To~cover a wide
class of optimality criteria we start out by introducing an extension of the
(priced) timed automata model that includes both costs and rewards as
separate modelling features. A~precise definition is then given of what
constitutes optimal infinite behaviours for this class of models. We
subsequently show that the derivation of optimal non-terminating schedules
for such double-priced timed automata is computable. This is done by a
reduction of the problem to the determination of optimal mean-cycles in
finite graphs with weighted edges. This reduction is obtained by introducing
the so-called corner-point abstraction, a~powerful abstraction technique
of which we show that it preserves optimal schedules.}
}
@article{BBS-arxiv05,
  publisher = {ACM Press},
  journal = {ACM Transactions on Computational Logic},
  author = {Baier, Christel and Bertrand, Nathalie and
                   Schnoebelen, {\relax Ph}ilippe},
  title = {Verifying nondeterministic probabilistic channel
                systems against {{\(\omega\)}}-regular linear-time
                properties},
  year = 2007,
  volume = 9,
  number = 1,
  nopages = {},
  month = dec,
  url = {http://arxiv.org/abs/cs.LO/0511023},
  pdf = {http://arxiv.org/pdf/cs.LO/0511023},
  ps = {http://arxiv.org/ps/cs.LO/0511023},
  doi = {10.1145/1297658.1297663},
  abstract = {Lossy channel systems (LCS's) are systems of finite state processes that
  communicate via unreliable unbounded fifo channels. We introduce NPLCS's,
  a variant of LCS's where message losses have a probabilistic behavior
  while the component processes behave nondeterministically, and study the
  decidability of qualitative verification problems for \(\omega\)-regular
  linear-time properties.\par
  We show that ---in contrast to finite-state Markov decision processes---
  the satisfaction relation for linear-time formulas depends on the type of
  schedulers that resolve the nondeterminism. While the qualitative model
  checking problems for the full class of history-dependent schedulers is
  undecidable, the same questions for finite-memory schedulers can be
  solved algorithmically. Additionally, some special kinds of reachability,
  or recurrent reachability, qualitative properties yield decidable
  verification problems for the full class of schedulers, which ---for this
  restricted class of problems--- are as powerful as finite-memory
  schedulers, or even a subclass of them.}
}
@article{BC-JALC2005,
  journal = {Journal of Automata, Languages and Combinatorics},
  author = {Bouyer, Patricia and Chevalier, Fabrice},
  title = {On Conciseness of Extensions of Timed Automata},
  year = 2005,
  volume = 10,
  number = 4,
  pages = {393-405},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BC05-jalc.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BC05-jalc.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BC05-jalc.ps},
  abstract = {In this paper we study conciseness of 
	various extensions of timed automata, and prove
	that several features like diagonal constraints or 
	updates lead to exponentially more concise timed 
	models.}
}
@article{Baudet05jalc,
  journal = {Journal of Automata, Languages and Combinatorics},
  author = {Baudet, Mathieu},
  title = {Random Polynomial-Time Attacks and {D}olev-{Y}ao Models},
  year = 2006,
  volume = 11,
  number = 1,
  pages = {7-21},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bau05-jalc.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bau05-jalc.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/Bau05-jalc.ps},
  abstract = {In this paper we present an extension of 
	Dolev-Yao models for security protocols with a notion 
	of random polynomial-time (Las Vegas) computability. 
	First we notice that Dolev-Yao models can be seen as 
	transition systems, possibly infinite. We then extend 
	these transition systems with computation times and 
	probabilities. The extended models can account for 
	normal Dolev-Yao transitions as well as nonstandard 
	operations such as inverting a one-way function. Our 
	main contribution consists of showing that under 
	reasonable assumptions the extended models are 
	equivalent to standard Dolev-Yao models as far as 
	(safety) security properties are concerned.}
}
@article{DD-icomp06,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Demri, St{\'e}phane and D'Souza, Deepak},
  title = {An automata-theoretic approach to constraint~{LTL}},
  year = 2007,
  pages = {380-415},
  volume = 205,
  number = 3,
  month = mar,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DD-icomp06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DD-icomp06.pdf},
  doi = {10.1016/j.ic.2006.09.006},
  abstract = {We consider an extension of linear-time temporal logic~(LTL)
with constraints interpreted over a concrete domain. We~use a new
automata-theoretic technique to show pspace decidability of the logic for the
constraint systems \((\mathbb{Z}, <, =)\) and \((\mathbb{N}, <, =)\). Along
the way, we give an automata-theoretic proof of a result of [Ph.~Balbiani,
J.~Condotta, \textit{Computational complexity of propositional linear temporal logics
based on qualitative spatial or temporal reasoning}, 2002] when the constraint system
satisfies the completion property. Our decision procedures extend easily to
handle extensions of the logic with past-time operators and constants, as well
as an extension of the temporal language itself to monadic second order logic.
Finally we show that the logic becomes undecidable when one considers
constraint systems that allow a counting mechanism.}
}
@article{Demri-jancl06,
  publisher = {Taylor \& Francis},
  journal = {Journal of Applied Non-Classical Logics},
  author = {Demri, St{\'e}phane},
  title = {Linear-Time Temporal Logics with {P}resburger Constraints: An~Overview},
  year = 2006,
  volume = 16,
  number = {3-4},
  pages = {311-347},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/demri-jancl06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/demri-jancl06.pdf},
  abstract = {We present an overview of linear-time temporal logics with
Presburger constraints whose models are sequences of tuples of integers. Such
formal specification languages are well-designed to specify and verify systems
that can be modelled with counter systems. The paper recalls the general
framework of LTL over concrete domains and presents the main decidability and
complexity results related to fragments of Presburger~LTL. Related formalisms
are also briefly presented.}
}
@article{DrGa06tocsys,
  publisher = {Springer},
  journal = {Theory of Computing Systems},
  author = {Droste, Manfred and Gastin, Paul},
  title = {On aperiodic and star-free formal power series in
              partially commuting variables},
  year = 2008,
  month = may,
  volume = 42,
  number = 4,
  pages = {608-631},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-12.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-12.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		rr-lsv-2005-12.ps},
  doi = {10.1007/s00224-007-9064-z},
  abstract = {Formal power series over non-commuting variables have been
    investigated as representations of the behavior of automata with
    multiplicities. Here we introduce and investigate the concepts of
    aperiodic and of star-free formal power series over semirings and
    partially commuting variables. We prove that if the semiring~\(K\) is
    idempotent and commutative, or if \(K\) is idempotent and the variables
    are non-commuting, then the product of any two aperiodic series is again
    aperiodic. We also show that if \(K\) is idempotent and the matrix monoids
    over~\(K\) have a Burnside property (satisfied, \textit{e.g.}~by the
    tropical semiring), then the aperiodic and the star-free series coincide.
    This generalizes a classical result of Sch{\"u}tzenberger~(1961) for
    aperiodic regular languages and subsumes a result of Guaiana, Restivo and
    Salemi~(1992) on aperiodic trace languages. }
}
@article{DrGa07tcs,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Droste, Manfred and Gastin, Paul},
  title = {Weighted automata and weighted logics},
  year = 2007,
  month = jun,
  volume = 380,
  number = {1-2},
  pages = {69-86},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-13.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-13.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
		rr-lsv-2005-13.ps},
  doi = {10.1016/j.tcs.2007.02.055},
  abstract = {Weighted automata are used to describe quantitative properties
                  in various areas such as probabilistic systems, image
                  compression, speech-to-text processing. The~behaviour of
                  such an automaton is a mapping, called a formal power
                  series, assigning to each word a weight in some semiring. 
		  We~generalize B{\"u}chi's and Elgot's fundamental theorems to this
                  quantitative setting. We~introduce a weighted version of MSO
                  logic and prove that, for commutative semirings, the
                  behaviours of weighted automata are precisely the formal
                  power series definable with particular sentences of our
                  weighted logic. We~also consider weighted first-order logic
                  and show that aperiodic series coincide with the first-order
                  definable ones, if the semiring is locally finite,
                  commutative and has some aperiodicity property.},
  oldnote = {Special issue of ICALP'05. To appear. 
               Also available as Research Report LSV-05-13, 
               Laboratoire Sp{\'e}cification et V{\'e}rification, ENS Cachan, 
               France, July 2005.}
}
@article{LLT-icomp07,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Lafourcade, Pascal and Lugiez, Denis and Treinen, Ralf},
  title = {Intruder Deduction for the Equational Theory of {A}belian Groups with 
                  Distributive Encryption},
  year = 2007,
  volume = 205,
  number = 4,
  pages = {581-623},
  month = apr,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LLT-icomp07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LLT-icomp07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LLT-icomp07.ps},
  doi = {10.1016/j.ic.2006.10.008},
  abstract = {Cryptographic protocols are small programs which involve a high
  level of concurrency and which are difficult to analyze by hand. The~most
  successful methods to verify such protocols are based on rewriting
  techniques and automated deduction in order to implement or mimic the
  process calculus describing the execution of a protocol. We~are interested
  in the intruder deduction problem, that is vulnerability to passive attacks
  in presence of equational theories which model the protocol specification
  and properties of the cryptographic operators.\par
  In the present paper we consider the case where the encryption distributes
  over the operator of an Abelian group or over an exclusive-or 
  operator. We~prove decidability of the intruder deduction problem in both 
  cases. We~obtain a PTIME decision procedure in a restricted case, the  
  so-called binary case.\par
  These decision procedures are based on a careful analysis of the proof
  system modeling the deductive power of the intruder, taking into account the
  algebraic properties of the equational theories under consideration.
  The~analysis of the deduction rules interacting with the equational theory
  relies on the manipulation of \(\mathbb{Z}\)-modules in the general case,
  and on results from prefix rewriting in the binary case.}
}
@book{TATA07,
  author = {Comon{-}Lundh, Hubert and Dauchet, Max and Gilleron, R{\'e}mi  and
                L{\"o}ding, Cristof and Jacquemard, Florent and 
		Lugiez, Denis and Tison, Sophie and  Tommasi, Marc},
  title = {Tree Automata Techniques and Applications},
  year = 2007,
  month = nov,
  url = {http://www.grappa.univ-lille3.fr/tata/},
  nmhowpublished = {Available on: \url{http://www.grappa.univ-lille3.fr/tata}},
  nmnote = {release October, 12th 2007}
}
@inproceedings{AA+-pvldb08,
  address = {Auckland, New Zealand},
  month = aug,
  year = 2008,
  volume = 1,
  series = {Proceedings of the {VLDB} Endowment},
  publisher = {ACM Press},
  editor = {Weber, Gerald},
  acronym = {{VLDB}'08},
  booktitle = {{P}roceedings of the 34th {I}nternational
           {C}onference on {V}ery {L}arge {D}ata {B}ases
	   ({VLDB}'08)},
  author = {Abiteboul, Serge and Allard, Tristan and 
  	 	 Chatalic, {\relax Ph}ilippe and Gardarin, Georges and
		 Ghitescu, Anca and Goasdou{\'e}, Fran{\c{c}}ois and Manolescu,
                  Ioana and Nguyen, Benjamin and Ouazara, Mohamed and 
		  Somani, Aditya and Travers, Nicolas and
                  Vasile, Gabriel and Zoupanos, Spyros},
  title = {Web{C}ontent: efficient {P2P} warehousing of web data},
  pages = {1428-1431},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/Aetal-pvldb08.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Aetal-pvldb08.pdf},
  abstract = {We present the WebContent platform for managing distributed
    repositories of XML and semantic Web data. The platform allows integrating
    various data processing building blocks (crawling, translation, semantic
    annotation, full-text search, structured XML querying, and semantic
    querying), presented as Web services, into a large-scale efficient
    platform. Calls to various services are combined inside ActiveXML
    documents, which are XML documents including service calls. An ActiveXML
    optimizer is used to: (i)~efficiently distribute computations among sites;
    (ii)~perform XQuery-specific optimizations by leveraging an algebraic
    XQuery optimizer; and (iii)~given an XML query, chose among several
    distributed indices the most appropriate in order to answer the query.}
}
@article{ABM-vldb08,
  publisher = {ACM Press},
  journal = {The VLDB Journal},
  author = {Abiteboul, Serge and Benjelloun, Omar and Milo, Tova},
  title = {The Active~{XML} project: an~overview},
  volume = 17,
  number = 5,
  pages = {1019-1040},
  year = {2008},
  month = aug,
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABM-vldb08.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABM-vldb08.pdf},
  doi = {10.1007/s00778-007-0049-y},
  abstract = {This paper provides an overview of the Active XML
    project developed at INRIA over the past five years. Active XML (AXML, for
    short), is a declarative framework that harnesses Web services for
    distributed data management, and is put to work in a peer-to-peer
    architecture.\par
    The model is based on AXML documents, which are XML documents that may
    contain embedded calls to Web services, and on AXML services, which are
    Web services capable of exchanging AXML documents. An AXML peer is a
    repository of AXML documents that acts both as a client by invoking the
    embedded service calls, and as a server by providing AXML services, which
    are generally defined as queries or updates over the persistent AXML
    documents.\par
    The approach gracefully combines stored information with data defined in
    an intensional manner as well as dynamic information. This simple, rather
    classical idea leads to a number of technically challenging problems, both
    theoretical and practical.\par
    In this paper, we describe and motivate the AXML model and language,
    overview the research results obtained in the course of the project, and
    show how all the pieces come together in our implementation.}
}
@inproceedings{AMPPS-icde08,
  address = {Cancun, Mexico},
  month = apr,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  editor = {Alonso, Gustavo and Blakeley, Jos{\'e} A. and Chen, Arbee L. P.},
  acronym = {{ICDE}'08},
  booktitle = {{P}roceedings of the 24th {I}nternational {C}onference on
                  {D}ata {E}ngineering ({ICDE}'08)},
  author = {Abiteboul, Serge and Manolescu, Ioana and
  	 	 Polyzotis, Neoklis and Preda, Nicoleta and
		 Sun, Chong},
  title = {{XML} processing in {DHT} networks},
  pages = {606-615},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/AMPPS-icde08.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AMPPS-icde08.pdf},
  doi = {10.1109/ICDE.2008.4497469},
  abstract = {We study the scalable management of XML data in P2P networks
    based on distributed hash tables (DHTs). We identify performance
    limitations in this context, and propose an array o ftechniques to lift
    them. First, we adapt the DHT platform to the needs of massive data
    processing. (This primarily consists of replacing the DHT store by an
    efficient native store and in streaming the communications with the DHT.)
    Second, we introduce a distributed hierarchical index and efficient
    algorithms taking advantage of this index to speed up query processing.
    Third, we present an innovative, XML-specific flavor of Bloom filters, to
    reduce data transfers entailed by query processing. Our approach is fully
    implemented in the KadoP DHT-based XML processing system, used in a
    real-life software manufacturing application. We present experiments that
    demonstrate the benefits of the proposed techniques.}
}
@inproceedings{AMZ-icde08,
  address = {Cancun, Mexico},
  month = apr,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  editor = {Alonso, Gustavo and Blakeley, Jos{\'e} A. and Chen, Arbee L. P.},
  acronym = {{ICDE}'08},
  booktitle = {{P}roceedings of the 24th {I}nternational {C}onference on
                  {D}ata {E}ngineering ({ICDE}'08)},
  author = {Abiteboul, Serge and Manolescu, Ioana and
  	 	 Zoupanos, Spyros},
  title = {{O}ptim{AX}: efficient support for data-intensive mash-ups},
  pages = {1564-1567},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/AMZ-icde08.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AMZ-icde08.pdf},
  doi = {10.1109/ICDE.2008.4497622},
  abstract = {Mash-ups are being used in various Web-based applications of Web
    2.0 which combine instantly information from different sources. Active XML
    (AXML, in short) language is a tool for decentralized, data-centric Web
    service integration. AXML document includes calls to services that may be
    either simple request-responses either long running subscriptions. Being
    fully composable and allowing resource sharing makes AXML ideal for
    mash-up style integration. In this demo we present how AXML can be used as
    a specification, optimization and distributed execution language for
    dynamic distributed mash-ups in varied P2P settings. We also demonstrate
    our AXML optimizer's (OptimAX) optimization rules and rewriting engine
    with a help of GUI.}
}
@inproceedings{AMB-icde08,
  address = {Cancun, Mexico},
  month = apr,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  editor = {Alonso, Gustavo and Blakeley, Jos{\'e} A. and Chen, Arbee L. P.},
  acronym = {{ICDE}'08},
  booktitle = {{P}roceedings of the 24th {I}nternational {C}onference on
                  {D}ata {E}ngineering ({ICDE}'08)},
  author = {Abiteboul, Serge and Marinoiu, Bogdan and
  	 	 Bourhis, Pierre},
  title = {Distributed Monitoring of Peer-to-Peer Systems},
  pages = {1572-1575},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/AMB-icde08.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AMB-icde08.pdf},
  doi = {10.1109/ICDE.2008.4497624},
  abstract = {Observing highly dynamic Peer-to-Peer systems is essential for
    many applications such as fault management or business processing. We
    demonstrate P2PMonitor, a P2P system for monitoring such systems. Alerters
    deployed on the monitored peers are designed to detect particular kinds of
    local events. They generate streams of XML data that form the primary
    sources of information for P2PMonitor. The core of the system is composed
    of processing components implementing the operators of an algebra over
    data streams.\par
    From a user viewpoint, monitoring a P2P system can be as simple as
    querying an XML document. The document is an ActiveXML document that
    aggregates a (possibly very large) number of streams generated by alerters
    on the monitored peers. Behind the scene, P2PMonitor compiles the
    monitoring query into a distributed monitoring plan, deploys alerters and
    stream algebra processors and issues notifications that are sent to users.\par
    The system functionalities are demonstrated by simulating the supply chain
    of a large company.}
}
@inproceedings{AMZ-icwe08,
  address = {Yorktown Heights, New York, USA},
  month = jul,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  editor = {Schwabe, Daniel and Curbera, Francisco and Dantzig, Paul},
  acronym = {{ICWE}'08},
  booktitle = {{P}roceedings of the 8th {I}nternational {C}onference on {W}eb {E}ngineering
                  ({ICWE}'08)},
  author = {Abiteboul, Serge and Manolescu, Ioana and
  	 	  Zoupanos, Spyros},
  title = {{O}ptim{AX}: Optimizing Distributed {A}ctive{XML} Applications},
  pages = {299-310},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/AMZ-icwe08.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AMZ-icwe08.pdf},
  doi = {10.1109/ICWE.2008.11},
  abstract = {The Web has become a platform of choice for the deployment of
    complex applications involving several business partners. Typically, such
    applications interoperate by means of Web services, exchanging XML
    information.\par
    We present OptimAX, an optimization Web service that applies at the static
    level (prior to enacting an application) in order to rewrite it into one
    whose execution will be more performant. OptimAX builds on the ActiveXML
    (AXML) data-centric Web service composition language, and demonstrates how
    database-style techniques can be efficiently integrated in a
    loosely-coupled, distributed application based on Web services. OptimAX
    has been fully implemented and we describe its experimental performance.}
}
@inproceedings{AGM-widm08,
  address = {Napa Valley, California, USA},
  month = oct,
  year = 2008,
  publisher = {ACM Press},
  editor = {Chan, Chee Yong and Polyzotis, Neoklis},
  acronym = {{WIDM}'08},
  booktitle = {{P}roceedings of the 10th {ACM} {I}nternational {W}orkshop on {W}eb
                  {I}nformation and {D}ata {M}anagement ({WIDM}'08)},
  author = {Abiteboul, Serge and Greenshpan, Ohad and Milo, Tova},
  title = {Modeling the mashup space},
  pages = {87-94},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/AGM-widm08.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGM-widm08.pdf},
  doi = {10.1145/1458502.1458517},
  abstract = {We introduce a formal model for capturing the notion of mashup
    in its globality. The basic component in our model is the mashlet. A
    mashlet may query data sources, import other mashlets, use external Web
    services, and specify complex interaction patterns between its components.
    A mashlet state is modeled by a set of relations and its logic specified
    by datalog-style active rules. We are primarily concerned with changes in
    a mashlet state relations and rules. The interactions with users and other
    applications, as well as the consequent effects on the mashlets
    composition and behavior, are captured by streams of changes. The model
    facilitates dynamic mashlets composition, interaction and reuse, and
    captures the fundamental behavioral aspects of mashups.}
}
@article{SAG-ercim08,
  publisher = {European Research Consortium for Informatics and Mathematics},
  journal = {ERCIM News},
  author = {Senellart, Pierre and Abiteboul, Serge and Gilleron,
                  R{\'e}mi},
  title = {Understanding the Hidden Web},
  volume = 72,
  pages = {32-33},
  year = 2008,
  month = jan,
  url = {http://ercim-news.ercim.eu/en72/special/understanding-the-hidden-web}
}
@inproceedings{HCL-fsttcs08,
  address = {Bangalore, India},
  month = dec,
  year = 2008,
  volume = 2,
  series = {Leibniz International Proceedings in Informatics},
  publisher = {Leibniz-Zentrum f{\"u}r Informatik},
  editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V.},
  acronym = {{FSTTCS}'08},
  booktitle = {{P}roceedings of the 28th {C}onference on
               {F}oundations of {S}oftware {T}echnology and
               {T}heoretical {C}omputer {S}cience
               ({FSTTCS}'08)},
  author = {Comon{-}Lundh, Hubert},
  title = {About  models of security protocols},
  nopages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HCL-fsttcs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HCL-fsttcs08.pdf},
  abstract = {In this paper, mostly consisting of definitions, we~revisit the
    models of security protocols: we~show that the symbolic and the
    computational models (as~well as others) are instances of a same generic
    model. Our definitions are also parametrized by the security primitives,
    the notion of attacker and, to some extent, the process calculus.}
}
@phdthesis{oreiby-these2008,
  author = {Oreiby, Ghassan},
  title = {Logiques temporelles pour le contr{\^o}le temporis{\'e}},
  year = 2008,
  month = dec,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-GO08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-GO08.pdf}
}
@article{GLLN-mscs08,
  publisher = {Cambridge University Press},
  journal = {Mathematical Structures in Computer Science},
  author = {Goubault{-}Larrecq, Jean and Lasota, S{\l}awomir
                  and Nowak, David},
  title = {Logical Relations for Monadic Types},
  volume = 18,
  number = 6,
  pages = {1169-1217},
  month = dec,
  year = 2008,
  note = {81~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GLLN-arxiv05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GLLN-arxiv05.pdf},
  doi = {10.1017/S0960129508007172},
  abstract = {Logical relations and their generalisations are a fundamental
                  tool in proving properties of lambda calculi, for example,
                  for yielding sound principles for observational equivalence.
                  We propose a natural notion of logical relations that is
                  able to deal with the monadic types of Moggi's computational
                  lambda calculus. The treatment is categorical, and is based
                  on notions of subsconing, mono factorisation systems and
                  monad morphisms. Our approach has a number of interesting
                  applications, including cases for lambda calculi with
                  non-determinism (where being in a logical relation means
                  being bisimilar), dynamic name creation and probabilistic
                  systems.}
}
@phdthesis{bursztein-these2008,
  author = {Bursztein, Elie},
  title = {Anticipation games. Th{\'e}orie des jeux appliqu{\'e}s {\`a} la 
  		s{\'e}curit{\'e} r{\'e}seau},
  year = 2008,
  month = nov,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-EB08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-EB08.pdf},
  futureslides = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/SLIDES/
                these-AS07-slides.pdf}
}
@phdthesis{sangnier-these2008,
  author = {Sangnier, Arnaud},
  title = {V{\'e}rification de syst{\`e}mes avec compteurs et pointeurs},
  year = 2008,
  month = nov,
  type = {Th{\`e}se de doctorat},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-AS07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-AS07.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/these-AS07.ps}
}
@phdthesis{arapinis-these2008,
  author = {Arapinis, Myrto},
  title = {S{\'e}curit{\'e} des protocoles cryptographiques~:
                  d{\'e}cidabilit{\'e} et r{\'e}sultats de r{\'e}duction},
  year = 2008,
  month = nov,
  type = {Th{\`e}se de doctorat},
  school = {Universit{\'e} Paris~12, Cr{\'e}teil, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-MA07.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-MA07.pdf},
  futureslides = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/SLIDES/
                these-FC07-slides.pdf}
}
@article{BB-lmcs08,
  journal = {Logical Methods in Computer Science},
  author = {Bollig, Benedikt},
  title = {On the Expressive Power of {\(2\)}-Stack Visibly Pushdown Automata},
  volume = 4,
  number = {4\string:16},
  month = dec,
  year = 2008,
  nopages = {},
  doi = {10.2168/LMCS-4(4:16)2008},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BB-lmcs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BB-lmcs08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BB-lmcs08.ps},
  abstract = {Visibly pushdown automata are input-driven pushdown automata
                  that recognize some non-regular context-free languages while
                  preserving the nice closure and decidability properties of
                  finite automata. Visibly pushdown automata with multiple
                  stacks have been considered recently by La~Torre,
                  Madhusudan, and Parlato, who exploit the concept of
                  visibility further to obtain a rich automata class that can
                  even express properties beyond the class of context-free
                  languages. At the same time, their automata are closed under
                  boolean operations, have a decidable emptiness and inclusion
                  problem, and enjoy a logical characterization in terms of a
                  monadic second-order logic over words with an additional
                  nesting structure. These results require a restricted
                  version of visibly pushdown automata with multiple stacks
                  whose behavior can be split up into a fixed number of
                  phases. In this paper, we~consider 2-stack visibly pushdown
                  automata (i.e., visibly pushdown automata with two stacks)
                  in their unrestricted form. We show that they are
                  expressively equivalent to the existential fragment of
                  monadic second-order logic. Furthermore, it turns out that
                  monadic second-order quantifier alternation forms an
                  infinite hierarchy wrt.~words with multiple nestings.
                  Combining these results, we conclude that 2-stack visibly
                  pushdown automata are not closed under complementation.
                  Finally, we discuss the expressive power of B{\"u}chi
                  2-stack visibly pushdown automata running on infinite
                  (nested) words. Extending the logic by an infinity
                  quantifier, we can likewise establish equivalence to
                  existential monadic second-order logic.}
}
@incollection{DH-afsec08,
  author = {Donatelli, Susanna and Haddad, Serge},
  title = {V{\'e}rification quantitative de cha{\^\i}nes de {M}arkov},
  booktitle = {Approches formelles des syst{\`e}mes embarqu{\'e}s communicants},
  editor = {Roux, Olivier H. and Jard, Claude},
  publisher = {Herm{\`e}s},
  year = 2008,
  month = oct,
  pages = {177-198},
  chapter = 6,
  url = {http://www.lavoisier.fr/notice/fr335499.html},
  futureisbn = {}
}
@incollection{CM-afsec08,
  author = {Cassez, Franck and Markey, Nicolas},
  title = {Contr{\^o}le des syst{\`e}mes temporis{\'e}s},
  booktitle = {Approches formelles des syst{\`e}mes embarqu{\'e}s communicants},
  editor = {Roux, Olivier H. and Jard, Claude},
  publisher = {Herm{\`e}s},
  year = 2008,
  month = oct,
  pages = {105-144},
  chapter = 4,
  url = {http://www.lavoisier.fr/notice/fr335499.html},
  nops = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/.ps},
  nopsgz = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PSGZ/.ps.gz},
  futureisbn = {}
}
@article{CD-fmsd08,
  publisher = {Springer},
  journal = {Formal Methods in System Design},
  author = {Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
  title = {Safely Composing Security Protocols},
  volume = 34,
  number = 1,
  pages = {1-36},
  month = feb,
  year = 2009,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CD-fmsd08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CD-fmsd08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CD-fmsd08.ps},
  doi = {10.1007/s10703-008-0059-4},
  abstract = {Security protocols are small programs that are executed in
    hostile environments. Many results and tools have been developed to
    formally analyze the security of a protocol in the presence of an active
    attacker that may block, intercept and send new messages. However even
    when a protocol has been proved secure, there is absolutely no guarantee
    if the protocol is executed in an environment where other protocols are
    executed, possibly sharing some common keys like public keys or long-term
    symmetric keys.\par
    In this paper, we show that security of protocols can be easily composed.
    More precisely, we show that whenever a protocol is secure, it remains
    secure even in an environment where arbitrary protocols satisfying a
    reasonable (syntactic) condition are executed. This result holds for a
    large class of security properties that encompasses secrecy and various
    formulations of authentication.}
}
@inproceedings{GGJ-wrs08,
  address = {Castle of Hagenberg, Austria},
  month = apr,
  year = 2009,
  volume = 237,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Middeldorp, Aart},
  acronym = {{WRS}'08},
  booktitle = {{P}roceedings of the 8th {I}nternational {W}orkshop on 
		{R}eduction {S}trategies in {R}ewriting and {P}rogramming ({WRS}'08)},
  author = {Gasc{\'o}n, Adri{\`a} and Godoy, Guillem and Jacquemard,
                  Florent},
  title = {Closure of Tree Automata Languages under Innermost Rewriting},
  pages = {23-38},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GGJ-wrs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GGJ-wrs08.pdf},
  doi = {10.1016/j.entcs.2009.03.033},
  abstract = {Preservation of regularity by a term rewriting system~(TRS)
     states that the set of reachable terms from a tree automata~(TA) language
     (a.k.a.~regular term set) is also a TA language. It~is an important and
     useful property, and there have been many works on identifying classes of
     TRS ensuring~it; unfortunately, regularity is not preserved for
     restricted classes of TRS like shallow~TRS. Nevertheless, this property
     has not been studied for important strategies of rewriting like the
     innermost strategy which corresponds to the call by value computation of
     programming languages.\par
     We prove that the set of innermost-reachable terms from a TA language by
     a shallow TRS is not necessarily regular, but it can be recognized by a
     TA with equality and disequality constraints between brothers. As~a
     consequence we conclude decidability of regularity of the reachable set
     of terms from a TA language by innermost rewriting and shallow TRS. This
     result is in contrast with plain (not necessarily innermost) rewriting
     for which we prove undecidability. We also show that, like for plain
     rewriting, innermost rewriting with linear and right-shallow TRS
     preserves regularity.}
}
@misc{NM-AV2008,
  author = {Markey, Nicolas},
  title = {Infinite Runs In Weighted Times Games with Energy Constraints},
  year = 2008,
  month = aug,
  noslides = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/SLIDES/.pdf},
  howpublished = {Invited talk, Workshop {A}utomata and {V}erification
                  ({AV}'08), Mons, Belgium}
}
@misc{PB-AV2008,
  author = {Bouyer, Patricia},
  title = {Probabilities in Timed Automata},
  year = 2008,
  month = aug,
  noslides = {},
  howpublished = {Invited talk, Workshop {A}utomata and {V}erification
                  ({AV}'08), Mons, Belgium}
}
@misc{PhS-AV2008,
  author = {Schnoebelen, {\relax Ph}ilippe},
  title = {The complexity of lossy channel systems},
  year = 2008,
  month = aug,
  noslides = {},
  howpublished = {Invited talk, Workshop {A}utomata and {V}erification
                  ({AV}'08), Mons, Belgium}
}
@inproceedings{EB-fast08,
  address = {Malaga, Spain},
  month = apr,
  year = 2009,
  volume = 5491,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Degano, Pierpaolo and Guttman,  Joshua and 
		Martinelli, Fabio},
  acronym = {{FAST}'08},
  booktitle = {{R}evised {S}elected {P}apers of the 5th {I}nternational {W}orkshop on 
	   {F}ormal {A}spects in {S}ecurity and {T}rust ({FAST}'08)},
  author = {Bursztein, Elie},
  title = {Extending Anticipation Games with Location, Penalty and
        Timeline},
  pages = {272-286},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/eb-fast08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/eb-fast08.pdf},
  doi = {10.1007/978-3-642-01465-9_18},
  abstract = {Over the last few years, attack graphs have became a well
    recognized tool to analyze and model complex network attack. The most
    advanced evolution of attack graphs, called anticipation games, is based
    on game theory. However even if anticipation games allow to model time,
    collateral effects and player interactions with the network, there is
    still key aspects of the network security that cannot be modeled in this
    framework. Theses aspects are network cooperation to fight unknown attack,
    the cost of attack based on its duration and the introduction of new
    attack over the time. In this paper we address these needs, by introducing
    a three-fold extension to anticipation games. We prove that this extension
    does not change the complexity of the framework. We illustrate the
    usefulness of this extension by presenting how it can be used to find a
    defense strategy against 0 days that use an honey net. Finally, we have
    implemented this extension into a prototype, to show that it can be used
    to analyze large networks security.}
}
@inproceedings{CLC-ccs08,
  address = {Alexandria, Virginia, USA},
  month = oct,
  year = 2008,
  publisher = {ACM Press},
  acronym = {{CCS}'08},
  booktitle = {{P}roceedings of the 15th {ACM} {C}onference
               on {C}omputer and {C}ommunications {S}ecurity
               ({CCS}'08)},
  author = {Comon{-}Lundh, Hubert and Cortier, V{\'e}ronique},
  title = {Computational Soundness of Observational Equivalence},
  pages = {109-118},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CLC-ccs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CLC-ccs08.pdf},
  doi = {10.1145/1455770.1455786},
  abstract = {Many security properties are naturally expressed as
                  indistinguishability between two versions of a protocol. In
                  this paper, we show that computational proofs of
                  indistinguishability can be considerably simplified, for a
                  class of processes that covers most existing protocols. More
                  precisely, we show a soundness theorem, following the line
                  of research launched by Abadi and Rogaway in~2000:
                  computational indistinguishability in presence of an active
                  attacker is implied by the observational equivalence of the
                  corresponding symbolic processes. We prove our result for
                  symmetric encryption, but the same techniques can be applied
                  to other security primitives such as signatures and
                  public-key encryption. The proof requires the introduction
                  of new concepts, which are general and can be reused in
                  other settings.}
}
@mastersthesis{ciobaca-master,
  author = {Ciob{\^a}c{\u{a}}, {\c{S}}tefan},
  title = {Verification of anonymity properties in e-voting protocols},
  school = {{M}aster {P}arisien de {R}echerche en 
	{I}nformatique, Paris, France},
  type = {Rapport de {M}aster},
  year = {2008},
  month = sep,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/master-ciobaca.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/master-ciobaca.pdf}
}
@misc{dots-rapp-18m,
  author = {Fran{\c{c}}ois Laroussinie and others},
  title = {Projet DOTS (ANR-06-SETI-003)~: Rapport {\`a} \(18\)~mois},
  year = 2008,
  month = sep,
  type = {Contract Report},
  note = {5~pages}
}
@misc{dots-rapp-12m,
  author = {Fran{\c{c}}ois Laroussinie and others},
  title = {Projet DOTS (ANR-06-SETI-003)~: Rapport {\`a} \(12\)~mois},
  year = 2008,
  month = mar,
  type = {Contract Report},
  note = {6~pages}
}
@misc{dots-rapp-6m,
  author = {Fran{\c{c}}ois Laroussinie and others},
  title = {Projet DOTS (ANR-06-SETI-003)~: Rapport {\`a} \(6\)~mois},
  year = 2007,
  month = aug,
  type = {Contract Report},
  note = {7~pages}
}
@misc{dots-1.1,
  author = {Cassez, Franck and Laroussinie, Fran{\c{c}}ois and Lime,
                  Didier and Markey, Nicolas},
  title = {Quantitative Objectives in Timed Games},
  howpublished = {Deliverable DOTS~1.1 (ANR-06-SETI-003)},
  year = 2008,
  month = sep
}
@misc{dots-3.1,
  author = {Bollig, Benedikt and Bouyer, Patricia and Cassez, Franck and
                  Chatain, {\relax Th}omas and Gastin, Paul and Haddad, Serge
                  and Jard, Claude},
  title = {Model for distributed timed systems},
  howpublished = {Deliverable DOTS~3.1 (ANR-06-SETI-003)},
  year = 2008,
  month = sep
}
@inproceedings{ADK-lpar08,
  address = {Doha, Qatar},
  month = nov,
  year = 2008,
  volume = {5330},
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer},
  editor = {Cervesato, Iliano and Veith, Helmut and Voronkov, Andrei},
  acronym = {{LPAR}'08},
  booktitle = {{P}roceedings of the 15th {I}nternational
               {C}onference on {L}ogic for {P}rogramming,
               {A}rtificial {I}ntelligence, and {R}easoning
               ({LPAR}'08)},
  author = {Arapinis, Myrto and Delaune, St{\'e}phanie and Kremer, Steve},
  title = {From One Session to Many: Dynamic Tags for Security Protocols},
  pages = {128-142},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ADK-lpar08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ADK-lpar08.pdf},
  doi = {10.1007/978-3-540-89439-1_9},
  abstract = {The design and verification of cryptographic 
	protocols is a notoriously difficult task, even in abstract 
	Dolev-Yao models. This is mainly due to several sources of 
	unboundedness (size of messages, number of sessions,~...). 
	In~this paper, we~present a transformation which maps a protocol 
	that is secure for a single session to a protocol that is secure 
	for an unbounded number of sessions. The~transformation is 
	surprisingly simple, computationally light and works for 
	arbitrary protocols that rely on usual cryptographic primitives, 
	such as symmetric and asymmetric encryption as well as digital 
	signatures. Our~result provides an effective strategy to design 
	secure protocols: (i)~design a protocol intended to be secure 
	for one session (this can be verified with existing automated 
	tools); (ii)~apply our transformation and obtain a protocol 
	which is secure for an unbounded number of sessions. 
	A~side-effect of this result is that we characterize a class of 
	protocols for which secrecy for an unbounded number of sessions 
	is decidable.}
}
@inproceedings{HCL-ijcar08,
  address = {Sydney, Australia},
  month = aug,
  year = 2008,
  volume = {5195},
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer-Verlag},
  editor = {Armando, Alessandro and Baumgartner, Peter and 
		Dowek, Gilles},
  acronym = {{IJCAR}'08},
  booktitle = {{P}roceedings of the 4th {I}nternational {J}oint
           {C}onference on {A}utomated {R}easoning
           ({IJCAR}'08)},
  author = {Comon{-}Lundh, Hubert},
  title = {Challenges in the Automated Verification of Security
                  Protocols},
  pages = {396-409},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HCL-ijcar08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HCL-ijcar08.pdf},
  doi = {10.1007/978-3-540-71070-7_34},
  abstract = {The application area of security protocols raises several
                  problems that are relevant to automated deduction. We
                  describe in this note some of these challenges.}
}
@article{DKR-jcs08,
  publisher = {{IOS} Press},
  journal = {Journal of Computer Security},
  author = {Delaune, St{\'e}phanie and Kremer, Steve and Ryan, Mark D.},
  title = {Verifying Privacy-type Properties of Electronic Voting 
		 Protocols},
  volume = 17,
  number = 4,
  month = jul,
  year = 2009,
  pages = {435-487},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-jcs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-jcs08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DKR-jcs08.ps},
  doi = {10.3233/JCS-2009-0340},
  abstract = {Electronic voting promises the possibility of a convenient,
    efficient and secure facility for recording and tallying votes in an
    election. Recently highlighted inadequacies of implemented systems have
    demonstrated the importance of formally verifying the underlying voting
    protocols. We study three privacy-type properties of electronic voting
    protocols: in increasing order of strength, they are vote-privacy,
    receipt-freeness, and coercion-resistance.\par
    We use the applied pi calculus, a formalism well adapted to modelling such
    protocols, which has the advantages of being based on well-understood
    concepts. The privacy-type properties are expressed using observational
    equivalence and we show in accordance with intuition that
    coercion-resistance implies receipt-freeness, which implies vote-privacy.\par
    We illustrate our definitions on three electronic voting protocols from
    the literature. Ideally, these three properties should hold even if the
    election officials are corrupt. However, protocols that were designed to
    satisfy receipt-freeness or coercion-resistance may not do so in the
    presence of corrupt officials. Our model and definitions allow us to
    specify and easily change which authorities are supposed to be
    trustworthy.}
}
@article{DG-tcs08,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {Demri, St{\'e}phane and Gascon, R{\'e}gis},
  title = {Verification of Qualitative {\(\mathbb{\MakeUppercase{Z}}\)}~constraints},
  volume = 409,
  number = 1,
  month = dec,
  year = 2008,
  pages = {24-40},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-tcs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-tcs08.pdf},
  doi = {10.1016/j.tcs.2008.07.023},
  abstract = {We introduce an LTL-like logic with atomic formulae built over a
    constraint language interpreting variables in~\(\mathbb{Z}\).
    The~constraint language includes periodicity constraints, comparison
    constraints of the form \({x = y}\) and \({x < y}\), is~closed under Boolean
    operations and admits a restricted form of existential quantification.
    Such constraints are used for instance in calendar formalisms or
    abstractions of counter automata by using congruences modulo some power of
    two. Indeed, various programming languages perform arithmetic operators
    modulo some integer. We~show that the satisfiability and model-checking
    problems (with respect to an appropriate class of constraint automata) for
    this logic are decidable in polynomial space improving significantly known
    results about its strict fragments. This is the largest set of qualitative
    constraints over~\(\mathbb{Z}\) known so~far, shown to admit a decidable
    LTL extension.}
}
@inproceedings{BCFH-valuetools08,
  address = {Athens, Greece},
  month = oct,
  year = 2008,
  publisher = {Institute for Computer Sciences, Social-Informatics and 
   	Telecommunications Engineering},
  editor = {Chahed, Tijani and Toumpis, Stavros and Yechiali, Uri},
  acronym = {{VALUETOOLS}'08},
  booktitle = {{P}roceedings of the 3rd {I}nternational {C}onference 
	   on {P}erformance {E}valuation {M}ethodologies and {T}ools
           ({VALUETOOLS}'08)},
  author = {Beccuti, Marco and Codetta{-}Raiteri, Daniele and
		 Franceschinis, Giuliana and Haddad, Serge},
  title = {Non Deterministic Repairable Fault Trees for Computing
                  Optimal Repair Strategy},
  nopages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCFH-valuetools08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCFH-valuetools08.pdf},
  doi = {10.4108/ICST.VALUETOOLS2008.4411},
  abstract = {In~this paper, the Non deterministic Repairable Fault
    Tree~(NdRFT) formalism is proposed: it allows to model failure modes of
    complex systems as well as their repair processes. The originality of this
    formalism with respect to other Fault Tree extensions is that it allows to
    face repair strategies optimization problems: in~an NdRFT model, the
    decision on whether to start or not a given repair action is non
    deterministic, so that all the possibilities are left open. The formalism
    is rather powerful allowing to specify which failure events are
    observable, whether local repair or global repair can be applied, and the
    resources needed to start a repair action. The optimal repair strategy can
    then be computed by solving an optimization problem on a Markov Decision
    Process~(MDP) derived from the NdRFT. A~software framework is proposed in
    order to perform in automatic way the derivation of an MDP from a NdRFT
    model, and to deal with the solution of the MDP.}
}
@article{DDMR-fmsd08,
  publisher = {Springer},
  journal = {Formal Methods in System Design},
  author = {De{~}Wulf, Martin and Doyen, Laurent and Markey, Nicolas
                  and Raskin, Jean-Fran{\c{c}}ois},
  title = {Robust Safety of Timed Automata},
  year = 2008,
  month = dec,
  volume = 33,
  number = {1-3},
  pages = {45-84},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DDMR-fmsd08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DDMR-fmsd08.pdf},
  doi = {10.1007/s10703-008-0056-7},
  abstract = {Timed automata are governed by an idealized semantics that
    assumes a perfectly precise behavior of the clocks. The traditional
    semantics is not robust because the slightest perturbation in the timing
    of actions may lead to completely different behaviors of the automaton.
    Following several recent works, we consider a relaxation of this
    semantics, in which guards on transitions are widened by~\(\Delta>0\) and
    clocks can drift by~\(\epsilon>0\). The relaxed semantics encompasses the
    imprecisions that are inevitably present in an implementation of a timed
    automaton, due to the finite precision of digital clocks.\par
    We solve the safety verification problem for this robust semantics: given
    a timed automaton and a set of bad states, our algorithm decides if there
    exist positive values for the parameters~\(\Delta\) and~\(\epsilon\) such
    that the timed automaton never enters the bad states under the relaxed
    semantics.}
}
@inproceedings{Bur-atva08,
  address = {Seoul, Korea},
  month = oct,
  year = {2008},
  volume = 5311,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Cha, Sungdeok and Choi, Jin-Young and Kim, Moonzoo 
		and Lee, Insup and Viswanathan, Mahesh},
  acronym = {{ATVA}'08},
  booktitle = {{P}roceedings of the 6th {I}nternational
               {S}ymposium on {A}utomated {T}echnology
               for {V}erification and {A}nalysis
               ({ATVA}'08)},
  author = {Bursztein, Elie},
  title = {Net{Q}i: A~Model Checker for Anticipation Game},
  pages = {246-251},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bur-atva08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bur-atva08.pdf},
  doi = {10.1007/978-3-540-88387-6_22},
  abstract = {NetQi is a freely available model-checker designed to analyze
    network incidents such as intrusion. This tool is an implementation of the
    anticipation game framework, a variant of timed game tailored for network
    analysis. The main purpose of NetQi is to find, given a network initial
    state and a set of rules, the best strategy that fulfills player
    objectives by model-checking the anticipation game and comparing the
    outcome of each play that fulfills strategy constraints. For instance, it
    can be used to find the best patching strategy. NetQi has been
    successfully used to analyze service failure due to hardware, network
    intrusion, worms and multiple-site intrusion defense cooperation.}
}
@inproceedings{ACEF-rp08,
  address = {Liverpool, UK},
  month = dec,
  year = 2008,
  volume = 223,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Halava, Vesa and Potapov, Igor},
  acronym = {{RP}'08},
  booktitle = {{P}roceedings of the 2nd {W}orkshop
           on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'08)},
  author = {Andr{\'e}, {\'E}tienne and Chatain, {\relax Th}omas and
		 Encrenaz, Emmanuelle and Fribourg, Laurent},
  title = {An Inverse Method for Parametric Timed Automata},
  pages = {29-46},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACEF-rp08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACEF-rp08.pdf},
  doi = {10.1016/j.entcs.2008.12.029},
  abstract = {Given a timed automaton with parametric timings, our objective
    is to describe a procedure for deriving constraints on the parametric
    timings in order to ensure that, for~each value of parameters satisfying
    these constraints, the behaviors of the timed automata are time-abstract
    equivalent. We~will exploit a reference valuation of the parameters that
    is supposed to capture a characteristic proper behavior of the system. 
    The~method has been implemented and is illustrated on various examples of
    asynchronous circuits.}
}
@inproceedings{BFS-infinity08,
  optaddress = {Toronto, Canada},
  month = jul,
  year = 2009,
  volume = 239,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Habermehl, Peter and Vojnar, Tom{\'a}{\v{s}}},
  acronym = {{INFINITY}'06,'07,'08},
  booktitle = {{J}oint {P}roceedings of the 8th, 9th and 10th {I}nternational 
               {W}orkshops on {V}erification of {I}nfinite
               {S}tate {S}ystems
               ({INFINITY}'06,'07,'08)},
  author = {Bouchy, Florent and Finkel, Alain and Sangnier, Arnaud},
  title = {Reachability in Timed Counter Systems},
  pages = {167-178},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFS-infinity08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFS-infinity08.pdf},
  doi = {10.1016/j.entcs.2009.05.038},
  abstract = {We introduce Timed Counter Systems, a~new class of systems
    mixing clocks and counters. Such systems have an infinite state space,
    hence their reachability problems are undecidable. By~abstracting clock
    values with a Region Graph, we~show the Counter Reachability Problem to be
    decidable for three subclasses: Timed~VASS, Bounded Timed Counter Systems,
    and Reversal-Bounded Timed Counter Systems.}
}
@proceedings{HV-infinity2008,
  title = {{J}oint {P}roceedings of the 8th, 9th and 10th {I}nternational 
           {W}orkshops on {V}erification of {I}nfinite
           {S}tate {S}ystems
           ({INFINITY}'06,'07,'08)},
  booktitle = {{J}oint {P}roceedings of the 8th, 9th and 10th {I}nternational 
               {W}orkshops on {V}erification of {I}nfinite
               {S}tate {S}ystems
               ({INFINITY}'06,'07,'08)},
  optacronym = {{INFINITY}'06,'07,'08},
  editor = {Habermehl, Peter and Vojnar, Tom{\'a}{\v{s}}},
  publisher = {Elsevier Science Publishers},
  doi = {10.1016/j.entcs.2009.05.026},
  series = {Electronic Notes in Theoretical Computer Science},
  volume = 239,
  year = 2009,
  month = jul,
  optaddress = {Toronto, Canada}
}
@techreport{LSV:08:18,
  author = {Goubault{-}Larrecq, Jean},
  title = {A Cone-Theoretic {K}rein-{M}ilman Theorem},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2008,
  month = jun,
  type = {Research Report},
  number = {LSV-08-18},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-18.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-18.pdf},
  note = {8~pages},
  abstract = {We prove the following analogue of the Krein-Milman 
    Theorem: in any locally convex \(T_{0}\) topological cone, every 
    convex compact saturated subset is the compact saturated convex hull 
    of its extreme points.}
}
@inproceedings{bbjlr-formats08,
  address = {Saint-Malo, France},
  month = sep,
  year = 2008,
  volume = 5215,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Cassez, Franck and Jard, Claude},
  acronym = {{FORMATS}'08},
  booktitle = {{P}roceedings of the 6th {I}nternational {C}onference
           on {F}ormal {M}odelling and {A}nalysis of {T}imed
           {S}ystems ({FORMATS}'08)},
  author = {Bouyer, Patricia and Brihaye, {\relax Th}omas and
		 Jurdzi{\'n}ski, Marcin and Lazi{\'c}, Ranko and 
		 Rutkowski, Micha{\l}},
  title = {Average-Price and Reachability-Price Games on Hybrid 
		 Automata with Strong Resets},
  pages = {63-77},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bbjlr-formats08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bbjlr-formats08.pdf},
  doi = {10.1007/978-3-540-85778-5_6},
  abstract = {We introduce and study hybrid automata with strong resets. They
    generalize o-minimal hybrid automata, a class of hybrid automata which
    allows modeling of complex continuous dynamics. A number of analysis
    problems, such as reachability testing and controller synthesis, are
    decidable for classes of o-minimal hybrid automata. We generalize existing
    decidability results for controller synthesis on hybrid automata and we
    establish new ones by proving that average-price and reachability-price
    games on hybrid systems with strong resets are decidable, provided that
    the structure on which the hybrid automaton is defined has a decidable
    first-order theory. Our proof techniques include a novel characterization
    of values in games on hybrid systems by optimality equations, and a
    definition of a new finitary equivalence relation on the states of a
    hybrid system which enables a reduction of games on hybrid systems to
    games on finite graphs. }
}
@inproceedings{bflms-formats08,
  address = {Saint-Malo, France},
  month = sep,
  year = 2008,
  volume = 5215,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Cassez, Franck and Jard, Claude},
  acronym = {{FORMATS}'08},
  booktitle = {{P}roceedings of the 6th {I}nternational {C}onference
           on {F}ormal {M}odelling and {A}nalysis of {T}imed
           {S}ystems ({FORMATS}'08)},
  author = {Bouyer, Patricia and Fahrenberg, Uli and Larsen, Kim G.
    		and Markey, Nicolas and Srba, Ji{\v{r}}{\'\i}},
  title = {Infinite Runs in Weighted Timed Automata with Energy 
		Constraints},
  pages = {33-47},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFLMS-formats08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFLMS-formats08.pdf},
  doi = {10.1007/978-3-540-85778-5_4},
  abstract = {We~study the problems of existence and construction of
infinite schedules for finite weighted automata and one-clock weighted
timed automata, subject to boundary constraints on the accumulated
weight. More specifically, we~consider automata equipped with positive
and negative weights on transitions and locations, corresponding to the
production and consumption of some resource (\emph{e.g.}~energy). We~ask the
question whether there exists an infinite path for which the accumulated
weight for any finite prefix satisfies certain constraints (\emph{e.g.}~remains
between~\(0\) and some given upper-bound). We~also consider a game version
of the above, where certain transitions may be uncontrollable.}
}
@article{CJP-lmcs08,
  journal = {Logical Methods in Computer Science},
  author = {Comon{-}Lundh, Hubert and Jacquemard, Florent and Perrin, Nicolas},
  title = {Visibly Tree Automata with Memory and Constraints},
  year = 2008,
  month = jun,
  volume = 4,
  number = {2\string:8},
  nopages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CJP-lmcs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CJP-lmcs08.pdf},
  doi = {10.2168/LMCS-4(2:8)2008},
  abstract = {Tree automata with one memory have been introduced in~2001. They
    generalize both pushdown (word) automata and the tree automata with
    constraints of equality between brothers of Bogaert and Tison. Though it
    has a decidable emptiness problem, the main weakness of this model is its
    lack of good closure properties.\par
    We propose a generalization of the visibly pushdown automata of Alur 
    and~Madhusudan to a family of tree recognizers which carry along their
    (bottom-up) computation an auxiliary unbounded memory with a tree
    structure (instead of a symbol stack). In~other words, these recognizers,
    called Visibly Tree Automata with Memory~(VTAM) define a subclass of tree
    automata with one memory enjoying Boolean closure properties. We~show in
    particular that they can be determinized and the problems like emptiness,
    membership, inclusion and universality are decidable for VTAM. Moreover,
    we propose several extensions of VTAM whose transitions may be constrained
    by different kinds of tests between memories and also constraints
    \emph{{\`a}~la} Bogaert and~Tison. We~show that some of these classes of
    constrained VTAM keep the good closure and decidability properties, and we
    demonstrate their expressiveness with relevant examples of tree
    languages.}
}
@incollection{DG-hwa08,
  year = 2009,
  series = {EATCS Monographs in Theoretical Computer Science},
  publisher = {Springer},
  editor = {Kuich, Werner and Vogler, Heiko and Droste, Manfred},
  booktitle = {Handbook of Weighted Automata},
  author = {Droste, Manfred and Gastin, Paul},
  title = {Weighted automata and weighted logics},
  pages = {175-211},
  chapter = 5,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-hwa08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-hwa08.pdf}
}
@incollection{DG-pct08,
  futureaddress = {},
  month = jan,
  year = 2009,
  series = {IARCS-Universities},
  publisher = {Universities Press},
  booktitle = {Perspectives in Concurrency Theory},
  editor = {Lodaya, Kamal and Mukund, Madhavan and
		 Ramanujam, R.},
  author = {Diekert, Volker and Gastin, Paul},
  title = {Local safety and local liveness for distributed systems},
  pages = {86-106},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-pct08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-pct08.pdf},
  abstract = {We introduce local safety and local liveness for distributed
    systems whose executions are modeled by Mazurkiewicz traces. We
    characterize local safety by local closure and local liveness by local
    density. Restricting to first-order definable properties, we prove a
    decomposition theorem in the spirit of the separation theorem for linear
    temporal logic. We then characterize local safety and local liveness by
    means of canonical local temporal logic formulae.}
}
@inproceedings{ABH-dlt08,
  address = {Kyoto, Japan},
  month = sep,
  year = 2008,
  volume = 5257,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Ito, Masami and Toyama, Masafumi},
  acronym = {{DLT}'08},
  booktitle = {{P}roceedings of the 12th {I}nternational
               {C}onference on {D}evelopments in {L}anguage {T}heory
               ({DLT}'08)},
  author = {Atig, Mohamed Faouzi and Bollig, Benedikt and Habermehl, Peter},
  title = {Emptiness of multi-pushdown automata is \(2\){ETIME}-complete},
  pages = {121-133},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABH-dlt08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABH-dlt08.pdf},
  doi = {10.1007/978-3-540-85780-8_9},
  abstract = {We consider multi-pushdown automata, a multi-stack extension of
    pushdown automata that comes with a constraint on stack operations: a pop
    can only be performed on the first non-empty stack (which implies that we
    assume a linear ordering on the collection of stacks). We show that the
    emptiness problem for multi-pushdown automata is 2ETIME-complete wrt.~the
    number of stacks. Containment in 2ETIME is shown by translating an
    automaton into a grammar for which we can check if the generated language
    is empty. The lower bound is established by simulating the behavior of an
    alternating Turing machine working in exponential space. We also compare
    multi-pushdown automata with the model of bounded-phase multi-stack
    (visibly) pushdown automata.}
}
@inproceedings{CDFPS-qest08,
  address = {Saint~Malo, France},
  month = sep,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{QEST}'08},
  booktitle = {{P}roceedings of the 5th {I}nternational
               {C}onference on {Q}uantitative 
               {E}valuation of {S}ystems
               ({QEST}'08)},
  author = {Chamseddine, Najla and Duflot, Marie and Fribourg, 
		  Laurent and Picaronny, Claudine and Sproston, Jeremy},
  title = {Computing Expected Absorption Times for Parametric 
		   Determinate Probabilistic Timed Automata},
  pages = {254-263},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDFPS-qest08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDFPS-qest08.pdf},
  doi = {10.1109/QEST.2008.34},
  abstract = {We consider a variant of probabilistic timed automata called
    \emph{parametric determinate probabilistic timed automata}. Such~automata
    are fully probabilistic: there~is a single distribution of outgoing
    transitions from each of the automaton's nodes, and~it~is possible to
    remain at a node only for a given amount of time. The~residence time
    within a node may be given in terms of a parameter, and~hence we do not
    assume that its concrete value is known.\par
    We claim that, often in practice, the maximal expected time to reach a
    given absorbing node of a probabilistic timed automaton can be captured
    using a parametric determinate probabilistic timed automaton. We give a
    method for computing the expected time for a parametric determinate
    probabilistic timed automaton to reach an absorbing node. The~method
    consists in constructing a variant of a Markov chain with costs (where the
    costs correspond to durations), and~is parametric in the sense that the
    expected absorption time is computed as a function of the model's
    parameters. The~complexity of the analysis is independent from the maximal
    constant bounding the values of the clocks, and is polynomial in the
    number of edges of the original parametric determinate probabilistic timed
    automaton.}
}
@inproceedings{JR-rta2008,
  address = {Hagenberg, Austria},
  month = jul,
  year = 2008,
  volume = 5117,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Voronkov, Andrei},
  acronym = {{RTA}'08},
  booktitle = {{P}roceedings of the 19th {I}nternational
               {C}onference on {R}ewriting {T}echniques
               and {A}pplications
               ({RTA}'08)},
  author = {Jacquemard, Florent and Rusinowitch, Micha{\"e}l},
  title = {Closure of {H}edge-Automata Languages by {H}edge 
		 Rewriting},
  pages = {157-171},
  doi = {10.1007/978-3-540-70590-1_11},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JR-rta08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JR-rta08.pdf},
  abstact = {We consider rewriting systems for unranked ordered terms,
    \textit{i.e.}, trees where the number of successors of a node is not
    determined by its label, and is not \textit{a priori} bounded. The
    rewriting systems are defined such that variables in the rewrite rules can
    be substituted by hedges (sequences of terms) instead of just terms.
    Consequently, this notion of rewriting subsumes both standard term
    rewriting and word rewriting.\par
    We investigate some preservation properties for two classes of languages
    of unranked ordered terms under this generalization of term rewriting. The
    considered classes include languages of hedge automata (HA) and some
    extension (called CF-HA) with context-free languages in transitions,
    instead of regular languages.\par
    In particular, we show that the set of unranked terms reachable from a
    given HA language, using a so called inverse context-free rewrite system,
    is a HA language. The proof, based on a HA completion procedure, reuses
    and combines known techniques with non-trivial adaptations. Moreover, we
    prove, with different techniques, that the closure of CF-HA languages with
    respect to restricted context-free rewrite systems, the symmetric case of
    the above rewrite systems, is a CF-HA language. As a consequence, the
    problems of ground reachability and regular hedge model checking are
    decidable in both cases. We give several counter examples showing that we
    cannot relax the restrictions.}
}
@proceedings{DJ-time2008,
  title = {{P}roceedings of the 15th {I}nternational {S}ymposium on
           {T}emporal {R}epresentation and {R}easoning
           ({TIME}'08)},
  booktitle = {{P}roceedings of the 15th {I}nternational {S}ymposium on
               {T}emporal {R}epresentation and {R}easoning
               ({TIME}'08)},
  editor = {Demri, St{\'e}phane and Jensen, {\relax Ch}ristian S.},
  publisher = {{IEEE} Computer Society Press},
  year = 2008,
  month = jun,
  address = {Montr{\'e}al, Canada}
}
@article{DL-tocl08,
  publisher = {ACM Press},
  journal = {ACM Transactions on Computational Logic},
  author = {Demri, St{\'e}phane and Lazi{\'c}, Ranko},
  title = {{LTL} with the freeze quantifier and register automata},
  volume = 10,
  number = 3,
  nopages = {},
  month = apr,
  year = 2009,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DL-tocl08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DL-tocl08.pdf},
  doi = {10.1145/1507244.1507246},
  abstract = {A data word is a sequence of pairs of a letter from a finite
    alphabet and an element from an infinite set, where the latter can only be
    compared for equality. To reason about data words, linear temporal logic
    is extended by the freeze quantifier, which stores the element at the
    current word position into a register, for equality comparisons deeper in
    the formula. By translations from the logic to alternating automata with
    registers and then to faulty counter automata whose counters may
    erroneously increase at any time, and from faulty and error-free counter
    automata to the logic, we obtain a complete complexity table for logical
    fragments defined by varying the set of temporal operators and the number
    of registers. In~particular, the~logic with future-time operators and
    \(1\)~register is decidable but not primitive recursive over finite data
    words. Adding past-time operators or \(1\)~more register, or switching to
    infinite data words, cause undecidability.}
}
@inproceedings{CS-concur08,
  address = {Toronto, Canada},
  month = aug,
  year = 2008,
  volume = 5201,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {van Breugel, Franck and Chechik, Marsha},
  acronym = {{CONCUR}'08},
  booktitle = {{P}roceedings of the 19th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'08)},
  author = {Chambart, Pierre and Schnoebelen, {\relax Ph}ilippe},
  title = {Mixing Lossy and Perfect Fifo Channels},
  pages = {340-355},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CS-concur08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CS-concur08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CS-concur08.ps},
  doi = {10.1007/978-3-540-85361-9_28},
  abstract = {We~consider asynchronous networks of finite-state systems
    communicating \emph{via} a combination of reliable and lossy fifo channels.
    Depending on the topology, the~reachability problem for such networks may
    be decidable. We~provide a complete classification of network topologies
    according to whether they lead to a decidable reachability problem.
    Furthermore, this classification can be decided in polynomial-time.}
}
@inproceedings{BCHK-concur08,
  address = {Toronto, Canada},
  month = aug,
  year = 2008,
  volume = 5201,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {van Breugel, Franck and Chechik, Marsha},
  acronym = {{CONCUR}'08},
  booktitle = {{P}roceedings of the 19th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'08)},
  author = {Baldan, Paolo and Chatain, {\relax Th}omas and Haar, Stefan and K{\"o}nig,
                  Barbara},
  title = {Unfolding-based Diagnosis of Systems with an Evolving Topology},
  pages = {203-217},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHK-concur08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHK-concur08.pdf},
  doi = {10.1007/978-3-540-85361-9_19},
  abstract = {We propose a framework for model-based diagnosis of systems with
    mobility and variable topologies, modelled as graph transformation
    systems. Generally speaking, model-based diagnosis is aimed at
    constructing explanations of observed faulty behaviours on the basis of a
    given model of the system. Since the number of possible explanations may
    be huge we exploit the unfolding as a compact data structure to store
    them, along the lines of previous work dealing with Petri net models.
    Given a model of a system and an observation, the explanations can be
    constructed by unfolding the model constrained by the observation, and
    then removing incomplete explanations in a pruning phase. The theory is
    formalised in a general categorical setting: constraining the system by
    the observation corresponds to taking a product in the chosen category of
    graph grammars, so that the correctness of the procedure can be proved by
    using the fact that the unfolding is a right adjoint and thus it preserves
    products. The theory thus should be easily applicable to a wide class of
    system models, including graph grammars and Petri nets.}
}
@inproceedings{BKKL-concur08,
  address = {Toronto, Canada},
  month = aug,
  year = 2008,
  volume = 5201,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {van Breugel, Franck and Chechik, Marsha},
  acronym = {{CONCUR}'08},
  booktitle = {{P}roceedings of the 19th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'08)},
  author = {Bollig, Benedikt and Katoen, Joost-Pieter and Kern, Carsten and
                  Leucker, Martin},
  title = {{\itshape Smyle}: A Tool for Synthesizing Distributed Models from
                  Scenarios by Learning},
  pages = {162-166},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-concur08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-concur08.pdf},
  doi = {10.1007/978-3-540-85361-9_15}
}
@inproceedings{LV-concur08,
  address = {Toronto, Canada},
  month = aug,
  year = 2008,
  volume = 5201,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {van Breugel, Franck and Chechik, Marsha},
  acronym = {{CONCUR}'08},
  booktitle = {{P}roceedings of the 19th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'08)},
  author = {Lozes, {\'E}tienne and Villard, Jules},
  title = {A Spatial Equational Logic for the Applied {{\(\pi\)}}-Calculus},
  pages = {387-401},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LV-concur08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LV-concur08.pdf},
  doi = {10.1007/978-3-540-85361-9_31},
  abstract = {Spatial logics have been proposed to reason locally and
    modularly on algebraic models of distributed systems. In this paper we
    define the spatial equational logic A\(\pi\)L whose models are processes
    of the applied \(\pi\)-calculus. This extension of the \(\pi\)-calculus
    allows term manipulation and records communications as active
    substitutions in a frame, thus augmenting the underlying predefined
    equational theory. Our logic allows one to reason locally either on frames
    or on processes, thanks to static and dynamic spatial operators. We study
    the logical equivalences induced by various relevant fragments
    of~A\(\pi\)L, and~show in particular that the whole logic induces a
    coarser equivalence than structural congruence. We give characteristic
    formulae for some of these equivalences and for static equivalence. Going
    further into the exploration of A\(\pi\)L's expressivity, we~also show
    that it can eliminate standard term quantification.}
}
@inproceedings{ABGMN-concur08,
  address = {Toronto, Canada},
  month = aug,
  year = 2008,
  volume = 5201,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {van Breugel, Franck and Chechik, Marsha},
  acronym = {{CONCUR}'08},
  booktitle = {{P}roceedings of the 19th 
               {I}nternational {C}onference on
               {C}oncurrency {T}heory
               ({CONCUR}'08)},
  author = {Akshay, S. and Bollig, Benedikt and Gastin, Paul and Mukund,
                  Madhavan and Narayan Kumar, K.},
  title = {Distributed Timed Automata with Independently Evolving
                  Clocks},
  pages = {82-97},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABGMN-concur08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABGMN-concur08.pdf},
  doi = {10.1007/978-3-540-85361-9_10},
  abstract = { We propose a model of distributed timed systems where each 
component is a timed automaton with a set of local clocks that evolve at a 
rate independent of the clocks of the other components. A clock can be 
read by any component in the system, but it can only be reset by the 
automaton it belongs to.\par
There are two natural semantics for such systems. The \emph{universal} 
semantics captures behaviors that hold under any choice of clock rates for 
the individual components. This is a natural choice when checking that a 
system always satisfies a positive specification. However, to check if a 
system avoids a negative specification, it is better to use the 
\emph{existential} semantics---the set of behaviors that the system can 
possibly exhibit under some choice of clock rates.\par
We show that the existential semantics always describes a regular set of 
behaviors. However, in the case of universal semantics, checking emptiness 
turns out to be undecidable. As an alternative to the universal semantics, 
we propose a \emph{reactive} semantics that allows us to check positive 
specifications and yet describes a regular set of behaviors. }
}
@inproceedings{FS-mfcs08,
  address = {Toru{\'n}, Poland},
  month = aug,
  year = 2008,
  volume = {5162},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Ochma{\'n}ski, Edward and Tyszkiewicz, Jerzy},
  acronym = {{MFCS}'08},
  booktitle = {{P}roceedings of the 33rd
               {I}nternational {S}ymposium on
               {M}athematical {F}oundations of 
               {C}omputer {S}cience
               ({MFCS}'08)},
  author = {Finkel, Alain and Sangnier, Arnaud},
  title = {Reversal-bounded Counter Machines Revisited},
  pages = {323-334},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FS-mfcs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FS-mfcs08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FS-mfcs08.ps},
  doi = {10.1007/978-3-540-85238-4_26},
  abstract = {We~extend the class of reversal-bounded counter machines by
    authorizing a finite number of alternations between increasing and
    decreasing mode over a given bound. We~prove that extended
    reversal-bounded counter machines also have effective semi-linear
    reachability sets. We~also prove that the property of being
    reversal-bounded is undecidable in general even when we fix the bound,
    whereas this problem becomes decidable when considering Vector Addition
    System with States.}
}
@inproceedings{place-csl08,
  address = {Bertinoro, Italy},
  month = sep,
  year = 2008,
  volume = 5213,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Kaminski, Michael and Martini, Simone},
  acronym = {{CSL}'08},
  booktitle = {{P}roceedings of the 17th {A}nnual {EACSL} {C}onference on
                  {C}omputer {S}cience {L}ogic ({CSL}'08)},
  author = {Place, {\relax Th}omas},
  title = {Characterization of Logics Over Ranked Tree Languages},
  pages = {401-415},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/place-csl08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/place-csl08.pdf},
  doi = {10.1007/978-3-540-87531-4_29},
  abstract = {We study the expressive power of the logics
     \(\textit{EF}+\textit{F}^{-1}\), \(\Delta_{2}\), and boolean combinations
     of \(\Sigma_{1}\) over ranked trees. In~particular, we provide effective
     characterizations of those three logics using algebraic identities.
     Characterizations had already been obtained for those logics over
     unranked trees, but both the algebra and the proofs were dependant on the
     properties of the unranked structure and the problem remained open for
     ranked trees.}
}
@inproceedings{BDL-csl08,
  address = {Bertinoro, Italy},
  month = sep,
  year = 2008,
  volume = 5213,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Kaminski, Michael and Martini, Simone},
  acronym = {{CSL}'08},
  booktitle = {{P}roceedings of the 17th {A}nnual {EACSL} {C}onference on
                  {C}omputer {S}cience {L}ogic ({CSL}'08)},
  author = {Brochenin, R{\'e}mi and Demri, St{\'e}phane and
		 Lozes, {\'E}tienne},
  title = {On~the Almighty Wand},
  pages = {323-338},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDL-csl08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDL-csl08.pdf},
  doi = {10.1007/978-3-540-87531-4_24},
  abstract = {We investigate decidability, complexity and expressive power
    issues for (first-order) separation logic with one record field (herein
    called~SL) and its fragments. SL~can specify properties about the memory
    heap of programs with singly-linked lists. Separation logic with two
    record fields is known to be undecidable by reduction of finite
    satisfiability for classical predicate logic with one binary relation.
    Surprisingly, we~show that second-order logic is as expressive as SL and
    as a by-product we get undecidability of~SL. This is refined by showing
    that SL without the separating conjunction is as expressive as~SL, whence
    undecidable too. As~a consequence of this deep result, in~SL the magic
    wand can simulate the separating conjunction. By~contrast, we~establish
    that SL without the magic wand is decidable with non-elementary complexity
    by reduction from satisfiability for the first-order theory over finite
    words. Equivalence between second-order logic and separation logic extends
    to the case with more than one selector.}
}
@inproceedings{bhhtv08ciaa,
  address = {San Francisco, California, USA},
  month = jul,
  year = 2008,
  volume = 5148,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer-Verlag},
  editor = {Ibarra, Oscar H. and Ravikumar, Bala},
  acronym = {{CIAA}'08},
  booktitle = {{P}roceedings of the 13th {I}nternational 
           {C}onference on {I}mplementation and
           {A}pplication of {A}utomata
           ({CIAA}'08)},
  author = {Bouajjani, Ahmed and Habermehl, Peter and Hol\'{\i}k, Luk{\'a}{\v{s}} and 
		Touili, Tayssir and Vojnar, Tom{\'a}{\v{s}}},
  title = {Antichain-based Universality and Inclusion Testing over
                 Nondeterministic Finite Tree Automata},
  pages = {57-67},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bhhtv-ciaa08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bhhtv-ciaa08.pdf},
  doi = {10.1007/978-3-540-70844-5_7},
  abstract = {We propose new antichain-based algorithms for checking
    universality and inclusion of nondeterministic tree automata. We have
    implemented these algorithms in a prototype tool and we present
    experiments which show that the algorithms provide a significant
    improvement over the traditional determinisation-based approaches.
    Furthermore, we use the proposed antichain-based inclusion checking
    algorithm to build an abstract regular tree model checking framework based
    entirely on nondeterministic tree automata. We show the significantly
    improved efficiency of this framework on a series of experiments with
    verifying various programs over dynamic tree-shaped data structures linked
    by pointers.}
}
@inproceedings{tCS-pods08,
  address = {Vancouver, Canada},
  month = jun,
  year = 2008,
  publisher = {ACM Press},
  editor = {Lenzerini, Maurizio and Lembo, Domenico},
  acronym = {{PODS}'08},
  booktitle = {{P}roceedings of the 27th {A}nnual 
	  {ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium 
	  on {P}rinciples of {D}atabase {S}ystems
	  ({PODS}'08)},
  author = {ten~Cate, Balder and Segoufin, Luc},
  title = {{XP}ath, Transitive Closure Logic, and Nested Tree Walking
                  Automata},
  pages = {251-260},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/tCS-pods08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/tCS-pods08.pdf},
  doi = {10.1145/1376916.1376952},
  abstract = {We consider the navigational core of XPath, extended with two
    operators: the Kleene star for taking the transitive closure of path
    expressions, and a subtree relativisation operator, allowing one to
    restrict attention to a specific subtree while evaluating a subexpression.
    We show that the expressive power of this XPath dialect equals that of
    FO(MTC), first order logic extended with monadic transitive closure. We
    also give a characterization in terms of nested tree-walking automata.
    Using the latter we then proceed to show that the language is strictly
    less expressive than MSO. This solves an open question about the relative
    expressive power of FO(MTC) and MSO on trees. We~also investigate the
    complexity for our XPath dialect. We~show that query evaluation be done in
    polynomial time (combined complexity), but that satisfiability and query
    containment (as~well as emptiness for our automaton model) are
    2ExpTime-complete (it is ExpTime-complete for Core XPath).}
}
@inproceedings{ASV-pods08,
  address = {Vancouver, Canada},
  month = jun,
  year = 2008,
  publisher = {ACM Press},
  editor = {Lenzerini, Maurizio and Lembo, Domenico},
  acronym = {{PODS}'08},
  booktitle = {{P}roceedings of the 27th {A}nnual 
	  {ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium 
	  on {P}rinciples of {D}atabase {S}ystems
	  ({PODS}'08)},
  author = {Abiteboul, Serge and Segoufin, Luc and Vianu, Victor},
  title = {Static Analysis of Active {XML} Systems},
  pages = {221-230},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ASV-pods08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ASV-pods08.pdf},
  doi = {10.1145/1376916.1376948},
  abstract = {Active XML is a high-level specification language tailored to
                  data-intensive, distributed, dynamic Web services. Active
                  XML is based on XML documents with embedded function calls.
                  The state of a document evolves depending on the result of
                  internal function calls (local computations) or external
                  ones (interactions with users or other services). Function
                  calls return documents that may be active, so may activate
                  new subtasks. The focus of the paper is on the verification
                  of temporal properties of runs of Active XML systems,
                  specified in a tree-pattern based temporal logic, Tree-LTL,
                  that allows expressing a rich class of semantic properties
                  of the application. The main results establish the boundary
                  of decidability and the complexity of automatic verification
                  of Tree-LTL properties.}
}
@inproceedings{BBBM-qest08,
  address = {Saint~Malo, France},
  month = sep,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{QEST}'08},
  booktitle = {{P}roceedings of the 5th {I}nternational
               {C}onference on {Q}uantitative 
               {E}valuation of {S}ystems
               ({QEST}'08)},
  author = {Bertrand, Nathalie and Bouyer, Patricia and Brihaye,
                  {\relax Th}omas and Markey, Nicolas},
  title = {Quantitative Model-Checking of One-Clock Timed Automata under
		Probabilistic Semantics},
  pages = {55-64},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBM-qest08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBM-qest08.pdf},
  doi = {10.1109/QEST.2008.19},
  abstract = {In [Baier \emph{et~al.}, \textit{Probabilistic and Topological
    Semantics for Timed Automata}, FSTTCS'07] a probabilistic semantics for
    timed automata has been defined in order to rule out unlikely (sequences
    of) events. The qualitative model-checking problem for LTL properties has
    been investigated, where the aim is to check whether a given LTL property
    holds with probability~\(1\) in a timed automaton, and solved for the class of
    single-clock timed automata.\par
    In this paper, we consider the quantitative model-checking problem for
     \(\omega\)-regular properties: we aim at computing the exact probability
     that a given timed automaton satisfies an \(\omega\)-regular property. We
     develop a framework in which we can compute a closed-form expression for
     this probability; we furthermore give an approximation algorithm, and
     finally prove that we can decide the threshold problem in that
     framework.}
}
@article{BLM-lmcs08,
  journal = {Logical Methods in Computer Science},
  author = {Bouyer, Patricia and Larsen, Kim G. and Markey, Nicolas},
  title = {Model Checking One-clock Priced Timed Automata},
  volume = 4,
  number = {2\string:9},
  nopages = {},
  month = jun,
  year = 2008,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLM-lmcs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLM-lmcs08.pdf},
  doi = {10.2168/LMCS-4(2:9)2008},
  abstract = {We consider the model of priced (a.k.a.~weighted) timed automata, an
    extension of timed automata with cost information on both locations and
    transitions, and we study various model-checking problems for that model
    based on extensions of classical temporal logics with cost constraints on
    modalities. We prove that, under the assumption that the model has only one
    clock, model-checking this class of models against the logic~WCTL, CTL
    with cost-constrained modalities, is PSPACE-complete (while it has been
    shown undecidable as soon as the model has three clocks).
    We~also prove that model checking WMTL (LTL with cost-constrained
    modalities) is decidable only if there is a single clock in the model and a
    single stopwatch cost variable (\textit{i.e.}, whose slopes lie
    in~\(\{0,1\}\)).}
}
@inproceedings{AFFM-wollic08,
  address = {Edinburgh, Scotland, UK},
  month = jul,
  year = 2008,
  volume = 5110,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Hodges, Wilfrid and de Queiroz, Ruy},
  acronym = {{WoLLIC}'08},
  booktitle = {{P}roceedings of the 15th {W}orkshop on {L}ogic, {L}anguage,
 	   {I}nformation and {C}omputation ({WoLLIC}'08)},
  author = {Areces, Carlos and Figueira, Diego and Figueira, Santiago 
		and Mera, Sergio},
  title = {Expressive Power and Decidability for Memory Logics},
  pages = {56-68},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AFFM-wollic08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AFFM-wollic08.pdf},
  doi = {10.1007/978-3-540-69937-8_7},
  abstract = {Taking as inspiration the hybrid
    logic~\(\mathcal{HL}(\downarrow)\), we~introduce a new family of logics
    that we call memory logics. In~this article we~present in detail two
    interesting members of this family defining their formal syntax and
    semantics. We then introduce a proper notion of bisimulation and
    investigate their expressive power (in comparison with modal and hybrid
    logics). We~will prove that in terms of expressive power, the memory
    logics we discuss in this paper are more expressive than orthodox modal
    logic, but less expressive than~\(\mathcal{HL}(\downarrow)\). We~also
    establish the undecidability of their satisfiability problems.}
}
@inproceedings{EF-lix06,
  address = {Palaiseau, France},
  month = apr,
  year = 2008,
  volume = 209,
  series = {Electronic Notes in Theoretical Computer Science},
  publisher = {Elsevier Science Publishers},
  editor = {Palamidessi, Catuscia and Valencia, Franck},
  acronym = {{LIX}'06},
  booktitle = {{P}roceedings of the {LIX} {C}olloquium on {E}merging 
		{T}rends in {C}oncurrency {T}heory
           ({LIX}'06)},
  author = {Encrenaz, Emmanuelle and Fribourg, Laurent},
  title = {Time Separation of Events: An Inverse Method},
  pages = {135-148},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EF-lix06.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EF-lix06.pdf},
  doi = {10.1016/j.entcs.2008.04.008},
  abstract = {The problem of {"}time separation{"} can be stated as follows:
                  Given a system made of several connected components, each
                  one entailing a local delay known with uncertainty, what is
                  the maximum time for traversing the global system? This
                  problem is useful, \textit{e.g.} in the domain of digital circuits,
                  for determining the global traversal time of a signal from
                  the knowledge of bounds on the component propagation delays.
                  The uncertainty on each component delay is given under the
                  form of an interval. The general problem is NP-complete. We
                  focus here on the inverse problem: we seek intervals for
                  component delays for which the global traversal time is
                  guaranteed to be no greater than a specified maximum. We
                  give a polynomial time method to solve it. As a typical
                  application, we show how to use the method in order to relax
                  some specified local delays while preserving the maximum
                  traversal time. This is especially useful, in the area of
                  digital circuits, for optimizing {"}setup{"} timings of input
                  signals (minimum timings required for stability).}
}
@article{LMO-lmcs08,
  journal = {Logical Methods in Computer Science},
  author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas and Oreiby,
                  Ghassan},
  title = {On the Expressiveness and Complexity of~{ATL}},
  volume = {4},
  number = {2\string:7},
  month = may,
  year = 2008,
  nopages = {},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/LMO-lmcs08.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LMO-lmcs08.pdf},
  corrigendumpdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LMO-lmcs08-erratum.pdf},
  doi = {10.2168/LMCS-4(2:7)2008},
  abstract = {ATL is a temporal logic geared towards the specification and
verification of properties in multi-agents systems. It allows to reason on the
existence of strategies for coalitions of agents in order to enforce a given
property. We prove that the standard definition of~ATL (built on modalities
{"}Next{"}, {"}Always{"} and~{"}Until{"}) has to be completed in order to express the
duals of its modalities: it~is necessary to add the modality {"}Release{"}.
We~then precisely characterize the complexity of ATL model-checking when the
number of agents is not fixed. We prove that it is \(\Delta_{2}^{P}\) and
\(\Delta_{3}^{P}\)-complete, depending on the underlying multi-agent model
(ATS and CGS,~resp.). We also prove that~ATL\({}^{+}\) model-checking is
\(\Delta_{3}^{P}\)-complete over both models, even with a fixed number of
agents.}
}
@inproceedings{BJ-ijcar08,
  address = {Sydney, Australia},
  month = aug,
  year = 2008,
  volume = {5195},
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer-Verlag},
  editor = {Armando, Alessandro and Baumgartner, Peter and 
		Dowek, Gilles},
  acronym = {{IJCAR}'08},
  booktitle = {{P}roceedings of the 4th {I}nternational {J}oint
           {C}onference on {A}utomated {R}easoning
           ({IJCAR}'08)},
  author = {Bouhoula, Adel and Jacquemard, Florent},
  title = {Automated Induction with Constrained Tree Automata},
  pages = {539-553},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BJ-ijcar08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BJ-ijcar08.pdf},
  doi = {10.1007/978-3-540-71070-7_44},
  abstract = {We propose a procedure for automated implicit inductive theorem
    proving for equational specifications made of rewrite rules with
    conditions and constraints. The constraints are interpreted over
    constructor terms (representing data values), and may express syntactic
    equality, disequality, ordering and also membership in a fixed tree
    language. Constrained equational axioms between constructor terms are
    supported and can be used in order to specify complex data structures like
    sets, sorted lists, trees, powerlists...\par
    Our procedure is based on tree grammars with constraints, a formalism
    which can describe exactly the initial model of the given specification
    (when it is sufficiently complete and terminating). They are used in the
    inductive proofs first as an induction scheme for the generation of
    subgoals at induction steps, second for checking validity and redundancy
    criteria by reduction to an emptiness problem, and third for defining and
    solving membership constraints.\par
    We show that the procedure is sound and refutationally complete.
    It~generalizes former test set induction techniques and yields natural
    proofs for several non-trivial examples presented in the paper, these
    examples are difficult (if not impossible) to specify and carry on
    automatically with other induction procedures.}
}
@inproceedings{KMT-ijcar08,
  address = {Sydney, Australia},
  month = aug,
  year = 2008,
  volume = {5195},
  series = {Lecture Notes in Artificial Intelligence},
  publisher = {Springer-Verlag},
  editor = {Armando, Alessandro and Baumgartner, Peter and 
		Dowek, Gilles},
  acronym = {{IJCAR}'08},
  booktitle = {{P}roceedings of the 4th {I}nternational {J}oint
           {C}onference on {A}utomated {R}easoning
           ({IJCAR}'08)},
  author = {Kremer, Steve and Mercier, Antoine and Treinen, Ralf},
  title = {Proving Group Protocols Secure Against Eavesdroppers},
  pages = {116-131},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KMT-ijcar08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KMT-ijcar08.pdf},
  doi = {10.1007/978-3-540-71070-7_9},
  abstract = {Security protocols are small programs 
	designed to ensure properties such as secrecy of messages 
	or authentication of parties in a hostile environment. In 
	this paper we investigate automated verification of a 
	particular type of security protocols, called \emph{group 
	protocols}, in the presence of an eavesdropper, i.e., a 
	passive attacker. The specificity of group protocols is 
	that the number of participants is not bounded.\par
	Our approach consists in representing an infinite set of 
	messages exchanged during an unbounded number of sessions, 
	one session for each possible number of participants, as 
	well as the infinite set of associated secrets. We use 
	so-called visibly tree automata with memory and structural 
	constraints (introduced recently by Comon-Lundh 
	\textit{et~al.})  to represent over-approximations of these 
	two sets. We~identify restrictions on the specification of 
	protocols which allow us to reduce the attacker 
	capabilities guaranteeing that the above mentioned class of 
	automata is closed under the application of the remaining 
	attacker rules. The class of protocols respecting these 
	restrictions is large enough to cover several existing 
	protocols, such as the GDH family, GKE, and others.}
}
@inproceedings{BHHKT-wodes08,
  address = {Gothenburg, Sweden},
  month = may,
  year = 2008,
  acronym = {{WODES}'08},
  booktitle = {{P}roceedings of the 9th {W}orkshop on {D}iscrete {E}vent {S}ystems
	   ({WODES}'08)},
  author = {B{\'e}rard, B{\'e}atrice and Haddad, Serge and Hillah, Lom
                  Messan and Kordon, Fabrice and Thierry{-}Mieg, Yann},
  title = {Collision Avoidance in Intelligent Transport Systems: Towards
                  an Application of Control Theory},
  pages = {346-351},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHHKT-wodes08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHHKT-wodes08.pdf},
  doi = {10.1109/WODES.2008.4605970},
  abstract = {Safety is a prevalent issue in Intelligent Transport
    Systems~(ITS). To~ensure such a vital requirement, methodologies must
    offer support for the careful design and analysis of such systems. Indeed
    these steps must cope with temporal and spatial constraints associated
    with mobility rules and parallelism which induce a high complexity. Here
    we handle the problem of unexpected and uncontrollable vehicles which
    significantly endanger the traffic. In~this context, we~propose to apply
    discrete control theory to a model of automatic motorway in order to
    synthesize a controller that handles collision avoidance. This approach
    includes two parts: the design of a formal model and an efficient
    implementation based on hierarchical decision diagrams.}
}
@proceedings{CKR-dagstuhl07,
  editor = {Chen, Liqun and Kremer, Steve and Ryan, Mark D.},
  booktitle = {Formal Protocol Verification Applied},
  title = {Formal Protocol Verification Applied},
  year = 2008,
  address = {Dagstuhl, Germany},
  series = {Dagstuhl Seminar Proceedings},
  volume = {07421},
  url = {http://drops.dagstuhl.de/portals/index.php?semnr=07421}
}
@incollection{HM-mvrts08,
  author = {Haddad, Serge and Moreaux, Patrice},
  title = {Verification of Probabilistic Systems Methods and 
		Tools},
  booktitle = {Modeling and Verification of Real-Time Systems},
  editor = {Merz, Stephan and Navet, Nicolas},
  year = {2008},
  month = jan,
  pages = {289-318},
  publisher = {ISTE Ltd. -- John Wiley \& Sons, Ltd.},
  url = {http://www.lavoisier.fr/notice/fr1848210130.html}
}
@inproceedings{BS-icalp08,
  address = {Reykjavik, Iceland},
  month = jul,
  year = 2008,
  volume = 5126,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Aceto, Luca and Damg{\aa}rd, Ivan and
		Goldberg, Leslie~Ann and Halld{\'o}rsson, Magn{\'u}s M. 
		and Ing{\'o}lfsd{\'o}ttir, Anna and Walukiewicz, Igor},
  acronym = {{ICALP}'08},
  booktitle = {{P}roceedings of the 35th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming ({ICALP}'08)~-- {P}art~{II}},
  author = {Boja{\'n}czyk, Miko{\l}aj and Segoufin, Luc},
  title = {Tree languages defined in first-order logic with one quantifier alternation},
  pages = {233-245},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BS-icalp08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BS-icalp08.pdf},
  doi = {10.1007/978-3-540-70583-3_20},
  abstract = {We study tree languages that can be defined in
                  \(\Delta_{2}\). These are tree languages definable by a
                  first-order formula whose quantifier prefix
                  is~\(\exists^{*}\forall^{*}\), and simultaneously by a
                  first-order formula whose quantifier prefix
                  is~\(\forall^{*}\exists^{*}\), both formulas over the
                  signature with the descendant relation. We~provide an
                  effective characterization of tree languages definable
                  in~\(\Delta_{2}\). This characterization is in terms of
                  algebraic equations. Over words, the class of word languages
                  definable in~\(\Delta_{2}\) forms a robust class, which was
                  given an effective algebraic characterization by Pin and
                  Weil.}
}
@inproceedings{BMOW-icalp08,
  address = {Reykjavik, Iceland},
  month = jul,
  year = 2008,
  volume = 5126,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Aceto, Luca and Damg{\aa}rd, Ivan and
		Goldberg, Leslie~Ann and Halld{\'o}rsson, Magn{\'u}s M. 
		and Ing{\'o}lfsd{\'o}ttir, Anna and Walukiewicz, Igor},
  acronym = {{ICALP}'08},
  booktitle = {{P}roceedings of the 35th {I}nternational 
               {C}olloquium on {A}utomata, {L}anguages and 
               {P}rogramming ({ICALP}'08)~-- {P}art~{II}},
  author = {Bouyer, Patricia and Markey, Nicolas and Ouaknine, Jo{\"e}l
                  and Worrell, James},
  title = {On Expressiveness and Complexity in Real-time Model Checking},
  pages = {124-135},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BMOW-icalp08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BMOW-icalp08.pdf},
  doi = {10.1007/978-3-540-70583-3_11},
  abstract = {Metric Interval Temporal Logic (MITL) is a popular formalism for
    expressing real-time specifications. This logic achieves decidability by
    restricting the precision of timing constraints, in particular, by banning
    so-called \emph{punctual} specifications. In~this paper we~introduce a
    significantly more expressive logic that can express a wide variety of
    punctual specifications, but whose model-checking problem has the same
    complexity as that of~MITL. We~conclude that for model checking the most
    commonly occurring specifications, such as invariance and bounded
    response, punctuality can be accommodated at no cost.}
}
@techreport{LSV:08:10,
  author = {Villard, Jules and Lozes, {\'E}tienne and Treinen, Ralf},
  title = {A Spatial Equational Logic for the Applied pi-calculus},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2008,
  month = mar,
  type = {Research Report},
  number = {LSV-08-10},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-10.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-10.pdf},
  note = {44~pages},
  abstract = {Spatial logics have been proposed to reason locally and
     modularly on algebraic models of distributed systems. In~this paper
     we~investigate a spatial equational logic (A\(\pi\)L) whose models are
     processes of the applied \(\pi\)-calculus, an extension of the
     \(\pi\)-calculus allowing term manipulation modulo a predefined
     equational theory, and wherein communications are recorded as active
     substitutions in a frame. Our logic allows us to reason locally either on
     frames or on processes, thanks to static and dynamic spatial operators.
     We study the logical equivalences induced by various relevant fragments
     of~A\(\pi\)L, and show in particular that the whole logic induces a coarser
     equivalence than structural congruence. We give characteristic formulae
     for this new equivalence as well as for static equivalence on frames.
     Going further into the exploration of A\(\pi\)L's expressivity, we also show
     that it can eliminate standard term quantication, and that the
     model-checking problem for the adjunct-free fragment of A\(\pi\)L can be
     reduced to satisfiability of a purely first-order logic of a term
     algebra.}
}
@inproceedings{JGL:badweeds,
  address = {Budapest, Hungary},
  month = mar,
  year = 2008,
  volume = 5289,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Leucker, Martin},
  acronym = {{RV}'08},
  booktitle = {{P}roceedings of the 8th {W}orkshop on {R}untime {V}erification ({RV}'08)},
  author = {Goubault{-}Larrecq, Jean and Olivain, Julien},
  title = {A Smell of Orchids},
  pages = {1-20},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/go-rv08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/go-rv08.pdf},
  doi = {10.1007/978-3-540-89247-2_1},
  abstract = {Orchids is an intrusion detection tool based on techniques for
    fast, on-line model-checking. Orchids detects complex, correlated strands
    of events with very low overhead in practice, although its detec- tion
    algorithm has worst-case exponential time complexity.\par
    The purpose of this paper is twofold. First, we explain the salient
    features of the basic model-checking algorithm in an intuitive way, as a
    form of dynamically-spawned monitors. One distinctive feature of the
    Orchids algorithm is that fresh monitors need to be spawned at a pos-
    sibly alarming rate.\par
    The second goal of this paper is therefore to explain how we tame the
    complexity of the procedure, using abstract interpretation techniques to
    safely kill useless monitors. This includes monitors which will provably
    detect nothing, but also monitors that are subsumed by others, in the
    sense that they will definitely fail the so-called shortest run criterion.
    We take the opportunity to show how the Orchids algorithm maintains its
    monitors sorted in such a way that the subsumption operation is effected
    with no overhead, and we correct a small, but definitely annoying bug in
    its core algorithm, as it was published in~2001.}
}
@article{BCHLR08-tcs,
  publisher = {Elsevier Science Publishers},
  journal = {Theoretical Computer Science},
  author = {B{\'e}rard, B{\'e}atrice and Cassez, Franck and Haddad,
                  Serge and Lime, Didier and Roux, Olivier H.},
  title = {When are Timed Automata Weakly Timed Bisimilar to Time
                  {P}etri Nets?},
  year = 2008,
  month = sep,
  volume = 403,
  number = {2-3},
  pages = {202-220},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHLR-tcs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHLR-tcs08.pdf},
  doi = {10.1016/j.tcs.2008.03.030},
  abstract = {In this paper, we compare Timed Automata~(TA) and Time Petri
    Nets~(TPN) with respect to weak timed bisimilarity. It~is already known
    that the class of bounded TPNs is strictly included in the class of~TA.
    It~is thus natural to try and identify the
    subclass~\(\mathcal{TA}^{\textit{wtb}}\) of~TA equivalent to some TPN for
    the weak timed bisimulation relation. We~give a characterization of this
    subclass and we show that the membership problem and the reachability
    problem for \(\mathcal{TA}^{\textit{wtb}}\) are PSPACE-complete.
    Furthermore we show that for a TA in~\(\mathcal{TA}^{\textit{wtb}}\) with
    integer constants, an~equivalent TPN can be built with integer bounds but
    with a size exponential w.r.t.~the original model. Surprisingly, using
    rational bounds yields a TPN whose size is linear.}
}
@inproceedings{JGL-csf08,
  address = {Pittsburgh, Pennsylvania, USA},
  month = jun,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{CSF}'08},
  booktitle = {{P}roceedings of the 
               21st {IEEE} {C}omputer {S}ecurity {F}oundations
               {S}ymposium ({CSF}'08)},
  author = {Goubault{-}Larrecq, Jean},
  title = {Towards Producing Formally Checkable Security Proofs, Automatically},
  pages = {224-238},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-15.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-15.pdf},
  doi = {10.1109/CSF.2008.21},
  abstract = {First-order logic models of security for cryptographic protocols,
    based on variants of the Dolev-Yao model, are now well-established
    tools.  Given that we have checked a given security protocol~\(\pi\)
    using a given first-order prover, how hard is it to extract a
    formally checkable proof of~it, as~required in, e.g., common
    criteria at evaluation level~\(7\)?  We~demonstrate that this is
    surprisingly hard: the problem is non-recursive in general. 
    On~the practical side, we show how we can extract finite models~\(\mathcal{M}\)
    from a set~\(\mathcal{S}\) of clauses representing~\(\pi\),
    automatically, in two ways.  We~then define a model-checker
    testing \(\mathcal{M} \models \mathcal{S}\), and show how we can instrument it
    to output a formally checkable proof, e.g., in~Coq.  This was
    implemented in the \texttt{h1} tool suite.  Experience on a number of
    protocols shows that this is practical.}
}
@inproceedings{DKR-csf08,
  address = {Pittsburgh, Pennsylvania, USA},
  month = jun,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{CSF}'08},
  booktitle = {{P}roceedings of the 
               21st {IEEE} {C}omputer {S}ecurity {F}oundations
               {S}ymposium ({CSF}'08)},
  author = {Delaune, St{\'e}phanie and Kremer, Steve and
		  Ryan, Mark D.},
  title = {Composition of Password-based Protocols},
  pages = {239-251},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-csf08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-csf08.pdf},
  doi = {10.1109/CSF.2008.6},
  abstract = {We investigate the composition of protocols that share a common
  secret.  This situation arises when users employ the same password
  on different services.  More precisely we study whether resistance
  against guessing attacks composes when the same password is used.
  We model guessing attacks using a common definition based on static
  equivalence in a cryptographic process calculus close to the applied
  pi calculus. We show that resistance against guessing attacks
  composes in the presence of a passive attacker. However, composition
  does not preserve resistance against guessing attacks for an active
  attacker. We therefore propose a simple syntactic criterion under
  which we show this composition to hold. Finally, we present a
  protocol transformation that ensures this syntactic criterion and
  preserves resistance against guessing attacks.}
}
@inproceedings{DKS-csf08,
  address = {Pittsburgh, Pennsylvania, USA},
  month = jun,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{CSF}'08},
  booktitle = {{P}roceedings of the 
               21st {IEEE} {C}omputer {S}ecurity {F}oundations
               {S}ymposium ({CSF}'08)},
  author = {Delaune, St{\'e}phanie and Kremer, Steve and
		  Steel, Graham},
  title = {Formal Analysis of {PKCS}\#11},
  pages = {331-344},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKS-csf08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKS-csf08.pdf},
  doi = {10.1109/CSF.2008.16},
  abstract = {PKCS\#11 defines an API for cryptographic devices that has 
    been widely adopted in industry. However, it~has been shown to be 
    vulnerable to a variety of attacks that could, for example, compromise 
    the sensitive keys stored on the device. In~this paper, we~set out a 
    formal model of the operation of the API, which differs from previous 
    security API models notably in that it accounts for non-monotonic 
    mutable global state. We~give decidability results for our formalism, 
    and describe an implementation of the resulting decision procedure 
    using a model checker. We~report some new attacks and prove the safety 
    of some configurations of the API in our model.}
}
@techreport{LSV:08:08,
  author = {Finkel, Alain and Leroux, J{\'e}r{\^o}me},
  title = {Presburger Functions are Piecewise Linear},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2008,
  month = mar,
  type = {Research Report},
  number = {LSV-08-08},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-08.pdf},
  note = {9~pages},
  abstract = {In this paper we geometrically characterize sets and functions
    definable in the first order additive theory of the reals and the
    integers, a decidable extension of the Presburger arithmetic combining
    both integral and real variables. We introduce the notion of polinear
    sets, an extension of the linear sets that characterizes these sets and we
    prove that a function is definable in this logic if and only if it is
    piecewise rational linear.}
}
@inproceedings{BSS-lics08,
  address = {Pittsburgh, Pennsylvania, USA},
  month = jun,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'08},
  booktitle = {{P}roceedings of the 23rd
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'08)},
  author = {Boja{\'n}czyk, Miko{\l}aj and Segoufin, Luc and Straubing, Howard},
  title = {Piecewise Testable Tree Languages},
  pages = {442-451},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BSS-lics08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BSS-lics08.pdf},
  doi = {10.1109/LICS.2008.46},
  abstract = {This paper presents a decidable characterization of tree
    languages that can be defined by a boolean combination of \(\Sigma_{1}\)
    formulas. This is a tree extension of the Simon theorem, which says that a
    string language can be defined by a boolean combination of \(\Sigma_{1}\)
    formulas if and only if its syntactic monoid is \(J\)-trivial. }
}
@inproceedings{CS-lics08,
  address = {Pittsburgh, Pennsylvania, USA},
  month = jun,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'08},
  booktitle = {{P}roceedings of the 23rd
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'08)},
  author = {Chambart, Pierre and Schnoebelen, {\relax Ph}ilippe},
  title = {The Ordinal Recursive Complexity of Lossy Channel Systems},
  pages = {205-216},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CS-lics08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CS-lics08.pdf},
  doi = {10.1109/LICS.2008.47},
  abstract = {We show that reachability and termination for lossy channel
        systems is exactly at level \(\mathcal{F}_{\omega^{\omega}}\) in the
        Fast-Growing Hierarchy of recursive functions, the first level that
        dominates all multiply-recursive functions.}
}
@inproceedings{BBBBG-lics08,
  address = {Pittsburgh, Pennsylvania, USA},
  month = jun,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  acronym = {{LICS}'08},
  booktitle = {{P}roceedings of the 23rd
               {A}nnual {IEEE} {S}ymposium on
               {L}ogic in {C}omputer {S}cience
               ({LICS}'08)},
  author = {Baier, Christel and Bertrand, Nathalie and Bouyer,
  	      Patricia and Brihaye, {\relax Th}omas and Gr{\"o}{\ss}er, Marcus},
  title = {Almost-Sure Model Checking of Infinite Paths in One-Clock
        Timed Automata},
  pages = {217-226},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBBG-lics08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBBG-lics08.pdf},
  doi = {10.1109/LICS.2008.25},
  abstract = { In this paper, we~define two relaxed semantics (one based
    on probabilities and the other one based on the topological notion of
    largeness) for LTL over infinite runs of timed automata which rule out
    unlikely sequences of events. We~prove that these two semantics match in
    the framework of single-clock timed automata (and~only in that framework),
    and prove that the corresponding relaxed model-checking problems are
    PSPACE-Complete. Moreover, we~prove that the probabilistic non-Zenoness
    can be decided for single-clock timed automata in NLOGSPACE.}
}
@inproceedings{DKS-TFIT2008,
  address = {Taipei, Taiwan},
  month = mar,
  year = 2008,
  editor = {Kuo, Tei-Wei and Cruz-Lara, Samuel},
  acronym = {{TFIT}'08},
  booktitle = {{P}roceedings of the 4th {T}aiwanese-{F}rench
	   {C}onference on {I}nformation {T}echnology ({TFIT}'08)},
  author = {Delaune, St{\'e}phanie and Kremer, Steve and
                 Steel, Graham},
  title = {Formal Analysis of {PKCS}\#11},
  pages = {267-278},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKS-tfit08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKS-tfit08.pdf},
  abstract = {PKCS\#11 defines an API for cryptographic devices that has been
    widely adopted in industry. However, it~has been shown to be vulnerable to
    a variety of attacks that could, for~example, compromise the sensitive
    keys stored on the device. In~this paper, we~set out a formal model of the
    operation of the API, which differs from previous security API models
    notably in that it accounts for non-monotonic mutable global state. We
    give decidability results for our formalism, and describe an
    implementation of the resulting decision procedure using a model checker.
    We report some new attacks and prove the safety of some configurations of
    the API in our model.}
}
@inproceedings{poti-TFIT2008,
  address = {Taipei, Taiwan},
  month = mar,
  year = 2008,
  editor = {Kuo, Tei-Wei and Cruz-Lara, Samuel},
  acronym = {{TFIT}'08},
  booktitle = {{P}roceedings of the 4th {T}aiwanese-{F}rench
	   {C}onference on {I}nformation {T}echnology ({TFIT}'08)},
  author = {Bouyer, Patricia},
  title = {Model-Checking Timed Temporal Logics},
  pages = {132-142},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bouyer-tfit08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bouyer-tfit08.pdf},
  abstract = {In this paper, we~present several timed extensions of
temporal logics, that can be used for model-checking real-time
systems. We~give different formalisms and the corresponding
decidability\slash complexity results. We also give intuition
to explain these results.}
}
@inproceedings{DRS-ifiptm08,
  address = {Trondheim, Norway},
  month = jun,
  year = 2008,
  volume = 263,
  series = {IFIP Conference Proceedings},
  publisher = {Springer},
  editor = {Karabulut, Yuecel and Mitchell, John and Herrmann, Peter and 
  		Jensen, Christian Damsgaard},
  acronym = {IFIPTM'08},
  booktitle = {{P}roceedings of the 2nd {J}oint i{T}rust and {PST}
                  {C}onferences on {P}rivacy, {T}rust {M}anagement and
                  {S}ecurity (IFIPTM'08)},
  author = {Delaune, St{\'e}phanie and Ryan, Mark D. and Smyth, Ben},
  title = {Automatic verification of privacy properties in the applied pi-calculus},
  pages = {263-278},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DRS-ifiptm08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DRS-ifiptm08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/DRS-ifiptm08.ps},
  abstract = {We develop a formal method verification technique for
    cryptographic protocols. We~focus on proving observational equivalences of
    the kind \(P \sim Q\), where the processes \(P\) and~\(Q\) have the same
    structure and differ only in the choice of terms. The calculus of
    ProVerif, a variant of the applied pi-calculus, makes some progress in
    this direction. We~expand the scope of ProVerif, to provide reasoning
    about further equivalences. We~also provide an extension which allows
    modelling of protocols which require global synchronisation. Finally we
    develop an algorithm to enable automated reasoning.\par
    We demonstrate the practicality of our work with two case studies.}
}
@inproceedings{BFL-time08,
  address = {Montr{\'e}al, Canada},
  month = jun,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  noeditor = {Demri, St{\'e}phane and Jensen, {\relax Ch}ristian S.},
  acronym = {{TIME}'08},
  booktitle = {{P}roceedings of the 15th {I}nternational {S}ymposium on 
	       {T}emporal {R}epresentation and {R}easoning
	       ({TIME}'08)},
  author = {Bouchy, Florent and Finkel, Alain and Leroux, J{\'e}r{\^o}me},
  title = {Decomposition of Decidable First-Order Logics over Integers
                  and Reals},
  pages = {147-155},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFL-time08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFL-time08.pdf},
  doi = {10.1109/TIME.2008.22},
  abstract = {We tackle the issue of representing infinite sets of realvalued
                  vectors. This paper introduces an operator for combining
                  integer and real sets. Using this operator, we~decompose
                  three well-known logics extending Presburger with reals. Our
                  decomposition splits the logic into two parts: one~integer,
                  and one decimal (\textit{i.e.},~on the interval~\([0,1[\)).
                  We~also give some basis for an implementation of our
                  representation.}
}
@inproceedings{Bur-wistp08,
  address = {Sevilla, Spain},
  month = may,
  year = 2008,
  volume = 5019,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Onieva, Jose A. and Sauveron, Damien and
		Chaumette, Serge  and Gollmann, Dieter and
		Markantonakis, Konstantinos},
  acronym = {{WISTP}'08},
  booktitle = {{P}roceedings of the 
           2nd {I}nternational {W}orkshop 
	   on {I}nformation {S}ecurity {T}heory and {P}ractices
           ({WISTP}'08)},
  author = {Bursztein, Elie},
  title = {Probabilistic Protocol Identification for Hard to Classify Protocol},
  pages = {49-63},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bur-wistp08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Bur-wistp08.pdf},
  doi = {10.1007/978-3-540-79966-5_4},
  note = {Best paper award},
  abstract = {With the  growing  use  of  protocols obfuscation  techniques,
    protocol  identification for Q.O.S  enforcement, traffic  prohibition, and
    intrusion detection  has became  a complex task.  This paper  address this
    issue with a probabilistic identification analysis that combines multiples
    advanced identification techniques and returns an ordered list of probable
    protocols.  It~combines a  payload  analysis with  a  classifier based  on
    several discriminators,  including packet  entropy and size.  We~show with
    its  implementation,  that it  overcomes  the  limitations of  traditional
    port-based  protocol identification  when  dealing with  hard to  classify
    protocol such as peer to peer protocols. We also details how it deals with
    tunneled session and covert channel.}
}
@inproceedings{BGMR-time08,
  address = {Montr{\'e}al, Canada},
  month = jun,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  noeditor = {Demri, St{\'e}phane and Jensen, {\relax Ch}ristian S.},
  acronym = {{TIME}'08},
  booktitle = {{P}roceedings of the 15th {I}nternational {S}ymposium on 
	       {T}emporal {R}epresentation and {R}easoning
	       ({TIME}'08)},
  author = {Brihaye, {\relax Th}omas and Ghannem, Mohamed and Markey,
                  Nicolas and Rieg, Lionel},
  title = {Good friends are hard to find!},
  pages = {32-40},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGMR-time08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGMR-time08.pdf},
  doi = {10.1109/TIME.2008.10},
  abstract = {We focus on the problem of finding (the~size of) a~minimal
    winning coalition in a multi-player game. More precisely, we~prove that
    deciding whether there is a winning coalition of size at most~\(k\) is
    NP-complete, while deciding whether \(k\) is the optimal size is
    DP-complete. We~also study different variants of our original problem: the
    function problem, where the aim is to effectively compute the coalition;
    more succinct encoding of the game; and richer families of winning
    objectives.}
}
@article{DGK-ijfcs08,
  publisher = {World Scientific},
  journal = {International Journal of Foundations of Computer Science},
  author = {Diekert, Volker and Gastin, Paul and Kufleitner, 
		 Manfred},
  title = {A Survey on Small Fragments of First-Order Logic over 
		 Finite Words},
  volume = 19,
  number = 3,
  pages = {513-548},
  year = 2008,
  month = jun,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DGK-ijfcs08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DGK-ijfcs08.pdf},
  doi = {10.1142/S0129054108005802},
  abstract = {We consider fragments of first-order logic over finite
	words. In~particular, we~deal with 
	first-order logic with a restricted number of 
	variables and with the lower levels of the 
	alternation hierarchy. We~use the algebraic 
	approach to show decidability of 
	expressibility within these fragments. As~a 
	byproduct, we~survey several characterizations 
	of the respective fragments.  We~give complete 
	proofs for all characterizations and we 
	provide all necessary background.  Some of the 
	proofs seem to be new and simpler than those 
	which can be found elsewhere. We also give a 
	proof of Simon's theorem on factorization 
	forests restricted to aperiodic monoids 
	because this is simpler and sufficient for our 
	purpose.}
}
@techreport{LSV:08:02,
  author = {Bursztein, Elie},
  title = {Network Administrator and Intruder Strategies},
  institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  year = 2008,
  month = feb,
  type = {Research Report},
  number = {LSV-08-02},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-02.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-02.pdf},
  note = {23~pages},
  abstract = {The anticipation game framework is an 
	extension of attack graphs based on game theory. It 
	is used to anticipate and analyze intruder and 
	administrator interactions with the network. In this 
	paper we extend this framework with cost and reward 
	in order to analyze and find player strategies. 
	Additionally this extension allows to take into 
	account the financial aspect of network security in 
	the analysis. Intuitively a strategy is the best 
	succession of actions that the administrator or the 
	intruder can perform to achieve his objectives. 
	Player objectives range from patching the network 
	efficiently to compromising the most valuable 
	network assets. We prove that finding the optimal 
	strategy is decidable and only requires a linear 
	memory space. Finally we show that finding strategy 
	can be done in practice by evaluating the 
	performance of our analyzer called NetQi.}
}
@article{BFLP-sttt08,
  publisher = {Springer},
  journal = {International Journal on Software Tools 
             for Technology Transfer},
  author = {Bardin, S{\'e}bastien and Finkel, Alain and 
	  Leroux, J{\'e}r{\^o}me and Petrucci, Laure},
  title = {{FAST}: Acceleration from theory to practice},
  year = 2008,
  month = oct,
  volume = 10,
  number = 5,
  pages = {401-424},
  url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-16.pdf},
  doi = {10.1007/s10009-008-0064-3},
  abstract = {Fast acceleration of symbolic transition 
    systems~(\textsc{Fast}) is a tool for the
    analysis of systems manipulating unbounded integer variables. We~check
    safety properties by
    computing the reachability set of the system under study. Even if this
    reachability set is not
    necessarily recursive, we~use innovative techniques, namely symbolic
    representation, acceleration and circuit selection, to~increase
    convergence. \textsc{Fast} has proved to perform very well on case
    studies. This~paper describes the tool, from the underlying theory to
    the architecture choices. Finally, \textsc{Fast} capabilities are
    compared with those of other tools. A~range of case studies from the
    literature is investigated.}
}
@misc{hcl:lecture07,
  author = {Comon{-}Lundh, Hubert},
  title = {Soundness of abstract cryptography},
  oldhowpublished = {Lecture notes, part 1. 
         Available at \url{http://staff.aist.go.jp/h.comon-lundh/}},
  year = {2007},
  note = {Course notes (part~1), Symposium on Cryptography and
                  Information Security (SCIS2008), Tokai, Japan},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CL-sac08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CL-sac08.pdf}
}
@misc{bouyer-cortos06,
  author = {Bouyer, Patricia},
  title = {Weighted Timed Automata: Model-Checking and Games},
  year = {2005},
  month = aug,
  howpublished = {Invited talk, Workshop CORTOS'06, Bonn, Germany}
}
@misc{bouyer-avocs05,
  author = {Bouyer, Patricia},
  title = {Optimal Timed Games},
  year = {2005},
  month = sep,
  howpublished = {Invited talk,  5th {I}nternational {W}orkshop
                  on {A}utomated {V}erification of {C}ritical {S}ystems
                  ({AVoCS}'05), Warwick, UK}
}
@misc{bouyer-infinity05,
  author = {Bouyer, Patricia},
  title = {Optimal Reachability Timed Games},
  year = {2005},
  month = aug,
  howpublished = {Invited talk, 7th {I}nternational {W}orkshop
                  on {V}erification of {I}nfinite {S}tate {S}ystems
                  ({INFINITY}'05), San Francisco, USA}
}
@misc{bouyer-fac04,
  author = {Bouyer, Patricia},
  title = {Automates temporis{\'e}s, de la th{\'e}orie {\`a} l'impl{\'e}mentation},
  year = {2004},
  month = mar,
  howpublished = {Invited talk,  Journ\'ees Formalisation des Activit?s
   Concurrentes (FAC'04), Toulouse, France}
}
@inproceedings{bouyer-etr05,
  address = {Nancy, France},
  month = sep,
  year = 2005,
  noeditor = {},
  acronym = {{ETR}'05},
  booktitle = {{A}ctes de la 4{\`e}me {\'E}cole {T}emps-{R}{\'e}el ({ETR}'05)},
  author = {Bouyer, Patricia},
  title = {An Introduction to Timed Automata},
  pages = {111-123},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bouyer-etr05.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bouyer-etr05.pdf}
}
@inproceedings{bouyer-artist2-05,
  author = {Bouyer, Patricia},
  title = {Foundations of Timed Systems},
  booktitle = {Proc. of the ARTIST2 Summer School on Component \&
   Modelling, Testing \& Verification, and Statical Analysis of Embedded
   Systems},
  address = {N{\"a}sslingen, Sweden},
  month = sep # {-} # oct,
  year = {2005},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bouyer-nasslingen.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bouyer-nasslingen.pdf}
}
@incollection{BL-litron08,
  author = {Bouyer, Patricia and Laroussinie, Fran{\c{c}}ois},
  title = {Model Checking Timed Automata},
  booktitle = {Modeling and Verification of Real-Time Systems},
  editor = {Merz, Stephan and Navet, Nicolas},
  year = {2008},
  month = jan,
  pages = {111-140},
  publisher = {ISTE Ltd. -- John Wiley \& Sons, Ltd.},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BL-litron08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BL-litron08.pdf}
}
@misc{Demri0506,
  author = {Demri, St{\'e}phane},
  title = {Temporal logics},
  year = {2005},
  note = {Course notes, {M}aster {P}arisien de {R}echerche en 
	{I}nformatique, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Demri-2.8-TL.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Demri-2.8-TL.pdf}
}
@misc{Demri0304,
  author = {Demri, St{\'e}phane},
  title = {Complexit{\'e} algorithmique de variantes de {LTL} pour la v{\'e}rification},
  year = {2004},
  note = {Course notes, {DEA} Algorithmique, Paris, France},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Demri-coursLTL.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Demri-coursLTL.pdf}
}
@article{PPSLBCH-commag08,
  publisher = {{IEEE} Communications Society},
  journal = {IEEE Communications Magazine},
  author = {Papadimitratos, Panos and Poturalski, Marcin and Schaller,
                  Patrick and Lafourcade, Pascal and Basin, David and
		  {\v{C}}apkun, Srdjan and Hubaux, Jean-Pierre},
  title = {Secure Neighborhood Discovery: A~Fundamental
		 Element for Mobile Ad Hoc Networking},
  year = 2008,
  month = feb,
  volume = 46,
  number = 2,
  pages = {132-139},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PPSLBCH-commag08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PPSLBCH-commag08.pdf},
  doi = {10.1109/MCOM.2008.4473095},
  abstract = {Pervasive computing systems will likely be deployed in the near
    future, with the proliferation of wireless devices and the emergence of ad
    hoc networking as key enablers. Coping with mobility and the volatility of
    wireless communications in such systems is critical. Neighborhood
    Discovery~(ND), namely, the discovery of devices directly reachable for
    communication or in physical proximity, becomes a fundamental requirement
    and a building block for various applications. However, the very nature of
    wireless mobile networks makes it easy to abuse ND and thereby compromise
    the overlying protocols and applications. Thus, providing methods to
    mitigate this vulnerability and to secure ND is crucial. In~this article,
    we~focus on this problem and provide definitions of neighborhood types and
    ND protocol properties, as well as a broad classification of attacks. Our
    ND literature survey reveals that securing ND is indeed a difficult and
    largely open problem. Moreover, given the severity of the problem, we
    advocate the need to formally model neighborhood and to analyze ND
    schemes.}
}
@misc{NB-SuMo-2006,
  author = {Bertrand, Nathalie},
  title = {SuMo~-- Reachability analysis for lossy channels},
  month = feb,
  year = {2006},
  note = {See~\cite{BBS-forte06} for a description. Written in~OCaml (3000~lines)},
  note-fr = {Voir la description dans~\cite{BBS-forte06}. {\'E}crit
                  en~OCaml (3000~lignes)}
}
@article{BK-IC08,
  publisher = {Elsevier Science Publishers},
  journal = {Information and Computation},
  author = {Bollig, Benedikt and Kuske, Dietrich},
  title = {{M}uller Message-Passing Automata and Logics},
  volume = 206,
  number = {9-10},
  pages = {1084-1094},
  year = 2008,
  month = sep # {-} # oct,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BK-IC08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BK-IC08.pdf},
  ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BK-IC08.ps},
  doi = {10.1016/j.ic.2008.03.010},
  abstract = {We study nonterminating message-passing automata whose behavior
  is described by infinite message sequence charts. As~a first result, we~show
  that Muller, B{\"u}chi, and termination-detecting Muller acceptance are
  equivalent for these devices. To~describe the expressive power of these
  automata, we give a logical characterization. More precisely, we~show that
  they have the same expressive power as the existential fragment of a monadic
  second-order logic featuring a first-order quantifier to express that there
  are infinitely many elements satisfying some property. This result is based
  on Vinner's extension of the classical Ehrenfeucht-Fra{\"\i}ss{\'e} game to
  cope with the infinity quantifier.}
}
@unpublished{JLC-rc,
  author = {Carr{\'e}, Jean-Loup},
  title = {R{\'e}{\'e}criture, confluence},
  year = {2007},
  month = dec,
  note = {Course notes, {P}r{\'e}paration {\`a} l'agr{\'e}gation, 
	 ENS Cachan, France}
}
@misc{averiles07-f1.6,
  author = {Ourghanlian, Alain and Bozga, Marius and Roglewicz, Adam and
                  Sangnier, Arnaud},
  title = {Projet {RNTL} {A}veriles~-- Fourniture F1.6~: Exp{\'e}rimentation},
  year = 2007,
  month = sep,
  type = {Contract Report},
  note = {16~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-f16.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-f16.pdf}
}
@misc{averiles07-f1.4,
  author = {LIAFA and LSV and Verimag},
  title = {Projet {RNTL} {A}veriles~-- Fourniture F1.4~: Prototypes d'outil},
  year = 2007,
  month = sep,
  type = {Contract Report},
  note = {3~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-f14.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-f14.pdf}
}
@misc{averiles07-f1.3,
  author = {LIAFA and {CRIL Technology} and {EDF R\&D} and LSV and Verimag},
  title = {Projet {RNTL} {A}veriles~-- Fourniture F1.3~: Algorithmes de v{\'e}rification},
  year = 2007,
  month = sep,
  type = {Contract Report},
  note = {19~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-f13.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-f13.pdf}
}
@misc{averiles07-f1.2,
  author = {LIAFA and {CRIL Technology} and {EDF R\&D} and LSV and Verimag},
  title = {Projet {RNTL} {A}veriles~-- Fourniture F1.2~: Extraction de mod{\`e}les},
  year = 2007,
  month = sep,
  type = {Contract Report},
  note = {19~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-f12.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-f12.pdf}
}
@misc{averiles07-f1.1,
  author = {LIAFA and {CRIL Technology} and {EDF R\&D} and LSV and Verimag},
  title = {Projet {RNTL} {A}veriles~-- Fourniture F1.1~: Mod{\`e}les},
  year = 2007,
  month = sep,
  type = {Contract Report},
  note = {6~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-f11.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-f11.pdf}
}
@misc{averiles07,
  author = {LIAFA and {CRIL Technology} and {EDF R\&D} and LSV and Verimag},
  title = {Rapport {\`a} mi-parcours du projet {RNTL} {A}veriles (analyse et
                  v{\'e}rification de logiciels embarqu{\'e}s avec structures
                  de m{\'e}moire dynamique},
  year = 2007,
  month = sep,
  type = {Contract Report},
  note = {4~pages},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-MP.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/averiles-MP.pdf}
}
@unpublished{PG-algo,
  author = {Gastin, Paul},
  title = {Algorithmique},
  year = {2007},
  month = nov,
  note = {Course notes, {M}agist{\`e}re STIC, ENS Cachan, France}
}
@unpublished{PG-languages,
  author = {Gastin, Paul},
  title = {Langages formels},
  year = {2007},
  month = may,
  note = {Course notes, {M}agist{\`e}re STIC, ENS Cachan, France}
}
@misc{ltl2ba-v1.1,
  author = {Gastin, Paul and Oddoux, Denis},
  title = {LTL2BA~v1.1},
  year = {2007},
  month = aug,
  nohowpublished = {Available at http://www.lsv.ens-cachan.fr/~gastin/ltl2ba/},
  note = {Written in~C++ (about 4000 lines)},
  note-fr = {\'Ecrit en~C++ (environ 4000 lignes)},
  url = {http://www.lsv.ens-cachan.fr/~gastin/ltl2ba/}
}
@misc{gastex-v2.8,
  author = {Gastin, Paul},
  title = {Gas{{\TeX}}: Graphs and Automata Simplified in~{{\TeX}} (v2.8)},
  year = {2006},
  month = nov,
  nohowpublished = {Available at http://www.lsv.ens-cachan.fr/~gastin/gastex/gastex.html},
  note = {Written in~\TeX (about 2000 lines)},
  note-fr = {\'Ecrit en~\TeX (environ 2000 lignes)},
  url = {http://www.lsv.ens-cachan.fr/~gastin/gastex/gastex.html}
}
@misc{pronobis-final,
  author = {ARC ProNoBis},
  title = {ProNoBis: Probability and Nondeterminism, Bisimulations and
                  Security~-- {R}apport Final},
  year = 2007,
  month = oct,
  type = {Contract Report},
  nonote = {78~slides},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/SLIDES/pronobis-final.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/SLIDES/pronobis-final.pdf}
}
@misc{netanalyser-v0.7.5,
  author = {Bursztein, Elie},
  title = {NetAnalyzer~v0.7.5},
  year = {2008},
  month = jan,
  nohowpublished = {Available at .... },
  note = {Written in~C and Perl (about 25000 lines)},
  note-fr = {\'Ecrit en~C et en Perl (environ 25000 lignes)}
}
@misc{netqi-v1,
  author = {Bursztein, Elie},
  title = {NetQi~v1rc1},
  year = {2007},
  month = dec,
  howpublished = {Available at \url{http://www.netqi.org/}},
  note = {Written in~C and Java (about 10000 lines)},
  note-fr = {\'Ecrit en~C et en Java (environ 10000 lignes)},
  url = {http://www.netqi.org}
}
@incollection{DiGa08Thomas,
  author = {Diekert, Volker and Gastin, Paul},
  title = {First-order definable languages},
  booktitle = {Logic and Automata: History and Perspectives},
  editor = {Flum, J{\"o}rg and Gr{\"a}del, Erich and Wilke, Thomas},
  publisher = {Amsterdam University Press},
  series = {Texts in Logic and Games},
  volume = 2,
  year = 2008,
  pages = {261-306},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-WT08.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-WT08.pdf},
  abstract = {We give an essentially self-contained presentation of some principal
    results for first-order definable languages over finite and infinite
    words.  We~introduce the notion of a \emph{counter-free} B{\"u}chi
    automaton; and we relate counter-freeness to \emph{aperiodicity}
    and to the notion of \emph{very weak alternation}.
    We also show that aperiodicity of a regular
    \(\infty\)-language can be decided in polynomial
    space, if the language is specified by some B{\"u}chi automaton.}
}
@proceedings{AGHMR-sasyft04,
  title = {Selected papers of the International Workshop on 
	   Security Analysis of Systems: Formalisms and Tools
           ({SASYFT}'04)},
  booktitle = {Selected papers of the International Workshop on 
	   Security Analysis of Systems: Formalisms and Tools
           ({SASYFT}'04)},
  editor = {Anantharaman, Siva and Gastin, Paul and Hains, Ga{\'e}tan and
           Mullins, John and Rusinowitch, Micha{\"e}l},
  year = 2006,
  address = {Orl{\'e}ans, France},
  journal = {jalc},
  volume = 11,
  number = 1
}
@mastersthesis{bouchy-master,
  author = {Bouchy, Florent},
  title = {Biblioth{\`e}que de m{\'e}thodes pour la 
            classification},
  school = {{M}aster {R}echerche 
	{I}nformatique, Tours, France},
  type = {Rapport de {M}aster},
  year = 2005,
  month = sep
}
@inproceedings{HMY-csndsp08,
  address = {Graz, Austria},
  month = jul,
  year = 2008,
  publisher = {{IEEE} Computer Society Press},
  noeditor = {},
  acronym = {{CSNDSP}'08},
  booktitle = {{P}roceedings of the 6th {S}ymposium on {C}ommunication {S}ystems,
                  {N}etworks and {D}igital {S}ignal {P}rocessing
		  ({CSNDSP}'08)},
  author = {Haddad, Serge and Mokdad, Lynda and Youcef, Samir},
  title = {Response Time Analysis of Composite Web Services},
  pages = {506-510},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/HMY-csndsp08.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HMY-csndsp08.pdf},
  abstract = {Service Oriented Computing (SOC) strives for applications with
    services as the fundamental items of design, and Web services acting as
    the enabling technology. Web services use open XML-based standards and are
    becoming the most important technology for communication between
    heterogenous business applications over Internet. In this paper, we focus
    on mean response times. Thus we propose analytical formulas for mean
    response times for structured BPEL constructors such as sequence, flow and
    switch. We propose also a response time formula for multi-choice pattern
    which is a generalization of switch constructor. Contrarily to previous
    studies in the literature, we consider that the servers can be
    heterogenous and the number of invoked elementary Web services can be
    variable.}
}
@article{AP-ieeedeb09,
  publisher = {{IEEE} Computer Society Press},
  journal = {IEEE Data Engineering Bulletin},
  author = {Abiteboul, Serge and Polyzotis, Neoklis},
  title = {Searching Shared Content in Communities with the Data Ring},
  volume = 32,
  number = 2,
  pages = {44-51},
  year = 2009,
  month = jun,
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/AP-ieeedeb09.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AP-ieeedeb09.pdf},
  doi = {},
  abstract = {Information ubiquity has created a large crowd of users (most
    notably scientists), who could employ DBMS technology to share and search
    their data more effectively. Still, this user base prefers to keep its
    data in files that can be easily managed by applications such as
    spreadsheets, rather than deal with the complexity and rigidity of modern
    database systems.\par
    In this article, we describe a vision for enabling non-experts, such as
    scientists, to build content sharing communities in a true database
    fashion: declaratively. The proposed infrastructure, called the data ring,
    enables users to share and search their data with minimal effort; the user
    points to the data that should be shared, and the data ring becomes
    responsible for automatically indexing the data (to make it accessible),
    replicating it (for availability), and reorganizing its physical storage
    (for better query performance). We outline the salient features of our
    proposal, and outline recent technical advancements in realizing data
    rings.}
}
@article{ASV-ieeedeb09,
  publisher = {{IEEE} Computer Society Press},
  journal = {IEEE Data Engineering Bulletin},
  author = {Abiteboul, Serge and Segoufin, Luc and Vianu, Victor},
  title = {Modeling and Verifying Active {XML} Artifacts},
  volume = 32,
  number = 3,
  pages = {10-15},
  year = 2009,
  month = sep,
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/ASV-ieeedeb09.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ASV-ieeedeb09.pdf},
  doi = {}
}
@article{AKSS-jvldb09,
  publisher = {ACM Press},
  journal = {The VLDB Journal},
  author = {Abiteboul, Serge and Kimelfeld, Benny and Sagiv, Yehoshua and
  	  	 Senellart, Pierre},
  title = {On the expressiveness of probabilistic {XML} models},
  volume = 18,
  number = 5,
  pages = {1041-1064},
  year = 2009,
  month = oct,
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/AKSS-jvldb09.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AKSS-jvldb09.pdf},
  doi = {10.1007/s00778-009-0146-1},
  abstract = {Various known models of probabilistic XML can be
    represented as instantiations of the abstract notion of
    \emph{p-documents}. In addition to ordinary nodes, p-documents have
    \emph{distributional} nodes that specify the possible worlds and their
    probabilistic distribution. Particular families of p-documents are
    determined by the types of distributional nodes that can be used as well
    as by the structural constraints on the placement of those nodes in a
    p-document. Some of the resulting families provide natural extensions and
    combinations of previously studied probabilistic XML models. The focus of
    the paper is on the expressive power of families of p-documents. In
    particular, two main issues are studied. The first is the ability to
    (efficiently) \emph{translate} a given p-document of one family into
    another family. The second is \emph{closure under updates}, namely, the
    ability to (efficiently) represent the result of updating the instances of
    a p-document of a given family as another p-document of that family. For
    both issues, we distinguish two variants corresponding to
    \emph{value-based} and \emph{object-based} semantics of p-documents.}
}
@inproceedings{ABM-edbt09,
  address = {Saint Petersburg, Russia},
  month = mar,
  year = 2009,
  novolume = {},
  series = {ACM International Conference Proceeding Series},
  publisher = {Springer},
  editor = {Kersten, Martin L. and Novikov, Boris and Teubner, Jens  and
                  Polutin, Vladimir and Manegold, Stefan},
  acronym = {{EDBT}'09},
  booktitle = {{A}dvances in {D}atabase {T}echnology~---
	   {P}roceedings of the 12th {I}nternational {C}onference on
                  {E}xtending {D}atabase {T}echnology ({EDBT}'09)},
  author = {Abiteboul, Serge and Bourhis, Pierre and Marinoiu, Bogdan},
  title = {Efficient maintenance techniques for views over active
                  documents},
  pages = {1076-1087},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABM-edbt09.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABM-edbt09.pdf},
  doi = {10.1145/1516360.1516483},
  abstract = {Many Web applications are based on dynamic interactions between
    Web components exchanging flows of information. Such a situation arises
    for instance in mashup systems or when monitoring distributed autonomous
    systems. Our work is in this challenging context that has generated
    recently a lot of attention; see Web~2.0. We introduce the axlog formal
    model for capturing such interactions and show how this model can be
    supported efficiently. The central component is the axlog widget defined
    by one tree-pattern query or more, over an active document (in the Active
    XML style) that includes some input streams of updates. A widget generates
    a stream of updates for each query, the updates that are needed to
    maintain the view corresponding to the query. We exploit an array of known
    technologies: datalog optimization techniques such as Differential or
    MagicSet, constraint query languages, and efficient XML filtering
    (YFilter). The novel optimization technique we propose is based on
    fundamental new notions: a relevance (different than that of MagicSet),
    satisfiability and provenance for active documents. We briefly discuss an
    implementation of an axlog engine, an application that we used to test the
    approach, and results of experiments.}
}
@inproceedings{AGMP-icde2009,
  address = {Shanghai, China},
  month = mar # {-} # apr,
  year = 2009,
  publisher = {{IEEE} Computer Society Press},
  editor = {Ioannidis, Yannis E. and Lee, Dik Lun and Ng, Raymond T.},
  acronym = {{ICDE}'09},
  booktitle = {{P}roceedings of the 25th {I}nternational {C}onference on
                  {D}ata {E}ngineering ({ICDE}'09)},
  author = {Abiteboul, Serge and Greenshpan, Ohad and Milo, Tova and
                  Polyzotis, Neoklis},
  title = {Match{U}p: Autocompletion for Mashups},
  pages = {1479-1482},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/AGMP-icde2009.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGMP-icde2009.pdf},
  doi = {10.1109/ICDE.2009.47},
  abstract = {A~\emph{mashup} is a Web application that integrates data,
    computation and GUI provided by several systems into a unique tool. The
    concept originated from the understanding that the number of applications
    available on the Web and the need for combining them to meet user
    requirements, are growing very rapidly. This demo presents \emph{MatchUp},
    a system that supports rapid, on-demand, intuitive development of
    \emph{mashups}, based on a novel \emph{autocompletion} mechanism. The key
    observation guiding the development of \emph{MatchUp} is that mashups
    developed by different users typically share common characteristics; they
    use similar classes of mashup components and glue them together in a
    similar manner. \emph{MatchUp} exploits these similarities to predict,
    given a user's partial mashup specification, what are the most likely
    potential \emph{completions} (missing components and connection between
    them) for the specification. Using a novel ranking algorithm, users are
    then offered top-k completions from which they choose and refine according
    to their needs.}
}
@inproceedings{BFLM-hscc10,
  address = {Stockholm, Sweden},
  month = apr,
  year = 2010,
  publisher = {ACM Press},
  editor = {Johansson, Karl Henrik and Yi, Wang},
  acronym = {{HSCC}'10},
  booktitle = {{P}roceedings of the 13th {I}nternational {C}onference
               on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
               ({HSCC}'10)},
  author = {Bouyer, Patricia and Fahrenberg, Uli and Larsen, Kim G.
		 and Markey, Nicolas},
  title = {Timed Automata with Observers under Energy Constraints},
  pages = {61-70},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFLM-hscc10.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFLM-hscc10.pdf},
  doi = {10.1145/1755952.1755963},
  abstract = {In this paper, we study one-clock priced timed automata in which
    prices can grow linearly (\(\frac{dp}{dt}=k\)) or exponentially
    (\(\frac{dp}{dt}=kp\)), with discontinuous updates on edges. We propose
    EXPTIME algorithms to decide the existence of controllers that ensure
    existence of infinite runs or reachability of some goal location with
    non-negative observer value all along the run. These algorithms consist in
    computing the optimal delays that should be elapsed in each location along
    a run, so that the final observer value is maximized (and never goes below
    zero).}
}
@inproceedings{VLC-tacas10,
  address = {Paphos, Cyprus},
  month = mar,
  year = 2010,
  volume = {6015},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Esparza, Javier and Majumdar, Rupak},
  acronym = {{TACAS}'10},
  booktitle = {{P}roceedings of the 16th {I}nternational 
               {C}onference on {T}ools and {A}lgorithms for
               {C}onstruction and {A}nalysis of {S}ystems
               ({TACAS}'10)},
  author = {Villard, Jules and Lozes, {\'E}tienne and Calcagno, Cristiano},
  title = {Tracking Heaps that Hop with Heap-Hop},
  pages = {275-279},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/VLC-tacas10.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/VLC-tacas10.pdf},
  doi = {10.1007/978-3-642-12002-2_23},
  abstract = {Heap-Hop is a program prover for concurrent heap-manipulating
    programs that use Hoare monitors and message-passing synchronization.
    Programs are annotated with pre and post-conditions and loop invariants,
    written in a fragment of separation logic. Communications are governed by
    a form of session types called contracts. Heap-Hop can prove safety and
    race-freedom and, thanks to contracts, absence of memory leaks and
    deadlock-freedom. It has been used in several case studies, including
    concurrent programs for copyless list transfer, service provider
    protocols, and load-balancing parallel tree disposal.}
}
@inproceedings{DS-fossacs10,
  address = {Paphos, Cyprus},
  month = mar,
  year = 2010,
  volume = {6014},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Ong, C.-H. Luke},
  acronym = {{FoSSaCS}'10},
  booktitle = {{P}roceedings of the 13th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'10)},
  author = {Demri, St{\'e}phane and Sangnier, Arnaud},
  title = {When Model-Checking
                  Freeze {LTL} over Counter Machines Becomes Decidable},
  pages = {176-190},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DS-fossacs10.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DS-fossacs10.pdf},
  doi = {10.1007/978-3-642-12032-9_13},
  abstract = {We study the decidability status of model-checking freeze LTL
    over various subclasses of counter machines for which the reachability
    problem is known to be decidable (reversal-bounded counter machines,
    vector additions systems with states, flat counter machines, one-counter
    machines). In freeze LTL, a register can store a counter value and at some
    future position an equality test can be done between a register and a
    counter value. Herein, we complete an earlier work started on one-counter
    machines by considering other subclasses of counter machines, and
    especially the class of reversal-bounded counter machines. This gives us
    the opportuniy to provide a systematic classification that distinguishes
    determinism vs. nondeterminism and we consider subclasses of formulae by
    restricting the set of atomic formulae or\slash and the polarity of the
    occurrences of the freeze operators, leading to the flat fragment.}
}
@inproceedings{tCF-fossacs10,
  address = {Paphos, Cyprus},
  month = mar,
  year = 2010,
  volume = {6014},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Ong, C.-H. Luke},
  acronym = {{FoSSaCS}'10},
  booktitle = {{P}roceedings of the 13th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'10)},
  author = {ten~Cate, Balder and Fontaine, Ga{\"e}lle},
  title = {An Easy Completeness Proof for the Modal \(\mu\)-Calculus on Finite Trees},
  pages = {161-175},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/tCF-fossacs10.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/tCF-fossacs10.pdf},
  doi = {	10.1007/978-3-642-12032-9_12},
  abstract = {We give a complete axiomatization for the modal \(\mu\)-calculus on
    finite trees. While the completeness of our axiomatization already follows
    from a more powerful result by Igor Walukiewicz, our proof is easier and
    uses very different tools, inspired from model theory. We show that our
    approach generalizes to certain axiomatic extensions, and to the extension
    of the \(\mu\)-calculus with graded modalities. We hope that the method might
    be helpful for other completeness proofs as well.}
}
@inproceedings{CS-fossacs10,
  address = {Paphos, Cyprus},
  month = mar,
  year = 2010,
  volume = {6014},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Ong, C.-H. Luke},
  acronym = {{FoSSaCS}'10},
  booktitle = {{P}roceedings of the 13th {I}nternational
               {C}onference on {F}oundations of {S}oftware {S}cience
               and {C}omputation {S}tructures
               ({FoSSaCS}'10)},
  author = {Chambart, Pierre and Schnoebelen, {\relax Ph}ilippe},
  title = {Toward a compositional theory of leftist grammars and 
		transformations},
  pages = {237-251},
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-fossacs10.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-fossacs10.pdf},
  doi = {10.1007/978-3-642-12032-9_17},
  abstract = {Leftist grammars [Motwani \textit{et~al.}, STOC~2000] are
    special semi-Thue systems where symbols can only insert or erase to their
    left. We~develop a theory of leftist grammars seen as word transformers as
    a tool toward rigorous analyses of their computational power. Our~main
    contributions in this first paper are (1)~constructions proving that
    leftist transformations are closed under compositions and transitive
    closures, and (2)~a~proof that bounded reachability is NP-complete even
    for leftist grammars with acyclic rules.}
}
@article{CDMP-apal09,
  publisher = {Elsevier Science Publishers},
  journal = {Annals of Pure and Applied Logics},
  author = {Chevalier, Fabrice and D'Souza, Deepak and Matteplackel, Raj Mohan
                  and Prabhakar,  Pavithra},
  title = {Automata and logics over finitely varying functions},
  year = {2009},
  month = dec,
  volume = {161},
  number = {3},
  pages = {324-336},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDMP-apal09.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDMP-apal09.pdf},
  doi = {10.1016/j.apal.2009.07.007},
  abstract = {We extend some of the classical connections between automata and
    logic due to B{\"u}chi~(1960) and McNaughton and Papert~(1971) to
    languages of finitely varying functions or {"}signals{"}. In particular,
    we introduce a natural class of automata for generating finitely varying
    functions called ST-NFAs, and show that it coincides in terms of language
    definability with a natural monadic second-order logic interpreted over
    finitely varying functions (Rabinovich, 2002). We also identify a
    {"}counter-free{"} subclass of ST-NFAs which characterise the first-order
    definable languages of finitely varying functions. Our proofs mainly
    factor through the classical results for word languages. These results
    have applications in automata characterisations for continuously
    interpreted real-time logics like Metric Temporal Logic (MTL) (Chevalier
    \emph{et~al.}, 2006,~2007).}
}
@phdthesis{mercier-phd2009,
  author = {Mercier, Antoine},
  title = {Contributions {\`a} l'analyse automatique des protocoles
                  cryptographiques en pr{\'e}sence de propri{\'e}t{\'e}s
                  alg{\'e}briques : protocoles de groupe, {\'e}quivalence
                  statique},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  type = {Th{\`e}se de doctorat},
  year = 2009,
  month = dec,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AM-these09.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AM-these09.pdf}
}
@phdthesis{bursuc-phd2009,
  author = {Bursuc, Sergiu},
  title = {Contraintes de d{\'e}ductibilit{\'e} dans une alg{\`e}bre
                  quotient: r{\'e}duction de mod{\`e}les et applications {\`a}
                  la s{\'e}curit{\'e}},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  type = {Th{\`e}se de doctorat},
  year = 2009,
  month = dec,
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/SB-these09.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SB-these09.pdf}
}
@article{schmitz-scp10,
  publisher = {Elsevier Science Publishers},
  journal = {Science of Computer Programming},
  author = {Sylvain Schmitz},
  title = {An Experimental Ambiguity Detection Tool},
  volume = 75,
  number = {1-2},
  pages = {71-84},
  month = jan,
  year = 2010,
  doi = {10.1016/j.scico.2009.07.002},
  url = {http://hal.archives-ouvertes.fr/hal-00436398},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/schmitz-scp10.pdf},
  abstract = {Although programs convey an unambiguous meaning, the grammars
   used in practice to describe their syntax are often ambiguous, and
   completed with disambiguation rules. Whether these rules achieve the
   removal of all the ambiguities while preserving the original intended
   language can be difficult to ensure. We present an experimental ambiguity
   detection tool for GNU Bison, and illustrate how it can assist a
   grammatical development for a subset of Standard~ML.}
}
@incollection{CM-CES09,
  author = {Cassez, Franck and Markey, Nicolas},
  title = {Control of Timed Systems},
  booktitle = {Communicating Embedded Systems~-- Software and Design},
  editor = {Jard, Claude and Roux, Olivier H.},
  publisher = {Wiley-ISTE},
  year = 2009,
  month = oct,
  pages = {83-120},
  chapter = 3,
  url = {http://www.iste.co.uk/index.php?f=x&ACTION=View&id=288},
  nops = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/.ps},
  nopsgz = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PSGZ/.ps.gz},
  isbn = {9781848211438}
}
@incollection{DH-CES09,
  author = {Donatelli, Susanna and Haddad, Serge},
  title = {Quantitative Verification of {M}arkov Chains},
  booktitle = {Communicating Embedded Systems~-- Software and Design},
  editor = {Jard, Claude and Roux, Olivier H.},
  publisher = {Wiley-ISTE},
  year = 2009,
  month = oct,
  pages = {139-163},
  chapter = 5,
  url = {http://www.iste.co.uk/index.php?f=x&ACTION=View&id=288},
  nops = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/.ps},
  nopsgz = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PSGZ/.ps.gz},
  isbn = {9781848211438}
}
@inproceedings{CLPV-vmcai10,
  address = {Madrid, Spain},
  month = jan,
  year = 2010,
  volume = 5944,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Barthe, Gilles and Hermenegildo, Manuel},
  acronym = {{VMCAI}'10},
  booktitle = {{P}roceedings of the 11th {I}nternational {C}onference on
   	       {V}erification, {M}odel {C}hecking and {A}bstract {I}nterpretation
	       ({VMCAI}'10)},
  author = {Chadha, Rohit and Legay, Axel and Prabhakar, Pavithra
		 and Viswanathan, Mahesh},
  title = {Complexity bounds for the verification of real-time software},
  pages = {95-111},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CLPV-vmcai10.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CLPV-vmcai10.pdf},
  doi = {10.1007/978-3-642-11319-2_10},
  abstract = {We present uniform approaches to establish complexity bounds for
    decision problems such as reachability and simulation, that arise
    naturally in the verification of timed software systems. We model timed
    software systems as timed automata augmented with a data store (like a
    pushdown stack) and show that there is at least an exponential blowup in
    complexity of verification when compared with untimed systems. Our proof
    techniques also establish complexity results for boolean programs, which
    are automata with stores that have additional boolean variables.}
}
@article{JGL-mscs09,
  publisher = {Cambridge University Press},
  journal = {Mathematical Structures in Computer Science},
  author = {Goubault{-}Larrecq, Jean},
  title = {{D}e~{G}root Duality and Models of Choice: Angels, Demons, and Nature},
  volume = {20},
  number = 2,
  pages = {169-237},
  month = apr,
  year = 2010,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-mscs09.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-mscs09.pdf},
  doi = {10.1017/S0960129509990363},
  abstract = {We introduce convex-concave duality for various models of
    non-deterministic choice, probabilistic choice, and the two of them
    together. This complements the well-known duality of stably compact spaces
    in a pleasing way: convex-concave duality swaps angelic and demonic
    choice, and leaves probabilistic choice invariant.}
}
@inproceedings{JGL-asian09,
  address = {Seoul, Korea},
  month = dec,
  year = 2009,
  volume = 5913,
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  editor = {Datta, Anupam},
  acronym = {{ASIAN}'09},
  booktitle = {{P}roceedings of the 13th {A}sian
               {C}omputing {S}cience {C}onference
               ({ASIAN}'09)},
  author = {Goubault{-}Larrecq, Jean},
  title = {{\textquotedbl}{L}ogic Wins!{\textquotedbl}},
  pages = {1-16},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-asian09.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-asian09.pdf},
  doi = {10.1007/978-3-642-10622-4_1},
  abstract = {Clever algorithm design is sometimes superseded by simple
    encodings into logic. We apply this motto to a few case studies in the
    formal verification of security properties. In particular, we examine
    confidentiality objectives in hardware circuit descriptions written in
    VHDL.}
}
@phdthesis{chamseddine-phd2009,
  author = {Chamseddine, Najla},
  title = {Analyse quantitative parametr{\'e}e d'automates temporis{\'e}s probabilistes},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  type = {Th{\`e}se de doctorat},
  year = 2009,
  month = oct,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/NC-these09.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/NC-these09.pdf}
}
@phdthesis{bouchy-phd2009,
  author = {Bouchy, Florent},
  title = {Logiques et mod{\`e}les pour la v{\'e}rification de syst{\`e}mes infinis},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  type = {Th{\`e}se de doctorat},
  year = 2009,
  month = nov,
  url = {http://www.lsv.fr/Publis/PAPERS/PDF/FB-these09.pdf},
  pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FB-these09.pdf}
}
@phdthesis{sznajder-phd2009,
  author = {Sznajder, Nathalie},
  title = {Synth{\`e}se de syst{\`e}mes distribu{\'e}s ouverts},
  school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
               ENS Cachan, France},
  type = {Th{\`e}se de doctorat},
  year = 2009,
  month = nov,
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/NS-these09.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/NS-these09.pdf}
}
@inproceedings{SRKK-wissec09,
  address = {Louvain-la-Neuve, Belgium},
  month = nov,
  year = 2009,
  editor = {Pereira, Olivier and Quisquater, Jean-Jacques and
		Standaert, Fran\c{c}ois-Xavier},
  acronym = {{WISSEC}'09},
  booktitle = {{P}roceedings of the 4th {B}enelux {W}orkshop on
		{I}nformation and {S}ystem {S}ecurity ({WISSEC}'09)},
  author = {Smyth, Ben and Ryan, Mark D. and Kremer, Steve and
		   Kourjieh, Mounira},
  title = {Election verifiability in electronic voting protocols
		  (Preliminary version)},
  nopages = {},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/SRKK-wissec09.pdf},
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/SRKK-wissec09.pdf},
  abstract = {We~present a symbolic definition of election verifiability for
    electronic voting protocols. Our definition is given in terms of
    reachability assertions in the applied pi calculus and is amenable to
    automated reasoning using the tool ProVerif. The~definition distinguishes
    three aspects of verifiability, which we call individual, universal, and
    eligibility verifiability. It also allows us to determine precisely what
    aspects of the system are required to be trusted. We demonstrate our
    formalism by analysing the protocols due to Fujioka, Okamoto \&~Ohta and
    Juels, Catalano \&~Jakobsson; the~latter of which has been implemented by
    Clarkson, Chong \&~Myers. }
}
@inproceedings{CCD-secco09,
  address = {Bologna, Italy},
  month = oct,
  year = 2009,
  editor = {Boreale, Michele and Kremer, Steve},
  acronym = {{SecCo}'09},
  booktitle = {{P}reliminary {P}roceedings of the 7th {I}nternational
               {W}orkshop on {S}ecurity {I}ssues in
               {C}oordination {M}odels, {L}anguages and
               {S}ystems ({SecCo}'09)},
  author = {Cheval, Vincent and Comon{-}Lundh, Hubert and Delaune, St{\'e}phanie},
  title = {A~decision procedure for proving observational equivalence},
  nmnote = {did not appear in postproceedings EPTCS7},
  url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CCD-secco09.pdf},
  pdf = {