@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 = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CCD-secco09.pdf}
}
@proceedings{BK-secco2009,
title = {{P}roceedings of the 7th {I}nternational {W}orkshop on
{S}ecurity {I}ssues in {C}oncurrency ({S}ec{C}o'09)},
booktitle = {{P}roceedings of the 7th {I}nternational {W}orkshop on
{S}ecurity {I}ssues in {C}oncurrency ({S}ec{C}o'09)},
acronym = {{S}ec{C}o'09},
editor = {Boreale, Michele and Kremer, Steve},
doi = {10.4204/EPTCS.7},
url = {http://eptcs.web.cse.unsw.edu.au/content.cgi?SECCO2009},
series = {Electronic Proceedings in Theoretical Computer Science},
volume = 7,
year = 2009,
month = aug,
address = {Bologna, Italy}
}
@article{bbc09-lmcs,
journal = {Logical Methods in Computer Science},
author = {Bouyer, Patricia and Brihaye, {\relax Th}omas and Chevalier, Fabrice},
title = {O-Minimal Hybrid Reachability Games},
year = 2010,
month = jan,
volume = 6,
number = {1:1},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBC-lmcs09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBC-lmcs09.pdf},
doi = {10.2168/LMCS-6(1:1)2010},
abstract = {In this paper, we consider reachability games over general
hybrid systems, and distinguish between two possible observation
frameworks for those games: either the precise dynamics of the system is
seen by the players (this is the perfect observation framework), or only
the starting point and the delays are known by the players (this is the
partial observation framework). In the first more classical framework, we
show that time-abstract bisimulation is not adequate for solving this
problem, although it is sufficient in the case of timed automata. That is
why we consider an other equivalence, namely the suffix equivalence based on
the encoding of tra jectories through words. We show that this suffix
equivalence is in general a correct abstraction for games. We apply this
result to o-minimal hybrid systems, and get decidability and computability
results in this framework. For the second framework which assumes a
partial observation of the dynamics of the system, we propose another
abstraction, called the superword encoding, which is suitable to solve the
games under that assumption. In that framework, we also provide
decidability and computability results.}
}
@article{BCM-icomp2009,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Bouyer, Patricia and Chevalier, Fabrice and Markey, Nicolas},
title = {On the Expressiveness of {TPTL} and~{MTL}},
volume = {208},
number = 2,
pages = {97-116},
month = feb,
year = 2010,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCM-icomp09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCM-icomp09.pdf},
doi = {10.1016/j.ic.2009.10.004},
abstract = {TPTL and MTL are two classical timed extensions of~LTL. In~this
paper, we prove the 20-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 \emph{can}
be expressed in~MTL. More generally, we show that TPTL formulae using only
modality~F can be translated into~MTL.}
}
@mastersthesis{dimino-m1,
author = {Dimino, J{\'e}r{\'e}mie},
title = {Les syst{\`e}mes {\`a} canaux non-fiables vus comme des
transducteurs},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de stage de {M1}},
year = {2009},
month = oct,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/dimino-m1.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/dimino-m1.pdf}
}
@inproceedings{FS-sofsem10,
address = {\v{S}pindler\r{u}v Ml\'{y}n, Czech Republic},
month = jan,
year = 2010,
volume = 5901,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Peleg, David and Muscholl, Anca},
acronym = {{SOFSEM}'10},
booktitle = {{P}roceedings of the 36th International Conference on
Current Trends in Theory and Practice of
Computer Science ({SOFSEM}'10)},
author = {Finkel, Alain and Sangnier, Arnaud},
title = {Mixing coverability and reachability to analyze {VASS}
with one zero-test},
pages = {394-406},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FS-sofsem10.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FS-sofsem10.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FS-sofsem10.ps},
doi = {10.1007/978-3-642-11266-9_33},
abstract = {We study Vector Addition Systems with States (VASS) extended in
such a way that one of the manipulated integer variables can be tested to
zero. For this class of system, it has been proved that the reachability
problem is decidable. We prove here that boundedness, termination and
reversal-boundedness are decidable for VASS with one zero-test. To decide
reversal-boundedness, we provide an original method which mixes both the
construction of the coverability graph for VASS and the computation of the
reachability set of reversal-bounded counter machines. The same
construction can be slightly adapted to decide boundedness and hence
termination.}
}
@article{BKKL-tse09,
publisher = {{IEEE} Computer Society Press},
journal = {IEEE Transactions on Software Engineering},
author = {Bollig, Benedikt and Katoen, Joost-Pieter and Kern, Carsten
and Leucker, Martin},
title = {Learning Communicating Automata from~{MSCs}},
volume = {36},
number = {3},
pages = {390-408},
month = may # {-} # jun,
year = 2010,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-tse09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-tse09.pdf},
doi = {10.1109/TSE.2009.89},
abstract = {This paper is concerned with bridging the gap between
requirements and distributed systems. Requirements are defined as basic
message sequence charts (MSCs) specifying positive and negative scenarios.
Communicating finite-state machines (CFMs), \textit{i.e.}, finite automata
that communicate via FIFO buffers, act as system realizations. The key
contribution is a generalization of Angluin's learning algorithm for
synthesizing CFMs from MSCs. This approach is exact---the resulting CFM
precisely accepts the set of positive scenarions and rejects all negative
ones---and yields fully asynchronous implementations. The paper
investigates for which classes of MSC languages CFMs can be learned,
presents an optimization technique for learning partial orders, and
provides substantial empirical evidence indicating the practical
feasibility of the approach.}
}
@article{BKKL-cai09,
publisher = {Slovak Academy of Sciences},
journal = {Computing and Informatics},
author = {Bollig, Benedikt and Katoen, Joost-Pieter and Kern, Carsten
and Leucker, Martin},
title = {{SMA}---The Smyle Modeling Approach},
volume = {29},
number = {1},
pages = {45-72},
year = 2010,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-cai09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-cai09.pdf},
abstract = {This paper introduces the model-based software development
lifecycle model \emph{SMA}---the Smyle \emph{Modeling Approach}---which is
centered around \emph{Smyle}. \emph{Smyle} is a dedicated learning
procedure to support engineers to interactively obtain design models from
requirements, characterized as either being desired (positive) or unwanted
(negative) system behavior. Within \emph{SMA}, the learning approach is
complemented by so-called \emph{scenario patterns} where the engineer can
specify \emph{clearly} desired or unwanted behavior. This way, user
interaction is reduced to the interesting scenarios limiting the design
effort considerably. In~\emph{SMA}, the learning phase is further
complemented by an effective analysis phase that allows for detecting
design flaws at an early design stage. Using learning techniques allows us
to gradually develop and refine requirements, naturally supporting
evolving requirements, and allows for a rather inexpensive redesign in
case anomalous system behavior is detected during analysis, testing, or
maintenance. This paper describes the approach and reports on first
practical experiences.}
}
@mastersthesis{cheval-master,
author = {Cheval, Vincent},
title = {Algorithme de d{\'e}cision de l'{\'e}quivalence symbolique de
syst{\`e}mes de contraintes},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2009},
month = sep,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/master-cheval.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/master-cheval.pdf}
}
@mastersthesis{brenguier-master,
author = {Brenguier, Romain},
title = {Calcul des {\'e}quilibres de Nash dans les jeux temporis{\'e}s},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2009},
month = sep,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/master-brenguier.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/master-brenguier.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/master-brenguier.ps}
}
@techreport{LSV:09:20,
author = {Andr{\'e}, {\'E}tienne},
title = {Everything You Always Wanted to Know About {IMITATOR} (But~Were Afraid to~Ask)},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2009},
month = jul,
type = {Research Report},
number = {LSV-09-20},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-20.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-20.pdf},
note = {11~pages},
abstract = {We present here the user manual of IMITATOR, a tool for
synthesizing constraints on timing bounds (seen as parameters) in the
framework of timed automata. Unlike classical synthesis methods, the tool
IMITATOR takes advantage of a given reference valuation of the parameters
for which the system is known to behave properly. The goal of IMITATOR is
to generate a constraint such that, under any valuation satisfying this
constraint, the system is guaranteed to behave, in terms of alternating
sequences of locations and actions, as under the reference valuation.\par
We give here the installation requirements and the launching commands of
IMITATOR, as well as the source code of a toy example.}
}
@inproceedings{DJLL-fsttcs09,
address = {Kanpur, India},
month = dec,
year = 2009,
volume = 4,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Kannan, Ravi and Narayan Kumar, K.},
acronym = {{FSTTCS}'09},
booktitle = {{P}roceedings of the 29th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'09)},
author = {Demri, St{\'e}phane and Jurdzi{\'n}ski, Marcin and Lachish,
Oded and Lazi{\'c}, Ranko},
title = {The covering and boundedness problems for branching vector addition systems},
pages = {181-192},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/djll-fsttcs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/djll-fsttcs09.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2009.2317},
abstract = {The covering and boundedness problems for branching vector
addition systems are shown complete for doubly-exponential time.}
}
@inproceedings{DKP-fsttcs09,
address = {Kanpur, India},
month = dec,
year = 2009,
volume = 4,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Kannan, Ravi and Narayan Kumar, K.},
acronym = {{FSTTCS}'09},
booktitle = {{P}roceedings of the 29th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'09)},
author = {Delaune, St{\'e}phanie and Kremer, Steve and Pereira,
Olivier},
title = {Simulation based security in the applied pi calculus},
pages = {169-180},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DKP-fsttcs09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DKP-fsttcs09.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2009.2316},
abstract = {We present a symbolic framework for refinement and composition
of security protocols. The framework uses the notion of ideal
functionalities. These are abstract systems which are secure by
construction and which can be combined into larger systems. They can be
separately refined in order to obtain concrete protocols implementing
them. Our work builds on ideas from computational models such as the
universally composable security and reactive simulatability frameworks.
The underlying language we use is the applied pi calculus which is a
general language for specifying security protocols. In our framework we
can express the different standard flavours of simulation-based security
which happen to all coincide. We illustrate our framework on an
authentication functionality which can be realized using the
Needham-Schroeder-Lowe protocol. For this we need to define an ideal
functionality for asymmetric encryption and its realization. We also show
a joint state result for this functionality which allows composition (even
though the same key material is reused) using a tagging mechanism.}
}
@article{BCHMMR-ijwsr09,
publisher = {{IGI} Publishing},
journal = {International Journal of Web Services Research},
author = {Boutrous{-}Saab, C{\'e}line and Coulibaly, Demba and Haddad, Serge
and Melliti, Tarek and Moreaux, Patrice and Rampacek, Sylvain},
title = {An Integrated Framework for Web Services Orchestration},
volume = 6,
number = 4,
pages = {1-29},
year = 2009,
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCHMMR-ijwsr09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCHMMR-ijwsr09.pdf},
abstract = {Currently, Web services give place to active research and this
is due both to industrial and theoretical factors. On one hand, Web
services are essential as the design model of applications dedicated to
the electronic business. On the other hand, this model aims to become one
of the major formalisms for the design of distributed and cooperative
applications in an open environment (the Internet). In this article, the
authors will focus on two features of Web services. The first one concerns
the interaction problem: given the interaction protocol of a Web service
described in BPEL, how to generate the appropriate client? Their approach
is based on a formal semantics for BPEL via process algebra and yields an
algorithm which decides whether such a client exists and synthesizes the
description of this client as a (timed) automaton. The second one concerns
the design process of a service. They propose a method which proceeds by
two successive refinements: first the service is described via UML, then
refined in a BPEL model and finally enlarged with JAVA code using JCSWL, a
new language that we introduce here. Their solutions are integrated in a
service development framework that will be presented in a synthetic way.}
}
@inproceedings{VLC-aplas09,
address = {Seoul, Korea},
month = dec,
year = 2009,
volume = {5904},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Hu, Zhenjiang},
acronym = {{APLAS}'09},
booktitle = {{P}roceedings of the 7th {A}sian {S}ymposium
on {P}rogramming {L}anguages and {S}ystems
({APLAS}'09)},
author = {Villard, Jules and Lozes, {\'E}tienne and Calcagno, Cristiano},
title = {Proving Copyless Message Passing},
pages = {194-209},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/VLC-aplas09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/VLC-aplas09.pdf},
doi = {10.1007/978-3-642-10672-9_15},
abstract = {Handling concurrency using a shared memory and locks is tedious
and error-prone. One solution is to use message passing instead. We study
here a particular, contract-based flavor that makes the ownership transfer
of messages explicit. In this case, ownership of the heap region
representing the content of a message is lost upon sending, which can lead
to efficient implementations. In this paper, we define a proof system for
a concurrent imperative programming language implementing this idea and
inspired by the Singularity OS. The proof system, for which we prove
soundness, is an extension of separation logic, which has already been
used successfully to study various ownership-oriented paradigms.}
}
@inproceedings{AFS-avocs09,
address = {Swansea, UK},
month = sep,
year = {2009},
volume = 23,
series = {Electronic Communications of the EASST},
publisher = {European Association of Software Science and Technology},
editor = {Roggenbach, Markus},
acronym = {{AVoCS}'09},
booktitle = {{P}roceedings of the 9th {I}nternational
{W}orkshop on {A}utomated {V}erification
of {C}ritical {S}ystems
({AVoCS}'09)},
author = {Andr{\'e}, {\'E}tienne and Fribourg, Laurent and Sproston,
Jeremy},
title = {An Extension of the Inverse Method to Probabilistic Timed Automata},
nopages = {},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AFS-avocs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AFS-avocs09.pdf},
abstract = {Probabilistic timed automata can be used to model systems in
which probabilistic and timing behavior coexist. Verification of
probabilistic timed automata models is generally performed with regard to
a single reference valuation of the timing parameters. Given such a
parameter valuation, we present a method for obtaining automatically a
constraint on timing parameters for which the reachability probabilities
(1)~remain invariant and (2)~are~equal to the reachability probabilities
for the reference valuation. The method relies on parametric analysis of a
non-probabilistic version of the probabilistic timed automata model using
the {"}inverse method{"}. Our approach is useful for avoiding repeated
executions of probabilistic model checking analyses for the same model
with different parameter valuations. We provide examples of the
application of our technique to models of randomized protocols.}
}
@incollection{HI-petrinet-diaz,
year = 2009,
publisher = {Wiley-ISTE},
editor = {Diaz, Michel},
booktitle = {Petri Nets: Fundamental Models, Verification and Applications},
author = {Haddad, Serge and Ili{\'e}, Jean-Michel},
title = {Symmetry and Temporal Logic},
pages = {435-460},
url = {http://eu.wiley.com/WileyCDA/WileyTitle/productCd-1848210795.html}
}
@incollection{HV-petrinet-diaz-b,
year = 2009,
publisher = {Wiley-ISTE},
editor = {Diaz, Michel},
booktitle = {Petri Nets: Fundamental Models, Verification and Applications},
author = {Haddad, Serge and Vernadat, Fran{\c{c}}ois},
title = {Verification of Specific Properties},
pages = {349-414},
url = {http://eu.wiley.com/WileyCDA/WileyTitle/productCd-1848210795.html}
}
@incollection{HM-petrinet-diaz-c,
year = 2009,
publisher = {Wiley-ISTE},
editor = {Diaz, Michel},
booktitle = {Petri Nets: Fundamental Models, Verification and Applications},
author = {Haddad, Serge and Moreaux, Patrice},
title = {Tensor Methods and Stochastic {P}etri Nets},
pages = {321-346},
url = {http://eu.wiley.com/WileyCDA/WileyTitle/productCd-1848210795.html}
}
@incollection{HM-petrinet-diaz-b,
year = 2009,
publisher = {Wiley-ISTE},
editor = {Diaz, Michel},
booktitle = {Petri Nets: Fundamental Models, Verification and Applications},
author = {Haddad, Serge and Moreaux, Patrice},
title = {Stochastic Well-formed {P}etri Nets},
pages = {303-320},
url = {http://eu.wiley.com/WileyCDA/WileyTitle/productCd-1848210795.html}
}
@incollection{HM-petrinet-diaz-a,
year = 2009,
publisher = {Wiley-ISTE},
editor = {Diaz, Michel},
booktitle = {Petri Nets: Fundamental Models, Verification and Applications},
author = {Haddad, Serge and Moreaux, Patrice},
title = {Stochastic {P}etri Nets},
pages = {269-302},
url = {http://eu.wiley.com/WileyCDA/WileyTitle/productCd-1848210795.html}
}
@incollection{H-petrinet-diaz,
year = 2009,
publisher = {Wiley-ISTE},
editor = {Diaz, Michel},
booktitle = {Petri Nets: Fundamental Models, Verification and Applications},
author = {Haddad, Serge},
title = {Decidability and Complexity of {P}etri Net Problems},
pages = {87-122},
url = {http://eu.wiley.com/WileyCDA/WileyTitle/productCd-1848210795.html}
}
@incollection{HV-petrinet-diaz-a,
year = 2009,
publisher = {Wiley-ISTE},
editor = {Diaz, Michel},
booktitle = {Petri Nets: Fundamental Models, Verification and Applications},
author = {Haddad, Serge and Vernadat, Fran{\c{c}}ois},
title = {Analysis Methods for {P}etri Nets},
pages = {41-86},
url = {http://eu.wiley.com/WileyCDA/WileyTitle/productCd-1848210795.html}
}
@article{BBC-apal09,
publisher = {Elsevier Science Publishers},
journal = {Annals of Pure and Applied Logics},
author = {Bouyer, Patricia and Brihaye, {\relax Th}omas and
Chevalier, Fabrice},
title = {Weighted O-Minimal Hybrid Systems},
year = {2009},
month = dec,
volume = {161},
number = {3},
pages = {268-288},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBC-apal09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBC-apal09.pdf},
doi = {10.1016/j.apal.2009.07.014},
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.}
}
@inproceedings{ZBH-lads09,
address = {Turin, Italy},
year = 2010,
volume = 6039,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Dastani, Mehdi and El~Fallah Seghrouchni, Amal and Leite, Jo{\~a}o
and Torroni, Paolo},
acronym = {{LADS}'09},
booktitle = {{R}evised {S}elected {P}apers of the 2nd {W}orkshop on {LA}nguages, methodologies and
{D}evelopment tools for multi-agent system{S} ({LADS}'09)},
author = {Zargayouna, Mahdi and Balbo, Flavien and Haddad, Serge},
title = {Agents Secure Interaction in Data Driven Languages},
pages = {72-91},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ZBH-lads09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ZBH-lads09.pdf},
doi = {10.1007/978-3-642-13338-1_5},
abstract = {This paper discusses the security issues in data driven
coordination languages. These languages rely on a data space shared by the
agents and used to coordinate their activities. We extend these languages
with a main distinguishing feature, which is the possibility to define
fine-grained security conditions, associated with every datum in the
shared space. Two main ideas makes it possible: the consideration of an
abstraction of agents' states in the form of data at language level and
the introduction of a richer interaction mechanism than state-of-the-art
templates. This novel security mechanism allows both agents and system
designers to prohibit undesirable interactions.}
}
@inproceedings{FLS-nordsec09,
address = {Oslo, Norway},
month = oct,
year = 2009,
volume = 5838,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {J{\o}sang, Audun and Maseng, Torleiv and Knapskog, Svein Johan},
acronym = {{NordSec}'09},
booktitle = {{P}roceedings of the 14th {N}ordic {W}orkshop on {S}ecure {IT}
{S}ystems ({NordSec}'09)},
author = {Focardi, Riccardo and Luccio, Flaminia L. and
Steel, Graham},
title = {Blunting Differential Attacks on {PIN} Processing {API}s},
pages = {88-103},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FLS-nordsec09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FLS-nordsec09.pdf},
doi = {10.1007/978-3-642-04766-4_7},
abstract = {We~propose a countermeasure for a class of known attacks on the
PIN processing API used in the ATM (cash machine) network. This API
controls access to the tamper-resistant Hardware Security Modules where
PIN encryption, decryption and verification takes place. The~attacks are
differential attacks, whereby an attacker gains information about the
plaintext values of encrypted customer PINs by making changes to the
non-confidential inputs to a command. Our~proposed fix adds an integrity
check to the parameters passed to the command. It~is novel in that it
involves very little change to the existing ATM network infrastructure.}
}
@inproceedings{KMT-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 = {Kremer, Steve and Mercier, Antoine and Treinen, Ralf},
title = {Reducing Equational Theories for the Decision of Static
Equivalence},
pages = {94-108},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KMT-asian09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KMT-asian09.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/KMT-asian09.ps},
doi = {10.1007/978-3-642-10622-4_8},
abstract = {Static equivalence is a well established notion of
indistinguishability of sequences of terms which is useful in the symbolic
analysis of cryptographic protocols. Static equivalence modulo equational
theories allows a more accurate representation of cryptographic primitives
by modelling properties of operators by equational axioms. We develop a
method that allows in some cases to simplify the task of deciding static
equivalence in a multi-sorted setting, by removing a symbol from the term
signature and reducing the problem to several simpler equational theories.
We illustrate our technique at hand of bilinear pairings.}
}
@inproceedings{AF-ijcai09,
address = {Pasadena, California, USA},
month = jul,
year = 2009,
publisher = {AAAI Press},
editor = {Boutilier, Craig},
acronym = {{IJCAI}'09},
booktitle = {{P}roceedings of the 21st {I}nternational {J}oint
{C}onference on {A}rtificial {I}ntelligence
({IJCAI}'09)},
author = {Areces, Carlos and Figueira, Diego},
title = {Which Semantics for Neighbourhood Semantics?},
pages = {671-676},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AF-ijcai09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AF-ijcai09.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/AF-ijcai09.ps},
abstract = {In this article we discuss two alternative proposals for
neighbourhood semantics (which we call strict and loose neighbourhood
semantics, NSS~and~NSL respectively) that have been previously introduced
in the literature. Our~main tools are suitable notions of bisimulation.
While an elegant notion of bisimulation exists for NSL, the required
bisimulation for NSS is rather involved. We~propose a simple extension of
NSS with a universal modality that we call NSS(E), which comes together
with a natural notion of bisimulation. We~also investigate the complexity
of the satisfiability problem for NSL and NSS(E).}
}
@article{DKS-jcs09,
publisher = {{IOS} Press},
journal = {Journal of Computer Security},
author = {Delaune, St{\'e}phanie and Kremer, Steve and Steel, Graham},
title = {Formal Analysis of {PKCS\#11} and Proprietary Extensions},
volume = 18,
number = 6,
pages = {1211-1245},
year = 2010,
month = nov,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKS-jcs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKS-jcs09.pdf},
doi = {10.3233/JCS-2009-0394},
abstract = {PKCS\#11 denes 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 diers 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 the model checker
NuSMV. We report some new attacks and prove the safety of some
congurations of the API in our model. We also analyse proprietary
extensions proposed by nCipher (Thales) and Eracom (Safenet), designed to
address the shortcomings of PKCS\#11.}
}
@techreport{LSV:09:16,
author = {B{\'e}rard, B{\'e}atrice and Haddad, Serge and Sassolas, Mathieu},
title = {Verification on Interrupt Timed Automata},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2009},
month = jul,
type = {Research Report},
number = {LSV-09-16},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-16.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-16.pdf},
note = {16~pages},
abstract = {The class of Interrupt Timed Automata (ITA) has been introduced to
model multi-task systems with interruptions in a single processor
environment. This is a subclass of hybrid automata in which real
valued variables consist of a restricted type of stopwatches
(variables with rate \(0\) or~\(1\)) organized along levels. While
reachability is undecidable with usual stopwatches, it was proved
that this problem is decidable in ITA and that untimed languages of
ITA are effectively regular. Here we investigate the problem of
model checking timed extensions of CTL over ITA and show in
contrast that this problem is undecidable. On~the other hand, we
prove that model checking is decidable for two relevant fragments of this
timed logic: (1)~the~first one where formula contain only model
clocks and (2)~the~second one where formulas have a single external
clock.}
}
@techreport{LSV:09:15,
author = {H{\'e}am, Pierre-Cyrille and Nicaud, Cyril},
title = {Seed: an Easy-to-Use Random Generator of Recursive Data Structures for Testing},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2009},
month = jul,
type = {Research Report},
number = {LSV-09-15},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-15.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-15.pdf},
note = {16~pages},
abstract = {Random testing represents a simple and tractable way for software
assessment. This paper presents the Seed tool dedicated to the
uniform random generation of recursive data structures as labelled
trees or logical formulas. We show how Seed can be used in several
testing contexts, from model based testing to performance
testing. Generated data structures are defined by grammar-like rules,
given in an XML format, multiplying Seed possible applications.
Seed is based on combinatorial techniques, and can generate uniformly
at random \(k\)~structures of size~\(n\) with a
time complexity in \(O(n^{2}+ kn\cdot \log(n))\). Finally, Seed is available as a free
java application and a great effort has been made to make it
easy-to-use.}
}
@techreport{LSV:09:13,
author = {Andr{\'e}, {\'E}tienne and Encrenaz, Emmanuelle and Fribourg, Laurent},
title = {Synthesizing Parametric Constraints on Various Case Studies Using {IMITATOR}},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2009},
month = jun,
type = {Research Report},
number = {LSV-09-13},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-13.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-13.pdf},
note = {18~pages},
abstract = {We present here applications of IMITATOR, a tool for
synthesizing constraints on timing bounds (seen as parameters) in the
framework of timed automata. Unlike classical synthesis methods, we take
advantage of a given reference valuation of the parameters for which the
system is known to behave properly. Our aim is to generate a constraint
such that, under any valuation satisfying this constraint, the system is
guaranteed to behave, in terms of alternating sequences of locations and
actions, as under the reference valuation. This is useful for safely
relaxing some values of the reference valuation, and optimizing timing
bounds of the system. We have successfully applied our tool to various
examples of asynchronous circuits and protocols, which are detailed in
this report.}
}
@inproceedings{BFSP-infinity09,
address = {Bologna, Italy},
month = nov,
year = 2009,
volume = 10,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Farzan, Azadeh and Legay, Axel},
acronym = {{INFINITY}'09},
booktitle = {{P}roceedings of the 11th {I}nternational
{W}orkshops on {V}erification of {I}nfinite
{S}tate {S}ystems
({INFINITY}'09)},
author = {Bouchy, Florent and Finkel, Alain and San{ }Pietro, Pierluigi},
title = {Dense-choice Counter Machines Revisited},
pages = {3-22},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFSP-infinity09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFSP-infinity09.pdf},
doi = {10.4204/EPTCS.10.1},
abstract = {This paper clarifies the picture about Dense-choice Counter
Machines, which have been less studied than (discrete) Counter Machines.
We revisit the definition of {"}Dense Counter Machines{"} so that it now
extends (discrete) Counter Machines, and we provide new undecidability and
decidability results. Using the first-order additive mixed theory of reals
and integers, we give a logical characterization of the sets of
configurations reachable by reversal-bounded Dense-choice Counter
Machines.}
}
@inproceedings{AF-infinity09,
address = {Bologna, Italy},
month = nov,
year = 2009,
volume = 10,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Farzan, Azadeh and Legay, Axel},
acronym = {{INFINITY}'09},
booktitle = {{P}roceedings of the 11th {I}nternational
{W}orkshops on {V}erification of {I}nfinite
{S}tate {S}ystems
({INFINITY}'09)},
author = {Andr{\'e}, {\'E}tienne and Fribourg, Laurent},
title = {An Inverse Method for Policy-Iteration Based Algorithms},
pages = {44-61},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AF-infinity09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AF-infinity09.pdf},
doi = {10.4204/EPTCS.10.4},
abstract = {We present an extension of two policy-iteration based algorithms
on weighted graphs (viz.,~Markov Decision Problems and Max-Plus Algebras).
This extension allows us to solve the following inverse problem:
considering the weights of the graph to be unknown constants or
parameters, we suppose that a reference instantiation of those weights is
given, and we aim at computing a constraint on the parameters under which
an optimal policy for the reference instantiation is still optimal. The
original algorithm is thus guaranteed to behave well around the reference
instantiation, which provides us with some criteria of robustness. We
present an application of both methods to simple examples. A prototype
implementation has been done.}
}
@inproceedings{BCLD-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 = {Bursuc, Sergiu and Delaune, St{\'e}phanie and Comon{-}Lundh,
Hubert},
title = {Deducibility constraints},
pages = {24-38},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCD-asian09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCD-asian09.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BCD-asian09.ps},
doi = {10.1007/978-3-642-10622-4_3},
abstract = {In their work on tractable deduction systems, D.~McAllester and
later D.~Basin and H.~Ganzinger have identified a property of inference
systems (the~locality property) that ensures the tractability of the
\textit{Entscheidungsproblem}.\par
On~the other hand, deducibility constraints are sequences of deduction
problems in which some parts (formulas) are unknown. The~problem is to
decide their satisfiability and to represent the set of all possible
solutions. Such constraints have also been used for deciding some security
properties of cryptographic protocols.\par
In this paper we show that local inference systems (actually a slight
modification of such systems) yield not only a tractable deduction
problem, but also decidable deducibility constraints. Our algorithm not
only allows to decide the existence of a solution, but also gives a
representation of all solutions.}
}
@incollection{ACL-fps09,
noaddress = {},
month = may,
year = 2009,
volume = 5458,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
noacronym = {},
booktitle = {{F}ormal to {P}ractical {S}ecurity},
editor = {Cortier, V{\'e}ronique and Kirchner, Claude and
Okada, Mitsuhiro and Sakurada, Hideki},
author = {Affeldt, Reynald and Comon{-}Lundh, Hubert},
title = {Verification of Security Protocols with a Bounded Number of
Sessions Based on Resolution for Rigid Variables},
pages = {1-20},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACL-fps09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACL-fps09.pdf},
doi = {10.1007/978-3-642-02002-5_1},
abstract = {First-order logic resolution is a standard way to automate the
verification of security protocols. However, it sometimes fails to produce
security proofs for secure protocols because of the detection of false
attacks. For the verification of a bounded number of sessions, false
attacks can be avoided by introducing rigid variables. Unfortunately, this
yields complicated resolution procedures. We show here that there is a
simple translation of the security problem for a bounded number of
sessions into first-order logic, that does not introduce false attacks.
This is shown by translating clauses involving rigid variables into
classical first-order clauses, while preserving satisfiability. We
illustrate this approach by giving a complete and terminating strategy for
a first-order logic fragment resulting from the above translation, that
yields a decision procedure for a bounded number of sessions.}
}
@inproceedings{HMY-msr09,
address = {Nantes, France},
month = nov,
year = 2009,
number = {7-9},
volume = {43},
series = {Journal Europ{\'e}en des Syst{\`e}mes Automatis{\'e}s},
publisher = {Herm{\`e}s},
editor = {Lime, Didier and Roux, Olivier H.},
acronym = {{MSR}'09},
booktitle = {{A}ctes du 7{\`e}me {C}olloque sur la
{M}od{\'e}lisation des {S}yst{\`e}mes
{R}{\'e}actifs
({MSR}'09)},
author = {Haddad, Serge and Mokdad, Lynda and Youcef, Samir},
title = {Bornes du temps de r{\'e}ponse des services Web composites},
pages = {969-983},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HMY-msr09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HMY-msr09.pdf},
abstract = {The quality of service (QoS) of Web services is a key
factor of their success. This requires to design new methods in order to
study~it. Here we propose families of upper bounding models for the
response time of composite Web services for two kinds of composition: the
statical and random {"}fork and merge{"}. In~the first~case, the~complexity of
bounding models belongs to~\(O(n\cdot \sqrt{n})\) where \(n\)~is the
number of called services whereas the complexity of the exact model
belongs to~\(O(n^2)\). In~the second~case, the~complexity of bounding
models still belongs to~\(O(n\cdot \sqrt{n})\) whereas the complexity of
the exact model belongs to~\(O(n^3)\). Furthermore, having a family of
bounding models allows to choose the bounding model depending on the
parameters of the exact model. The numerical results show the interest of
our approach w.r.t. complexity and accuracy of the bound.}
}
@inproceedings{ACDFR-msr09,
address = {Nantes, France},
month = nov,
year = 2009,
number = {7-9},
volume = {43},
series = {Journal Europ{\'e}en des Syst{\`e}mes Automatis{\'e}s},
publisher = {Herm{\`e}s},
editor = {Lime, Didier and Roux, Olivier H.},
acronym = {{MSR}'09},
booktitle = {{A}ctes du 7{\`e}me {C}olloque sur la
{M}od{\'e}lisation des {S}yst{\`e}mes
{R}{\'e}actifs
({MSR}'09)},
author = {Andr{\'e}, {\'E}tienne and Chatain, {\relax Th}omas and
De{ }Smet, Olivier and Fribourg, Laurent and Ruel, Silvain},
title = {Synth{\`e}se de contraintes temporis{\'e}es pour
une architecture d'automatisation en r{\'e}seau},
pages = {1049-1064},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACDFR-msr09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACDFR-msr09.pdf},
abstract = {We deal with the problem of synthesis of timing constraints for
concurrent systems. Such systems are modeled by networks of timed automata
where some constants, represented as parameters, can be tuned. A suitable
value of these parameters is assumed to be known from a preliminarily
simulation process. We present a method which infers a zone of suitable
points around this reference functioning point. This zone is defined by a
system of linear inequalities over the parameters. This method is applied
to the case study of a networked automation system.}
}
@inproceedings{ABC-cav09,
address = {Grenoble, France},
month = jun # {-} # jul,
year = 2009,
volume = 5643,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Bouajjani, Ahmad and Maler, Oded},
acronym = {{CAV}'09},
booktitle = {{P}roceedings of the 21st
{I}nternational {C}onference on
{C}omputer {A}ided {V}erification
({CAV}'09)},
author = {Abadi, Mart{\'\i}n and Blanchet, Bruno and Comon{-}Lundh,
Hubert},
title = {Models and Proofs of Protocol Security: A~Progress Report},
pages = {35-49},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABC-cav09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABC-cav09.pdf},
doi = {10.1007/978-3-642-02658-4_5},
abstract = {This paper discusses progress in the verification of security
protocols. Focusing on a small, classic example, it stresses
the use of program-like representations of protocols, and
their automatic analysis in symbolic and computational
models.}
}
@inproceedings{CDL-adhs09,
address = {Zaragoza, Spain},
month = sep,
year = 2009,
editor = {Giua, Alessandro and Silva, Manuel and Zaytoon, Janan},
acronym = {{ADHS}'09},
booktitle = {{P}roceedings of the 3rd {IFAC} {C}onference on {A}nalysis and
{D}esign of {H}ybrid {S}ystems ({ADHS}'09)},
author = {Chatain, {\relax Th}omas and David, Alexandre and Larsen, Kim
G.},
title = {Playing Games with Timed Games},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDL-adhs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDL-adhs09.pdf},
abstract = {In this paper we focus on property-preserving preorders between
timed game automata and their application to control of partially
observable systems. Following the example of timed simulation between
timed automata, we define timed alternating simulation as a preorder
between timed game automata, which preserves controllability. We define a
method to reduce the timed alternating simulation problem to a safety
game. We show how timed alternating simulation can be used to control
efficiently a partially observable system. This method is illustrated by a
generic case study.}
}
@inproceedings{BHK-rp09,
address = {Palaiseau, France},
month = sep,
year = 2009,
volume = 5797,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Bournez, Olivier and Potapov, Igor},
acronym = {{RP}'09},
booktitle = {{P}roceedings of the 3rd {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'09)},
author = {Boichut, Yohan and H{\'e}am,
Pierre-Cyrille and Kouchnarenko, Olga},
title = {How to Tackle Integer Weighted Automata Positivity},
pages = {79-92},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHK-rp09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHK-rp09.pdf},
doi = {10.1007/978-3-642-04420-5_9},
abstract = {This paper is dedicated to candidate abstractions to capture
relevant aspects of the integer weighted automata. The
expected effect of applying these abstractions is studied to
build the deterministic reachability graphs allowing us to
semi-decide the positivity problem on these automata.
Moreover, the papers reports on the implementations and
experimental results, and discusses other encodings.}
}
@article{BCHK-ijfcs09,
publisher = {World Scientific},
journal = {International Journal of Foundations of Computer Science},
author = {Boichut, Yohan and Courbis, Rom{\'e}o and H{\'e}am,
Pierre-Cyrille and Kouchnarenko, Olga},
title = {Handling Non-left Linear Rules when Completing Tree Automata},
volume = 20,
number = 5,
pages = {837-849},
year = 2009,
month = oct,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHK-ijfcs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHK-ijfcs09.pdf},
doi = {10.1142/S0129054109006917},
abstract = {This paper addresses the following general problem of tree
regular model-checking: decide whether \(\mathcal{R}^*(\mathcal{L}) \cap
\mathcal{L}_p = \emptyset\) where \(\mathcal{R}^*\) is the reflexive and
transitive closure of a successor relation induced by a term rewriting
system~\(\mathcal{R}\), and \(\mathcal{L}\) and~\(\mathcal{L}_p\) are both
regular tree languages. We~develop an automatic approximation-based
technique to handle this---undecidable in general---problem in the case
when term rewriting system rules are non left-linear.}
}
@article{BDL-apal09,
publisher = {Elsevier Science Publishers},
journal = {Annals of Pure and Applied Logics},
author = {Brochenin, R{\'e}mi and Demri, St{\'e}phane and Lozes,
{\'E}tienne},
title = {Reasoning about sequences of memory states},
volume = {161},
number = {3},
pages = {305-323},
year = 2009,
month = dec,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDL-apal09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDL-apal09.pdf},
doi = {10.1016/j.apal.2009.07.004},
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_1^0\)-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{BCDL-formats09,
address = {Budapest, Hungary},
month = sep,
year = 2009,
volume = 5813,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ouaknine, Jo{\"e}l and Vaandrager, Frits},
acronym = {{FORMATS}'09},
booktitle = {{P}roceedings of the 7th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'09)},
author = {Bulychev, Peter and Chatain, {\relax Th}omas and David,
Alexandre and Larsen, Kim G.},
title = {Checking simulation relation between timed game automata},
pages = {73-87},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCDL-formats09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCDL-formats09.pdf},
doi = {10.1007/978-3-642-04368-0_8},
abstract = {In this paper we focus on property-preserving preorders between
timed game automata and their application to control of
partially observable systems. We define timed weak
alternating simulation as a preorder between timed game
automata, which preserves controllability. We define the
rules of building a symbolic turn-based two-player game such
that the existence of a winning strategy is equivalent to
the simulation being satisfied. We also propose an
on-the-fly algorithm for solving this game. This simulation
checking method can be applied to the case of
non-alternating or strong simulations as well. We illustrate
our algorithm by a case study and report on results.}
}
@inproceedings{HP-qest09,
address = {Budapest, Hungary},
month = sep,
year = 2009,
publisher = {{IEEE} Computer Society Press},
acronym = {{QEST}'09},
booktitle = {{P}roceedings of the 6th {I}nternational
{C}onference on {Q}uantitative
{E}valuation of {S}ystems
({QEST}'09)},
author = {Haddad, Serge and Pekergin, Nihal},
title = {Using Stochastic Comparison for Efficient
Model Checking of Uncertain {M}arkov Chains},
pages = {177-186},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HP-qest09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HP-qest09.pdf},
doi = {10.1109/QEST.2009.42},
abstract = {We consider model checking of Discrete Time Markov Chains~(DTMC)
with transition probabilities which are not exactly known but lie in a
given interval. Model checking a Probabilistic Computation Tree
Logic~(PCTL) formula for interval-valued DTMCs~(IMC) has been shown to be
NP hard and co-NP hard. Since the state space of a realistic DTMC is
generally huge, these lower bounds prevent the application of exact
algorithms for such models. Therefore we propose to apply the stochastic
comparison method to check an extended version of PCTL for IMCs. More
precisely, we first design linear time algorithms to quantitatively
analyze IMCs. Then we develop an efficient, semi-decidable PCTL model
checking procedure for IMCs. Furthermore, our procedure returns more
refined answers than traditional ones: YES, NO, DON'T~KNOW. Thus we may
provide useful partial information for modelers in the {"}DON'T~KNOW{"}
case.}
}
@inproceedings{CFLS-esorics09,
address = {Saint~Malo, France},
month = sep,
year = 2009,
volume = 5789,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Backes, Michael and Ning, Peng},
acronym = {{ESORICS}'09},
booktitle = {{P}roceedings of the 14th {E}uropean {S}ymposium on
{R}esearch in {C}omputer {S}ecurity ({ESORICS}'09)},
author = {Centenaro, Matteo and Focardi, Riccardo and
Luccio, Flaminia L. and Steel, Graham},
title = {Type-based Analysis of {PIN} Processing {API}s},
pages = {53-68},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CFLS-esorics09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CFLS-esorics09.pdf},
doi = {10.1007/978-3-642-04444-1_4},
abstract = {We examine some known attacks on the PIN verification framework,
based on weaknesses of the security API for the tamper-resistant Hardware
Security Modules used in the network. We specify this API in an imperative
language with cryptographic primitives, and show how its flaws are
captured by a notion of robustness that extends the one of Myers,
Sabelfeld and Zdancewic to our cryptographic setting. We~propose an
improved API, give an extended type system for assuring integrity and for
preserving confidentiality via randomized and non-randomized encryptions,
and show our new API to be type-checkable.}
}
@inproceedings{CS-esorics09,
address = {Saint~Malo, France},
month = sep,
year = 2009,
volume = 5789,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Backes, Michael and Ning, Peng},
acronym = {{ESORICS}'09},
booktitle = {{P}roceedings of the 14th {E}uropean {S}ymposium on
{R}esearch in {C}omputer {S}ecurity ({ESORICS}'09)},
author = {Cortier, V{\'e}ronique and Steel, Graham},
title = {A~generic security {API} for symmetric key management on
cryptographic devices},
pages = {605-620},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CS-esorics09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CS-esorics09.pdf},
doi = {10.1007/978-3-642-04444-1_37},
abstract = {Security APIs are used to define the boundary between trusted
and untrusted code. The security properties of existing APIs are not
always clear. In~this paper, we~give a new generic API for managing
symmetric keys on a trusted cryptographic device. We state and prove
security properties for our API. In~particular, our API offers a high
level of security even when the host machine is controlled by an attacker.
Our API is generic in the sense that it can implement a wide variety of
(symmetric~key) protocols. As a proof of concept, we give an algorithm for
automatically instantiating the API commands for a given key management
protocol. We demonstrate the algorithm on a set of key establishment
protocols from the Clark-Jacob suite.}
}
@article{CAM-jcss09,
publisher = {Elsevier Science Publishers},
journal = {Journal of Computer and System Sciences},
author = {Cautis, Bogdan and Abiteboul, Serge and Milo, Tova},
title = {Reasoning about {XML} update constraints},
month = sep,
year = 2009,
volume = 75,
number = 6,
pages = {336-358},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CAM-jcss09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CAM-jcss09.pdf},
doi = {10.1016/j.jcss.2009.02.001},
abstract = {We introduce in this paper a class of constraints for describing
how an XML document can evolve, namely \emph{XML update
constraints}. For these constraints, we~study the implication
problem, giving algorithms and complexity results for
constraints of varying expressive power. Besides classical
constraint implication, we also consider an instance-based
approach in which we take into account data. More precisely,
we study implication with respect to a current tree
instance, resulting from a series of unknown updates. The
main motivation of our work is reasoning about data
integrity under update restrictions in contexts where owners
may lose control over their data, such as in publishing or
exchange.}
}
@inproceedings{FS-mfcs09,
address = {Novy Smokovec, Slovakia},
month = aug,
year = 2009,
volume = 5734,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Kr{\'a}lovi{\v c}, Rastislav and Niwi{\'n}ski, Damian},
acronym = {{MFCS}'09},
booktitle = {{P}roceedings of the 34th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'09)},
author = {Figueira, Diego and Segoufin, Luc},
title = {Future-looking logics on data words and trees},
pages = {331-343},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FS-mfcs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FS-mfcs09.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/FS-mfcs09.ps},
doi = {10.1007/978-3-642-03816-7_29},
abstract = {In a data word or a data tree each position carries a label
from a finite alphabet and a data value from an infinite domain. These
models have been considered in the realm of semistructured data, timed
automata and extended temporal logics.\par
Over data words we consider the logic 1-reg-LTL(\(\textbf{F}\)), that
extends LTL(\(\textbf{F}\)) with one register for storing data values for
later comparisons. We show that satisfiability over data words of
1-reg-LTL(\(\textbf{F}\)) is already not primitive recursive. We also show
that the extension of 1-reg-LTL(\(\textbf{F}\)) with either the reverse
modality \(\textbf{F}^{-1}\) or with one extra register is undecidable.
All those lower bounds were already known for
1-reg-LTL(\(\textbf{X}\),\(\textbf{F}\)) and our results essentially show
that the \(\textbf{X}\) modality was not necessary.\par
Moreover we show that over data trees similar lower bounds hold for
certain fragments of XPATH.}
}
@article{DG-jlc09,
publisher = {Oxford University Press},
journal = {Journal of Logic and Computation},
author = {Demri, St{\'e}phane and Gascon, R{\'e}gis},
title = {The Effects of Bounding Syntactic Resources on {P}resburger
{LTL}},
pages = {1541-1575},
volume = {19},
number = {6},
month = dec,
year = 2009,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DG-jlc09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DG-jlc09.pdf},
doi = {10.1093/logcom/exp037},
abstract = {LTL over Presburger constraints is the extension of LTL where
the atomic formulae are quantifier-free Presburger formulae having as free
variables the counters at different states of the model. This logic is
known to admit undecidable satisfiability and model-checking problems.
We~study decidability and complexity issues for fragments of LTL with
Presburger constraints obtained by restricting the syntactic resources of
the formulae (the number of variables, the maximal distance between two
states for which counters can be compared and, to a smaller extent, the
set of Presburger constraints) while preserving the strength of the
logical operators. We~provide a complete picture refining known results
from the literature. We~show that model-checking and satisfiability
problems for the fragments of LTL with difference constraints restricted
to two variables and distance one and to one variable and distance two are
highly undecidable, enlarging significantly the class of known undecidable
fragments. On the positive side, we prove that the fragment restricted to
one variable and to distance one augmented with propositional variables is
\textsc{pspace}-complete. Since the atomic formulae can state quantitative
properties on the counters, this extends some results about model-checking
pushdown systems and one-counter automata. In~order to establish the
pspace upper bound, we show that the nonemptiness problem for B{\"u}chi
one-counter automata taking values in~\(\mathbb{Z}\) and allowing zero
tests and sign tests, is~only \textsc{nlogspace}-complete. Finally,
we~establish that model-checking one-counter automata with complete
quantifier-free Presburger LTL restricted to one variable is also
\textsc{pspace}-complete whereas the satisfiability problem is
undecidable.}
}
@inproceedings{KAS-arspawits09,
address = {York, UK},
month = aug,
year = 2009,
volume = 5511,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Degano, Pierpaolo and Vigan{\`o}, Luca},
acronym = {{ARSPA-WITS}'09},
booktitle = {{R}evised {S}elected {P}apers of the {J}oint {W}orkshop
on {A}utomated {R}easoning for {S}ecurity {P}rotocol {A}nalysis and
{I}ssues in the {T}heory of {S}ecurity ({ARSPA-WITS}'09)},
author = {Keighren, Gavin and Aspinall, David and Steel, Graham},
title = {Towards a Type System for Security {API}s},
pages = {173-192},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KAS-arspawits09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KAS-arspawits09.pdf},
doi = {10.1007/978-3-642-03459-6_12},
abstract = {Security API analysis typically only considers a subset of an
API's functions, with results bounded by the number of function calls.
Furthermore, attacks involving partial leakage of sensitive information
are usually not covered. Type-based static analysis has the potential to
alleviate these shortcomings. To that end, we present a type system for
secure information flow based upon the one of Volpano, Smith and Irvine,
extended with types for cryptographic keys and ciphertext similar to those
in Sumii and Pierce. In~contrast to some other type systems, the
encryption and decryption of keys does not require special treatment. We
show that a well-typed sequence of commands is non-interferent, based upon
a definition of indistinguishability where, in certain circumstances, the
adversary can distinguish between ciphertexts that correspond to encrypted
public data.}
}
@inproceedings{FS-arspawits09,
address = {York, UK},
month = aug,
year = 2009,
volume = 5511,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Degano, Pierpaolo and Vigan{\`o}, Luca},
acronym = {{ARSPA-WITS}'09},
booktitle = {{R}evised {S}elected {P}apers of the {J}oint {W}orkshop
on {A}utomated {R}easoning for {S}ecurity {P}rotocol {A}nalysis and
{I}ssues in the {T}heory of {S}ecurity ({ARSPA-WITS}'09)},
author = {Fr{\"o}schle, Sibylle and Steel, Graham},
title = {Analysing {PKCS}\#11 Key Management {API}s with Unbounded
Fresh Data},
pages = {92-106},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FS-arspawits09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FS-arspawits09.pdf},
doi = {10.1007/978-3-642-03459-6_7},
abstract = {We extend Delaune, Kremer and Steel's framework for analysis of
PKCS#11-based APIs from bounded to unbounded fresh data. We achieve this
by: formally defining the notion of an \emph{attribute policy}; showing
that a well-designed API should have a certain class of policy we call
\emph{complete}; showing that APIs with complete policies may be safely
abstracted to APIs where the attributes are fixed; and proving that these
\emph{static} APIs can be analysed in a small bounded model such that
security properties will hold for the unbounded case. We automate analysis
in our framework using the SAT-based security protocol model checker
SATMC. We show that a symmetric key management subset of the Eracom
PKCS#11 API, used in their ProtectServer product, preserves the secrecy of
sensitive keys for unbounded numbers of fresh keys and \emph{handles},
i.e.~pointers to keys. We also show that this API is not robust: if~an
encryption key is lost to the intruder, SATMC finds an attack whereby all
the keys may be compromised.}
}
@inproceedings{CDK-secret09,
address = {Port Jefferson, New~York, USA},
month = jul,
year = 2009,
editor = {Comon{-}Lundh, Hubert and Meadows, Catherine},
acronym = {{SecReT}'09},
booktitle = {{P}reliminary {P}roceedings of the 4th
{I}nternational {W}orkshop on {S}ecurity and {R}ewriting {T}echniques
({SecReT}'09)},
author = {Ciob{\^a}c{\u{a}}, {\c{S}}tefan and Delaune, St{\'e}phanie and
Kremer, Steve},
title = {Computing knowledge in security protocols under convergent
equational theories},
pages = {47-58},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDK-secret09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDK-secret09.pdf},
abstract = {We propose a procedure for the intruder deduction problem and
for the static equivalence problem, in the case where cryptographic
primitives are modeled by a convergent equational theory. Our~procedure
terminates on a wide range of equational theories. In~particular,
we~obtain a new decidability result for a theory of trapdoor commitment
that we encountered in the study of e-voting protocols. We~also provide a
prototype implementation.}
}
@inproceedings{ACD-secret09,
address = {Port Jefferson, New~York, USA},
month = jul,
year = 2009,
editor = {Comon{-}Lundh, Hubert and Meadows, Catherine},
acronym = {{SecReT}'09},
booktitle = {{P}reliminary {P}roceedings of the 4th
{I}nternational {W}orkshop on {S}ecurity and {R}ewriting {T}echniques
({SecReT}'09)},
author = {Arnaud, Mathilde and Cortier, V{\'e}ronique and
Delaune, St{\'e}phanie},
title = {Modeling and Verifying Ad Hoc Routing Protocol},
pages = {33-46},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACD-secret09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACD-secret09.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ACD-secret09.ps},
abstract = {Mobile ad hoc networks consist of mobile wireless devices which
autonomously organize their infrastructure. In~such a network, a~central
issue, ensured by routing protocols, is to find a route from one device to
another. Those protocols use cryptographic mechanisms in order to prevent
a malicious node from compromising the discovered route.\par
We present a calculus for modeling and reasoning about security protocols,
including in particular secured routing protocols. Our calculus extends
standard symbolic models to take into account the characteristics of
routing protocols and to model wireless communication in a more accurate
way. Then, by using constraint solving techniques, we propose a decision
procedure for analyzing routing protocols for a bounded number of sessions
and for a fixed network topology. We~demonstrate the usage and usefulness
of our approach by analyzing the protocol SRP applied to~DSR.}
}
@inproceedings{KMT-secret09,
address = {Port Jefferson, New~York, USA},
month = jul,
year = 2009,
editor = {Comon{-}Lundh, Hubert and Meadows, Catherine},
acronym = {{SecReT}'09},
booktitle = {{P}reliminary {P}roceedings of the 4th
{I}nternational {W}orkshop on {S}ecurity and {R}ewriting {T}echniques
({SecReT}'09)},
author = {Kremer, Steve and Mercier, Antoine and Treinen, Ralf},
title = {Reducing Equational Theories for the Decision of Static
Equivalence (Preliminary Version)},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KMT-secret09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KMT-secret09.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/KMT-secret09.ps},
abstract = {Static equivalence is a well established notion of
indistinguishability of sequences of terms which is useful in the symbolic
analysis of cryptographic protocols. Static equivalence modulo equational
theories allows a more accurate representation of cryptographic primitives
by modelling properties of operators by equational axioms. We develop a
method that allows in some cases to simplify the task of deciding static
equivalence in a multi-sorted setting, by removing a symbol from the term
signature and reducing the problem to several simpler equational theories.
We illustrate our technique at hand of bilinear pairings.}
}
@article{ACEF-ijfcs09,
publisher = {World Scientific},
journal = {International Journal of Foundations of Computer Science},
author = {Andr{\'e}, {\'E}tienne and Chatain, {\relax Th}omas and
Encrenaz, Emmanuelle and Fribourg, Laurent},
title = {An Inverse Method for Parametric Timed Automata},
volume = 20,
number = 5,
pages = {819-836},
month = oct,
year = 2009,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACEF-ijfcs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACEF-ijfcs09.pdf},
doi = {10.1142/S0129054109006905},
abstract = {We consider in this paper systems modeled by timed automata. The
timing bounds involved in the action guards and location invariants of our
timed automata are not constants, but parameters. Those parametric timed
automata allow the modelling of various kinds of timed systems,
\textit{e.g.} communication protocols or asynchronous circuits. We will
also assume that we are given an initial tuple~\(\pi_0\) of values for the
parameters, which corresponds to values for which the system is known to
behave properly. Our goal is to compute a constraint~\(K_0\) on the
parameters, satisfied by~\(\pi_0\), guaranteeing that, under any parameter
valuation satisfying~\(K_0\), the system behaves in the same manner: for any
two parameter valuations satisfying~\(K_0\), the behaviors of the timed
automata are (time-abstract) equivalent, \textit{i.e.}, the traces of execution
viewed as alternating sequences of actions and locations are identical. We
present an algorithm \texttt{InverseMethod} that terminates in the case of acyclic
models, and discuss how to extend it in the cyclic case. We also explain
how to combine our method with classical synthesis methods which are based
on the avoidance of a given set of bad states. A prototype implementation
has been done, and various experiments are described.}
}
@techreport{LSV:09:09,
author = {Goubault{-}Larrecq, Jean},
title = {On a Generalization of a Result by {V}alk and {J}antzen},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2009},
month = may,
type = {Research Report},
number = {LSV-09-09},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-09.pdf},
note = {18~pages},
abstract = {We~show that, under mild assumptions on the effective, well
quasi-ordered set~\(X\), one~can compute a finite basis of an
upward-closed subset~\(U\) of~\(X\) if and only if one can decide whether
\(U \cap \downarrow z\) is empty for every \(z \in \widehat{X}\). Here
\(\widehat{X}\) is the completion of \(X\) as defined in Finkel and
Goubault-Larrecq, {\em Forward Analysis for WSTS, Part~{I:} Completions},
STACS'09, pages 433-444, 2009. This generalizes a useful result proved by
Valk and Jantzen in~1985, which is the case \(X = \\mathbb{N}^k\).}
}
@inproceedings{RBH-formats09,
address = {Budapest, Hungary},
month = sep,
year = 2009,
volume = 5813,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ouaknine, Jo{\"e}l and Vaandrager, Frits},
acronym = {{FORMATS}'09},
booktitle = {{P}roceedings of the 7th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'09)},
author = {Bouillard, Anne and Haar, Stefan and Rosario, Sidney},
title = {Critical paths in the Partial Order Unfolding of a
Stochastic {P}etri Net},
pages = {43-57},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-formats09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-formats09.pdf},
doi = {10.1007/978-3-642-04368-0_6},
abstract = {In concurrent real-time processes, the speed of individual
components has a double impact: on the one hand, the overall
latency of a compound process is affected by the latency of
its components. But, if the composition has race conditions,
the very outcome of the process will also depend on the
latency of component processes. Using stochastic Petri nets,
we investigate the probability of a transition occurrence
being critical for the entire process, i.e. such that a
small increase or decrease of the duration of the occurrence
entails an increase or decrease of the total duration of the
process. The first stage of the analysis focuses on
occurrence nets, as obtained by partial order unfoldings, to
determine criticality of events; we then lift to workflow
nets to investigate criticality of transitions inside a
workflow.}
}
@inproceedings{LA-ictac09,
address = {Kuala Lumpur, Malaysia},
month = aug,
year = 2009,
volume = 5684,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Leucker, Martin and Morgan, Carroll},
acronym = {{ICTAC}'09},
booktitle = {{P}roceedings of the 6th {I}nternational {C}olloquium on
{T}heoretical {A}spects of {C}omputing ({ICTAC}'09)},
author = {Longuet, Delphine and Aiguier, Marc},
title = {Integration Testing from Structured First-Order
Specifications via Deduction Modulo},
pages = {261-276},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LA-ictac09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LA-ictac09.pdf},
doi = {10.1007/978-3-642-03466-4_17},
abstract = {Testing from first-order specifications has mainly been studied
for flat specifications, that are specifications of a single software
module. However, the specifications of large software systems are
generally built out of small specifications of individual modules, by
enriching their union. The aim of integration testing is to test the
composition of modules assuming that they have previously been verified,
i.e. assuming their correctness. One of the main method for the selection
of test cases from first-order specifications, called axiom unfolding, is
based on a proof search for the different instances of the property to be
tested, thus allowing the coverage of this property. The idea here is to
use deduction modulo as a proof system for structured first-order
specifications in the context of integration testing, so as to take
advantage of the knowledge of the correctness of the individual modules.}
}
@inproceedings{andre-ictac09,
address = {Kuala Lumpur, Malaysia},
month = aug,
year = 2009,
volume = 5684,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Leucker, Martin and Morgan, Carroll},
acronym = {{ICTAC}'09},
booktitle = {{P}roceedings of the 6th {I}nternational {C}olloquium on
{T}heoretical {A}spects of {C}omputing ({ICTAC}'09)},
author = {Andr{\'e}, {\'E}tienne},
title = {{IMITATOR}: A~Tool for Synthesizing Constraints on Timing
Bounds of Timed Automata},
pages = {336-342},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/andre-ictac09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/andre-ictac09.pdf},
doi = {10.1007/978-3-642-03466-4_22},
abstract = {We present here Imitator, a tool for synthesizing constraints on
timing bounds (seen as parameters) in the framework of timed automata.
Unlike classical synthesis methods, we take advantage of a given reference
valuation of the parameters for which the system is known to behave
properly. Our aim is to generate a constraint such that, under any
valuation satisfying this constraint, the system is guaranteed to behave,
in terms of alternating sequences of locations and actions, as under the
reference valuation. This is useful for safely relaxing some values of the
reference valuation, and optimizing timing bounds of the system. We have
successfully applied our tool to various examples of asynchronous circuits
and protocols.}
}
@article{RBHJ-tsc08,
publisher = {{IEEE} Computer Society Press},
journal = {IEEE Transactions on Services Computing},
author = {Rosario, Sidney and Benveniste, Albert and Haar, Stefan and
Jard, Claude},
title = {Probabilistic {Q}o{S} and Soft Contracts for
Transaction-Based Web Services Orchestrations},
pages = {187-200},
volume = 1,
number = 4,
month = oct # {-} # dec,
year = 2008,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/RBHJ-tsc08.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/RBHJ-tsc08.pdf},
doi = {10.1109/TSC.2008.17},
abstract = {Service level agreements (SLAs), or contracts, have an
important role in web services. They define the obligations
and rights between the provider of a web service and its
client, about the function and the Quality of the service
(QoS). For composite services like orchestrations, contracts
are deduced by a process called QoS contract composition,
based on contracts established between the orchestration and
the called web services. Contracts are typically stated as
hard guarantees (e.g., response time always less than 5
msec). Using hard bounds is not realistic, however, and more
statistical approaches are needed. In this paper we propose
using soft probabilistic contracts instead, which consist of
a probability distribution for the considered QoS
parameter---in this paper, we focus on timing. We show how to
compose such contracts, to yield a global probabilistic
contract for the orchestration. Our approach is implemented
by the TOrQuE tool. Experiments on TOrQuE show that overly
pessimistic contracts can be avoided and significant room
for safe overbooking exists. An essential component of SLA
management is then the continuous monitoring of the
performance of called web services, to check for violations
of the SLA. We propose a statistical technique for run-time
monitoring of soft contracts.}
}
@inproceedings{BRBH-atpn09,
address = {Paris, France},
month = jun,
year = 2009,
volume = 5606,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Franceschinis, Giuliana and Wolf, Karsten},
acronym = {{PETRI~NETS}'09},
booktitle = {{P}roceedings of the 30th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'09)},
author = {Bouillard, Anne and Rosario, Sidney and
Benveniste, Albert and Haar, Stefan},
title = {Monotonicity in Service Orchestrations},
pages = {263-282},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BRBH-atpn09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BRBH-atpn09.pdf},
doi = {10.1007/978-3-642-02424-5_16},
abstract = {Web Service orchestrations are compositions of different Web
Services to form a new service. The services called during the orchestration
guarantee a given performance to the orchestrater, usually in the form of
contracts.\par
These contracts can be used by the orchestrater to deduce the contract it
can offer to its own clients, by performing contract composition. An
implicit assumption in contract based QoS management is: {"}the better the
component services perform, the better the orchestration's performance
will~be{"}. Thus, contract based QoS management for Web services
orchestrations implicitly assumes monotony.\par
In some orchestrations, however, monotony can be violated, i.e., the
performance of the orchestration improves when the performance of a
component service degrades. This is highly undesirable since it can render
the process of contract composition inconsistent.\par
In this paper we define monotony for orchestrations modelled by Colored
Occurrence Nets (CO-nets) and we characterize the classes of monotonic
orchestrations. We show that few orchestrations are indeed monotonic,
mostly since latency can be traded for quality of data. We also propose a
sound refinement of monotony, called \emph{conditional monotony}, which
forbids this kind of cheating and show that conditional monotony is widely
satisfied by orchestrations. This finding leads to reconsidering the way
SLAs should be formulated.}
}
@inproceedings{BDMR-concur09,
address = {Bologna, Italy},
month = sep,
year = 2009,
volume = 5710,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Bravetti, Mario and Zavattaro, Gianluigi},
acronym = {{CONCUR}'09},
booktitle = {{P}roceedings of the 20th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'09)},
author = {Bouyer, Patricia and Duflot, Marie and Markey, Nicolas and
Renault, Gabriel},
title = {Measuring Permissivity in Finite Games},
pages = {196-210},
doi = {10.1007/978-3-642-04081-8_14},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDMR-concur09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDMR-concur09.pdf},
abstract = {In this paper, we extend the classical notion of strategies in
turn-based finite games by allowing several moves to be selected.
We~define and study a quantitative measure for permissivity of such
strategies by assigning penalties when blocking transitions. We~prove that
for reachability objectives, most permissive strategies exist, can be
chosen memoryless, and can be computed in polynomial time, while it is in
\(\textsf{NP}\cap\textsf{coNP}\) for discounted and mean penalties.}
}
@incollection{EFH-tsmaai09,
author = {El~Fallah Seghrouchni, Amal and Haddad, Serge},
title = {Interop{\'e}rabilit{\'e} des syst{\`e}mes multi-agents
{\`a} l'aide des services web},
booktitle = {Technologies des syst{\`e}mes multi-agents et
applications industrielles},
editor = {El~Fallah Seghrouchni, Amal and Briot, Jean-Pierre},
publisher = {Herm{\`e}s},
year = 2009,
month = apr,
pages = {77-99},
chapter = 3,
url = {http://www.lavoisier.fr/notice/fr2746217850.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 = {}
}
@inproceedings{HKPPT-acc09,
address = {Saint Louis, Missouri, USA},
month = jun,
year = 2009,
acronym = {{ACC}'09},
booktitle = {{P}roceedings of the 28th {A}merican {C}ontrol
{C}onference ({ACC}'09)},
author = {Haddad, Serge and Kordon, Fabrice and Petrucci, Laure and
Pradat{-}Peyre, Jean-Fran{\c{c}}ois and Tr{\`e}ves, Nicolas},
title = {Efficient State-Based Analysis by Introducing Bags in
{P}etri Nets Color Domains},
pages = {5018-5025},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HKPPT-acc09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HKPPT-acc09.pdf},
doi = {10.1109/ACC.2009.5160020},
abstract = {The use of high-level nets, such as coloured Petri nets, is very
convenient for modelling complex controllable systems in order to have a
compact, readable and structured specification. However, when coming to
the analysis phase, using too elaboratc types becomes a burden.\par
A good trade-off between expressivene and analy is capabilities is then to
have only imple types, which is achieved with symmetric nels. These latter
nels enjoy the possibility of generating a symbolic reachability gralph,
which is much smallcr than the whole state space and still allows for
exhaustive analysis.\par
In this paper, we extend the symmetric net model with bags on arcs. Hence,
variables can be bags of tokens,leading to more flexible models. We show
that symmetric nets with bags also allow for applying the symbolic
reachability graph technique with application to deadlock detection and
more generally for safety properties.}
}
@misc{dots-2.2,
author = {Chatain, {\relax Th}omas and Gastin, Paul and Muscholl, Anca
and Sznajder, Nathalie and Walukiewicz, Igor and
Zeitoun, Marc},
title = {Distributed control for restricted specifications},
howpublished = {Deliverable DOTS~2.2 (ANR-06-SETI-003)},
year = 2009,
month = mar
}
@misc{dots-1.2a,
author = {Bouyer, Patricia and Laroussinie, Fran{\c{c}}ois and
Lime, Didier and Markey, Nicolas},
title = {Synthesis of timed controllers},
howpublished = {Deliverable DOTS~1.2a (ANR-06-SETI-003)},
year = 2009,
month = mar
}
@article{DHS-tose09,
publisher = {{IEEE} Computer Society Press},
journal = {IEEE Transactions on Software Engineering},
author = {Donatelli, Susanna and Haddad, Serge and Sproston, Jeremy},
title = {Model Checking Timed and Stochastic Properties with {CSL\textsuperscript{TA}}},
volume = 35,
number = 2,
month = mar # {-} # apr,
year = 2009,
pages = {224-240},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DHS-tose09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DHS-tose09.pdf},
doi = {10.1109/TSE.2008.108},
abstract = {Markov chains are a well-known stochastic process that provide
a balance between being able to adequately model the system's behavior and
being able to afford the cost of the model solution. Systems can be
modelled directly as Markov chains, or with a higher-level formalism for
which Markov chains represent the underlying semantics. Markov chains are
widely used to study the performance of computer and telecommunication
systems. The definition of stochastic temporal logics like Continuous
Stochastic Logic~(CSL) and its variant~asCSL, and of their model-checking
algorithms, allows a unified approach to the verification of systems,
allowing the mix of performance evaluation and probabilistic verification.
\par
In this paper we present the stochastic logic CSL\textsuperscript{TA} ,
which is more expressive than CSL and~asCSL, and in which properties can
be specified using automata (more precisely, timed automata with a single
clock). The extension with respect to expressiveness allows the
specification of properties referring to the probability of a finite
sequence of timed events. A~typical example is the responsiveness property
{"}with probability at least~0.75, a~message sent at time~0 by a
system~\(A\) will be received before time~5 by system~\(B\) and the
acknowledgment will be back at~\(A\) before time~7{"}, a property that
cannot be expressed in either CSL or~asCSL. Furthermore, the choice of
using automata rather than the classical temporal operators Next and Until
should help in enlarging the accessibility of model checking to a larger
public. We~also present a model-checking algorithm
for~CSL\textsuperscript{TA}.}
}
@inproceedings{AFGM-tableaux09,
address = {Oslo, Norway},
month = jul,
year = 2009,
volume = 5607,
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer},
editor = {Giese, Martin and Waaler, Arild},
acronym = {{TABLEAUX}'09},
booktitle = {{P}roceedings of the 18th {I}nternational
{W}orkshop on {T}heorem {P}roving with
{A}nalytic {T}ableaux and {R}elated {M}ethods
({TABLEAUX}'09)},
author = {Areces, Carlos and Figueira, Diego and Gor{\'\i}n, Daniel
and Mera, Sergio},
title = {Tableaux and Model Checking for Memory Logics},
pages = {47-61},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AFGM-tableaux09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AFGM-tableaux09.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/AFGM-tableaux09.ps},
doi = {10.1007/978-3-642-02716-1_5},
abstract = {Memory logics are modal logics whose semantics is specified in
terms of relational models enriched with additional data structure to
represent memory. The logical language is then extended with a collection
of operations to access and modify the data structure. In~this paper we
study their satisfiability and the model checking problems.\par
We first give sound and complete tableaux calculi for the memory logic
\(ML(k,r,e)\) (the basic modal language extended with the operator \(r\) used
to memorize a state, the operator \(e\) used to wipe out the memory, and the
operator \(k\) used to check if the current point of evaluation is
memorized) and some of its sublanguages. As the satisfiability problem of
\(ML(k,r,e)\) is undecidable, the tableau calculus we present is non
terminating. Hence, we furthermore study a variation that ensures
termination, at the expense of completeness, and we use model checking to
ensure soundness. Secondly, we show that the model checking problem is
PSpace-complete.}
}
@inproceedings{DHL-mbt09,
address = {York, UK},
month = oct,
year = 2009,
number = {2},
volume = {253},
series = {Electronic Notes in Theoretical Computer Science},
publisher = {Elsevier Science Publishers},
acronym = {{MBT}'09},
booktitle = {{P}roceedings of the 5th Workshop on Model-Based Testing
({MBT}'09)},
author = {Dadeau, Fr{\'e}d{\'e}ric and H{\'e}am, Pierre-Cyrille and
Levrey, Jocelyn},
title = {On the Use of Uniform Random Generation of Automata for Testing},
pages = {37-51},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DHL-mbt09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DHL-mbt09.pdf},
doi = {10.1016/j.entcs.2009.09.050 },
abstract = {Developing efficient and automatic testing techniques is one of
the major challenges facing software validation community. In this paper,
we show how a uniform random generation process of finite automata,
developed in a recent work by Bassino and Nicaud, is relevant for many
faces of automatic testing. The main contribution is to show how to
combine two major testing approaches: model-based testing and random
testing. This leads to a new testing technique successfully experimented
on a realistic case study. We also illustrate how the power of random
testing, applied on a Chinese Postman Problem implementation, points out
an error in a well-known algorithm. Finally, we provide some statistics on
model-based testing algorithms.}
}
@article{BHK-njc09,
journal = {Nordic Journal of Computing},
author = {Boichut, Yohan and H{\'e}am, Pierre-Cyrille and Kouchnarenko,
Olga},
title = {Approximation-based Tree Regular Model-Checking},
volume = {14},
number = {3},
pages = {216-241},
month = oct,
year = 2008,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHK-njc09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHK-njc09.pdf},
abstract = {This paper addresses the following general problem of tree
regular model-checking: decide whether \(\mathcal{R}^*(L)\cap L_{p} =
\varnothing\) where \(\mathcal{R}^*\) is the reflexive and transitive
closure of a successor relation induced by a term rewriting
system~\(\mathcal{R}\), and \(L\) and \(L_p\) are both regular tree
languages. We develop an automatic approximation-based technique to handle
this---undecidable in general---problem in most practical cases, extending
a recent work by Feuillade, Genet and Viet~Triem~Tong. We also make this
approach fully automatic for practical validation of security protocols.}
}
@inproceedings{CDK-cade09,
address = {Montreal, Canada},
month = aug,
year = 2009,
volume = {5663},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Schmidt, Renate},
acronym = {{CADE}'09},
booktitle = {{P}roceedings of the 22nd {I}nternational
{C}onference on {A}utomated {D}eduction
({CADE}'09)},
author = {Ciob{\^a}c{\u{a}}, {\c{S}}tefan and Delaune, St{\'e}phanie and
Kremer, Steve},
title = {Computing knowledge in security protocols under convergent
equational theories},
pages = {355-370},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDK-cade09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDK-cade09.pdf},
doi = {10.1007/978-3-642-02959-2_27},
abstract = {In the symbolic analysis of security protocols, two classical
notions of knowledge, deducibility and indistinguishability, yield
corresponding decision problems. We~propose a procedure for both problems
under arbitrary convergent equational theories. Our~procedure terminates
on a wide range of equational theories. In~particular, we~obtain a new
decidability result for a theory we encountered when studying electronic
voting protocols. We~also provide a prototype implementation.}
}
@inproceedings{CHK-ciaa09,
address = {Sydney, Australia},
month = jul,
year = 2009,
volume = 5642,
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
editor = {Maneth, Sebastian},
acronym = {{CIAA}'09},
booktitle = {{P}roceedings of the 14th {I}nternational
{C}onference on {I}mplementation and
{A}pplication of {A}utomata
({CIAA}'09)},
author = {Courbis, Rom{\'e}o and H{\'e}am, Pierre-Cyrille and
Kouchnarenko, Olga},
title = {{TAGED} Approximations for Veriying Temporal Patterns},
pages = {135-144},
doi = {10.1007/978-3-642-02979-0_17},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CHK-ciaa09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CHK-ciaa09.pdf},
abstract = {This paper investigates the use of tree automata with global
equalities and disequalities (TAGED for short) in reachability analysis
over term rewriting systems (TRSs). The reachability problem being in
general undecidable on non terminating TRSs, we provide TAGED-based
construction, and then design approximation-based semi-decision procedures
to model-check useful temporal patterns on infinite state rewriting
graphs. To show that the above TAGED-based construction can be effectively
carried out, complexity analysis for rewriting TAGED-definable languages
is given.}
}
@inproceedings{HNS-ciaa09,
address = {Sydney, Australia},
month = jul,
year = 2009,
volume = 5642,
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
editor = {Maneth, Sebastian},
acronym = {{CIAA}'09},
booktitle = {{P}roceedings of the 14th {I}nternational
{C}onference on {I}mplementation and
{A}pplication of {A}utomata
({CIAA}'09)},
author = {H{\'e}am, Pierre-Cyrille and Nicaud, Cyril and Schmitz, Sylvain},
title = {Random Generation of Deterministic Tree (Walking) Automata},
pages = {115-124},
doi = {10.1007/978-3-642-02979-0_15},
url = {http://hal.inria.fr/inria-00408316},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HNS-ciaa09.pdf},
abstract = {Uniform random generators deliver a simple empirical means to
estimate the average complexity of an algorithm. We present a general
rejection algorithm that generates sequential letter-to-letter transducers
up to isomorphism. We tailor this general scheme to randomly generate
deterministic tree walking automata and deterministic top-down tree
automata. We apply our implementation of the generator to the estimation
of the average complexity of a deterministic tree walking automata to
nondeterministic top-down tree automata construction we also implemented.}
}
@inproceedings{BG-dlt09,
address = {Stuttgart, Germany},
month = jun # {-} # jul,
year = 2009,
volume = {5583},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Diekert, Volker and Nowotka, Dirk},
acronym = {{DLT}'09},
booktitle = {{P}roceedings of the 13th {I}nternational
{C}onference on {D}evelopments in {L}anguage {T}heory
({DLT}'09)},
author = {Bollig, Benedikt and Gastin, Paul},
title = {Weighted versus Probabilistic Logics},
pages = {18-38},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BG-dlt09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BG-dlt09.pdf},
doi = {10.1007/978-3-642-02737-6_2},
abstract = {While a mature theory around logics such as MSO, LTL, and CTL
has been developed in the pure boolean setting of finite automata,
weighted automata lack such a natural connection with (temporal) logic and
related verification algorithms. In this paper, we will identify weighted
versions of MSO and CTL that generalize the classical logics and even
other quantitative extensions such as probabilistic CTL. We establish
expressiveness results on our logics giving translations from weighted and
probabilistic CTL into weighted MSO.}
}
@inproceedings{AGM-pods09,
address = {Providence, Rhode Island, USA},
month = jun # {-} # jul,
year = 2009,
publisher = {ACM Press},
editor = {Su, Jianwen},
acronym = {{PODS}'09},
booktitle = {{P}roceedings of the 28th {A}nnual
{ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium
on {P}rinciples of {D}atabase {S}ystems
({PODS}'09)},
author = {Abiteboul, Serge and Gottlob, Georg and Manna, Marco},
title = {Distributed {XML} Design},
pages = {247-258},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AGM-pods09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AGM-pods09.pdf},
doi = {10.1145/1559795.1559833},
abstract = {A \emph{distributed XML document} is an XML document that spans
several machines or Web repositories. We assume that a distribution design
of the document tree is given, providing an XML tree some of whose leaves
are {"}docking points{"}, to which XML subtrees can be attached. These
subtrees may be provided and controlled by peers at remote locations, or
may correspond to the result of function calls, e.g., Web services. If a
global type~\(t\), e.g. a DTD, is specified for a distributed
document~\(T\), it~would be most desirable to be able to break this type
into a collection of local types, called a local typing, such that the
document satisfies~\(t\) if and only if each peer (or~function) satisfies
its local type. In this paper we lay out the fundamentals of a theory of
local typing and provide formal definitions of three main variants of
locality: local typing, maximal local typing, and perfect typing, the
latter being the most desirable. We study the following relevant decision
problems: (i)~given a typing for a design, determine whether it is local,
maximal local, or perfect; (ii)~given a design, establish whether a
(maximal) local, or perfect typing does exist. For some of these problems
we provide tight complexity bounds (polynomial space), while for the
others we show exponential upper bounds. A~main contribution is a
polynomial-space algorithm for computing a perfect typing in this context,
if it exists.}
}
@inproceedings{ABM-pods09,
address = {Providence, Rhode Island, USA},
month = jun # {-} # jul,
year = 2009,
publisher = {ACM Press},
editor = {Su, Jianwen},
acronym = {{PODS}'09},
booktitle = {{P}roceedings of the 28th {A}nnual
{ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium
on {P}rinciples of {D}atabase {S}ystems
({PODS}'09)},
author = {Abiteboul, Serge and Bourhis, Pierre and Marinoiu, Bogdan},
title = {Satisfiability and relevance for queries over active documents},
pages = {87-96},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABM-pods09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABM-pods09.pdf},
doi = {10.1145/1559795.1559810},
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. This is a challenging problem that has generated recently a lot
of attention; see~Web~2.0. For capturing interactions between Web
components, we use active documents interacting with the rest of the world
via streams of updates. Their input streams specify updates to the
document (in the spirit of RSS feeds), whereas their output streams are
defined by queries on the document. In most of the paper, the focus is on
input streams where the updates are only insertions, although we do
consider also deletions. \par
We introduce and study two fundamental concepts in this setting, namely,
satisfiability and relevance. Some fact is \emph{satisfiable} for an
active document and a query if it has a chance to be in the result of the
query in some future state. Given an active document and a query, a call
in the document is \emph{relevant} if the data brought by this call has a
chance to impact the answer to the query. We analyze the complexity of
computing satisfiability in our core model (insertions only) and for
extensions (e.g., with deletions). We also analyze the complexity of
computing relevance in the core model.}
}
@inproceedings{BLPS-pods09,
address = {Providence, Rhode Island, USA},
month = jun # {-} # jul,
year = 2009,
publisher = {ACM Press},
editor = {Su, Jianwen},
acronym = {{PODS}'09},
booktitle = {{P}roceedings of the 28th {A}nnual
{ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium
on {P}rinciples of {D}atabase {S}ystems
({PODS}'09)},
author = {Barcel{\'o}, Pablo and Libkin, Leonid and Poggi, Antonella and
Sirangelo, Cristina},
title = {{XML} with Incomplete Information: Models, Properties, and
Query Answering},
pages = {237-246},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLPS-pods09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BLPS-pods09.pdf},
doi = {10.1145/1559795.1559832},
abstract = {We study models of incomplete information for XML, their
computational properties, and query answering. While our approach is
motivated by the study of relational incompleteness, incomplete
information in XML documents may appear not only as null values but also
as missing structural information. Our goal is to provide a classification
of incomplete descriptions of XML documents, and separate features---or
groups of features---that lead to hard computational problems from those
that admit efficient algorithms. Our classification of incomplete
information is based on the combination of null values with partial
structural descriptions of documents. The key computational problems we
consider are consistency of partial descriptions, representability of
complete documents by incomplete ones, and query answering. We show how
factors such as schema information, the presence of node ids, and missing
structural information affect the complexity of these main computational
problems, and find robust classes of incomplete XML descriptions that
permit tractable query evaluation.}
}
@inproceedings{fig-pods09,
address = {Providence, Rhode Island, USA},
month = jun # {-} # jul,
year = 2009,
publisher = {ACM Press},
editor = {Su, Jianwen},
acronym = {{PODS}'09},
booktitle = {{P}roceedings of the 28th {A}nnual
{ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium
on {P}rinciples of {D}atabase {S}ystems
({PODS}'09)},
author = {Figueira, Diego},
title = {Satisfiability of Downward {XP}ath with Data Equality Tests},
pages = {197-206},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/fig-pods09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/fig-pods09.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/fig-pods09.ps},
doi = {10.1145/1559795.1559827},
abstract = {In this work we investigate the satisfiability problem for the
logic \(\textup{XPath}(\downarrow,\downarrow^{*},=)\), that includes all
downward axes as well as equality and inequality tests. We address this
problem in the absence of DTDs and the sibling axis. We prove that this
fragment is decidable, and we nail down its complexity, showing the
problem to be ExpTime-complete. The result also holds when path
expressions allow closure under the Kleene star operator. To obtain these
results, we introduce a new automaton model over data trees that captures
\(\textup{XPath}(\downarrow,\downarrow^*,=)\) and has an ExpTime emptiness
problem. Furthermore, we give the exact complexity of several
downward-looking fragments. }
}
@inproceedings{PS-icalp09,
address = {Rhodes, Greece},
month = jul,
year = 2009,
volume = 5556,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Albers, Susanne and Marchetti-Spaccamela, Alberto and
Matias, Yossi and Thomas, Wolfgang},
acronym = {{ICALP}'09},
booktitle = {{P}roceedings of the 36th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'09)},
author = {Place, {\relax Th}omas and Segoufin, Luc},
title = {A decidable characterization of Locally Testable Tree Languages},
pages = {285-296},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PS-icalp09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PS-icalp09.pdf},
doi = {10.1007/978-3-642-02930-1_24},
abstract = {A regular tree language~\(L\) is locally testable if the
membership of a tree into~\(L\) depends only on the presence or
absence of some neighborhoods in the tree. In~this paper we
show that it is decidable whether a regular tree language is
locally testable.}
}
@article{goubault-jcs09,
publisher = {{IOS} Press},
journal = {Journal of Computer Security},
author = {Goubault{-}Larrecq, Jean},
title = {Finite Models for Formal Security Proofs},
volume = 18,
number = 6,
pages = {1247-1299},
year = 2010,
month = nov,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-jcs09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-jcs09.pdf},
doi = {10.3233/JCS-2009-0395},
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 using a given first-order prover, how hard is it to extract a
formally checkable proof of it, as required in, \textit{e.g.}, common
criteria at the highest evaluation level~(EAL7)? We~demonstrate that this
is surprisingly hard in the general case: the problem is non-recursive.
Nonetheless, we show that we can instead extract finite
models~\(\mathcal{M}\) from a set~\(S\) of clauses representing~\(\pi\),
automatically, and give two ways of doing~so. We~then define a
model-checker testing \(\mathcal{M} \models S\), and show how we can
instrument it to output a formally checkable proof, \textit{e.g.}, in~Coq.
Experience on a number of protocols shows that this is practical, and that
even complex (secure) protocols modulo equational theories have small
finite models, making our approach suitable.}
}
@inproceedings{FGL-icalp09,
address = {Rhodes, Greece},
month = jul,
year = 2009,
volume = 5556,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Albers, Susanne and Marchetti-Spaccamela, Alberto and
Matias, Yossi and Thomas, Wolfgang},
acronym = {{ICALP}'09},
booktitle = {{P}roceedings of the 36th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'09)},
author = {Finkel, Alain and Goubault{-}Larrecq, Jean},
title = {Forward Analysis for {WSTS}, Part~{II}: Complete {WSTS}},
pages = {188-199},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FGL-icalp09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FGL-icalp09.pdf},
doi = {10.1007/978-3-642-02930-1_16},
abstract = {We~describe a simple, conceptual forward analysis procedure for
\(\infty\)-complete WSTS~\(\mathcal{S}\). This computes the \emph{clover}
of a state~\(s_0\) , \textit{i.e.}, a~finite description of the closure of
the cover of~\(s_0\) . When \(S\) is the completion of a
WSTS~\(\mathcal{X}\), the clover in~\(\mathcal{S}\) is a finite
description of the cover in~\(\mathcal{X}\). We~show that this applies
exactly when \(\mathcal{X}\) is an \(\omega^2\)-WSTS, a~new robust class
of WSTS. We~show that our procedure terminates in more cases than the
generalized Karp-Miller procedure on extensions of Petri nets. We
characterize the WSTS where our procedure terminates as those that are
\emph{clover-flattable}. Finally, we~apply this to well-structured counter
systems.}
}
@inproceedings{BBBB-icalp09,
address = {Rhodes, Greece},
month = jul,
year = 2009,
volume = 5556,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Albers, Susanne and Marchetti-Spaccamela, Alberto and
Matias, Yossi and Thomas, Wolfgang},
acronym = {{ICALP}'09},
booktitle = {{P}roceedings of the 36th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'09)},
author = {Baier, Christel and Bertrand, Nathalie and Bouyer,
Patricia and Brihaye, {\relax Th}omas},
title = {When are Timed Automata Determinizable?},
pages = {43-54},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBB-icalp09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBBB-icalp09.pdf},
doi = {10.1007/978-3-642-02930-1_4},
abstract = {In this paper, we propose an abstract procedure which, given a
timed automaton, produces a language-equivalent deterministic infinite
timed tree. We~prove that under a certain boundedness condition, the
infinite timed tree can be reduced into a classical deterministic timed
automaton. The boundedness condition is satisfied by several subclasses of
timed automata, some of them were known to be determinizable (event-clock
timed automata, automata with integer resets), but some others were not.
We prove for instance that strongly non-Zeno timed automata can be
determinized. As a corollary of those constructions, we get for those
classes the decidability of the universality and of the inclusion
problems, and compute their complexities (the inclusion problem is for
instance EXPSPACE-complete for strongly non-Zeno timed automata).}
}
@inproceedings{BF-icalp09,
address = {Rhodes, Greece},
month = jul,
year = 2009,
volume = 5556,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Albers, Susanne and Marchetti-Spaccamela, Alberto and
Matias, Yossi and Thomas, Wolfgang},
acronym = {{ICALP}'09},
booktitle = {{P}roceedings of the 36th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'09)},
author = {Bouyer, Patricia and Forejt, Vojt{\v e}ch},
title = {Reachability in Stochastic Timed Games},
pages = {103-114},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BF-icalp09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BF-icalp09.pdf},
doi = {10.1007/978-3-642-02930-1_9},
abstract = {We define stochastic timed games, which extend two-player timed
games with probabilities (following a recent approach by Baier
\textit{et~al.}), and which extend in a natural way continuous-time Markov
decision processes. We~focus on the reachability problem for these games,
and ask whether one of the players has a strategy to ensure that the
probability of reaching a fixed set of states is equal~to (or~below,
resp.~above) a~certain number~\(r\), whatever the second player does.
We~show that the problem is undecidable in general, but that it becomes
decidable if we restrict to single-clock 1\(\frac{1}{2}\)-player games and
ask whether the player can ensure that the probability of reaching the set
is~\(=1\) (or~\(>0\),~\(=0\)).}
}
@inproceedings{CD-csf09,
address = {Port Jefferson, New York, USA},
month = jul,
year = 2009,
publisher = {{IEEE} Computer Society Press},
acronym = {{CSF}'09},
booktitle = {{P}roceedings of the
22nd {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'09)},
author = {Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
title = {A~method for proving observational equivalence},
pages = {266-276},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CD-csf09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CD-csf09.pdf},
doi = {10.1109/CSF.2009.9},
abstract = {Formal methods have proved their usefulness for analyzing the
security of protocols. Most existing results focus on trace properties
like secrecy or authentication. There are however several security
properties, which cannot be defined (or cannot be naturally defined) as
trace properties and require the notion of \emph{observational
equivalence}. Typical examples are anonymity, privacy related properties
or statements closer to security properties used in cryptography.\par
In this paper, we consider the applied pi calculus and we show that for
\emph{determinate} processes, observational equivalence actually coincides
with trace equivalence, a notion simpler to reason with. We~exhibit a
large class of determinate processes, called \emph{simple processes}, that
capture most existing protocols and cryptographic primitives. Then, for
simple processes without replication, we~reduce the decidability of trace
equivalence to deciding an equivalence relation introduced by M.~Baudet.
Altogether, this yields the first decidability result of observational
equivalence for a general class of equational theories.}
}
@inproceedings{CDK-forte09,
address = {Lisbon, Portugal},
month = jun,
year = 2009,
volume = {5522},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Lee, David and Lopes, Ant{\'o}nia and Poetzsch-Heffter, Arnd},
acronym = {{FMOODS/FORTE}'09},
booktitle = {{P}roceedings of {IFIP} {I}nternational {C}onference on {F}ormal
{T}echniques for {D}istributed {S}ystems ({FMOODS/FORTE}'09)},
author = {Chadha, Rohit and Delaune, St{\'e}phanie and
Kremer, Steve},
title = {Epistemic Logic for the Applied Pi Calculus},
pages = {182-197},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/cdk-forte09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/cdk-forte09.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/cdk-forte09.ps},
doi = {10.1007/978-3-642-02138-1_12},
abstract = {We propose an epistemic logic for the applied pi calculus, which
is a variant of the pi calculus with extensions for modeling cryptographic
protocols. In such a calculus, the security guarantees are usually stated
as equivalences. While process calculi provide a natural means to describe
the protocols themselves, epistemic logics are often better suited for
expressing certain security properties such as secrecy and anonymity.\par
We intend to bridge the gap between these two approaches: using the set of
traces generated by a process as models, we define a logic which has
constructs for reasoning about both intruder's epistemic knowledge and the
set of messages in possession of the intruder. As an example we consider
two formalizations of privacy in electronic voting and study the
relationship between them.}
}
@inproceedings{BHKL-ijcai2009,
address = {Pasadena, California, USA},
month = jul,
year = 2009,
publisher = {AAAI Press},
editor = {Boutilier, Craig},
acronym = {{IJCAI}'09},
booktitle = {{P}roceedings of the 21st {I}nternational {J}oint
{C}onference on {A}rtificial {I}ntelligence
({IJCAI}'09)},
author = {Bollig, Benedikt and Habermehl, Peter and Kern, Carsten and
Leucker, Martin},
title = {Angluin-Style Learning of~{NFA}},
pages = {1004-1009},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHKL-ijcai09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHKL-ijcai09.pdf},
abstract = {We introduce NL\(^{*}\), a learning algorithm for inferring
non-deterministic finite-state automata using membership and equivalence
queries. More specifically, residual finite-state automata (RFSA) are
learned similarly as in Angluin's popular L\(^{*}\) algorithm, which,
however, learns deterministic finite-state automata~(DFA). Like in a~DFA,
the~states of an RFSA represent residual languages. Unlike a~DFA, an~RFSA
restricts to prime residual languages, which cannot be described as the
union of other residual languages. In~doing~so, RFSA can be exponentially
more succinct than~DFA. They are, therefore, the preferable choice for
many learning applications. The implementation of our algorithms is
applied to a collection of examples and confirms the expected advantage of
NL\(^{*}\) over L\(^{*}\).}
}
@inproceedings{BCDDH-tacas09,
address = {York, UK},
month = mar,
year = 2009,
volume = {5505},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Kowalewski, Stefan and Philippou, Anna},
acronym = {{TACAS}'09},
booktitle = {{P}roceedings of the 15th {I}nternational
{C}onference on {T}ools and {A}lgorithms for
{C}onstruction and {A}nalysis of {S}ystems
({TACAS}'09)},
author = {Berwanger, Dietmar and Chatterjee, Krishnendu and
De{~}Wulf, Martin and Doyen, Laurent and
Henzinger, {\relax Th}omas~A.},
title = {Alpaga: A~Tool for Solving Parity Games with Imperfect
Information},
pages = {58-61},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCDDH-tacas09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCDDH-tacas09.pdf},
doi = {10.1007/978-3-642-00768-2_7},
abstract = {Alpaga is a solver for two-player parity games with imperfect
information. Given the description of a game, it~determines
whether the first player can ensure to win and, if~so,
it~constructs a winning strategy. The~tool provides a
symbolic implementation of a recent algorithm based on
antichains.}
}
@inproceedings{BCL-rta09,
address = {Bras{\'\i}lia, Brazil},
month = jun # {-} # jul,
year = 2009,
volume = 5595,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Treinen, Ralf},
acronym = {{RTA}'09},
booktitle = {{P}roceedings of the 20th {I}nternational
{C}onference on {R}ewriting {T}echniques
and {A}pplications
({RTA}'09)},
author = {Bursuc, Sergiu and Comon{-}Lundh, Hubert},
title = {Protocol security and algebraic properties: decision results
for a bounded number of sessions},
pages = {133-147},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCL-rta09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCL-rta09.pdf},
doi = {10.1007/978-3-642-02348-4_10},
abstract = {We consider the problem of deciding the security of
cryptographic protocols for a bounded number of sessions, taking into
account some algebraic properties of the security primitives, for instance
Abelian group properties. We propose a general method for deriving
decision algorithms, splitting the task into 4 properties of the rewriting
system describing the intruder capabilities: locality, conservativity,
finite variant property and decidability of one-step deducibility
constraints. We illustrate this method on a non trivial example, combining
several Abelian Group properties, exponentiation and a homomorphism,
showing a decidability result for this combination. }
}
@inproceedings{GJ-rta09,
address = {Bras{\'\i}lia, Brazil},
month = jun # {-} # jul,
year = 2009,
volume = 5595,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Treinen, Ralf},
acronym = {{RTA}'09},
booktitle = {{P}roceedings of the 20th {I}nternational
{C}onference on {R}ewriting {T}echniques
and {A}pplications
({RTA}'09)},
author = {Godoy, Guillem and Jacquemard, Florent},
title = {Unique Normalization for Shallow {TRS}},
pages = {63-77},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-21.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-21.pdf},
doi = {10.1007/978-3-642-02348-4_5},
abstract = {Computation with a term rewrite system (TRS) consists in
the application of its rules from a given starting
term until a normal form is reached, which is
considered the result of the computation.
The unique normalization (UN) property for a TRS~\(R\)
states that
any starting term can reach at most one normal form
when \(R\) is used, i.e. that the computation with R is
unique. \par
We study the decidability of this property
for classes of TRS defined by syntactic restrictions
such as linearity (variables can occur only once in
each side of the rules), flatness (sides of the
rules have depth at most one) and shallowness
(variables occur at depth at most one in the rules).\par
We prove that UN is decidable in polynomial time for
shallow and linear TRS, using tree automata
techniques. This result is very near to the limits
of decidability, since this property is known
undecidable even for very restricted classes like
right-ground TRS, flat TRS and also right-flat and
linear TRS. We also show that that UN is even
undecidable for flat and right-linear TRS. The
latter result is in contrast with the fact that many
other natural properties like reachability,
termination, confluence, weak normalization... are
decidable for this class of TRS.}
}
@inproceedings{BCD-rta09,
address = {Bras{\'\i}lia, Brazil},
month = jun # {-} # jul,
year = 2009,
volume = 5595,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Treinen, Ralf},
acronym = {{RTA}'09},
booktitle = {{P}roceedings of the 20th {I}nternational
{C}onference on {R}ewriting {T}echniques
and {A}pplications
({RTA}'09)},
author = {Baudet, Mathieu and Cortier, V{\'e}ronique and Delaune,
St{\'e}phanie},
title = {{YAPA}: A~generic tool for computing intruder knowledge},
pages = {148-163},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCD-rta09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCD-rta09.pdf},
doi = {10.1007/978-3-642-02348-4_11},
abstract = {Reasoning about the knowledge of an attacker is a necessary step
in many formal analyses of security protocols. In the framework of the
applied pi calculus, as in similar languages based on equational logics,
knowledge is typically expressed by two relations: deducibility and static
equivalence. Several decision procedures have been proposed for these
relations under a variety of equational theories. However, each theory has
its particular algorithm, and none has been implemented so~far.\par
We provide a generic procedure for deducibility and static equivalence
that takes as input any convergent rewrite system. We show that our
algorithm covers all the existing decision procedures for convergent
theories. We also provide an efficient implementation, and compare it
briefly with the more general tool ProVerif.}
}
@article{LAL-jar09,
publisher = {Springer},
journal = {Journal of Automated Reasoning},
author = {Longuet, Delphine and Aiguier, Marc and Le{~}Gall, Pascale},
title = {Proof-guided test selection from first-order specifications
with equality},
year = {2010},
month = dec,
volume = 45,
number = 4,
pages = {437-473},
nmnote = {special issue on Tests and Proofs},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LAL-jar09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LAL-jar09.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LAL-jar09.ps},
doi = {10.1007/s10817-009-9128-7},
abstract = {This paper deals with test case selection from axiomatic
specifications whose axioms are quantifier-free first-order formulas with
equality. We first prove the existence of an ideal exhaustive test set to
start the selection from. We then propose an extension of the test
selection method called axiom unfolding, originally defined for algebraic
specifications, to quantifier-free first-order specifications with
equality. This method basically consists of a case analysis of the
property under test (the test purpose) according to the specification
axioms. It is based on a proof search for the different instances of the
test purpose. Since the calculus is sound and complete, this allows us to
provide a full coverage of this property. The generalisation we propose
allows to deal with any kind of predicate (not only equality) and with any
form of axiom and test purpose (not only equations or Horn clauses).
Moreover, it improves our previous works with efficiently dealing with the
equality predicate, thanks to the paramodulation rule.}
}
@article{BHR-fi09,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {Bouyer, Patricia and Haddad, Serge and Reynier, Pierre-Alain},
title = {Undecidability Results for Timed Automata with Silent
Transitions},
year = 2009,
volume = 92,
number = {1-2},
pages = {1-25},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-12.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2007-12.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
rr-lsv-2007-12.ps},
abstract = {In this work, we study decision problems related to timed
automata with silent transitions (TA-epsilon) which strictly extend the
expressiveness of timed automata~(TA). First, we answer negatively a
central question raised by the introduction of silent transitions: can we
decide whether the language recognized by a TA-epsilon can be recognized
by some TA? Then we establish in the framework of TA-epsilon some old open
conjectures that O.~Finkel has recently solved for~TA. Its proofs follow a
generic scheme which relies on the fact that only a finite number of
configurations can be reached by a TA while reading a timed word. This
property does not hold for TA-epsilon, the proofs in the framework of
TA-epsilon thus require more elaborated arguments. We~establish
undecidability of complementability, minimization of the number of clocks,
and closure under shuffle. We~also show these results in the framework of
infinite timed languages.}
}
@techreport{LSV:09:02,
author = {Bursuc, Sergiu and Comon{-}Lundh, Hubert},
title = {Protocols, insecurity decision and combination of equational theories},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2009},
month = feb,
type = {Research Report},
number = {LSV-09-02},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-02.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2009-02.pdf},
note = {43~pages},
abstract = {We consider the problem of finding attacks for a bounded number
of sessions of security protocols. We~contribute to this field, showing
how to decompose the problem into pieces for a class of equational
theories, which includes the hierarchical combinations, as well as
non-hierarchical ones. We apply this result to an electronic purse case
study: we~show the decidability in co-NP of the insecurity problem for a
complex equational theory mixing three Abelian groups, exponentiation and
homomorphism properties.\par
The main technical contributions rely on equational logic, term rewriting
and combination of theories.}
}
@article{BS-tocl08,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Benedikt, Michael and Segoufin, Luc},
title = {Regular tree languages definable in {FO} and in {FO}\(_{\textit{mod}}\)},
volume = 11,
number = 1,
nopages = {},
month = oct,
year = 2009,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-tocl09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-tocl09.pdf},
doi = {10.1145/1614431.1614435},
abstract = {We~consider regular languages of labeled trees. We~give an
effective characterization of the regular languages over such trees that
are definable in first-order logic in the language of labeled graphs.
These languages are the analog on trees of the {"}locally threshold
testable{"} languages on strings. We~show that this characterization yields
a decision procedure for determining whether a regular tree language is
first-order definable: the~procedure is polynomial time in the minimal
automaton presenting the regular language. We~also provide an algorithm
for deciding whether a regular language is definable in first-order logic
supplemented with modular quantifiers.}
}
@article{CCZ-tocl08,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Comon{-}Lundh, Hubert and Cortier, V{\'e}ronique and
Z{\u{a}}linescu, Eugen},
title = {Deciding security properties for cryptographic
protocols. Application to key cycles},
volume = 11,
number = 2,
nopages = {},
month = jan,
year = 2010,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CCZ-tocl09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CCZ-tocl09.pdf},
doi = {10.1145/1656242.1656244},
abstract = {There is a large amount of work dedicated to the formal
verification of security protocols. In~this paper, we~revisit and extend
the NP-complete decision procedure for a bounded number of sessions. We
use a, now standard, deducibility constraint formalism for modeling
security protocols. Our~first contribution is to give a simple set of
constraint simplification rules, that allows to reduce any deducibility
constraint to a set of solved forms, representing all solutions (within
the bound on sessions).\par
As a consequence, we prove that deciding the existence of key cycles is
NP-complete for a bounded number of sessions. The problem of key-cycles
has been put forward by recent works relating computational and symbolic
models. The so-called soundness of the symbolic model requires indeed that
no key cycle (\textit{e.g.},~enc\((k, k)\)) ever occurs in the
execution of the protocol. Otherwise, stronger security assumptions (such
as KDM-security) are required.\par
We show that our decision procedure can also be applied to prove again the
decidability of authentication-like properties and the decidability of a
significant fragment of protocols with timestamps.}
}
@misc{Quasimodo-3.1,
author = {Bouyer, Patricia and Katoen, Joost-Pieter and
Langerak, Rom and Laroussinie, Fran{\c{c}}ois and
Markey, Nicolas and Raskin, Jean-Fran{\c{c}}ois},
title = {Transfer of correctness from models to implementation},
howpublished = {Deliverable QUASIMODO~3.1 (ICT-FP7-STREP-214755)},
year = 2009,
month = jan
}
@inproceedings{JKV-lata09,
address = {Tarragona, Spain},
month = apr,
year = 2009,
volume = 5457,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Dediu, Adrian Horia and Mihai Ionescu, Armand and Mart{\'\i}n-Vide, Carlos},
acronym = {{LATA}'09},
booktitle = {{P}roceedings of the 3rd {I}nternational {C}onference on {L}anguage
and {A}utomata {T}heory and {A}pplications ({LATA}'09)},
author = {Jacquemard, Florent and Klay, Francis and Vacher, Camille},
title = {Rigid Tree Automata},
pages = {446-457},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JKV-lata09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JKV-lata09.pdf},
doi = {10.1007/978-3-642-00982-2_38},
abstract = {We introduce the class of Rigid Tree Automata (RTA), an
extension of standard bottom-up automata on ranked trees with
distinguished states called rigid. Rigid states define a restriction on
the computation of RTA on trees: RTA can test for equality in subtrees
reaching the same rigid state. RTA are able to perform local and global
tests of equality between subtrees, non-linear tree pattern matching, and
restricted disequality tests as well. Properties like determinism, pumping
lemma, boolean closure, and several decision problems are studied in
detail. In particular, the emptiness problem is shown decidable in linear
time for RTA whereas membership of a given tree to the language of a given
RTA is NP-complete. Our main result is the decidability of whether a given
tree belongs to the rewrite closure of a RTA language under a restricted
family of term rewriting systems, whereas this closure is not a RTA
language. This result, one of the first on rewrite closure of languages of
tree automata with constraints, is enabling the extension of model
checking procedures based on finite tree automata techniques. Finally, a
comparison of RTA with several classes of tree automata with local and
global equality tests, and with dag automata is also provided.}
}
@phdthesis{bouyer-hab2009,
author = {Bouyer, Patricia},
title = {From Qualitative to Quantitative Analysis of Timed Systems},
school = {Universit{\'e} Paris~7, Paris, France},
type = {M{\'e}moire d'habilitation},
year = 2009,
month = jan,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PB-hdr09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PB-hdr09.pdf}
}
@incollection{GMN-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 = {Gastin, Paul and Mukund, Madhavan and Narayan Kumar, K.},
title = {Reachability and boundedness in time-constrained {MSC} graphs},
pages = {157-183},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GMN-pct08.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GMN-pct08.pdf},
abstract = {Channel boundedness is a necessary condition for a
message-passing system to exhibit regular, finite-state behaviour at the
global level. For Message Sequence Graphs~(MSGs), the most basic form of
High-level Message Sequence Charts~(HMSCs), channel boundedness can be
characterized in terms of structural conditions on the underlying graph.
We consider MSGs enriched with timing constraints between events. These
constraints restrict the global behaviour and can impose channel
boundedness even when it is not guaranteed by the graph structure of the
MSG. We~show that we can use MSGs with timing constraints to simulate
computations of a two-counter machine. As~a consequence, even the more
fundamental problem of reachability, which is trivial for untimed MSGs,
becomes undecidable when we add timing constraints. Different forms of
channel boundedness also then turn out to be undecidable, using reductions
from the reachability problem.}
}
@incollection{BP-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 = {Bouyer, Patricia and Petit, Antoine},
title = {On extensions of timed automata},
pages = {35-63},
abstract = {Since their definition in the early nineties, timed automata have
been one of the most used and widely studied models for
representing and analyzing real-time systems. In their seminal
paper, Alur and Dill proved the probably most important property
of timed automata: checking emptiness of the language accepted by
a timed automaton, or equivalently checking a reachability
property in a timed automaton, is decidable. This result relies on
the construction of the so-called region automaton, which
abstracts behaviours of a timed automaton into behaviours of a
finite automaton. Since then, symbolic algorithms have been
developed to solve that problem, several model-checkers have been
implemented, and numerous case studies have been verified.\par
Lots of works have naturally aimed at proposing extensions of
timed automata with new features, while preserving the
above-mentioned fundamental decidability result. The motivation
for these extensions is basically twofold. First it can increase the
expressiveness of timed automata, allowing to model larger classes
of systems. Then it can improve the conciseness (and hence the
readability) of models by constructing more compact
representations for a given system.\par
In this paper, we discuss and compare some of the most important
extensions of timed automata that have been considered in the
literature.}
}
@inproceedings{BBL-Fossacs09,
address = {York, UK},
month = mar,
year = 2009,
volume = 5504,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {de Alfaro, Luca},
acronym = {{FoSSaCS}'09},
booktitle = {{P}roceedings of the 12th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'09)},
author = {Bansal, Kshitij and Brochenin, R{\'e}mi and
Lozes, {\'E}tienne},
title = {Beyond Shapes: Lists with Ordered Data},
pages = {425-439},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBL-fossacs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBL-fossacs09.pdf},
doi = {10.1007/978-3-642-00596-1_30},
abstract = {Standard analysis on recursive data structures restrict their
attention to shape properties (for instance, a program that manipulates a
list returns a list), excluding properties that deal with the actual
content of these structures. For instance, these analysis would not
establish that the result of merging two ordered lists is an ordered list.
Separation logic, one of the prominent framework for these kind of
analysis, proposed a heap model that could represent data, but, to our
knowledge, no predicate dealing with data has ever been integrated to the
logic while preserving decidability. We~establish decidability for
(first-order) separation logic with a predicate that allows to compare two
successive data in a list. We~then consider the extension where two data
in arbitrary positions may be compared, and establish the undecidability
in general. We~define a guarded fragment that turns out to be both
decidable and sufficiently expressive to prove the preservation of the
loop invariant of a standard program merging ordered lists. We~finally
consider the extension with the magic-wand and prove that, by constrast
with the data-free case, even a very restricted use of the magic wand
already introduces undecidability.}
}
@article{GSZ-fmsd09,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Gastin, Paul and Sznajder, Nathalie and Zeitoun, Marc},
title = {Distributed synthesis for well-connected
architectures},
volume = 34,
number = 3,
pages = {215-237},
month = jun,
year = 2009,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GSZ-fmsd09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GSZ-fmsd09.pdf},
doi = {10.1007/s10703-008-0064-7},
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 output
variables are totally ordered by their knowledge of input variables. 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.}
}
@article{LHS-lmcs08,
journal = {Logical Methods in Computer Science},
author = {Lozes, {\'E}tienne and Hirschkoff, Daniel and
Sangiorgi, Davide},
title = {Separability in the Ambient Logic},
volume = 4,
number = {3:4},
year = 2008,
month = sep,
nopages = {},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LHS-lmcs08.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/LHS-lmcs08.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/LHS-lmcs08.ps},
doi = {10.2168/LMCS-4(3:4)2008},
abstract = {The Ambient Logic~(AL) has been proposed for expressing
properties of process mobility in the calculus of Mobile
Ambients~(MA), and as a basis for query languages on
semistructured data. \par
We study some basic questions concerning the
discriminating power of~AL, focusing on the equivalence on
processes induced by the logic~(\(=_{L}\)). As underlying
calculi besides~MA we~consider a subcalculus in which an
image-finiteness condition holds and that we prove to be
Turing complete. Synchronous variants of these calculi are
studied as well. \par
In these calculi, we provide two operational
characterisations of~\(=_{L}\): a~coinductive one (as a form
of bisimilarity) and an inductive one (based on structual
properties of processes). After showing \(=_{L}\) to be
stricly finer than barbed congruence, we establish
axiomatisations of~\(=_{L}\) on the subcalculus of~MA (both
the asynchronous and the synchronous version), enabling us
to relate~\(=_{L}\) to structural congruence. We~also
present some (un)decidability results that are related to
the above separation properties for~AL: the~undecidability
of~\(=_{L}\) on~MA and its decidability on the
subcalculus.}
}
@proceedings{KP-secco2008,
title = {{P}roceedings of the 6th {I}nternational {W}orkshop on
{S}ecurity {I}ssues in {C}oncurrency ({S}ec{C}o'08)},
booktitle = {{P}roceedings of the 6th {I}nternational {W}orkshop on
{S}ecurity {I}ssues in {C}oncurrency ({S}ec{C}o'08)},
editor = {Kremer, Steve and Panangaden, Prakash},
publisher = {Elsevier Science Publishers},
doi = {10.1016/j.entcs.2009.07.077},
url = {http://www.sciencedirect.com/science/journal/15710661/242/3},
series = {Electronic Notes in Theoretical Computer Science},
volume = 242,
number = 3,
year = 2009,
month = aug,
address = {Toronto, Canada}
}
@article{BCK-IC09,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Baudet, Mathieu and Cortier, V{\'e}ronique and Kremer, Steve},
title = {Computationally Sound Implementations of Equational Theories
against Passive Adversaries},
year = {2009},
month = apr,
volume = 207,
number = 4,
pages = {496-520},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCK-ic09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCK-ic09.pdf},
doi = {10.1016/j.ic.2008.12.005},
abstract = {In~this paper we study the link between formal and cryptographic
models for security protocols in the presence of passive adversaries.
In~contrast to other works, we~do not consider a fixed set of primitives
but aim at results for arbitrary equational theories. We~define a
framework for comparing a cryptographic implementation and its
idealization with respect to various security notions. In~particular, we
concentrate on the computational 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, to~illustrate our framework, we~establish the
soundness of static equivalence for the exclusive OR and a theory of
ciphers and lists.}
}
@inproceedings{BH-Fossacs09,
address = {York, UK},
month = mar,
year = 2009,
volume = 5504,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {de Alfaro, Luca},
acronym = {{FoSSaCS}'09},
booktitle = {{P}roceedings of the 12th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'09)},
author = {B{\'e}rard, B{\'e}atrice and Haddad, Serge},
title = {Interrupt Timed Automata},
pages = {197-211},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BH-fossacs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BH-fossacs09.pdf},
doi = {10.1007/978-3-642-00596-1_15},
abstract = {In this work, we introduce the class of Interrupt Timed Automata
(ITA), which are well suited to the description of multi-task systems with
interruptions in a single processor environment. This model is a subclass
of hybrid automata. While reachability is undecidable for hybrid automata
we show that in ITA the reachability problem is in 2EXPSPACE and in PSPACE
when the number of clocks is fixed, with a procedure based on a
generalized class graph. Furthermore we consider a subclass ITA\(_{-}\)
which still describes usual interrupt systems and for which the
reachability problem is in NEXPTIME and in NP when the number of clocks is
fixed (without any class graph). There exist languages accepted by an
ITA\(_{-}\) but neither by timed automata nor by controlled real-time
automata (CRTA), another extension of timed automata. However we
conjecture that CRTA is not contained in ITA. So, we combine ITA with CRTA
in a model which encompasses both classes and show that the reachability
problem is still decidable.}
}
@article{KM-jcs09,
publisher = {{IOS} Press},
journal = {Journal of Computer Security},
author = {Kremer, Steve and Mazar{\'e}, Laurent},
title = {Computationally Sound Analysis of Protocols using
Bilinear Pairings},
year = 2010,
month = nov,
volume = 18,
number = 6,
pages = {999-1033},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KM-jcs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/KM-jcs09.pdf},
doi = {10.3233/JCS-2009-0388},
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 holds and that the
encryption scheme is \textsf{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. We also
investigate the security of a newly designed variant of the
Burmester-Desmedt protocol using bilinear pairings. More precisely, we
show for each of these protocols that the generated key is
indistinguishable from a random element.}
}
@inproceedings{BGH-Fossacs09,
address = {York, UK},
month = mar,
year = 2009,
volume = 5504,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {de Alfaro, Luca},
acronym = {{FoSSaCS}'09},
booktitle = {{P}roceedings of the 12th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'09)},
author = {Bollig, Benedikt and Grindei, Manuela-Lidia and
Habermehl, Peter},
title = {Realizability of Concurrent Recursive Programs},
pages = {410-424},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGH-fossacs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGH-fossacs09.pdf},
doi = {10.1007/978-3-642-00596-1_29},
abstract = {We define and study an automata model of concurrent recursive
programs. An~automaton consists of a finite number of pushdown systems
running in parallel and communicating via shared actions. Actually, we
combine multi-stack visibly pushdown automata and Zielonka's asynchronous
automata towards a model with an undecidable emptiness problem. However, a
reasonable restriction allows us to lift Zielonka's Theorem to this
recursive setting and permits a logical characterization in terms of a
suitable monadic second-order logic. Building on results from Mazurkiewicz
trace theory and work by La~Torre, Madhusudan, and Parlato, we thus develop
a framework for the specification, synthesis, and verification of concurrent
recursive processes.}
}
@article{DKR-jcs09,
publisher = {{IOS} Press},
journal = {Journal of Computer Security},
author = {Delaune, St{\'e}phanie and Kremer, Steve and Ryan, Mark D.},
title = {Symbolic bisimulation for the applied pi~calculus},
year = 2010,
month = mar,
volume = 18,
number = 2,
pages = {317-377},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-jcs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-jcs09.pdf},
doi = {10.3233/JCS-2010-0363},
abstract = {We propose a symbolic semantics for the finite applied
pi~calculus. The~applied pi calculus is a variant of the pi~calculus with
extensions for modelling cryptographic 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 terms.
We~define a symbolic labelled bisimulation relation, which is shown to be
sound but not complete with respect to standard bisimulation. We explore
the lack of completeness and demonstrate that the symbolic bisimulation
relation is sufficient for many practical examples. This~work is an
important step towards automation of observational equivalence for the
finite applied pi calculus, \textit{e.g.}~for verification of anonymity or
strong secrecy properties.}
}
@inproceedings{FGL-stacs2009,
address = {Freiburg, Germany},
month = feb,
year = 2009,
volume = 3,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Albers, Susanne and Marion, Jean-Yves},
acronym = {{STACS}'09},
booktitle = {{P}roceedings of the 26th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'09)},
author = {Finkel, Alain and Goubault{-}Larrecq, Jean},
title = {Forward Analysis for~{WSTS}, Part~{I}: Completions},
pages = {433-444},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FGL-stacs2009.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FGL-stacs2009.pdf},
abstract = {Well-structured transition systems provide the right foundation
to compute a finite basis of the set of predecessors of the upward closure
of a state. The~dual problem, to compute a finite representation of the
set of successors of the downward closure of a state, is~harder: Until
now, the theoretical framework for manipulating downward-closed sets was
missing. We~answer this problem, using insights from domain theory (dcpos
and ideal completions), from topology (sobrifications), and shed new light
on the notion of adequate domains of limits.}
}
@inproceedings{CGS-sofsem09,
address = {\v{S}pindler\r{u}v Ml\'{y}n, Czech Republic},
month = jan,
year = 2009,
volume = 5404,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Nielsen, Mogens and Ku{\v c}era, Anton{\'\i}n and Bro
Miltersen, Peter and Palamidessi, Catuscia and T{\r{u}}ma,
Petr and Valencia, Franck},
acronym = {{SOFSEM}'09},
booktitle = {{P}roceedings of the 35th International Conference on
Current Trends in Theory and Practice of
Computer Science ({SOFSEM}'09)},
author = {Chatain, {\relax Th}omas and Gastin, Paul and Sznajder, Nathalie},
title = {Natural Specifications Yield Decidability for Distributed
Synthesis of Asynchronous Systems},
pages = {141-152},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CGS-sofsem09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CGS-sofsem09.pdf},
doi = {10.1007/978-3-540-95891-8_16},
abstract = {We study the synthesis problem in an asynchronous distributed
setting: a finite set of processes interact locally with an uncontrollable
environment and communicate with each other by sending signals---actions
that are immediately received by the target process. The synthesis problem
is to come up with a local strategy for each process such that the
resulting behaviours of the system meet a given specification. We consider
external specifications over partial orders. External means that
specifications only relate input and output actions from and to the
environment and not signals exchanged by processes. We also ask for some
closure properties of the specification. We present this new setting for
studying the distributed synthesis problem, and give decidability results:
the non-distributed case, and the subclass of networks where communication
happens through a strongly connected graph. We believe that this framework
for distributed synthesis yields decidability results for many more
architectures.}
}
@inproceedings{BDLM-lfcs09,
address = {Deerfield Beach, Florida, USA},
month = jan,
year = 2009,
volume = 5407,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Artemov, Sergei N. and Nerode, Anil},
notefortitle = {6th edition of the conference},
acronym = {{LFCS}'09},
booktitle = {{P}roceedings of the {S}ymposium on {L}ogical {F}oundations of
{C}omputer {S}cience ({LFCS}'09)},
author = {Brihaye, {\relax Th}omas and Da{~}Costa, Arnaud and
Laroussinie, Fran{\c{c}}ois and
Markey, Nicolas},
title = {{ATL}~with Strategy Contexts and Bounded Memory},
pages = {92-106},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDLM-lfcs09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDLM-lfcs09.pdf},
doi = {10.1007/978-3-540-92687-0_7},
abstract = {We extend the alternating-time temporal logics ATL
and ATL\textsuperscript{*} with \emph{strategy contexts} and
\emph{memory constraints}: the first extension make strategy
quantifiers to not {"}forget{"} the strategies being executed by
the other players. The second extension allows strategy
quantifiers to restrict to memoryless or bounded-memory
strategies.\par
We first consider expressiveness issues. We show that our logics
can express important properties such as equilibria, and we
formally compare them with other similar formalisms (ATL,
ATL\textsuperscript{*}, Game Logic, Strategy Logic,~...).
We~then address the problem of model-checking for our logics,
providing a PSPACE algoritm for the sublogics involving only
memoryless strategies and an EXPSPACE algorithm for the
bounded-memory case.}
}
@inproceedings{ABGR-datalog10,
address = {Oxford, UK},
month = mar,
year = 2011,
volume = 6702,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {de Moor, Oege and Gottlob, Georg and Furche, Tim and
Sellers, Andrew Jon},
acronym = {{D}atalog'10},
booktitle = {{R}evised {S}elected {P}apers of the 1st {I}nternational {W}orkshop
{D}atalog {R}eloaded ({D}atalog'10)},
author = {Abiteboul, Serge and Bienvenu, Meghyn and Galland, Alban
and Rousset, Marie-{\relax Ch}ristine},
title = {Distributed {D}atalog Revisited},
pages = {252-261},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABGR-datalog10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABGR-datalog10.pdf},
doi = {10.1007/978-3-642-24206-9_15}
}
@techreport{rr-lsv-10-23,
author = {Bonnet, R{\'e}mi and Finkel, Alain and Haddad, Serge and
Rosa{-}Velardo, Fernando},
title = {Comparing Petri Data Nets and Timed Petri Nets},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2010},
month = dec,
type = {Research Report},
number = {LSV-10-23},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-23.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-23.pdf},
note = {16~pages},
abstract = {Well-Structured Transitions Systems (WSTS) constitute a generic
class of infinite-state systems for which several properties like
coverability remain decidable. The family of coverability languages that
they generate is an appropriate criterium for measuring their
expressiveness. Here we establish that Petri Data nets (PDNs) and Timed
Petri nets (TdPNs), two powerful classes of WSTS are equivalent w.r.t this
criterium.}
}
@phdthesis{vacher-phd2010,
author = {Vacher, Camille},
title = {Automates {\`a} contraintes globales pour la v{\'e}rification de
propri{\'e}t{\'e}s de s{\'e}curit{\'e}},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2010,
month = dec,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/vacher-phd.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/vacher-phd.pdf}
}
@phdthesis{place-phd2010,
author = {Place, {\relax Th}omas},
title = {Decidable Characterizations for Tree Logics},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2010,
month = dec,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/place-phd.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/place-phd.pdf}
}
@phdthesis{figueira-phd2010,
author = {Figueira, Diego},
title = {On decidable automata on data words and data trees
in relation to satisfiability of {LTL} and {XP}ath},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2010,
month = dec,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/figueira-phd.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/figueira-phd.pdf}
}
@phdthesis{andre-phd2010,
author = {Andr{\'e}, {\'E}tienne},
title = {An Inverse Method for the Synthesis of Timing Parameters in
Concurrent Systems},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2010,
month = dec,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/andre-phd.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/andre-phd.pdf},
abstract = {This thesis proposes a novel approach for the synthesis of
delays for timed systems. When verifying a real-time system, e.g., a
hardware device or a communication protocol, it is important to check that
not only the functional but also the timed behavior is correct. This
correctness depends on the values of the delays of internal operations and
of the environment.\par
Formal verification methods guarantee the correctness of a timed system
for a given set of delays, but do not give information for other values of
the delays. Checking the correctness of for various values of those delays
can be difficult and time consuming. It is thus interesting to consider
that these delays are parameters. The problem then consists in
synthesizing {"}good values{"} for those parameters, i.e., values for which
the system is guaranteed to behave well.\par
We are here interested in the synthesis of parameters in the framework of
timed automata, a model for verifying real-time systems. Our approach
relies on the following inverse method: given a reference valuation of the
parameters, we synthesize a constraint on the parameters, guaranteeing the
same time-abstract linear behavior as for the reference valuation. This
gives a criterion of robustness to the system. By iterating this inverse
method on various points of a bounded parameter domain, we are then able
to partition the parametric space into good and bad zones, with respect to
a given property one wants to verify. This gives a behavioral cartography
of the system.\par
This method extended to probabilistic systems allows to preserve minimum
and maximum probabilities of reachability properties. We also present
variants of the inverse method for directed weighted graphs and Markov
Decision Processes. Several prototypes have been implemented; in
particular, IMITATOR II implements the inverse method and the cartography
for timed automata. It allowed us to synthesize parameter values for
several case studies such as an abstract model of a memory circuit sold by
the chipset manufacturer ST-Microelectronics, and various communication
protocols. }
}
@techreport{rr-lsv-10-22,
author = {Soulat, Romain},
title = {On Properties of the Inverse Method:
Commutation of Instanciation
and Full Covering of the Behavioral Cartography},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2010},
month = dec,
type = {Research Report},
number = {LSV-10-22},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-22.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-22.pdf},
note = {14~pages},
abstract = {When one performs an Inverse Method on a Parametric Timed Automata over an
instance \(\pi_0\), one can instantiate some parameters at the very beginning
of the analysis or at the end, with a restriction of the constraint \(K_0\)
obtained in order to get a constraint over a subset of the parameters. In
this report, we show that the results of either methods are the same. We
present a theoretical proof and then an illustration of this property on
the flip-flop example and the Root Contention protocol. We also present
some results about the coverage of behavioral cartography and an
illustration of the full covering on the SPSMALL memory.}
}
@techreport{rr-lsv-10-21,
author = {Andr{\'e}, {\'E}tienne},
title = {Synthesizing Parametric Constraints on Various Case Studies
Using {IMITATOR}~{II}},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2010},
month = dec,
type = {Research Report},
number = {LSV-10-21},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-21.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-21.pdf},
note = {66~pages},
abstract = {We present here various case studies analyzed using IMITATOR II,
a tool implementing the {"}inverse method{"} in the framework of
parametric timed automata: given a reference valuation of the parameters,
it synthesizes a constraint such that the system behaves the same as under
the reference valuation in terms of traces, i.e., alternating sequences of
locations and actions.\par
This is useful for safely relaxing some values of the reference valuation,
and optimizing timing bounds of the system.\par
Besides the inverse method, IMITATOR~II also implements the {"}behavioral
cartography algorithm{"}, allowing to solve the following good parameters
problem: find a set of valuations within a given rectangle for which the
system behaves well.\par
We present here a range of case studies, communication protocols, hardware
circuits and industrial case studies for which constraints guaranteeing a
good behavior were synthesized using IMITATOR~II.}
}
@article{bbdfh-pe10,
publisher = {Elsevier Science Publishers},
journal = {Performance Evaluation},
author = {Baarir, Souheib and Beccuti, Marco and Dutheillet, Claude and
Franceschinis, Giuliana and Haddad, Serge},
title = {Lumping partially symmetrical stochastic models},
volume = 76,
nunmber = 1,
month = jan,
pages = {21-44},
year = 2011,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/bbdfh-pe10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/bbdfh-pe10.pdf},
doi = {10.1016/j.peva.2010.09.002},
abstract = {The performance and dependability evaluation of complex systems
by means of dynamic stochastic models (e.g. Markov chains) may be impaired
by the combinatorial explosion of their state space. Among the possible
methods to cope with this problem, symmetry-based ones can be applied to
systems including several similar components. Often however these systems
are only partially symmetric: their behavior is in general symmetric
except for some local situation when the similar components need to be
differentiated.\par
In this paper two methods to efficiently analyze partially symmetrical
models are presented in a general setting and the requirements for their
efficient implementation are discussed. Some case studies are presented to
show the methods' effectiveness and their applicative interest.}
}
@techreport{rr-lsv-10-20,
author = {Andr{\'e}, {\'E}tienne},
title = {{IMITATOR}~{II} User Manual},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2010},
month = nov,
type = {Research Report},
number = {LSV-10-20},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-20.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-20.pdf},
note = {31~pages},
abstract = {We present here the user manual of IMITATOR~II, a~tool
implementing the {"}inverse method{"} in the framework of parametric timed
automata: given a reference valuation of the parameters, its generates a
constraint such that the system behaves the same as under the reference
valuation in terms of traces, i.e., alternating sequences of locations and
actions. This is useful for safely relaxing some values of the reference
valuation, and optimizing timing bounds of the system.\par
Besides the inverse method, IMITATOR II also implements the {"}behavioral
cartography algorithm{"}, allowing to solve the following good parameters
problem: find a set of valuations within a given rectangle for which the
system behaves well.\par
We give here the installation requirements and the launching commands of
IMITATOR~II, as~well as the source code of a toy example.}
}
@article{JKV-icomp10,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Jacquemard, Florent and Klay, Francis and Vacher, Camille},
title = {Rigid Tree Automata},
volume = {209},
number = 3,
pages = {486-512},
year = 2011,
month = mar,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JKV-icomp11.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JKV-icomp11.pdf},
doi = {10.1016/j.ic.2010.11.015},
abstract = {We introduce the class of Rigid Tree Automata (RTA), an
extension of standard bottom-up automata on ranked trees with
distinguished states called rigid. Rigid states define a restriction on
the computation of RTA on trees: RTA can test for equality in subtrees
reaching the same rigid state. RTA are able to perform local and global
tests of equality between subtrees, non-linear tree pattern matching, and
restricted disequality tests as well. Properties like determinism, pumping
lemma, boolean closure, and several decision problems are studied in
detail. In particular, the emptiness problem is shown decidable in linear
time for RTA whereas membership of a given tree to the language of a given
RTA is NP-complete. Our main result is the decidability of whether a given
tree belongs to the rewrite closure of a RTA language under a restricted
family of term rewriting systems, whereas this closure is not a RTA
language. This result, one of the first on rewrite closure of languages of
tree automata with constraints, is enabling the extension of model
checking procedures based on finite tree automata techniques. Finally, a
comparison of RTA with several classes of tree automata with local and
global equality tests, and with dag automata is also provided.}
}
@mastersthesis{rodriguez-master,
author = {Rodr{\'\i}guez, C{\'e}sar},
title = {Implementation of a complete prefix unfolder for contextual nets},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2010},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/cr-m2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/cr-m2.pdf}
}
@article{AFFM-rsl10,
publisher = {Cambridge University Press},
journal = {Review of Symbolic Logic},
author = {Areces, Carlos and Figueira, Diego and Figueira, Santiago and
Mera, Sergio},
title = {The Expressive Power of Memory Logics},
year = {2011},
month = jun,
volume = 4,
number = 2,
pages = {290 - 318 },
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AFFM-rsl10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AFFM-rsl10.pdf},
doi = {10.1017/S1755020310000389},
abstract = {We investigate the expressive power of \emph{memory logics}.
These are modal logics extended with the possibility to store (or remove)
the current node of evaluation in (or from) a \emph{memory}, and to
perform membership tests on the current memory. From this perspective, the
hybrid logic \(\mathcal{HL}(\downarrow)\), for example, can be thought of
as a particular case of a memory logic where the memory is an indexed list
of elements of the domain.\par
This work focuses in the case where the memory is a set, and we can test
whether the current node belongs to the set or not. We prove that, in
terms of expressive power, the memory logics we discuss here lie between
the basic modal logic \(\mathcal{K}\) and \(\mathcal{HL}(\downarrow)\). We
show that the satisfiability problem of most of the logics we cover is
undecidable. The only logic with a decidable satisfiability problem is
obtained by imposing strong constraints on which elements can be
memorized.}
}
@inproceedings{hmy-bpsc10,
address = {Leipzig, Germany},
month = sep # {-} # oct,
year = 2010,
volume = {177},
series = {Lecture Notes in Informatics},
publisher = {Gesellschaft f{\"u}r Informatik},
editor = {Abramowicz, Witold and Alt, Rainer and F{\"a}hnrich, Klaus-Peter
and Franczyk, Bogdan and Maciaszek, Leszek A.},
acronym = {{ISSS}{\slash}{BPSC}'10},
booktitle = {{P}roceedings of the 2nd {I}nternational {S}ymposium on {S}ervices
{S}cience and 3rd {I}nternational {C}onference on {B}usiness
{P}rocess and {S}ervices {C}omputing
({ISSS}{\slash}{BPSC}'10)},
author = {Haddad, Serge and Mokdad, Lynda and Youcef, Samir},
title = {Selection of the Best composite Web Service Based on Quality
of Service},
pages = {255-266},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/hmy-bpsc10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/hmy-bpsc10.pdf},
abstract = {The paper proposes a general framework to composite Web services
selection based on multicriteria evaluation. The proposed framework
extends the Web services architecture by adding, in the registry, a new
Multicriteria Evaluation Component~(MEC) devoted to multicriteria
evaluation. This additional component takes as input a set of composite
Web services and a set of evaluation criteria and generates a set of
recommended composite Web services. In~addition to the description of the
conceptual architecture of the formwork, the paper also proposes solutions
to construct and evaluate composite web services. In order to show the
feasibility of the proposed architecture, we~have developed a prototype
based on the open source jUDDI registry.}
}
@inproceedings{CSV-vmcai11,
address = {Austin, Texas, USA},
month = jan,
year = 2011,
volume = 6538,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Jhala, Ranjit and Schmidt, David},
acronym = {{VMCAI}'11},
booktitle = {{P}roceedings of the 12th {I}nternational {C}onference on
{V}erification, {M}odel {C}hecking and {A}bstract {I}nterpretation
({VMCAI}'11)},
author = {Chadha, Rohit and Sistla, A. Prasad and Viswanathan, Mahesh},
title = {Probabilistic {B}{\"u}chi automata with non-extremal acceptance
thresholds},
pages = {103-117},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CSV-vmcai11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CSV-vmcai11.pdf},
doi = {10.1007/978-3-642-18275-4_9},
abstract = {This paper investigates the power of Probabilistic
B{\"u}chi Automata~(PBA) when the threshold probability of acceptance is
non-extremal, i.e., is a value strictly between 0 and 1. Many practical
randomized algorithms are designed to work under non-extremal threshold
probabilities and thus it is important to study power of PBAs for such
cases.\par
The paper presents a number of surprising expressiveness and decidability
results for PBAs when the threshold probability is non-extremal. Some of
these results sharply contrast with the results for extremal threshold
probabilities. The paper also presents results for Hierarchical PBAs and
for an interesting subclass of them called simple PBAs.}
}
@inproceedings{steel-escar09,
address = {D{\"u}sseldorf, Germany},
month = nov,
year = 2009,
editor = {Paar, Christof and Wollinger, Thomas},
acronym = {{ESCAR}'09},
booktitle = {{P}roceedings of the 7th
{C}onference on {E}mbedded {S}ecurity in {C}ars
({ESCAR}'09)},
author = {Steel, Graham},
title = {Towards a Formal Analysis of the {S}e{V}e{C}o{M}~{API}},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/steel-escar09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/steel-escar09.pdf}
}
@inproceedings{steel-fcc09,
address = {Port Jefferson, New York, USA},
month = jul,
year = 2009,
editor = {K{\"u}sters, Ralf},
acronym = {{FCC}'09},
booktitle = {{P}roceedings of the 5th {W}orkshop on {F}ormal and
{C}omputational {C}ryptography ({FCC}'09)},
author = {Steel, Graham},
title = {Computational Soundness for {API}s},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/steel-fcc09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/steel-fcc09.pdf}
}
@inproceedings{SC-fcc07,
address = {Venice, Italy},
month = jul,
year = 2007,
editor = {Backes, Michael and Lakhnech, Yassine},
acronym = {{FCC}'07},
booktitle = {{P}roceedings of the 3rd {W}orkshop on {F}ormal and
{C}omputational {C}ryptography ({FCC}'07)},
author = {Steel ,Graham and Courant, Judica{\"e}l},
title = {A formal model for detecting parallel key search attacks},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SC-fcc07.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SC-fcc07.pdf}
}
@mastersthesis{scerri-master,
author = {Scerri, Guillaume},
title = {Mod{\'e}lisation des cl{\'e}s de l'intrus},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2010},
month = sep,
nmnote = {Hubert prefere ne pas diffuser le rapport, et prepare une version 'conf'}
}
@mastersthesis{bonnet-master,
author = {Bonnet, R{\'e}mi},
title = {Well-structured {P}etri-nets extensions with data},
school = {{M}aster Computer Science, EPFL,
Lausanne, Switzerland},
type = {Rapport de {M}aster},
year = {2010},
month = mar,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/bonnet-m2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/bonnet-m2.pdf}
}
@article{LMT-tcs10,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Lanotte, Ruggero and Maggiolo{-}Schettini, Andrea and Troina, Angelo},
title = {Weak bisimulation for Probabilistic Timed Automata?},
volume = 411,
number = 50,
year = 2010,
month = nov,
pages = {4291-4322},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LMT-tcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LMT-tcs10.pdf},
doi = {10.1016/j.tcs.2010.09.003},
abstract = {We are interested in describing timed systems that exhibit
probabilistic behaviour. To this purpose, we consider a
model of Probabilistic Timed Automata and introduce a
concept of weak bisimulation for these automata, together
with an algorithm to decide it. The weak bisimulation
relation is shown to be preserved when either time, or
probability is abstracted away. As an application, we use
weak bisimulation for Probabilistic Timed Automata to model
and analyze a timing attack on the dining cryptographers protocol.}
}
@inproceedings{LS-DL09,
address = {Oxford, UK},
month = jul,
year = 2009,
volume = 477,
series = {CEUR Workshop Proceedings},
publisher = {RWTH Aachen, Germany},
editor = {Cuenca Grau, Bernardo and Horrocks, Ian and Motik, Boris and Sattler, Ulrike },
acronym = {{DL}'09},
booktitle = {{P}roceedings of the 22nd {I}nternational
{W}orkshop {D}escription {L}ogic ({DL}'09)},
author = {Libkin, Leonid and Sirangelo, Cristina},
title = {Open and closed world assumptions in data exchange},
pages = {1-6},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-DL09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-DL09.pdf}
}
@techreport{rr-lsv-10-17,
author = {B{\'e}rard, B{\'e}atrice and Haddad, Serge and Sassolas,
Mathieu and Zeitoun, Marc},
title = {Distributed Synthesis with Incomparable Information},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2010},
month = oct,
type = {Research Report},
number = {LSV-10-17},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-17.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-17.pdf},
note = {20~pages},
abstract = {Given (1)~an architecture defined by processes and communication
channels between them or with the environment, and (2)~a~specification on
the messages transmitted over the channels, distributed synthesis aims at
deciding existence of local programs, one for each process, that together
meet the specification, whatever the environment does. Recent work shows
that this problem can be solved when a \emph{linear preorder} sorts the
agents w.r.t. the information received from the environment.\par
In this paper we show a new decidability result in the case where this
preorder is broken by the addition of noisy agents embedded in a pipeline
architecture. This case cannot be captured by the classical framework.
Besides, this architecture makes it possible to model particular security
threats, known as covert channels, where two users (the sender and the
receiver) manage to communicate via a noisy protocol, and despite
incomparable views over the environment.}
}
@article{CD-jar10,
publisher = {Springer},
journal = {Journal of Automated Reasoning},
author = {Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
title = {Decidability and combination results for two notions of
knowledge in security protocols},
volume = 48,
number = {4},
pages = {441-487},
month = apr,
year = 2012,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-jar10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-jar10.pdf},
doi = {10.1007/s10817-010-9208-8},
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 considered:
deducibility and indistinguishability. Those notions are well-studied and
several decidability results already exist to deal with a variety of
equational theories. Most of the existing results are dedicated to
specific equational theories and only few results, especially in the case
of indistinguishability, have been obtained for equational theories with
associative and commutative properties~(AC).\par
In this paper, we show that existing 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. We also propose a general setting
for solving deducibility and indistinguishability for an important class
(called \emph{monoidal}) of equational theories involving AC operators.\par
As a consequence of these two results, new decidability and complexity
results can be obtained for many relevant equational theories.}
}
@incollection{DR-lgtcs10,
month = jan,
year = 2011,
publisher = {Cambridge University Press},
booktitle = {Lectures in Game Theory for Computer Scientists},
editor = {Apt, Krzysztof R. and Gr{\"a}del, Erich},
author = {Doyen, Laurent and Raskin, Jean-Fran{\c{c}}ois},
title = {Games with Imperfect Information: Theory and Algorithms},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DR-lgtcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DR-lgtcs10.pdf},
ps = {DR-lgtcs10.ps}
}
@article{CDH-lmcs10,
journal = {Logical Methods in Computer Science},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger,
{\relax Th}omas A.},
title = {Expressiveness and Closure Properties for Quantitative
Languages},
volume = 6,
number = {3:10},
nopages = {},
month = sep,
year = 2010,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDH-lmcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDH-lmcs10.pdf},
ps = {CDH-lmcs10.ps},
doi = {10.2168/LMCS-6(3:10)2010},
abstract = {Weighted automata are nondeterministic automata with numerical
weights on transitions. They can define quantitative languages~\(L\) that
assign to each word~\(w\) a real number~\(L(w)\). In the case of infinite
words, the value of a run is naturally computed as the maximum, limsup,
liminf, limit-average, or discounted-sum of the transition weights. The
value of a word \(w\) is the supremum of the values of the runs over
\(w\). We study expressiveness and closure questions about these
quantitative languages.\par
We first show that the set of words with value greater than a threshold
can be non-\(omega\)-regular for deterministic limit-average and
discounted-sum automata, while this set is always \(omega\)-regular when
the threshold is isolated (i.e., some neighborhood around the threshold
contains no word). In the latter case, we prove that the \(omega\)-regular
language is robust against small perturbations of the transition
weights.\par
We next consider automata with transition weights~\(0\) or \(1\) and show
thatthey are as expressive as general weighted automata in the
limit-average case, but not in the discounted-sum case.\par
Third, for quantitative languages \(L_1\) and~\(L_2\), we consider the
operations\(max(L_1,L_2)\), \(min(L_1,L_2)\), and \(1-L_1\), which
generalize the booleanoperations on languages, as well as the sum \(L_1 +
L_2\). We establish the closure properties of all classes of quantitative
languages with respect to these four operations.}
}
@inproceedings{CD-lpar10,
address = {Yogyakarta, Indonesia},
month = oct,
year = 2010,
volume = {6397},
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer},
editor = {Fernm{\"u}ller, Chrisaitn G. and Voronkov, Andrei},
acronym = {{LPAR}'10},
booktitle = {{P}roceedings of the 17th {I}nternational
{C}onference on {L}ogic for {P}rogramming,
{A}rtificial {I}ntelligence, and {R}easoning
({LPAR}'10)},
author = {Chatterjee, Krishnendu and Doyen, Laurent},
title = {The Complexity of Partial-Observation Parity Games},
pages = {1-14},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-lpar10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-lpar10.pdf},
ps = {CD-lpar10.ps},
doi = {10.1007/978-3-642-16242-8_1},
abstract = {We consider two-player zero-sum games on graphs. On the basis of
the information available to the players these games can be classified as
follows: (a)~partial-observation (both players have partial view of the
game); (b)~one-sided partial-observation (one player has
partial-observation and the other player has complete-observation); and
(c)~complete-observation (both players have complete view of the game). We
survey the complexity results for the problem of deciding the winner in
various classes of partial-observation games with \(\omega\)-regular
winning conditions specified as parity objectives. We present a reduction
from the class of parity objectives that depend on sequence of states of
the game to the sub-class of parity objectives that only depend on the
sequence of observations. We also establish that partial-observation
acyclic games are PSPACE-complete.}
}
@inproceedings{haar-wodes10,
address = {Berlin, Germany},
month = aug # {-} # sep,
year = 2010,
publisher = {IFAC},
editor = {Raisch, J{\"o}rg and Giua, Alessandro and Lafortune,
St{\'e}phane and Moor, Thomas},
acronym = {{WODES}'10},
booktitle = {{P}roceedings of the 10th {W}orkshop on {D}iscrete {E}vent {S}ystems
({WODES}'10)},
author = {Haar, Stefan},
title = {What Topology Tells us about Diagnosability in Partial Order Semantics},
pages = {221-226},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SH-wodes10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SH-wodes10.pdf},
abstract = {From a partial observation of the behaviour of a labeled
Discrete Event System, fault Diagnosis strives to determine whether or not
a given {"}invisible{"} fault event has occurred. The diagnosability problem
can be stated as follows: does the labeling allow for an outside observer
to determine the occurrence of the fault, no later than a bounded number
of events after that unobservable occurrence? In concurrent systems,
partial order semantics adds to the difficulty of the problem, but also
provides a richer and more complex picture of observation and diagnosis.
In particular, it is crucial to clarify the intuitive notion of {"}time
after fault occurrence{"}. To this end, we will use a unifying metric
framework for event structures, providing a general topological
description of diagnosability in both sequential and nonsequential
semantics for Petri nets.}
}
@inproceedings{AJRG-comnet10,
address = {Tozeur, Tunisia},
month = nov,
year = 2010,
publisher = {{IEEE} Computer Society Press},
noeditor = {},
acronym = {{C}om{N}et'10},
booktitle = {{P}roceedings of the 2nd {I}nternational {C}onference on
{C}ommunications and {N}etworking ({C}om{N}et'10)},
author = {Abassi, Ryma and Jacquemard, Florent and Rusinowitch,
Micha{\"e}l and Guemara{ }El{~}Fatmi, Sihem},
title = {{XML} Access Control: from {XACML} to Annotated Schemas},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AJRG-comnet10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AJRG-comnet10.pdf},
doi = {10.1109/COMNET.2010.5699810},
abstract = {XML became the \textit{de facto} standard for the data
representation and exchange on the internet. Regarding XML documents
access control policy definition, OASIS ratified the XACML standard. It is
a declarative language allowing the specification of authorizations as
rules. Furthermore, it is common to formally represent XML documents as
labeled trees and to handle secure requests through `user views'. A user
view is the part of the document accessible to a given user according to
the existing policy. Moreover, control access polices can be depicted as
annotated rules where annotations define for each document node whether it
is accessible. Hence, an annotated schema is a formal representation of
`user views'.\par
Our main contribution in this paper is then three folds. First, we compare
XACML policies and annotated schemas. Second, we identify a significant
fragment of XACML since this latter is very expressive and consequently
complex. Third, we define adequate translation algorithms from XACML
policies to annotated schemas.}
}
@inproceedings{JR-ppdp10,
address = {Hagenberg, Austria},
month = jul,
year = 2010,
publisher = {ACM Press},
editor = {Kutsia, Temur and Schreiner, Wolfgang and Fern{\'a}ndez, Maribel},
acronym = {{PPDP}'10},
booktitle = {{P}roceedings of the 12th {I}nternational {ACM} {SIGPLAN}
{C}onference on {P}rinciples and {P}ractice of {D}eclarative
{P}rogramming ({PPDP}'10)},
author = {Jacquemard, Florent and Rusinowitch, Micha{\"e}l},
title = {Rewrite-based verification of {XML} updates},
pages = {119-130},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JR-ppdp10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JR-ppdp10.pdf},
doi = {10.1145/1836089.1836105},
abstract = {We propose a model for XML update primitives of the W3C XQuery
Update Facility as parameterized rewriting rules of the form: {"}insert an
unranked tree from a regular tree language~\(L\) as the first child of a
node labeled by~\(a\){"}. For these rules, we give type inference
algorithms, considering types defined by several classes of unranked tree
automata. These type inference algorithms are directly applicable to XML
static typechecking, which is the problem of verifying whether, a given
document transformation always converts source documents of a given input
type into documents of a given output type. We show that typechecking for
arbitrary sequences of XML update primitives can be done in polynomial
time when the unranked tree automaton defining the output type is
deterministic and complete, and that it is EXPTIME-complete otherwise.\par
We then apply the results to the verification of access control policies
for XML updates. We propose in particular a polynomial time algorithm for
the problem of local consistency of a policy, that is, for deciding the
non-existence of a sequence of authorized update operations starting from
a given document that simulates a forbidden update operation.}
}
@article{NSV-tods10,
publisher = {ACM Press},
journal = {ACM Transactions on Database Systems},
author = {Nash, Alan and Segoufin, Luc and Vianu, Victor},
title = {Views and queries: Determinacy and rewriting},
volume = 35,
number = 3,
month = jul,
year = 2010,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/NSV-tods10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/NSV-tods10.pdf},
doi = {10.1145/1806907.1806913},
abstract = {We investigate the question of whether a query~\(Q\) can be
answered using a set~\(\textbf{V}\) of views. We first define the problem
in information-theoretic terms: we say that \(\textbf{V}\)
determines~\(Q\) if \(\textbf{V}\)~provides enough information to uniquely
determine the answer to~\(Q\). Next, we look at the problem of
rewriting~\(Q\) in terms of~\(\textbf{V}\) using a specific language.
Given a view language~\(\textbf{V}\) and query language~\(\mathcal{Q}\),
we say that a rewriting language is complete for
\(\mathcal{V}\)-to-\(\mathcal{Q}\) rewritings if every \(Q\in\mathcal{Q}\)
can be rewritten in terms of \(\textbf{V}\in\mathcal{V}\) using a query
in~\(\mathcal{R}\), whenever \(\textbf{V}\) determines~\(Q\). While query
rewriting using views has been extensively investigated for some specific
languages, the connection to the information-theoretic notion of
determinacy, and the question of completeness of a rewriting language,
have received little attention. In this paper we investigate
systematically the notion of determinacy and its connection to rewriting.
The results concern decidability of determinacy for various view and query
languages, as well as the power required of complete rewriting languages.
We consider languages ranging from first-order to conjunctive queries.}
}
@inproceedings{KBBB-fmcad10,
address = {Lugano, Switzerland},
month = oct,
year = 2010,
publisher = {{IEEE} Computer Society Press},
editor = {Bloem, Roderick and Sharygina, Natasha},
acronym = {{FMCAD}'10},
booktitle = {{P}roceedings of the 10th {I}nternational {C}onference on
{F}ormal {M}ethods in {C}omputer {A}ided {D}esign ({FMCAD}'10)},
author = {K{\"u}hne, Ulrich and Beyer, Sven and Bormann, J{\"o}rg
and Barstow, John},
title = {Automated Formal Verification of Processors Based on
Architectural Models},
pages = {129-136},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KBBB-fmcad10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KBBB-fmcad10.pdf},
abstract = {To keep up with the growing complexity of digital systems, high
level models are used in the design process. In today's processor design,
a comprehensive tool chain can be built automatically from architectural
or transaction level models, but disregarding formal verification. We
present an approach to automatically generate a complete property suite
from an architecture description, that can be used to formally verify a
register transfer level (RTL) implementation of a processor. The property
suite is complete by construction, i.e. an exhaustive verification of all
the functionality of the processor is ensured by the method. It allows for
the efficient verification of single pipeline processors, including
several advanced processor features like multicycle instructions. At the
same time, the structured approach reduces the effort for verification
significantly compared to a manual complete formal verification. The
presented techniques have been implemented in the tool FISACo, which is
demonstrated on an industrial processor.}
}
@article{AHLNW-mscs10,
publisher = {Cambridge University Press},
journal = {Mathematical Structures in Computer Science},
author = {Antonik, Adam and Huth, Michael and Larsen, Kim~G. and Nyman,
Ulrik and W{\k{a}}sowski, Andrzej},
title = {Modal and mixed specifications: key decision
problems and their complexities},
volume = 10,
number = 1,
month = feb,
year = 2010,
pages = {75-103},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AHLNW-mscs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AHLNW-mscs10.pdf},
doi = {10.1017/S0960129509990260},
abstract = {Modal and mixed transition systems are specification formalisms
that allow the mixing of over- and under-approximation. We discuss three
fundamental decision problems for such specifications:
\begin{itemize}
\item whether a set of specifications has a common implementation;
\item whether an individual specification has an implementation; and
\item whether all implementations of an individual specification are implementations of
another one.
\end{itemize}
For each of these decision problems we investigate the worst-case
computational complexity for the modal and mixed cases. We show that the
first decision problem is EXPTIME-complete for both modal and mixed
specifications. We prove that the second decision problem is
EXPTIME-complete for mixed specifications (it is known to be trivial for
modal ones). The third decision problem is also shown to be
EXPTIME-complete for mixed specifications.}
}
@inproceedings{BGGLP-scan10,
address = {Lyon, France},
month = sep,
year = 2010,
noeditor = {},
acronym = {SCAN'10},
booktitle = {{P}roceedings of the 14th {GAMM}-{IMACS} {I}nternational
{S}ymposium on {S}cientific {C}omputing, {C}omputer
{A}rithmetic and {V}alidated {N}umerics ({SCAN}'10)},
author = {Bouissou, Olivier and Goubault, {\'E}ric and
Goubault{-}Larrecq, Jean and Putot, Sylvie},
title = {A Generalization of {P}-boxes to Affine Arithmetic, and Applications to
Static Analysis of Programs},
nopages = {}
}
@article{GLK-mscs10,
publisher = {Cambridge University Press},
journal = {Mathematical Structures in Computer Science},
author = {Goubault{-}Larrecq, Jean and Keimel, Klaus},
title = {{C}hoquet-{K}endall-{M}atheron Theorems for Non-{H}ausdorff
Spaces},
volume = 21,
number = 3,
pages = {511-561},
month = jun,
year = 2011,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GLK-mscs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GLK-mscs10.pdf},
doi = {10.1017/S0960129510000617},
abstract = {We establish Choquet-Kendall-Matheron theorems on non-Hausdorff
topological spaces. This typical result of random set theory is profitably
recast in purely topological terms, using intuitions and tools from domain
theory. We obtain three variants of the theorem, each one characterizing
distributions, in the form of continuous valuations, over relevant
powerdomains of demonic, resp. angelic, resp. erratic non-determinism.}
}
@article{DR-lmcs10,
journal = {Logical Methods in Computer Science},
author = {Demri, St{\'e}phane and Rabinovich, Alexander},
title = {The Complexity of Linear-time Temporal Logic over the Class
of Ordinals},
volume = 6,
number = 4,
nopages = {},
month = dec,
year = 2010,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DR-lmcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DR-lmcs10.pdf},
doi = {10.2168/LMCS-6(4:9)2010},
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 by 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{SD-jelia10,
address = {Helsinki, Finland},
month = sep,
year = 2010,
volume = 6431,
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer},
editor = {Niemel{\"a}, Ilkka and Janhunen, Tomi},
acronym = {{JELIA}'10},
booktitle = {{P}roceedings of the 12th {E}uropean {C}onference on {L}ogics in
{A}rtificial {I}ntelligence ({JELIA}'10)},
author = {Demri, St{\'e}phane},
title = {Counter Systems for Data Logics},
pages = {10},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SD-jelia10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SD-jelia10.pdf},
doi = {10.1007/978-3-642-15675-5_3},
abstract = {Data logics are logical formalisms that are used to specify
properties on structures equipped with data (data words, data trees, runs
from counter systems, timed words, etc.). In this survey talk, we shall
see how satisfiability problems for such data logics are related to
reachability problems for counter systems (including counter automata with
errors, vector addition systems with states, etc.). This is the
opportunity to provide an overview about the relationships between data
logics and verification problems for counter systems.}
}
@inproceedings{CSV-fsttcs10,
address = {Chennai, India},
month = dec,
year = 2010,
volume = 8,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Lodaya, Kamal and Mahajan, Meena},
acronym = {{FSTTCS}'10},
booktitle = {{P}roceedings of the 30th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'10)},
author = {Chadha, Rohit and Sistla, A. Prasad and Viswanathan, Mahesh},
title = {Model Checking Concurrent Programs with Nondeterminism and Randomization},
pages = {364-375},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CSV-fsttcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CSV-fsttcs10.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2010.364},
abstract = {For concurrent probabilistic programs having process-level
nondeterminism, it is often necessary to restrict the class of schedulers
that resolve nondeterminism to obtain sound and precise model checking
algorithms. In this paper, we introduce two classes of schedulers called
\emph{view consistent} and \emph{locally Markovian} schedulers and
consider the model checking problem of concurrent, probabilistic programs
under these alternate semantics. Specifically, given a B{\"u}chi
automaton~\(\textsf{Spec}\), a~threshold~\(x\in[0,1]\), and a concurrent
program~\(\mathbb{P}\), the model checking problem asks if the measure of
computations of~\(\mathbb{P}\) that satisfy~\(\textsf{Spec}\) is at
least~\(x\), under all view consistent (or locally Markovian) schedulers.
We give precise complexity results for the model checking problem (for
different classes of B{\"u}chi automata specifications) and contrast it
with the complexity under the standard semantics that considers all
schedulers. }
}
@inproceedings{AGMN-fsttcs10,
address = {Chennai, India},
month = dec,
year = 2010,
volume = 8,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Lodaya, Kamal and Mahajan, Meena},
acronym = {{FSTTCS}'10},
booktitle = {{P}roceedings of the 30th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'10)},
author = {Akshay, S. and Gastin, Paul and Mukund, Madhavan and Narayan Kumar, K.},
title = {Model checking time-constrained scenario-based specifications},
pages = {204-215},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AGMN-fsttcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGMN-fsttcs10.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2010.204},
abstract = {We consider the problem of model checking message-passing
systems with real-time requirements. As behavioural specifications, we use
message sequence charts (MSCs) annotated with timing constraints. Our
system model is a network of communicating finite state machines with
local clocks, whose global behaviour can be regarded as a timed automaton.
Our goal is to verify that all timed behaviours exhibited by the system
conform to the timing constraints imposed by the specification. In
general, this corresponds to checking inclusion for timed languages, which
is an undecidable problem even for timed regular languages. However, we
show that we can translate regular collections of time-constrained MSCs
into a special class of event-clock automata that can be determinized and
complemented, thus permitting an algorithmic solution to the model
checking problem.}
}
@inproceedings{CDHR-fsttcs10,
address = {Chennai, India},
month = dec,
year = 2010,
volume = 8,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Lodaya, Kamal and Mahajan, Meena},
acronym = {{FSTTCS}'10},
booktitle = {{P}roceedings of the 30th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'10)},
author = {Chatterjee, Krishnendu and
Doyen, Laurent and Henzinger, {\relax Th}omas A. and Raskin, Jean-Fran{\c{c}}ois},
title = {Generalized Mean-payoff and Energy Games},
pages = {505-516},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDHR-fsttcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDHR-fsttcs10.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2010.505}
}
@inproceedings{BFLZ-fsttcs10,
address = {Chennai, India},
month = dec,
year = 2010,
volume = 8,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Lodaya, Kamal and Mahajan, Meena},
acronym = {{FSTTCS}'10},
booktitle = {{P}roceedings of the 30th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'10)},
author = {Bonnet, R{\'e}mi and Finkel, Alain and Leroux, J{\'e}r{\^o}me
and Zeitoun, Marc},
title = {Place-Boundedness for Vector Addition Systems with one zero-test},
pages = {192-203},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFLZ-fsttcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFLZ-fsttcs10.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2010.192},
abstract = {Reachability and boundedness problems have been shown decidable
for Vector Addition Systems with one zero-test. Surprisingly,
place-boundedness remained open. We provide here a variation of the
Karp-Miller algorithm to compute a basis of the downward closure of the
reachability set which allows to decide place-boundedness. This forward
algorithm is able to pass the zero-tests thanks to a finer cover, hybrid
between the reachability and cover sets, reclaiming accuracy on one
component. We show that this filtered cover is still recursive, but that
equality of two such filtered covers, even for usual Vector Addition
Systems (with no zero-test), is undecidable.}
}
@inproceedings{HBMOW-fsttcs10,
address = {Chennai, India},
month = dec,
year = 2010,
volume = 8,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Lodaya, Kamal and Mahajan, Meena},
acronym = {{FSTTCS}'10},
booktitle = {{P}roceedings of the 30th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'10)},
author = {Hunter, Paul and Bouyer, Patricia and Markey, Nicolas and
Ouaknine, Jo{\"e}l and Worrell, James},
title = {Computing rational radical sums in uniform \(\textsf{TC}^{0}\)},
pages = {308-316},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HBMOW-fsttcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HBMOW-fsttcs10.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2010.308},
abstract = {A~fundamental problem in numerical computation and computational
geometry is to determine the sign of arithmetic expressions in radicals.
Here we consider the simpler problem of deciding whether \(\sum_{i=1}^m
C_i \cdot A_i^{X_i}\) is zero for given rational numbers~\(A_i\),
\(C_i\),~\(X_i\). It~has been known for almost twenty years that this can
be decided in polynomial time. In this paper we improve this result by
showing membership in uniform \(\textsf{TC}^0\). This requires several
significant departures from Bl{\"o}mer's polynomial-time algorithm as the
latter crucially relies on primitives, such as gcd computation and binary
search, that are not known to be in~\(\textsf{TC}^0\).}
}
@inproceedings{DLM-fsttcs10,
address = {Chennai, India},
month = dec,
year = 2010,
volume = 8,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Lodaya, Kamal and Mahajan, Meena},
acronym = {{FSTTCS}'10},
booktitle = {{P}roceedings of the 30th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'10)},
author = {Da{~}Costa, Arnaud and Laroussinie, Fran{\c{c}}ois and Markey, Nicolas},
title = {{ATL} with strategy contexts: Expressiveness and Model Checking},
pages = {120-132},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DLM-fsttcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DLM-fsttcs10.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2010.120},
abstract = {We study the alternating-time temporal logics \(\textsf{ATL}\)
and~\(\textsf{ATL}^{*}\) extended with strategy contexts: these make
agents commit to their strategies during the evaluation of formulas,
contrary to plain \(\textsf{ATL}\) and~\(\textsf{ATL}^{*}\) where strategy
quantifiers reset previously selected strategies.\par
We illustrate the important expressive power of strategy contexts by
proving that they make the extended logics, namely
\(\textsf{ATL}_{\textsf{sc}}\) and~\(\textsf{ATL}_{\textsf{sc}}^{*}\), equally
expressive: any~formula in~\(\textsf{ATL}_{\textsf{sc}}^{*}\) can be
translated into an equivalent, linear-size \(\textsf{ATL}_{\textsf{sc}}\)
formula. Despite the high expressiveness of these logics, we prove that
they remain decidable by designing a tree-automata-based algorithm for
model-checking \(\textsf{ATL}_{\textsf{sc}}\) on the full class of
\(n\)-player concurrent game structures.}
}
@proceedings{MW-time2010,
author = {Markey, Nicolas and Wijsen, Jef},
editor = {Markey, Nicolas and Wijsen, Jef},
title = {{P}roceedings of the 17th {I}nternational {S}ymposium on
{T}emporal {R}epresentation and {R}easoning
({TIME}'10)},
booktitle = {{P}roceedings of the 17th {I}nternational {S}ymposium on
{T}emporal {R}epresentation and {R}easoning
({TIME}'10)},
year = 2010,
month = sep,
publisher = {{IEEE} Computer Society Press},
address = {Paris, France},
url = {http://ieeexplore.ieee.org/xpl/tocresult.jsp?reload=true&isnumber=5601852},
doi = {10.1109/TIME.2010.4}
}
@proceedings{GL-concur10,
author = {Gastin, Paul and Laroussinie, Fran{\c{c}}ois},
editor = {Gastin, Paul and Laroussinie, Fran{\c{c}}ois},
title = {{P}roceedings of the 21st
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'10)},
booktitle = {{P}roceedings of the 21st
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'10)},
year = 2010,
month = aug # {-} # sep,
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {6269},
url = {http://www.springerlink.com/content/978-3-642-15374-7},
doi = {10.1007/978-3-642-15375-4}
}
@inproceedings{FHL-express2010,
address = {Paris, France},
month = aug,
year = 2010,
volume = 41,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Fr{\"o}schle, Sibylle and Valencia, Franck},
acronym = {{EXPRESS}'10},
booktitle = {{P}roceedings of the 17th {I}nternational
{W}orkshop on {E}xpressiveness in
{C}oncurrency
({EXPRESS}'10)},
author = {Figueira, Diego and Hofman, Piotr and Lasota, S{\l}awomir},
title = {Relating timed and register automata},
pages = {61-75},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FHL-express10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FHL-express10.pdf},
doi = {10.4204/EPTCS.41.5},
abstract = {Timed automata and register automata are well-known models of
computation over timed and data words respectively. The former has clocks
that allow to test the lapse of time between two events, whilst the latter
includes registers that can store data values for later comparison.
Although these two models behave in appearance differently, several
decision problems have the same (un)decidability and complexity results
for both models. As a prominent example, emptiness is decidable for
alternating automata with one clock or register, both with non-primitive
recursive complexity. This is not by chance.\par
This work confirms that there is indeed a tight relationship between the
two models. We show that a run of a timed automaton can be simulated by a
register automaton, and conversely that a run of a register automaton can
be simulated by a timed automaton. Our results allow to transfer
complexity and decidability results back and forth between these two kinds
of models. We justify the usefulness of these reductions by obtaining new
results on register automata.}
}
@inproceedings{DKRS-fast10,
address = {Pisa, Italy},
month = sep,
year = 2010,
volume = 6561,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Degano, Pierpaolo and Etalle, Sandro and Guttman, Joshua},
acronym = {{FAST}'10},
booktitle = {{R}evised {S}elected {P}apers of the 7th {I}nternational {W}orkshop on
{F}ormal {A}spects in {S}ecurity and {T}rust ({FAST}'10)},
author = {Delaune, St{\'e}phanie and Kremer, Steve and Ryan, Mark D. and
Steel, Graham},
title = {A~Formal Analysis of Authentication in the {TPM}},
pages = {111-125},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DKRS-fast10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DKRS-fast10.pdf},
ps = {DKRS-fast10.ps},
doi = {10.1007/978-3-642-19751-2_8},
abstract = {The Trusted Platform Module~(TPM) is a hardware chip designed to
enable computers to achieve a greater level of security than is possible
in software alone. To this end, the TPM provides a way to store
cryptographic keys and other sensitive data in its shielded memory.
Through its API, one can use those keys to achieve some security goals.
The TPM is a complex security component, whose specification consists of
more than \(700\)~pages.\par
We model a collection of four TPM commands, and we identify and formalise
their security properties. Using the tool ProVerif, we rediscover some
known attacks and some new variations on them. We propose modifications to
the API and verify our properties for the modified API.}
}
@inproceedings{DKRS-secco10,
address = {Paris, France},
month = aug,
year = 2010,
editor = {Cortier, V{\'e}ronique and Chatzikokolakis, Kostas},
acronym = {{SecCo}'10},
booktitle = {{P}reliminary {P}roceedings of the 8th {I}nternational
{W}orkshop on {S}ecurity {I}ssues in
{C}oordination {M}odels, {L}anguages and
{S}ystems ({SecCo}'10)},
author = {Delaune, St{\'e}phanie and Kremer, Steve and Ryan, Mark D. and
Steel, Graham},
title = {A~Formal Analysis of Authentication in the~{TPM} (short paper)},
nopages = {},
nmnote = {did not appear in postproc. EPTCS 51},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DKRS-secco10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DKRS-secco10.pdf},
ps = {DKRS-secco10.ps}
}
@article{bwa-jcs10,
publisher = {{IOS} Press},
journal = {Journal of Computer Security},
author = {Baudet, Mathieu and Warinschi,
Bogdan and Abadi, Mart{\'\i}n},
title = {Guessing Attacks and the Computational Soundness of Static
Equivalence},
volume = 18,
number = 5,
pages = {909-968},
month = sep,
year = 2010,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/bwa-jcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/bwa-jcs10.pdf},
doi = {10.3233/JCS-2009-0386},
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{bgl-setop10,
address = {Athens, Greece},
month = sep,
year = 2010,
volume = 6514,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Cavalli, Ana and Leneutre, Jean},
acronym = {{DPM}{{\slash}}{SETOP}'10},
booktitle = {{R}evised {S}elected {P}apers of the 5th {I}nternational {W}orkshop
on {D}ata {P}rivacy {M}anagement and {A}utonomous
{S}pontaneous {S}ecurity ({DPM}'10) and 3rd {I}nternational
{W}orkshop on {A}utonomous
and {S}pontaneous {S}ecurity ({SETOP}'10)},
author = {Benzina, Hedi and Goubault{-}Larrecq, Jean},
title = {Some Ideas on Virtualized Systems Security, and Monitors},
pages = {244-258},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/bgl-setop10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/bgl-setop10.pdf},
doi = {10.1007/978-3-642-19348-4_18},
abstract = {Virtualized systems such as Xen, VirtualBox, VMWare or QEmu have
been proposed to increase the level of security achievable on personal
computers. On the other hand, such virtualized systems are now targets for
attacks. We propose an intrusion detection architecture for virtualized
systems, and discuss some of the security issues that arise. We argue that
a weak spot of such systems is domain zero administration, which is left
entirely under the administrator's responsibility, and is in particular
vulnerable to trojans. To~avert some of the risks, we~propose to install a
role-based access control model with possible role delegation, and to
describe all undesired activity ows through simple temporal formulas. We
show how the latter are compiled into Orchids rules, via a fragment of
linear temporal logic, through a generalization of the so-called history
variable mechanism.}
}
@article{LV-dc10,
publisher = {Springer},
journal = {Distributed Computing},
author = {Lozes, {\'E}tienne and Villard, Jules},
title = {A~spatial equational logic for the applied \(\pi\)-calculus},
pages = {61-83},
volume = 23,
number = 1,
year = 2010,
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LV-discomp10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LV-discomp10.pdf},
doi = {10.1007/s00446-010-0112-6},
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 \(\textsf{A}\pi\textsf{L}\) whose
models are processes of the applied \(\pi\)-calculus. This extension of
the \(\pi\)-calculus allows term manipulation and records communications
as aliases in a frame, thus augmenting the predefined underlying
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
\(\textsf{A}\pi\textsf{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
\(\textsf{A}\pi\textsf{L}\)'s expressivity, we also show that it can
eliminate standard term quantification.}
}
@inproceedings{andre-infinity2010,
address = {Singapore},
month = sep,
year = 2010,
volume = 39,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Chen, Yu-Fang and Rezine, Ahmed},
acronym = {{INFINITY}'10},
booktitle = {{P}roceedings of the 12th {I}nternational
{W}orkshops on {V}erification of {I}nfinite
{S}tate {S}ystems
({INFINITY}'10)},
author = {Andr{\'e}, {\'E}tienne},
title = {{IMITATOR~II}: A~Tool for Solving the Good Parameters Problem in Timed
Automata},
pages = {91-99},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/andre-infinity10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/andre-infinity10.pdf},
doi = {10.4204/EPTCS.39.7},
abstract = {We present here IMITATOR~II, a~new version of IMITATOR, a~tool
implementing the {"}inverse method{"} for parametric timed automata: given
a reference valuation of the parameters, it~synthesizes a constraint such
that, for any valuation satisfying this constraint, the system behaves the
same as under the reference valuation in terms of traces, \textit{i.e.},
alternating sequences of locations and actions.\par
IMITATOR~II also implements the {"}behavioral cartography algorithm{"},
allowing us to solve the following good parameters problem: find a set of
valuations within a given bounded parametric domain for which the system
behaves well.\par
We present new features and optimizations of the tool, and give results of
applications to various examples of asynchronous circuits and
communication protocols.}
}
@inproceedings{demri-infinity2010,
address = {Singapore},
month = sep,
year = 2010,
volume = 39,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Chen, Yu-Fang and Rezine, Ahmed},
acronym = {{INFINITY}'10},
booktitle = {{P}roceedings of the 12th {I}nternational
{W}orkshops on {V}erification of {I}nfinite
{S}tate {S}ystems
({INFINITY}'10)},
author = {Demri, St{\'e}phane},
title = {On Selective Unboundedness of~{VASS}},
pages = {1-15},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/demri-infinity10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/demri-infinity10.pdf},
doi = {10.4204/EPTCS.39.1},
abstract = {Numerous properties of vector addition systems with states
amount to checking the (un)boundedness of some selective feature
(\textit{e.g.}, number of reversals, run length). Some of these features
can be checked in exponential space by using Rackoff's proof or its
variants, combined with Savitch's theorem. However, the question is still
open for many others, e.g., reversal-boundedness. In the paper, we
introduce the class of generalized unboundedness properties that can be
verified in exponential space by extending Rackoff's technique, sometimes
in an unorthodox way. We obtain new optimal upper bounds, for example for
place-boundedness problem, reversal-boundedness detection (several
variants exist), strong promptness detection problem and regularity
detection. Our analysis is sufficiently refined so as we also obtain a
polynomial-space bound when the dimension is fixed.}
}
@phdthesis{carre-phd2010,
author = {Carr{\'e}, Jean-Loup},
title = {Analyse statique de programmes multi-thread pour l'embarqu{\'e}},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2010,
month = jul,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/carre-these10.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/carre-these10.pdf}
}
@phdthesis{akshay-phd2010,
author = {Akshay, S.},
title = {Sp{\'e}cification et v{\'e}rification pour des syst{\`e}mes
distribu{\'e}s et temporis{\'e}s},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2010,
month = jul,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/akshay-phd.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/akshay-phd.pdf}
}
@inproceedings{BDF-nsmc10,
address = {Williamsburg, Virginia, USA},
month = sep,
year = 2010,
editor = {Benzi, Michele and Dayar, Tugrul},
acronym = {{NSMC}'10},
booktitle = {{P}roceedings of the 6th {I}nternational {M}eeting on the
{N}umerical {S}olution of {M}arkov {C}hain ({NSMC}'10)},
author = {Bu\v{s}i\'{c}, Ana and Djafri, Hilal and Fourneau, Jean-Michel},
title = {Stochastic Bounds for Censored {M}arkov Chains},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDF-nsmc10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDF-nsmc10.pdf},
abstract = {Censored Markov chains~(CMC) allow to represent the conditional
behavior of a system within a subset of observed states. They provide a
theoretical framework to study the truncation of a discrete-time Markov
chain when the generation of the state-space is too hard or when the
number of states is too large. But the stochastic matrix of a CMC may be
difficult to obtain. Dayar \textit{et~al.}~(2006) have proposed an
algorithm, called DPY, that computes a stochastic bounding matrix for a
CMC with a smaller complexity with only a partial knowledge of the chain.
We prove that this algorithm is optimal for the information they take into
account. We also show how some additional knowledge on the chain can
improve stochastic bounds for~CMC.}
}
@article{KMT-jar10,
publisher = {Springer},
journal = {Journal of Automated Reasoning},
author = {Kremer, Steve and Mercier, Antoine and Treinen, Ralf},
title = {Reducing Equational Theories for the Decision of Static
Equivalence},
year = 2012,
month = feb,
pages = {197-217},
number = 48,
volume = 2,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KMT-jar10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KMT-jar10.pdf},
doi = {10.1007/s10817-010-9203-0},
abstract = {Static equivalence is a well established notion of
indistinguishability of sequences of terms which is useful in the symbolic
analysis of cryptographic protocols. Static equivalence modulo equational
theories allows for a more accurate representation of cryptographic
primitives by modelling properties of operators by equational axioms. We
develop a method that allows us in some cases to simplify the task of
deciding static equivalence in a multi-sorted setting, by removing a
symbol from the term signature and reducing the problem to several simpler
equational theories. We illustrate our technique at hand of bilinear
pairings.}
}
@article{CDK-jar10,
publisher = {Springer},
journal = {Journal of Automated Reasoning},
author = {Ciob{\^a}c{\u{a}}, {\c{S}}tefan and Delaune, St{\'e}phanie
and Kremer, Steve},
title = {Computing knowledge in security protocols under convergent
equational theories},
year = 2012,
month = feb,
pages = {219-262},
number = 2,
volume = 48,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDK-jar10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDK-jar10.pdf},
doi = {10.1007/s10817-010-9197-7},
abstract = {The analysis of security protocols requires reasoning about the
knowledge an attacker acquires by eavesdropping on network traffic. In
formal approaches, the messages exchanged over the network are modeled by
a term algebra equipped with an equational theory axiomatizing the
properties of the cryptographic primitives (e.g. encryption, signature).
In this context, two classical notions of knowledge, deducibility and
indistinguishability, yield corresponding decision problems.\par
We propose a procedure for both problems under arbitrary convergent
equational theories. Since the underlying problems are undecidable we
cannot guarantee termination. Nevertheless, our procedure terminates on a
wide range of equational theories. In particular, we obtain a new
decidability result for a theory we encountered when studying electronic
voting protocols. We also provide a prototype implementation.}
}
@inproceedings{BCFS-ccs10,
address = {Chicago, Illinois, USA},
month = oct,
year = 2010,
publisher = {ACM Press},
acronym = {{CCS}'10},
booktitle = {{P}roceedings of the 17th {ACM} {C}onference
on {C}omputer and {C}ommunications {S}ecurity
({CCS}'10)},
author = {Bortolozzo, Matteo and Centenaro, Matteo and Focardi,
Riccardo and Steel, Graham},
title = {Attacking and Fixing {PKCS}\#11 Security Tokens},
pages = {260-269},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCFS-ccs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCFS-ccs10.pdf},
doi = {10.1145/1866307.1866337},
abstract = {We show how to extract sensitive cryptographic keys from a
variety of commercially available tamper resistant cryptographic security
tokens, exploiting vulnerabilities in their RSA PKCS\#11 based APIs. The
attacks are performed by Tookan, an automated tool we have developed,
which reverse-engineers the particular token in use to deduce its
functionality, constructs a model of its API for a model checker, and then
executes any attack trace found by the model checker directly on the
token. We describe the operation of Tookan and give results of testing the
tool on 17 commercially available tokens: 9~were vulnerable to attack,
while the other 8 had severely restricted functionality. One of the
attacks found by the model checker has not previously appeared in the
literature. We show how Tookan may be used to verify patches to insecure
devices, and give a secure configuration that we have implemented in a
patch to a software token simulator. This is the first such configuration
to appear in the literature that does not require any new cryptographic
mechanisms to be added to the standard. We comment on lessons for future
key management APIs.}
}
@article{BJLMO-jwcn10,
publisher = {Hindawi Publishing Corp.},
journal = {EURASIP Journal on Wireless Communications and Networking},
author = {Brihaye, {\relax Th}omas and Jungers, Marc and Lasaulce,
Samson and Markey, Nicolas and Oreiby, Ghassan},
title = {Using Model Checking for Analyzing Distributed Power Control
Problems},
year = 2010,
volume = {2010},
number = {861472},
nopages = {},
month = jun,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BJLMO-jwcn10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BJLMO-jwcn10.pdf},
doi = {10.1155/2010/861472},
abstract = {Model checking~(MC) is a formal verification technique which has
been known and still knows a resounding success in the computer science
community. Realizing that the distributed power control~(PC) problem can be
modeled by a timed game between a given transmitter and its environment,
the authors wanted to know whether this approach can be applied to
distributed~PC. It~turns out that it can be applied successfully and allows
one to analyze realistic scenarios including the case of discrete transmit
powers and games with incomplete information. The proposed methodology is
as follows. We state some objectives a transmitter-receiver pair would like
to reach. The network is modeled by a game where transmitters are
considered as timed automata interacting with each other. The objectives
are then translated into timed alternating-time temporal logic formulae and
MC is exploited to know whether the desired properties are verified and
determine a winning strategy.}
}
@article{CKW-jar2010,
publisher = {Springer},
journal = {Journal of Automated Reasoning},
author = {Cortier, V{\'e}ronique and Kremer, Steve and Warinschi, Bogdan},
title = {A~Survey of Symbolic Methods in Computational Analysis of
Cryptographic Systems},
year = 2010,
month = apr,
pages = {225-259},
number = {3-4},
volume = {46},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CKW-jar10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CKW-jar10.pdf},
doi = {10.1007/s10817-010-9187-9},
abstract = {Since the 1980s, two approaches have been developed for
analyzing security protocols. One of the approaches relies on a
computational model that considers issues of complexity and probability.
This approach captures a strong notion of security, guaranteed against all
probabilistic polynomial-time attacks. The other approach relies on a
symbolic model of protocol executions in which cryptographic primitives
are treated as black boxes. Since the seminal work of Dolev and Yao, it
has been realized that this latter approach enables significantly simpler
and often automated proofs. However, the guarantees that it offers with
respect to the more detailed computational models have been quite
unclear.\par
For more than twenty years the two approaches have coexisted but evolved
mostly independently. Recently, significant research efforts attempt to
develop paradigms for cryptographic systems analysis that combines the
best of both worlds. There are two broad directions that have been
followed. Computational soundness aims to establish sufficient conditions
under which results obtained using symbolic models imply security under
computational models. The direct approach aims to apply the principles and
the techniques developed in the context of symbolic models directly to
computational ones.\par
In this paper we survey existing results along both of these directions.
Our goal is to provide a rather complete summary that could act as a quick
reference for researchers who want to contribute to the field, want to
make use of existing results, or just want to get a better picture of what
results already exist.}
}
@inproceedings{KRS-esorics10,
address = {Athens, Greece},
month = sep,
year = 2010,
volume = {6345},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Gritzalis, Dimitris and Preneel, Bart},
acronym = {{ESORICS}'10},
booktitle = {{P}roceedings of the 15th {E}uropean {S}ymposium on
{R}esearch in {C}omputer {S}ecurity ({ESORICS}'10)},
author = {Kremer, Steve and Ryan, Mark D. and Smyth, Ben},
title = {Election verifiability in electronic voting protocols},
pages = {389-404},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KRS-esorics10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KRS-esorics10.pdf},
doi = {10.1007/978-3-642-15497-3_24},
abstract = {We present a formal, symbolic definition of election
verifiability for electronic voting protocols in the context of the
applied pi calculus. Our definition is given in terms of boolean tests
which can be performed on the data produced by an election. The definition
distinguishes three aspects of verifiability: individual, universal and
eligibility verifiability. It also allows us to determine precisely which
aspects of the system's hardware and software must be trusted for the
purpose of election verifiability. In contrast with earlier work our
definition is compatible with a large class of electronic voting schemes,
including those based on blind signatures, homomorphic encryption and
mixnets. We demonstrate the applicability of our formalism by analysing
three protocols: FOO, Helios~2.0, and Civitas (the latter two have been
deployed).}
}
@inproceedings{DDS-esorics10,
address = {Athens, Greece},
month = sep,
year = 2010,
volume = {6345},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Gritzalis, Dimitris and Preneel, Bart},
acronym = {{ESORICS}'10},
booktitle = {{P}roceedings of the 15th {E}uropean {S}ymposium on
{R}esearch in {C}omputer {S}ecurity ({ESORICS}'10)},
author = {Dahl, Morten and Delaune, St{\'e}phanie and Steel, Graham},
title = {Formal Analysis of Privacy for Vehicular Mix-Zones},
pages = {55-70},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-esorics10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-esorics10.pdf},
ps = {DDS-esorics10.ps},
doi = {10.1007/978-3-642-15497-3_4},
abstract = {Safety critical applications for recently proposed vehicle to
vehicle ad-hoc networks~(VANETs) rely on a beacon signal, which poses a
threat to privacy since it could allow a vehicle to be tracked. Mix-zones,
where vehicles encrypt their transmissions and then change their
identifiers, have been proposed as a solution to this problem. \par
In this work, we~describe a formal analysis of mix-zones. We~model a
mix-zone and propose a formal definition of privacy for such a zone.
We~give a set of necessary conditions for any mix-zone protocol to preserve
privacy. We~analyse, using the tool ProVerif, a~particular proposal for key
distribution in mix-zones, the CMIX protocol. We~report attacks on privacy
and we propose a fix.}
}
@inproceedings{phs-rp10,
address = {Brno, Czech Republic},
month = aug,
year = 2010,
volume = 6227,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ku{\v c}era, Anton{\'\i}n and Potapov, Igor},
acronym = {{RP}'10},
booktitle = {{P}roceedings of the 4th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'10)},
author = {Schnoebelen, {\relax Ph}ilippe},
title = {Lossy Counter Machines Decidability Cheat Sheet},
pages = {51-75},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/phs-rp10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/phs-rp10.pdf},
doi = {10.1007/978-3-642-15349-5_4},
abstract = {Lossy counter machines (LCM's) are a variant of Minsky counter
machines based on weak (or~unreliable) counters in the sense that they can
decrease nondeterministically and without notification. This model,
introduced by R.~Mayr [TCS~297:337-354 (2003)], is not yet very
well known, even though it has already proven useful for establishing
hardness results.\par
In this paper we survey the basic theory of LCM's and their verification
problems, with a focus on the decidability/undecidability divide. }
}
@inproceedings{AF-rp10,
address = {Brno, Czech Republic},
month = aug,
year = 2010,
volume = 6227,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ku{\v c}era, Anton{\'\i}n and Potapov, Igor},
acronym = {{RP}'10},
booktitle = {{P}roceedings of the 4th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'10)},
author = {Andr{\'e}, {\'E}tienne and Fribourg, Laurent},
title = {Behavioral Cartography of Timed Automata},
pages = {76-90},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AF-rp10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AF-rp10.pdf},
doi = {10.1007/978-3-642-15349-5_5},
abstract = {We aim at finding a set of timing parameters for which a given
timed automaton has a {"}good{"} behavior. We~present here a novel
approach based on the decomposition of the parametric space into
behavioral tiles, \textit{i.e.}, sets of parameter valuations for which
the behavior of the system is uniform. This gives us a behavioral
cartography according to the values of the parameters.\par
It is then straightforward to partition the space into a {"}good{"} and a
{"}bad{"} subspace, according to the behavior of the tiles. We extend this
method to probabilistic systems, allowing to decompose the parametric
space into tiles for which the minimal (resp. maximal) probability of
reaching a given location is uniform. An~implementation has been made, and
experiments successfully conducted.}
}
@inproceedings{CJ-notere10,
address = {Tozeur, Tunisia},
month = may # {-} # jun,
year = 2010,
publisher = {{IEEE} Computer Society Press},
noeditor = {},
acronym = {{NOTERE}'10},
booktitle = {{A}ctes de la 10{\`e}me {C}onf{\'e}rence {I}nternationale sur les
{NO}uvelles {TE}chnologies de la {R\'E}partition ({NOTERE}'10)},
author = {Chatain, {\relax Th}omas and Jard, Claude},
title = {S{\'e}mantique concurrente symbolique des r{\'e}seaux
de {P}etri saufs et d{\'e}pliages finis des r{\'e}seaux
temporels},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CJ-notere10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CJ-notere10.pdf},
abstract = {On consid\`ere des r\'eseaux de Petri color\'es, \`a contraintes
lin\'eaires et pouvant poss\'eder des arcs de lecture. Sur cette classe,
on d\'efinit une s\'emantique concurrente en termes de processus d'ordre
partiel permettant de garder explicite l'ind\'ependance entre des tirs de
transitions. L'ensemble des processus peut \^etre repr\'esent\'e en
utilisant la notion de d\'epliage symbolique. Nous montrons alors comment
les r\'eseaux de Petri temporels peuvent \^etre cod\'es dans ce mod\`ele
\`a l'aide d'une transformation syntaxique pr\'eservant la concurrence.
Cette transformation permet de d\'efinir la notion de d\'epliage de
r\'eseaux de Petri temporels et d'en donner une repr\'esentation par
pr\'efixe fini.}
}
@inproceedings{BFCH-dsn09,
address = {Estoril, Portugal},
month = jun # {-} # jul,
year = 2009,
publisher = {{IEEE} Computer Society Press},
noeditor = {},
acronym = {{DSN}'09},
booktitle = {{P}roceedings of the 39th {A}nnual {IEEE}{\slash}{IFIP}
{I}nternational {C}onference on {D}ependable {S}ystems and
{N}etworks ({DSN}'09)},
author = {Beccuti, Marco and Franceschinis, Giuliana and
Codetta{-}Raiteri, Daniele and Haddad, Serge},
title = {Parametric {NdRFT} for the derivation of optimal repair
strategies},
pages = {399-408},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFCH-dsn09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFCH-dsn09.pdf},
doi = {10.1109/DSN.2009.5270312},
abstract = {Non deterministic Repairable Fault Trees~(NdRFT) are a recently
proposed modeling formalism for the study of optimal repair strategies:
they are based on the widely adopted Fault Tree formalism, but in addition
to the failure modes, NdRFTs allow to define possible repair actions. In a
previous pa per the formalism has been introduced together with an
analysis method and a tool allowing to automatically derive the best
repair strategy to be applied in each state. The analysis technique is
based on the generation and solution of a Markov Decision Process. In this
paper we present an extension, ParNdRFT, that allows to exploit the
presence of redundancy to reduce the complexity of the model and of the
analysis. It is based on the translation of the ParNdRFT in to a Markov
Decision Well-Formed Net, i.e. a model specified by means of an High Level
Petri Net formalism. The translated model can be efficiently solved thanks
to existing algorithms that generate a reduced state space automatically
exploiting the model symmetries.}
}
@inproceedings{DHLN-acsd10,
address = {Braga, Portugal},
month = jun,
year = 2010,
publisher = {{IEEE} Computer Society Press},
editor = {Gomes, Lu{\'\i}s and Khomenko, Victor},
acronym = {{ACSD}'10},
booktitle = {{P}roceedings of the 10th {I}nternational
{C}onference on {A}pplication of {C}oncurrency
to {S}ystem {D}esign
({ACSD}'10)},
author = {Doyen, Laurent and Henzinger, {\relax Th}omas A. and Legay, Axel and
Nickovic, Dejan},
title = {Robustness of Sequential Circuits},
pages = {77-84},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DHLN-acsd10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DHLN-acsd10.pdf},
doi = {10.1109/ACSD.2010.26},
abstract = {Digital components play a central role in the design of complex
embedded systems. These components are interconnected with other, possibly
analog, devices and the physical environment. This environment cannot be
entirely captured and can provide inaccurate input data to the component.
It~is thus important for digital components to have a robust behavior,
\textit{i.e.},~the presence of a small change in the input sequences
should not result in a drastic change in the output sequences.\par
In this paper, we study a notion of robustness for sequential circuits.
However, since sequential circuits may have parts that are naturally
discontinuous (\textit{e.g.},~digital controllers with switching
behavior), we~need a flexible framework that accommodates this fact and
leaves discontinuous parts of the circuit out from the robustness
analysis. As a consequence, we~consider sequential circuits that have
their input variables partitioned into two disjoint sets: control and
disturbance variables. Our contributions are (1)~a~definition of
robustness for sequential circuits as a form of continuity with respect to
disturbance variables, (2)~the~characterization of the exact class of
sequential circuits that are robust according to our definition,
(3)~an~algorithm to decide whether a sequential circuit is robust
or~not.}
}
@inproceedings{DDGRT-csl10,
address = {Brno, Czech Republic},
month = aug,
year = 2010,
volume = {6247},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Dawar, Anuj and Veith, Helmut},
acronym = {{CSL}'10},
booktitle = {{P}roceedings of the 19th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'10)},
author = {Degorre, Aldric and Doyen, Laurent and Gentilini, Raffaella
and Raskin, Jean-Fran{\c{c}}ois and Toru{\'n}czyk, Szymon},
title = {Energy and Mean-Payoff Games with Imperfect Information},
pages = {260-274},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DDGRT-csl10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DDGRT-csl10.pdf},
doi = {10.1007/978-3-642-15205-4_22},
abstract = {We consider two-player games with imperfect information and
quantitative objective. The game is played on a weighted graph with a
state space partitioned into classes of indistinguishable states, giving
players partial knowledge of the state. In an energy game, the weights
represent resource consumption and the objective of the game is to
maintain the sum of weights always nonnegative. In a mean-payoff game, the
objective is to optimize the limit-average usage of the resource. We show
that the problem of determining if an energy game with imperfect
information with fixed initial credit has a winning strategy is decidable,
while the question of the existence of some initial credit such that the
game has a winning strategy is undecidable. This undecidability result
carries over to mean-payoff games with imperfect information. On the
positive side, using a simple restriction on the game graph (namely, that
the weights are visible), we show that these problems become
EXPTIME-complete.}
}
@inproceedings{PhS-mfcs10,
address = {Brno, Czech Republic},
month = aug,
year = 2010,
volume = 6281,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Hlin{\v e}n{\'y}, Petr and Ku{\v c}era, Anton{\'\i}n},
acronym = {{MFCS}'10},
booktitle = {{P}roceedings of the 35th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'10)},
author = {Schnoebelen, {\relax Ph}ilippe},
title = {Revisiting {A}ckermann-Hardness for Lossy Counter Machines
and Reset {P}etri Nets},
pages = {616-628},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/phs-mfcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/phs-mfcs10.pdf},
doi = {10.1007/978-3-642-15155-2_54},
abstract = {We prove that coverability and termination are not
primitive-recursive for lossy counter machines and for Reset Petri nets.}
}
@inproceedings{CDGH-mfcs10,
address = {Brno, Czech Republic},
month = aug,
year = 2010,
volume = 6281,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Hlin{\v e}n{\'y}, Petr and Ku{\v c}era, Anton{\'\i}n},
acronym = {{MFCS}'10},
booktitle = {{P}roceedings of the 35th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'10)},
author = {Chatterjee, Krishnendu and Doyen, Laurent and
Gimbert, Hugo and Henzinger, {\relax Th}omas A.},
title = {Randomness for Free},
pages = {246-257},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDGH-mfcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDGH-mfcs10.pdf},
doi = {10.1007/978-3-642-15155-2_23},
abstract = {We consider two-player zero-sum games on graphs. These games can
be classified on the basis of the information of the players and on the
mode of interaction between them. On the basis of information the
classification is as follows: (a)~partial-observation (both players have
partial view of the game); (b)~one-sided complete-observation (one player
has complete observation); and (c)~complete-observation (both players have
complete view of the game). On~the basis of mode of interaction we have
the following classification: (a)~concurrent (players interact
simultaneously); and (b)~turn-based (players interact in turn). The~two
sources of randomness in these games are randomness in transition function
and randomness in strategies. In general, randomized strategies are more
powerful than deterministic strategies, and randomness in transitions
gives more general classes of games. We~present a complete
characterization for the classes of games where randomness is not
helpful~in: (a)~the~transition function (probabilistic transition can be
simulated by deterministic transition); and (b)~strategies (pure
strategies are as powerful as randomized strategies). As~consequence of
our characterization we obtain new undecidability results for these games.}
}
@inproceedings{FP-mfcs10,
address = {Brno, Czech Republic},
month = aug,
year = 2010,
volume = 6281,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Hlin{\v e}n{\'y}, Petr and Ku{\v c}era, Anton{\'\i}n},
acronym = {{MFCS}'10},
booktitle = {{P}roceedings of the 35th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'10)},
author = {Fontaine, Ga{\"e}lle and Place, {\relax Th}omas},
title = {Classes of trees definable in the {{\(\mu\)}}-calculus},
pages = {381-392},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FP-mfcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FP-mfcs10.pdf},
doi = {10.1007/978-3-642-15155-2_34},
abstract = {We are interested in frame definability of classes of trees,
using formulas of the \(\mu\)-calculus. In this set up, the proposition
letters (or in other words, the free variables) in the \(\mu\)-formulas
correspond to second order variables over which universally quantify. Our
main result is a semantic characterization of the \textbf{MSO} definable
classes of trees that are definable by a \(\mu\)-formula. We~also show
that it is decidable whether a given \textbf{MSO} formula corresponds to a
\(\mu\)-formula, in the sense that they define the same class of trees.}
}
@inproceedings{CDH-mfcs10,
address = {Brno, Czech Republic},
month = aug,
year = 2010,
volume = 6281,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Hlin{\v e}n{\'y}, Petr and Ku{\v c}era, Anton{\'\i}n},
acronym = {{MFCS}'10},
booktitle = {{P}roceedings of the 35th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'10)},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger,
{\relax Th}omas A.},
title = {Qualitative Analysis of Partially-observable {M}arkov Decision
Processes},
pages = {258-269},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDH-mfcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDH-mfcs10.pdf},
doi = {10.1007/978-3-642-15155-2_24},
abstract = {We study observation-based strategies for partially-observable
Markov decision processes (POMDPs) with parity objectives.
An~observation-based strategy relies on partial information about the
history of a play, namely, on the past sequence of observations.
We~consider qualitative analysis problems: given a POMDP with a parity
objective, decide whether there exists an observation-based strategy to
achieve the objective with probability~\(1\) (almost-sure winning), or
with positive probability (positive winning). Our main results are
twofold. First, we present a complete picture of the computational
complexity of the qualitative analysis problem for POMDPs with parity
objectives and its subclasses: safety, reachability, B{\"u}chi, and coB{\"u}chi
objectives. We~establish several upper and lower bounds that were not
known in the literature. Second, we give optimal bounds (matching upper
and lower bounds) for the memory required by pure and randomized
observation-based strategies for each class of objectives.}
}
@inproceedings{OU-mfcs10,
address = {Brno, Czech Republic},
month = aug,
year = 2010,
volume = 6281,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Hlin{\v e}n{\'y}, Petr and Ku{\v c}era, Anton{\'\i}n},
acronym = {{MFCS}'10},
booktitle = {{P}roceedings of the 35th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'10)},
author = {Olschewski, J{\"o}rg and Ummels, Michael},
title = {The Complexity of Finding Reset Words in
Finite Automata},
pages = {568-579},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/OU-mfcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/OU-mfcs10.pdf},
doi = {10.1007/978-3-642-15155-2_50},
abstract = {We study several problems related to finding reset words in
deterministic finite automata. In~particular, we~establish that the
problem of deciding whether a shortest reset word has length~\(k\) is
complete for the complexity class~\(DP\). This result answers a question
posed by Volkov. For the search problems of finding a shortest reset word
and the length of a shortest reset word, we establish membership in the
complexity classes FP\textsuperscript{NP} and FP\textsuperscript{NP[log]},
respectively. Moreover, we show that both these problems are hard for
FP\textsuperscript{NP[log]}. Finally, we~observe that computing a reset
word of a given length is FNP-complete.}
}
@inproceedings{EHH-apnoc10,
address = {Braga, Portugal},
month = jun,
year = 2010,
editor = {Sidorova, Natalia and Serebrenik, Alexander},
acronym = {{APNOC}'10},
booktitle = {{P}roceedings of the 2nd {I}nternational {W}orkshop on
{A}bstractions for {P}etri {N}ets and {O}ther {M}odels of
{C}oncurrency ({APNOC}'10)},
author = {El{~}Hog{-}Benzina, Dorsaf and Haddad, Serge and Hennicker, Rolf},
title = {Process Refinement and Asynchronous Composition with Modalities},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/EHH-apnoc10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/EHH-apnoc10.pdf},
abstract = {We propose a framework for the specification of infinite state
systems based on Petri nets with distinguished may- and must-transitions
(called modalities) which specify the allowed and the required behavior of
refinements and hence of implementations. Formally, refinements are
defined by relating the modal language specifications generated by two
modal Petri nets according to the refinement relation for modal language
specifications. We show that this refinement relation is decidable if the
underlying modal Petri nets are weakly deterministic. We also show that
the membership problem for the class of weakly deterministic modal Petri
nets is decidable. As an important application of our approach we consider
I/O-Petri nets which are obtained by asynchronous composition and thus
exhibit inherently an infinite behavior.}
}
@inproceedings{CDEHR-concur10,
address = {Paris, France},
month = aug # {-} # sep,
year = 2010,
volume = {6269},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Gastin, Paul and Laroussinie, Fran{\c{c}}ois},
acronym = {{CONCUR}'10},
booktitle = {{P}roceedings of the 21st
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'10)},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Edelsbrunner,
Herbert and Henzinger, {\relax Th}omas A. and Rannou, Philippe},
title = {Mean-Payoff Automaton Expressions},
pages = {269-283},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDEHR-concur10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDEHR-concur10.pdf},
doi = {10.1007/978-3-642-15375-4_19},
abstract = {Quantitative languages are an extension of boolean languages
that assign to each word a real number. Mean-payoff automata are finite
automata with numerical weights on transitions that assign to each
infinite path the long-run average of the transition weights. When the
mode of branching of the automaton is deterministic, nondeterministic, or
alternating, the corresponding class of quantitative languages is not
robust as it is not closed under the pointwise operations of max, min,
sum, and numerical complement. Nondeterministic and alternating
mean-payoff automata are not decidable either, as the quantitative
generalization of the problems of universality and language inclusion is
undecidable. We introduce a new class of quantitative languages, defined
by mean-payoff automaton expressions, which is robust and decidable: it is
closed under the four pointwise operations, and we show that all decision
problems are decidable for this class. Mean-payoff automaton expressions
subsume deterministic mean-payoff automata, and we show that they have
expressive power incomparable to nondeterministic and alternating
mean-payoff automata. We also present for the first time an algorithm to
compute distance between two quantitative languages, and in our case the
quantitative languages are given as mean-payoff automaton expressions.}
}
@inproceedings{BBM-concur10,
address = {Paris, France},
month = aug # {-} # sep,
year = 2010,
volume = {6269},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Gastin, Paul and Laroussinie, Fran{\c{c}}ois},
acronym = {{CONCUR}'10},
booktitle = {{P}roceedings of the 21st
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'10)},
author = {Bouyer, Patricia and Brenguier, Romain and Markey, Nicolas},
title = {{N}ash Equilibria for Reachability Objectives in Multi-player Timed Games},
pages = {192-206},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBM-concur10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBM-concur10.pdf},
doi = {10.1007/978-3-642-15375-4_14},
abstract = {We propose a procedure for computing Nash equilibria in
multi-player timed games with reachability objectives. Our procedure is
based on the construction of a finite concurrent game, and on a generic
characterization of Nash equilibria in (possibly infinite) concurrent
games. Along the way, we~use our characterization to compute Nash
equilibria in finite concurrent games.}
}
@inproceedings{BBM-formats10,
address = {Vienna, Austria},
month = sep,
year = 2010,
volume = {6246},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Chatterjee, Krishnendu and Henziner, Thomas A.},
acronym = {{FORMATS}'10},
booktitle = {{P}roceedings of the 8th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'10)},
author = {Bouyer, Patricia and Brenguier, Romain and Markey, Nicolas},
title = {Computing Equilibria in Two-Player Timed Games {\textit{via}}~Turn-Based
Finite Games},
pages = {62-76},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBM-formats10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBM-formats10.pdf},
doi = {10.1007/978-3-642-15297-9_7},
abstract = {We study two-player timed games where the objectives of the two
players are not opposite. We focus on the standard notion of Nash
equilibrium and propose a series of transformations that builds two finite
turn-based games out of a timed game, with a precise correspondence
between Nash equilibria in the original and in final games. This provides
us with an algorithm to compute Nash equilibria in two-player timed games
for large classes of properties.}
}
@inproceedings{BCH-time10,
address = {Paris, France},
month = sep,
year = 2010,
publisher = {{IEEE} Computer Society Press},
editor = {Markey, Nicolas and Wijsen, Jef},
acronym = {{TIME}'10},
booktitle = {{P}roceedings of the 17th {I}nternational {S}ymposium on
{T}emporal {R}epresentation and {R}easoning
({TIME}'10)},
author = {Balaguer, Sandie and Chatain, {\relax Th}omas and Haar, Stefan},
title = {A~Concurrency-Preserving Translation from Time {P}etri Nets to Networks of Timed
Automata},
pages = {77-84},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCH-time10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCH-time10.pdf},
doi = {10.1109/TIME.2010.12},
abstract = {Real-time distributed systems may be modeled in different
formalisms such as time Petri nets~(TPN) and networks of timed
automata~(NTA). This paper focuses on translating a \(1\)-bounded TPN into
an NTA and considers an equivalence which takes the distribution of
actions into account. This translation is extensible to bounded~TPNs.
We~first use \(S\)-invariants to decompose the net into components that
give the structure of the automata, then we add clocks to provide the
timing information. Although we have to use an extended syntax in the
timed automata, this is a novel approach since the other transformations
and comparisons of these models did not consider the preservation of
concurrency.}
}
@inproceedings{BHS-time10,
address = {Paris, France},
month = sep,
year = 2010,
publisher = {{IEEE} Computer Society Press},
editor = {Markey, Nicolas and Wijsen, Jef},
acronym = {{TIME}'10},
booktitle = {{P}roceedings of the 17th {I}nternational {S}ymposium on
{T}emporal {R}epresentation and {R}easoning
({TIME}'10)},
author = {B{\'e}rard, B{\'e}atrice and Haddad, Serge and Sassolas, Mathieu},
title = {Real Time Properties for Interrupt Timed Automata},
pages = {69-76},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHS-time10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHS-time10.pdf},
doi = {10.1109/TIME.2010.11},
abstract = {Interrupt Timed Automata (ITA) have been introduced to model
multi-task systems with interruptions. They form a~subclass of stopwatch
automata, where the real valued variables (with rate \(0\) or~\(1\)) are
organized along priority levels. While reachability is undecidable with
usual stopwatches, the problem was proved decidable for~ITA. In~this work,
after giving answers to some questions left open about expressiveness,
closure, and complexity for~ITA, our~main purpose is to investigate the
verification of real time properties over~ITA. While we prove that model
checking a variant of the timed logic TCTL is undecidable, we nevertheless
give model checking procedures for two relevant fragments of this logic:
one where formulas contain only model clocks and another one where
formulas have a single external clock.}
}
@inproceedings{HMY-iscc10,
address = {Riccione, Italy},
month = jun,
year = 2010,
publisher = {{IEEE} Computer Society Press},
noeditor = {},
acronym = {{ISCC}'10},
booktitle = {{P}roceedings of the 15th {IEEE} {S}ymposium on {C}omputers and
{C}ommunications ({ISCC}'10)},
author = {Haddad, Serge and Mokdad, Lynda and Youcef, Samir},
title = {Response time of {BPEL4WS} constructors},
pages = {695-700},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HMY-iscc10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HMY-iscc10.pdf},
doi = {10.1109/ISCC.2010.5546538},
abstract = {Response time is an important factor for every software system
and it becomes more salient when it is associated with introducing novel
technologies, such as Web services. Most performance evaluation of Web
services are focused toward composite Web services and their response
time. One important limitation of existing work is in the fact that only
constant or service exponential time distribution are considered. However,
experimental results have shown that the Web services response times is
typically heavy-tailed, in particulary, if there are heterogeneous. So,
heavy-tailed response times should be considered in the dimensioning Web
services. In this study, we propose analytical formulas for mean response
times for structured BPEL constructors such as \emph{sequence},
\emph{flow} and \emph{switch} constructors,~etc. The difference with
previous studies in the literature, is that we consider heterogenous
servers, the number of invoked elementary Web services can be variable and
the elementary Web services response times are heavy-tailed.}
}
@inproceedings{DDS-fcsprivmod10,
address = {Edinburgh, Scotland, UK},
month = jul,
year = 2010,
editor = {Cortier, V{\'e}ronique and Ryan, Mark D. and
Shmatikov, Vitaly},
acronym = {{FCS-PrivMod}'10},
booktitle = {{P}roceedings of the {W}orkshop on {F}oundations of {S}ecurity
and {P}rivacy ({FCS-PrivMod}'10)},
author = {Dahl, Morten and Delaune, St{\'e}phanie and Steel, Graham},
title = {Formal Analysis of Privacy for Vehicular Mix-Zones},
pages = {55-70},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-10.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-10.pdf},
ps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
rr-lsv-2010-10.ps},
doi = {10.1007/978-3-642-15497-3_4},
abstract = {Safety critical applications for recently proposed vehicle to
vehicle ad-hoc networks (VANETs) rely on a beacon signal, which poses a
threat to privacy since it could allow a vehicle to be tracked. Mix-zones,
where vehicles encrypt their transmissions and then change their
identifiers, have been proposed as a solution to this problem.\par
In this work, we describe a formal analysis of mix-zones. We model a
mix-zone and propose a formal definition of privacy for such a zone. We
give a set of necessary conditions for any mix-zone protocol to preserve
privacy. We analyse, using the tool ProVerif, a particular proposal for
key distribution in mix-zones, the CMIX protocol. We report attacks on
privacy and we propose a fix.}
}
@article{BKM-lmcs10,
journal = {Logical Methods in Computer Science},
author = {Bollig, Benedikt and Kuske, Dietrich and Meinecke, Ingmar},
title = {Propositional Dynamic Logic for Message-Passing Systems},
year = 2010,
month = sep,
volume = 6,
number = {3:16},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BKM-lmcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BKM-lmcs10.pdf},
doi = {10.2168/LMCS-6(3:16)2010},
abstract = {We examine a bidirectional propositional dynamic logic~(PDL) for
finite and infinite message sequence charts~(MSCs) extending
\(\textsf{LTL}\) and \(\textsf{TLC}^{-}\). By~this kind of multi-modal
logic we can express properties both in the entire future and in the past
of an event. Path expressions strengthen the classical until operator of
temporal logic. For every formula defining an MSC language, we construct a
communicating finite-state machine~(CFM) accepting the same language. The
CFM obtained has size exponential in the size of the formula. This
synthesis problem is solved in full generality, \textit{i.e.}, also for
MSCs with unbounded channels. The model checking problem for CFMs and
HMSCs turns out to be in PSPACE for existentially bounded MSCs. Finally,
we show that, for PDL with intersection, the semantics of a formula cannot
be captured by a CFM anymore.}
}
@inproceedings{CS-dlt2010,
address = {London, Ontario, Canada},
month = aug,
year = 2010,
volume = {6224},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Gao, Yuan and Lu, Hanlin and Seki, Shinnosuke and Yu, Sheng},
acronym = {{DLT}'10},
booktitle = {{P}roceedings of the 14th {I}nternational
{C}onference on {D}evelopments in {L}anguage {T}heory
({DLT}'10)},
author = {Chambart, Pierre and Schnoebelen, {\relax Ph}ilippe},
title = {Computing blocker sets for the Regular {P}ost Embedding
Problem},
pages = {136-147},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-dlt10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-dlt10.pdf},
doi = {10.1007/978-3-642-14455-4_14},
abstract = {Blocker and coblocker sets are regular languages involved in the
algorithmic solution of the Regular Post Embedding Problem.
We investigate the computability of these languages and
related decision problems.}
}
@inproceedings{Schmitz-acl10,
address = {Uppsala, Sweden},
month = jul,
year = 2010,
publisher = {Association for Computational Linguistics},
acronym = {{ACL}'10},
booktitle = {{P}roceedings of the 48th {A}nnual {M}eeting of the
{A}ssociation for {C}omputational {L}inguistics ({ACL}'10)},
author = {Schmitz, Sylvain},
title = {On the Computational Complexity of Dominance Links
in Grammatical Formalisms},
pages = {514-524},
url = {http://hal.archives-ouvertes.fr/hal-00482396},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Schmitz-acl10.pdf},
abstract = {Dominance links were introduced in grammars to model long
distance scrambling phenomena, motivating the definition of multiset-valued
linear indexed grammars (MLIGs) by Rambow~(1994b), and inspiring quite a
few recent formalisms. It~turns out that MLIGs have since been
rediscovered and reused in a variety of contexts, and that the complexity
of their emptiness problem has become the key to several open questions in
computer science. We survey complexity results and open issues on MLIGs
and related formalisms, and provide new complexity bounds for some
linguistically motivated restrictions.}
}
@article{HNS-tcs10,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {H{\'e}am, Pierre-Cyrille and Nicaud, Cyril and
Schmitz, Sylvain},
title = {Parametric Random Generation of Deterministic Tree
Automata},
year = 2010,
volume = 411,
number = {38-39},
pages = {3469-3480},
month = aug,
url = {http://hal.inria.fr/inria-00511450},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HNS-tcs10.pdf},
doi = {10.1016/j.tcs.2010.05.036},
abstract = {Uniform random generators deliver a simple empirical means to
estimate the average complexity of an algorithm. We present a general
rejection algorithm that generates sequential letter-to-letter transducers
up to isomorphism. We~also propose an original parametric random
generation algorithm to produce sequential letter-to-letter transducers
with a fixed number of transitions. We~tailor this general scheme to
randomly generate deterministic tree walking automata and deterministic
top-down tree automata. We~apply our implementation of the generator to
the estimation of the average complexity of a deterministic tree walking
automata to nondeterministic top-down tree automata construction we also
implemented.}
}
@incollection{DKR-lncs6000,
noaddress = {},
month = may,
year = 2010,
volume = 6000,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
noacronym = {},
booktitle = {{T}owards {T}rustworthy {E}lections -- {N}ew {D}irections in
{E}lectronic {V}oting},
editor = {Chaum, David and Jakobsson, Markus and Rivest, Ronald L. and
Ryan, Peter Y. A. and Benaloh, Josh and Kuty{\l}owski, Miros{\l}aw
and Adida, Ben},
author = {Delaune, St{\'e}phanie and Kremer, Steve and Ryan, Mark D.},
title = {Verifying Privacy-Type Properties of Electronic Voting
Protocols: A~Taster},
pages = {289-309},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DKR-lncs6000.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DKR-lncs6000.pdf},
doi = {10.1007/978-3-642-12980-3_18},
abstract = {While electronic elections promise the possibility of
convenient, efficient and secure facilities for recording and tallying
votes, recent studies have highlighted inadequacies in implemented
systems. These inadequacies provide additional motivation for applying
formal methods to the validation of electronic voting protocols.\par
In this paper we report on some of our recent efforts in using the applied
pi calculus to model and analyse properties of electronic elections. We
particularly focus on anonymity properties, namely vote-privacy and
receipt-freeness. These properties are expressed using observational
equivalence and we show in accordance with intuition that receipt-freeness
implies vote-privacy.\par
We illustrate our definitions on two electronic voting protocols from the
literature. Ideally, these properties should hold even if the election
officials are corrupt. However, protocols that were designed to satisfy
privacy or receipt-freeness 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.}
}
@inproceedings{CCD-ijcar10,
address = {Edinburgh, Scotland, UK},
month = jul,
year = 2010,
volume = {6173},
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer-Verlag},
editor = {Giesl, J{\"u}rgen and Haehnle, Reiner},
acronym = {{IJCAR}'10},
booktitle = {{P}roceedings of the 5th {I}nternational {J}oint
{C}onference on {A}utomated {R}easoning
({IJCAR}'10)},
author = {Cheval, Vincent and Comon{-}Lundh, Hubert and Delaune, St{\'e}phanie},
title = {Automating security analysis: symbolic equivalence of
constraint systems},
pages = {412-426},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-ijcar10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-ijcar10.pdf},
doi = {10.1007/978-3-642-14203-1_35},
abstract = {We consider security properties of cryptographic protocols, that
are either trace properties (such as confidentiality or authenticity) or
equivalence properties (such as anonymity or strong secrecy).\par
Infinite sets of possible traces are symbolically represented using
\emph{deducibility constraints}. We give a new algorithm that decides the
trace equivalence for the traces that are represented using such
constraints, in the case of signatures, symmetric and asymmetric
encryptions. Our algorithm is implemented and performs well on typical
benchmarks. This is the first implemented algorithm, deciding symbolic
trace equivalence.}
}
@inproceedings{BH-monterey2008,
address = {Budapest, Hungary},
month = apr,
year = 2010,
volume = 6028,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Choppy, {\relax Ch}ristine and Sokolsky, Oleg},
acronym = {{MONTEREY}'08},
booktitle = {{R}evised {S}elected {P}apers of the 15th {M}onterey
{W}orkshop on {F}oundations
of {C}omputer {S}oftware ({MONTEREY}'08)},
author = {Ben{ }Hmida, Mehdi and Haddad, Serge},
title = {Client Synthesis for Aspect Oriented Web Services},
pages = {24-42},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BH-monterey08.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BH-monterey08.pdf},
doi = {10.1007/978-3-642-12566-9_2},
abstract = {Client synthesis for complex Web services is a critical and
still open topic as it will enable more flexibility in the
deployment of such services. In previous works, our team has
developed a theoretical framework based on process algebra
that has led to algorithms and tools for the client
interaction. Here, we show how to generalise our approach
for aspect oriented Web services.}
}
@inproceedings{JGL-icalp10,
address = {Bordeaux, France},
month = jul,
year = 2010,
volume = 6199,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abramsky, Samson and Meyer{ }auf{ }der{ }Heide, Friedhelm
and Spirakis, Paul},
acronym = {{ICALP}'10},
booktitle = {{P}roceedings of the 37th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'10)~-- {P}art~{II}},
author = {Goubault{-}Larrecq, Jean},
title = {Noetherian Spaces in Verification},
pages = {2-21},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-icalp10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-icalp10.pdf},
doi = {10.1007/978-3-642-14162-1_2},
abstract = {Noetherian spaces are a topological concept that generalizes
well quasiorderings. We explore applications to infinite-state
verification problems, and show how this stimulated the search for
infinite procedures \`a la Karp-Miller.}
}
@inproceedings{CS-icalp10,
address = {Bordeaux, France},
month = jul,
year = 2010,
volume = 6199,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abramsky, Samson and Meyer{ }auf{ }der{ }Heide, Friedhelm
and Spirakis, Paul},
acronym = {{ICALP}'10},
booktitle = {{P}roceedings of the 37th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'10)~-- {P}art~{II}},
author = {Chambart, Pierre and Schnoebelen, {\relax Ph}ilippe},
title = {Pumping and Counting on the Regular {P}ost Embedding Problem},
pages = {64-75},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-icalp10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-icalp10.pdf},
doi = {10.1007/978-3-642-14162-1_6},
abstract = {The Regular Post Embedding Problem is a variant of Post's
Correspondence Problem where one compares strings with the subword
relation and imposes additional regular constraints on admissible
solutions. It is known that this problem is decidable, albeit with very
high complexity.\par
We consider and solve variant problems where the set of solutions is
compared to regular constraint sets and where one counts the number of
solutions. Our positive results rely on two non-trivial pumping lemmas for
Post-embedding languages and their complements.}
}
@inproceedings{CD-icalp10,
address = {Bordeaux, France},
month = jul,
year = 2010,
volume = 6199,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abramsky, Samson and Meyer{ }auf{ }der{ }Heide, Friedhelm
and Spirakis, Paul},
acronym = {{ICALP}'10},
booktitle = {{P}roceedings of the 37th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'10)~-- {P}art~{II}},
author = {Chatterjee, Krishnendu and Doyen, Laurent},
title = {Energy Parity Games},
pages = {599-610},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-icalp10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-icalp10.pdf},
doi = {10.1007/978-3-642-14162-1_50},
abstract = {Energy parity games are infinite two-player turn-based games
played on weighted graphs. The objective of the game combines a
(qualitative) parity condition with the (quantitative) requirement that
the sum of the weights (\textit{i.e.}, the level of energy in the game)
must remain positive. Beside their own interest in the design and
synthesis of resource-constrained omega-regular specifications, energy
parity games provide one of the simplest model of games with combined
qualitative and quantitative objective. Our main results are as follows:
(a)~exponential memory is sufficient and may be necessary for winning
strategies in energy parity games; (b)~the~problem of deciding the winner
in energy parity games can be solved in NP\(\cap\)coNP; and (c)~we~give an
algorithm to solve energy parity by reduction to energy games. We~also
show that the problem of deciding the winner in energy parity games is
polynomially equivalent to the problem of deciding the winner in
mean-payoff parity games, which can thus be solved in NP\(\cap\)coNP. As~a
consequence we also obtain a conceptually simple algorithm to solve
mean-payoff parity games.}
}
@inproceedings{BGMZ-icalp10,
address = {Bordeaux, France},
month = jul,
year = 2010,
volume = 6199,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abramsky, Samson and Meyer{ }auf{ }der{ }Heide, Friedhelm
and Spirakis, Paul},
acronym = {{ICALP}'10},
booktitle = {{P}roceedings of the 37th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'10)~-- {P}art~{II}},
author = {Bollig, Benedikt and Gastin, Paul and Monmege, Benjamin
and Zeitoun, Marc},
title = {Pebble weighted automata and transitive closure logics},
pages = {587-598},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGMZ-icalp10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGMZ-icalp10.pdf},
doi = {10.1007/978-3-642-14162-1_49},
abstract = {We introduce new classes of weighted automata on words. Equipped
with pebbles and a two-way mechanism, they go beyond the class of
recognizable formal power series, but capture a weighted version of
first-order logic with bounded transitive closure. In contrast to previous
work, this logic allows for unrestricted use of universal quantification.
Our main result states that pebble weighted automata, nested weighted
automata, and this weighted logic are expressively equivalent. We also
give new logical characterizations of the recognizable series.}
}
@inproceedings{CC-csf10,
address = {Edinburgh, Scotland, UK},
month = jul,
year = 2010,
publisher = {{IEEE} Computer Society Press},
acronym = {{CSF}'10},
booktitle = {{P}roceedings of the
23rd {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'10)},
author = {Ciob{\^a}c{\u{a}}, {\c{S}}tefan and Cortier, V{\'e}ronique},
title = {Protocol composition for arbitrary primitives},
pages = {322-336},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-09.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-09.pdf},
doi = {10.1109/CSF.2010.29},
abstract = {We study the composition of security protocols when protocols
share secrets such as keys. We show (in a Dolev-Yao model)
that if two protocols use disjoint cryptographic primitives,
their composition is secure if the individual protocols are
secure, even if they share data. Our result holds for any
cryptographic primitives that can be modeled using
equational theories, such as encryption, signature, MAC,
exclusive-or, and Diffie-Hellman. Our main result transforms
any attack trace of the combined protocol into an attack
trace of one of the individual protocols. This allows
various ways of combining protocols such as sequentially or
in parallel, possibly with inner replications. As an
application, we show that a protocol using preestablished
keys may use any (secure) key-exchange protocol without
jeopardizing its security, provided that they do not use the
same primitives. This allows us, for example, to securely
compose a Diffie-Hellman key exchange protocol with any
other protocol using the exchanged key, provided that the
second protocol does not use the Diffie-Hellman primitives.
We also explore tagging, which is a way of forcing the
disjointness of two protocols that share cryptographic
primitives We explain why composing protocols which use
tagged cryptographic primitives like encryption and hash
functions is secure by reducing this problem to the previous
one.}
}
@inproceedings{ACD-csf10,
address = {Edinburgh, Scotland, UK},
month = jul,
year = 2010,
publisher = {{IEEE} Computer Society Press},
acronym = {{CSF}'10},
booktitle = {{P}roceedings of the
23rd {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'10)},
author = {Arnaud, Mathilde and Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
title = {Modeling and Verifying Ad Hoc Routing Protocols},
pages = {59-74},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ACD-csf10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACD-csf10.pdf},
doi = {10.1109/CSF.2010.12},
abstract = {Mobile ad hoc networks consist of mobile wireless devices which
autonomously organize their infrastructure. In such networks, a central
issue, ensured by routing protocols, is to find a route from one device to
another. Those protocols use cryptographic mechanisms in order to prevent
malicious nodes from compromising the discovered route.\par
Our contribution is twofold. We first propose a calculus for modeling and
reasoning about security protocols, including in particular secured
routing protocols. Our calculus extends standard symbolic models to take
into account the characteristics of routing protocols and to model
wireless communication in a more accurate way. Our second main
contribution is a decision procedure for analyzing routing protocols for
any network topology. By using constraint solving techniques, we show that
it is possible to automatically discover (in NPTIME) whether there exists
a network topology that would allow malicious nodes to mount an attack
against the protocol, for a bounded number of sessions. We also provide a
decision procedure for detecting attacks in case the network topology is
given a priori. We demonstrate the usage and usefulness of our approach by
analyzing the protocol \textsf{SRP} applied to~\textsf{DSR}.}
}
@inproceedings{BKKLNP-cav10,
address = {Edinburgh, Scotland, UK},
month = jul,
year = 2010,
volume = {6174},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Cook, Byron and Jackson, Paul and Touili, Tayssir},
acronym = {{CAV}'10},
booktitle = {{P}roceedings of the 22nd
{I}nternational {C}onference on
{C}omputer {A}ided {V}erification
({CAV}'10)},
author = {Bollig, Benedikt and Katoen, Joost-Pieter and Kern, Carsten
and Leucker, Martin and Neider, Daniel and Piegdon, David R.},
title = {libalf: the Automata Learning Framework},
pages = {360-364},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BKKLNP-cav10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BKKLNP-cav10.pdf},
doi = {10.1007/978-3-642-14295-6_32},
abstract = {This paper presents \texttt{libalf}, a comprehensive,
open-source library for learning formal languages. \texttt{libalf} covers
various well-known learning techniques for finite automata (e.g.
Angluin's~\(\textsf{L}^*\), \textsf{Biermann}, \textsf{RPNI},~etc.) as
well as novel learning algorithms (such as for NFA and visibly one-counter
automata). \texttt{libalf}~is flexible and allows facilely interchanging
learning algorithms and combining domain-specific features in a
plug-and-play fashion. Its modular design and C++ implementation make it a
suitable platform for adding and engineering further learning algorithms
for new target models (\textit{e.g.}, B{\"u}chi automata).}
}
@article{RHS-ijfcs09,
publisher = {World Scientific},
journal = {International Journal of Foundations of Computer Science},
author = {Recalde, Laura and Haddad, Serge and Silva, Manuel},
title = {Continuous {P}etri Nets: Expressive Power and Decidability Issues},
volume = 21,
number = 2,
pages = {235-256},
year = 2010,
month = apr,
doi = {10.1142/S0129054110007222},
abstract = {State explosion is a fundamental problem in the analysis and
synthesis of discrete event systems. Continuous Petri nets can be seen as
a relaxation of the corresponding discrete model. The expected gains are
twofold: improvements in complexity and in decidability. In the case of
autonomous nets we prove that liveness or deadlock-freeness remain
decidable and can be checked more efficiently than in Petri nets. Then we
introduce time in the model which now behaves as a dynamical system driven
by differential equations and we study it w.r.t. expressiveness and
decidability issues. On the one hand, we prove that this model is
equivalent to timed differential Petri nets which are a slight extension
of systems driven by linear differential equations~(LDE). On~the other
hand, (contrary to the systems driven by~LDEs) we show that continuous
timed Petri nets are able to simulate Turing machines and thus that basic
properties become undecidable.}
}
@inproceedings{SS-lics10,
address = {Edinburgh, Scotland, UK},
month = jul,
year = 2010,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'10},
booktitle = {{P}roceedings of the 25th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'10)},
author = {Schweikardt, Nicole and Segoufin, Luc},
title = {Addition-invariant {FO} and regularity},
pages = {273-282},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SS-lics10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SS-lics10.pdf},
doi = {10.1109/LICS.2010.16},
abstract = {We consider formulas which, in addition to the symbols in the
vocabulary, may use two designated symbols~\(\prec\) and~\(+\) that must
be interpreted as a linear order and its associated addition. Such a
formula is called addition-invariant if, for each fixed interpretation of
the initial vocabulary, its result is independent of the particular
interpretation of~\(\prec\) and~\(+\).\par
This paper studies the expressive power of addition-invariant first-order
logic, \(+\)-inv-FO, on the class of finite strings. Our first main result
gives a characterization of the regular languages definable in
\(+\)-inv-FO: we show that these are exactly the languages definable in FO
with extra predicates, denoted by {"}lm{"} for short, for testing the
length of the string modulo some fixed number. Our second main result
shows that every language definable in \(+\)-inv-FO, that is bounded or
commutative or deterministic context-free, is regular. As an immediate
consequence of these two main results, we obtain that \(+\)-inv-FO is
equivalent to FO(lm) on the class of finite colored sets.\par
Our proof methods involve Ehrenfeucht-Fra{\"\i}ss{\'e} games, tools from
algebraic automata theory, and reasoning about semi-linear sets.}
}
@inproceedings{PS-lics10,
address = {Edinburgh, Scotland, UK},
month = jul,
year = 2010,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'10},
booktitle = {{P}roceedings of the 25th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'10)},
author = {Place, {\relax Th}omas and Segoufin, Luc},
title = {Deciding definability in \(\textrm{FO}_{2}(<)\) on trees},
pages = {253-262},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/PS-lics10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/PS-lics10.pdf},
doi = {10.1109/LICS.2010.17},
abstract = { We prove that it is decidable whether a regular unranked tree
language is definable in~\(\textsf{FO}_{2}(<_{h}, <_{v})\).
By~\(\textsf{FO}_{2}(<_{h}, <_{v})\) we refer to the two variable fragment
of first order logic built from the descendant and following sibling
predicates. In terms of expressive power it corresponds to a fragment of
the navigational core of XPath that contains modalities for going up to
some ancestor, down to some descendant, left to some preceding sibling,
and right to some following sibling.\par
We also investigate definability in some other fragments of XPath.}
}
@inproceedings{JGL-lics10,
address = {Edinburgh, Scotland, UK},
month = jul,
year = 2010,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'10},
booktitle = {{P}roceedings of the 25th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'10)},
author = {Goubault{-}Larrecq, Jean},
title = {{{\(\omega\)}}{\textbf{\MakeUppercase{QRB}}}-Domains and the
Probabilistic Powerdomain},
pages = {352-361},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-lics10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-lics10.pdf},
doi = {10.1109/LICS.2010.50},
abstract = {Is there any cartesian-closed category of continuous domains
that would be closed under Jones and Plotkin's probabilistic powerdomain
construction? This is a major open problem in the area of denotational
semantics of probabilistic higher-order languages. We relax the question,
and look for quasi-continuous dcpos instead. We introduce a natural class
of such quasi-continuous dcpos, the \(\omega\textbf{QRB}\)-domains. We
show that they form a category \(\omega\textbf{QRB}\) with pleasing
properties: \(\omega\textbf{QRB}\) is closed under the probabilistic
powerdomain functor, has all finite products, all bilimits, and is stable
under retracts, and even under so-called quasiretracts. But...
\(\omega\textbf{QRB}\) is not cartesian closed.}
}
@inproceedings{BCGJV-lics10,
address = {Edinburgh, Scotland, UK},
month = jul,
year = 2010,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'10},
booktitle = {{P}roceedings of the 25th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'10)},
author = {Bargu{\~n}{\'o}, Luis and Creus, Carles and Godoy, Guillem
and Jacquemard, Florent and Vacher, Camille},
title = {The Emptiness Problem for Tree Automata with Global Constraints},
pages = {263-272},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCGJV-lics10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCGJV-lics10.pdf},
doi = {10.1109/LICS.2010.28},
abstract = {We define tree automata with global constraints~(TAGC),
generalizing the class of tree automata with global equality and
disequality constraints~(TAGED). TAGC~can test for equality and
disequality between subterms whose positions are defined by the states
reached during a computation. In~particular, TAGC~can check that all the
subterms reaching a given state are distinct. This constraint is related
to monadic key constraints for XML documents, meaning that every two
distinct positions of a given type have different values.\par
We prove decidability of the emptiness problem for~TAGC. This solves, in
particular, the open question of decidability of emptiness for TAGED. We
further extend our result by allowing global arithmetic constraints for
counting the number of occurrences of some state or the number of
different subterms reaching some state during a computation. We also allow
local equality and disequality tests between sibling positions and the
extension to unranked ordered trees. As a consequence of our results for
TAGC, we prove the decidability of a fragment of the monadic second order
logic on trees extended with predicates for equality and disequality
between subtrees, and cardinality.}
}
@inproceedings{CF-pn10,
address = {Braga, Portugal},
month = jun,
year = 2010,
volume = 6128,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Lilius, Johan and Penczek, Wojciech},
acronym = {{PETRI~NETS}'10},
booktitle = {{P}roceedings of the 31st
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'10)},
author = {Chatain, {\relax Th}omas and Fabre, {\'E}ric},
title = {Factorization Properties of Symbolic Unfoldings of Colored
{P}etri Nets},
pages = {165-184},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CF-pn10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CF-pn10.pdf},
doi = {10.1007/978-3-642-13675-7_11},
abstract = {The unfolding technique is an efficient tool to explore the runs
of a Petri net in a true concurrency semantics, \textit{i.e.}, without
constructing all the interleavings of concurrent actions. But even small
real systems are never modeled directly as ordinary Petri nets: they use
many high-level features that were designed as extensions of Petri nets.
We focus here on two such features: colors and compositionality. We show
that the symbolic unfolding of a product of colored Petri nets can be
expressed as the product of the symbolic unfoldings of these nets. This is
a necessary result in view of distributed computations based on symbolic
unfoldings, as they have been developed already for standard unfoldings,
to design modular verification techniques, or modular diagnosis
procedures, for example. The factorization property of symbolic unfoldings
is valid for several classes of colored or high-level nets. We derive it
here for a class of (high-level) open nets, for which the composition is
performed by connecting places rather than transitions.}
}
@article{DL-jal10,
publisher = {Elsevier Science Publishers},
journal = {Journal of Applied Logic},
author = {Demri, St{\'e}phane and Lugiez, Denis},
title = {Complexity of Modal Logics with {P}resburger Constraints},
year = {2010},
volume = {8},
number = {3},
pages = {233-252},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DL-jal10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DL-jal10.pdf},
doi = {10.1016/j.jal.2010.03.001},
abstract = {We introduce the extended modal logic EML 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 EML satisfiability is only
\textsc{pspace}-complete by designing a Ladner-like algorithm. This
extends a well-known and non-trivial \textsc{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 provide a logarithmic space reduction
from a variant of Sheaves logic SL into EML that allows us to establish
that its satisfiability problem is also \textsc{pspace}-complete,
significantly improving the best known upper bound.}
}
@article{LS-jal10,
publisher = {Elsevier Science Publishers},
journal = {Journal of Applied Logic},
author = {Libkin, Leonid and Sirangelo, Cristina},
title = {Reasoning about {XML} with temporal logics and automata},
year = {2010},
volume = {8},
number = {2},
pages = {210-232},
month = jun,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-jal10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-jal10.pdf},
doi = {10.1016/j.jal.2009.09.005},
abstract = {We show that problems arising in static analysis of XML
specifications and transformations can be dealt with using techniques
similar to those developed for static analysis of programs. Many
properties of interest in the XML context are related to navigation, and
can be formulated in temporal logics for trees. We choose a logic that
admits a simple single-exponential translation into unranked tree
automata, in the spirit of the classical LTL-to-B{\"u}chi automata
translation. Automata arising from this translation have a number of
additional properties; in particular, they are convenient for reasoning
about unary node-selecting queries, which are important in the XML
context. We give two applications of such reasoning: one deals with a
classical XML problem of reasoning about navigation in the presence of
schemas, and the other relates to verifying security properties of XML
views.}
}
@article{DLS-tcs10,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Demri, St{\'e}phane and Lazi{\'c}, Ranko and
Sangnier, Arnaud},
title = {Model checking memoryful linear-time logics over
one-counter automata},
year = {2010},
volume = {411},
number = {22-24},
pages = {2298-2316},
month = may,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DLS-tcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DLS-tcs10.pdf},
doi = {10.1016/j.tcs.2010.02.021},
abstract = {We study complexity of the model-checking problems for LTL with
registers (also known as freeze LTL and written
LTL\(^{\downarrow}\)) and for first-order logic with data
equality tests (written \(\textrm{FO}(\sim, <, +1)\)) over
one-counter automata. We consider several classes of
one-counter automata (mainly deterministic vs.
nondeterministic) and several logical fragments (restriction
on the number of registers or variables and on the use of
propositional variables for control states). The logics have
the ability to store a counter value and to test it later
against the current counter value. We show that model
checking LTL\(^{\downarrow}\) and \(\textrm{FO}(\sim , <,
+1)\) over deterministic one-counter automata is
PSpace-complete with infinite and finite accepting runs. By
constrast, we prove that model checking LTL\(^{\downarrow}\)
in which the until operator~\(\mathbf{U}\) is restricted to
the eventually~\(\mathbf{F}\) 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. As a corollary of our proof, this
also holds for \(\textrm{FO}(\sim, <, +1)\) restricted to
two variables (written \(\textrm{FO}_2 (\sim, <, +1)\)).
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\(^{\downarrow}\) and
\(\textrm{FO}_2 (\sim, <, +1)\) are decidable. Our results
pave the way for model-checking memoryful (linear-time)
logics over other classes of operational models, such as
reversal-bounded counter machines.}
}
@article{AF-ijmest10,
publisher = {Taylor \& Francis},
journal = {International Journal of Mathematical Education
in Science and Technology},
author = {Arnoux, Pierre and Finkel, Alain},
title = {Using mental imagery processes for teaching and research in
mathematics and computer science},
volume = 41,
number = 2,
month = jan,
year = 2010,
pages = {229-242},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AF-ijmest10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AF-ijmest10.pdf},
doi = {10.1080/00207390903372429},
abstract = {The role of mental representations in mathematics and computer
science (for teaching or research) is often downplayed or even completely
ignored. Using an ongoing work on the subject, we argue for a more
systematic study and use of mental representations, to get an intuition of
mathematical concepts, and also to understand and build proofs. We give
two detailed examples.}
}
@article{GK-icomp10,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Gastin, Paul and Kuske, Dietrich},
title = {Uniform satisfiability problem for local temporal logics over
{M}azurkiewicz traces},
volume = 208,
number = 7,
month = jul,
year = 2010,
pages = {797-816},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GK-icomp10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GK-icomp10.pdf},
doi = {10.1016/j.ic.2009.12.003},
abstract = {We continue our study of the complexity of MSO-definable local
temporal logics over concurrent systems that can be described by
Mazurkiewicz traces. In previous papers, we showed that the satisfiability
problem for any such logic is in PSPACE (provided the dependence alphabet
is fixed) and remains in PSPACE for all classical local temporal logics
even if the dependence alphabet is part of the input. In~this paper, we
consider the uniform satisfiability problem for arbitrary MSO-definable
local temporal logics. For this problem, we prove multi-exponential lower
and upper bounds that depend on the number of alternations of set
quantifiers present in the chosen MSO-modalities.}
}
@article{Haar-tac10,
publisher = {{IEEE} Computer Society Press},
journal = {IEEE Transactions on Automatic Control},
author = {Haar, Stefan},
title = {Types of Asynchronous Diagnosability and
the {\emph{Reveals}}-Relation in Occurrence Nets},
volume = 55,
number = 10,
month = oct,
year = 2010,
pages = {2310-2320},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/haar-tac10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/haar-tac10.pdf},
doi = {10.1109/TAC.2010.2063490},
abstract = {We consider asynchronous diagnosis in (safe) Petri net models of
distributed systems, using the partial order semantics of occurrence net
unfoldings. Both the observability and diagnosability properties will
appear in two different forms, depending on the semantics chosen:
\emph{strong} observability and diagnosability are the classical notions
from the state machine model and correspond to interleaving semantics in
Petri nets. By contrast, the \emph{weak} form is linked to characteristics
of nonsequential processes, and requires an asynchronous \emph{progress}
assumption on those processes. We give algebraic characterizations for
both types, and give verification methods. The study of weak
diagnosability leads us to the analysis of a relation in occurrence nets,
first presented in~[S.~Haar~(2007): \textit{Unfold and Cover: Qualitative
Diagnosability for Petri Nets.}]: given the occurrence of some event~\(a\)
that \emph{reveals}~\(b\), the occurrence of~\(b\) is inevitable. Then
\(b\) may already have occurred, be concurrent to, or even in the future
of~\(a\). We show that the \emph{reveals}-relation can be effectively
computed recursively---for each pair, a suitable finite prefix of bounded
depth is sufficient---and show its use in asynchronous diagnosis. Based on
this relation, a~decomposition of the Petri net unfolding into
\emph{facets} is defined, yielding an abstraction technique that preserves
and reflects maximal partially ordered runs.}
}
@inproceedings{SRKK-arspawits10,
address = {Paphos, Cyprus},
month = oct,
year = 2010,
volume = 6186,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Armando, Alessandro and Lowe, Gavin},
acronym = {{ARSPA-WITS}'10},
booktitle = {{P}roceedings of the {J}oint {W}orkshop
on {A}utomated {R}easoning for {S}ecurity {P}rotocol {A}nalysis and
{I}ssues in the {T}heory of {S}ecurity ({ARSPA-WITS}'10)},
author = {Smyth, Ben and Ryan, Mark D. and Kremer, Steve and
Kourjieh, Mounira},
title = {Towards automatic analysis of election verifiability properties},
pages = {146-163},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SRKK-arspawits10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SRKK-arspawits10.pdf},
doi = {10.1007/978-3-642-16074-5_11},
abstract = {We present a symbolic definition that captures some
cases 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 software tool
ProVerif. The definition distinguishes three aspects of verifiability,
which we call individual, universal, and eligibility verifiability. We
demonstrate the applicability of our formalism by analysing the protocols
due to Fujioka, Okamoto~\& Ohta and a variant of the one by Juels,
Catalano~\& Jakobsson (implemented as Civitas by Clarkson, Chong~\& Myers).}
}
@inproceedings{BH-csr10,
address = {Kazan, Russia},
month = jun,
year = 2010,
volume = 6072,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Mayr, Ernst W.},
acronym = {{CSR}'10},
booktitle = {{P}roceedings of the 5th {I}nternational {C}omputer {S}cience
{S}ymposium in {R}ussia ({CSR}'10)},
author = {Bollig, Benedikt and H{\'e}lou{\"e}t, Lo{\"\i}c},
title = {Realizability of Dynamic {MSC} Languages},
pages = {48-59},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BH-csr10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BH-csr10.pdf},
doi = {10.1007/978-3-642-13182-0_5},
abstract = {We introduce dynamic communicating automata~(DCA), an~extension
of communicating finite-state machines that allows for dynamic creation of
processes. Their behavior can be described as sets of message sequence
charts~(MSCs). We~consider the realizability problem for DCA: given a
dynamic MSC grammar (a~high-level MSC specification), is there a DCA
defining the same set of MSCs? We~show that this problem is decidable in
doubly exponential time, and identify a class of realizable grammars that
can be implemented by \emph{finite} DCA.}
}
@article{CS-jacm10,
publisher = {ACM Press},
journal = {Journal of the~{ACM}},
author = {ten~Cate, Balder and Segoufin, Luc},
title = {Transitive Closure Logic, Nested Tree Walking Automata, and {XP}ath},
volume = 57,
number = 3,
month = mar,
year = 2010,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-jacm10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-jacm10.pdf},
doi = {10.1145/1706591.1706598},
abstract = {We study \textsf{FO(MTC)}, first-order logic with monadic
transitive closure, a logical formalism in between \textsf{FO} and
\textsf{MSO} on trees. We characterize the expressive power of
\textsf{FO(MTC)} in terms of nested tree-walking automata. Using the
latter we show that \textsf{FO(MTC)} is strictly less expressive than
\textsf{MSO}, solving an open problem. We also present a temporal logic on
trees that is expressivel complete for \textsf{FO(MTC)}, in the form of an
extension of the XML document navigation language XPath 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
\textsf{FO(MTC)} for Boolean, unary and binary queries. We also
investigate the complexity of the automata model as well as the XPath
dialect. We show that query evaluation be done in polynomial time
(combined complexity), but that emptiness (or, satisfiability) is
2ExpTime-complete.}
}
@article{ASV-tods09,
publisher = {ACM Press},
journal = {ACM Transactions on Database Systems},
author = {Abiteboul, Serge and Segoufin, Luc and Vianu, Victor},
title = {Static Analysis of {A}ctive {XML} Systems},
volume = 34,
number = 4,
month = dec,
year = 2009,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ASV-tods09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ASV-tods09.pdf},
doi = {10.1145/1620585.1620590},
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, and so may
activate new subtasks. The focus of this article is on the verification of
temporal properties of runs of Active XML systems, specified in a
tree-pattern-based temporal logic, Tree-LTL, which 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.}
}
@article{BMSS-jacm09,
publisher = {ACM Press},
journal = {Journal of the~{ACM}},
author = {Boja{\'n}czyk, Miko{\l}aj and Muscholl, Anca and
Schwentick, {\relax Th}omas and Segoufin, Luc},
title = {Two-variable logic on data trees and applications to {XML}
reasoning},
volume = 56,
number = 3,
month = may,
year = 2009,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMSS-jacm09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMSS-jacm09.pdf},
doi = {10.1145/1516512.1516515},
abstract = {Motivated by reasoning tasks for XML languages, the
satisfiability problem of logics on \emph{data trees} is investigated. The
nodes of a data tree have a \emph{label} from a finite set and a
\emph{data value} from a possibly infinite set. It is shown that
satisfiability for two-variable first-order logic is decidable if the tree
structure can be accessed only through the \emph{child} and the \emph{next
sibling} predicates and the access to data values is restricted to
equality tests. From this main result, decidability of satisfiability and
containment for a data-aware fragment of XPath and of the implication
problem for unary key and inclusion constraints is concluded.}
}
@article{BS-jsl09,
publisher = {Association for Symbolic Logic},
journal = {Journal of Symbolic Logic},
author = {Benedikt, Michael and Segoufin, Luc},
title = {Towards a Characterization of Order-Invariant Queries over
Tame Structures},
volume = 74,
number = 1,
pages = {168-186},
month = mar,
year = 2009,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-jsl09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-jsl09.pdf},
doi = {10.2178/jsl/1231082307},
abstract = {This work deals with the expressive power of logics on finite
graphs with access to an additional {"}arbitrary{"} linear order. The
queries that can be expressed this way are the \emph{order-invariant
queries} for the logic. For the standard logics used in computer science,
such as first-order logic, it is known that access to an arbitrary linear
order increases the expressiveness of the logic. However, when we look at
the separating examples, we find that they have satisfying models whose
Gaifman Graph is complex---unbounded in valence and in treewidth. We thus
explore the expressiveness of order-invariant queries over well-behaved
graphs. We prove that first-order order-invariant queries over strings and
trees have no additional expressiveness over first-order logic in the
original signature. We also prove new upper bounds on order-invariant
queries over bounded treewidth and bounded valence graphs. Our results
make use of a new technique of independent interest: the application of
algebraic characterizations of definability to show collapse results.}
}
@incollection{DBBetal-CES09,
author = {David, Alexandre and Behrmann, Gerd and Bulychev, Peter and
Byg, Joakin and Chatain, {\relax Th}omas and Larsen, Kim G.
and
Pettersson, Paul and Rasmussen, Jacob Illum and
Srba, Ji{\v{r}}{\'\i} and
Yi, Wang and Joergensen, Kenneth Y. and Lime, Didier and
Magnin, Morgan and Roux, Olivier H. and Traonouez, Louis-Marie},
title = {Tools for Model-Checking Timed Systems},
booktitle = {Communicating Embedded Systems~-- Software and Design},
editor = {Jard, Claude and Roux, Olivier H.},
publisher = {Wiley-ISTE},
year = 2009,
month = oct,
pages = {165-225},
chapter = 6,
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}
}
@article{BCHK-icomp10,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
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},
volume = 208,
number = 10,
pages = {1169-1192},
year = 2010,
month = oct,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCHK-icomp10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCHK-icomp10.pdf},
doi = {10.1016/j.ic.2009.11.009},
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 should hence be easily applicable to a wide class of
system models, including graph grammars and Petri nets.}
}
@incollection{Berwanger09,
year = 2010,
volume = 6006,
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer},
editor = {Bonnano, Giacomo and L{\"o}we, Benedikt and van der
Hoek, Wiebe},
booktitle = {Logic and the Foundations of Game and Decision Theory (LOFT8)},
author = {Berwanger, Dietmar},
title = {Infinite Coordination Games},
pages = {1-19},
futurechapter = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/Ber-loft8.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Ber-loft8.pdf},
doi = {10.1007/978-3-642-15164-4_1},
abstract = {We investigate the prescriptive power of sequential iterated
admissibility in coordination games of the Gale-Stewart style, \textit{i.e.},
perfect-information games of infinite duration with only two payoffs. We
show that, on this kind of games, the procedure of eliminating weakly
dominated strategies is independent of the elimination order and that,
under maximal simultaneous elimination, the procedure converges after at
most omega many stages.}
}
@article{BK-jlli10,
publisher = {Kluwer Academic Publishers},
journal = {Journal of Logic, Language and Information},
author = {Berwanger, Dietmar and Kaiser, {\L}ukasz},
title = {Information Tracking in Games on Graphs},
volume = 19,
number = 4,
pages = {395-412},
year = 2010,
month = oct,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BK-jlli10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BK-jlli10.pdf},
doi = {10.1007/s10849-009-9115-8},
abstract = {When seeking to coordinate in a game with imperfect information,
it is often relevant for a player to know what other players know. Keeping
track of the information acquired in a play of infinite duration may,
however, lead to infinite hierarchies of higher-order knowledge. We
present a construction that makes explicit which higher-order knowledge is
relevant in a game and allows us to describe a class of games that admit
coordinated winning strategies with finite memory.}
}
@article{BCL-jlli10,
publisher = {Kluwer Academic Publishers},
journal = {Journal of Logic, Language and Information},
author = {Bouyer, Patricia and Cassez, Franck and Laroussinie,
Fran{\c{c}}ois},
title = {Timed Modal Logics for Real-Time Systems: Specification,
Verification and Control},
volume = 20,
number = 2,
pages = {169-203},
year = 2011,
month = apr,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCL-jlli10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCL-jlli10.pdf},
doi = {10.1007/s10849-010-9127-4},
abstract = {In this paper, a timed modal logic~\(L_{c}\) is presented for
the specification and verification of real-time systems.
Several important results for~\(L_{c}\) are discussed. First
we address the model checking problem and we show that it is
an EXPTIME-complete problem. Secondly we consider
expressiveness and we explain how to express strong timed
bisimilarity and how to build characteristic formulas for
timed automata. We also propose a compositional algorithm
for~\(L_{c}\) model checking. Finally we consider several
control problems for which \(L_{c}\) can be used to check
controllability.}
}
@proceedings{Seg-icdt10,
author = {Segoufin, Luc},
editor = {Segoufin, Luc},
title = {Proceedings of the 13th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'10)},
booktitle = {Proceedings of the 13th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'10)},
year = 2010,
month = mar,
url = {http://portal.acm.org/citation.cfm?id=1804669&coll=ACM&dl=ACM}
}
@inproceedings{ACKNS-icdt10,
address = {Lausanne, Switzerland},
month = mar,
year = 2010,
publisher = {ACM Press},
editor = {Segoufin, Luc},
acronym = {{ICDT}'10},
booktitle = {{P}roceedings of the 13th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'10)},
author = {Abiteboul, Serge and Chan, T.-H. Hubert and Kharlamov, Evgeny
and Nutt, Werner and Senellart, Pierre},
title = {Aggregate queries for discrete and continuous probabilistic~{XML}},
pages = {50-61},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ACKNS-icdt10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACKNS-icdt10.pdf},
doi = {10.1145/1804669.1804679},
abstract = {Sources of data uncertainty and imprecision are numerous. A way
to handle this uncertainty is to associate probabilistic
annotations to data. Many such probabilistic database models
have been proposed, both in the relational and in the
semi-structured setting. The latter is particularly well
adapted to the management of uncertain data coming from a
variety of automatic processes. An important problem, in the
context of probabilistic XML databases, is that of answering
aggregate queries (count, sum, avg, etc.), which has
received limited attention so far. In a model unifying the
various (discrete) semi-structured probabilistic models
studied up to now, we present algorithms to compute the
distribution of the aggregation values (exploiting some
regularity properties of the aggregate functions) and
probabilistic moments (especially, expectation and variance)
of this distribution. We also prove the intractability of
some of these problems and investigate approximation
techniques. We finally extend the discrete model to a
continuous one, in order to take into account continuous
data values, such as measurements from sensor networks, and
present algorithms to compute distribution functions and
moments for various classes of continuous distributions of
data values.}
}
@inproceedings{Fig-icdt10,
address = {Lausanne, Switzerland},
month = mar,
year = 2010,
publisher = {ACM Press},
editor = {Segoufin, Luc},
acronym = {{ICDT}'10},
booktitle = {{P}roceedings of the 13th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'10)},
author = {Figueira, Diego},
title = {Forward-{XP}ath and extended register automata on data-trees},
pages = {230-240},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/fig-icdt10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/fig-icdt10.pdf},
ps = {fig-icdt10.ps},
doi = {10.1145/1804669.1804699},
abstract = {We consider a fragment of XPath named {"}forward-XPath{"}, which
contains all descendant and rightwards sibling axes as well as data
equality and inequality tests. The satisfiability problem for
forward-XPath in the presence of DTDs and even of primary key constraints
is shown here to be decidable.\par
To show decidability we introduce a model of alternating automata on data
trees that can move downwards and rightwards in the tree, have one
register for storing data and compare them for equality, and have the
ability to (1)~nondeterministically guess a data value and store it, and
(2)~quantify universally over the set of data values seen so far during
the run. This model extends the work of Jurdzi{\'n}ski and Lazi{\'c}.
Decidability of the finitary non-emptiness problem for this model is
obtained by a direct reduction to a well-structured transition system,
contrary to previous approaches.}
}
@article{CDH-tocl10,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger,
{\relax Th}omas A.},
title = {Quantitative Languages},
volume = 11,
number = 4,
nopages = {},
year = 2010,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDH-tocl10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDH-tocl10.pdf},
ps = {CDH-tocl10.ps},
abstract = {Quantitative generalizations of classical languages, which
assign to each word a real number in- stead of a boolean value, have
applications in modeling resource-constrained computation. We use weighted
automata (finite automata with transition weights) to define several
natural classes of quantitative languages over finite and infinite words;
in particular, the real value of an infinite run is computed as the
maximum, limsup, liminf, limit average, or discounted sum of the
transition weights. We define the classical decision problems of automata
theory (emptiness, universality, language inclusion, and language
equivalence) in the quantitative setting and study their compu- tational
complexity. As the decidability of the language-inclusion problem remains
open for some classes of weighted automata, we introduce a notion of
quantitative simulation that is decidable and implies language inclusion.
We also give a complete characterization of the expressive power of the
various classes of weighted automata. In particular, we show that most
classes of weighted automata cannot be determinized.}
}
@inproceedings{DR-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 = {Doyen, Laurent and Raskin, Jean-Fran{\c{c}}ois},
title = {Antichains Algorithms for Finite Automata},
pages = {2-22},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DR-tacas10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DR-tacas10.pdf},
ps = {DR-tacas10.ps},
doi = {10.1007/978-3-642-12002-2_2},
abstract = {We present a general theory that exploits simulation relations
on transition systems to obtain antichain algorithms for solving the
reachability and repeated reachability problems. Antichains are more
succinct than the sets of states manipulated by the traditional fixpoint
algorithms. The theory justifies the correctness of the antichain
algorithms, and applications such as the universality problem for finite
automata illustrate efficiency improvements. Finally, we show that new and
provably better antichain algorithms can be obtained for the emptiness
problem of alternating automata over finite and infinite words.}
}
@article{BCDDH-icomp10,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Berwanger, Dietmar and Chatterjee, Krishnendu and Doyen, Laurent
and De{~}Wulf, Martin and Henzinger, {\relax Th}omas A.},
title = {Strategy Construction for Parity Games with Imperfect
Information},
volume = 208,
number = 10,
pages = {1206-1220},
year = 2010,
month = oct,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCDDH-icomp10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCDDH-icomp10.pdf},
ps = {BCDDH-icomp10.ps},
doi = {10.1016/j.ic.2009.09.006},
abstract = {We consider two-player parity games with imperfect information
in which strategies rely on observations that provide imperfect
information about the history of a play. To solve such games,
\textit{i.e.}, to determine the winning regions of players and
corresponding winning strategies, one can use the subset construction to
build an equivalent perfect-information game. Recently, an algorithm that
avoids the inefficient subset construction has been proposed. The
algorithm performs a fixed-point computation in a lattice of antichains,
thus maintaining a succinct representation of state sets. However, this
representation does not allow to recover winning strategies.\par
In this paper, we build on the antichain approach to develop an algorithm
for constructing the winning strategies in parity games of imperfect
information. One major obstacle in adapting the classical procedure is
that the complementation of attractor sets would break the invariant of
downward-closedness on which the antichain representation relies. We
overcome this difficulty by decomposing problem instances recursively into
games with a combination of reachability, safety, and simpler parity
conditions. We also report on an experimental implementation of our
algorithm; to our knowledge, this is the first implementation of a
procedure for solving imperfect-information parity games on graphs.}
}
@misc{avote-D21,
nocontributor = {Ciob{\^a}c{\u{a}}, {\c{S}}tefan and Delaune,
St{\'e}phanie and Kremer, Steve},
author = {Ciob{\^a}c{\u{a}}, {\c{S}}tefan and Cortier, V{\'e}ronique},
title = {Algorithmes pour l'{\'e}quivalence statique},
year = 2009,
month = sep,
type = {Contract Report},
howpublished = {Deliverable AVOTE~2.1 (ANR-07-SESU-002)},
note = {17~pages},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/avote-d21.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/avote-d21.pdf}
}
@inproceedings{BBJ-iscc09,
address = {Sousse, Tunisia},
month = jul,
year = 2009,
publisher = {{IEEE} Computer Society Press},
noeditor = {},
acronym = {{ISCC}'09},
booktitle = {{P}roceedings of the 14th {IEEE} {S}ymposium on {C}omputers and
{C}ommunications ({ISCC}'09)},
author = {Ben Youssef, Nihel and Bouhoula, Adel and Jacquemard,
Florent},
title = {Automatic Verification of Conformance of Firewall
Configurations to Security Policies},
pages = {526 - 531},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBJ-iscc09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBJ-iscc09.pdf},
doi = {10.1109/ISCC.2009.5202309},
abstract = {The configuration of firewalls is highly error prone and
automated solution are needed in order to analyze its
correctness. We propose a formal and automatic method for
checking whether a firewall reacts correctly with respect to
a security policy given in an high level declarative
language. When errors are detected, some feedback is
returned to the user in order to correct the firewall
configuration. Furthermore, the procedure verifies that no
conflicts exist within the security policy. We show that our
method is both correct and complete. Finally, it has been
implemented in a prototype of verifier based on a
satisfiability solver modulo theories (SMT). Experiment
conducted on relevant case studies demonstrate the
efficiency and scalability of the approach.}
}
@misc{averiles09-f2.2,
author = {LIAFA and CRIL and EDF and LSV and Verimag},
title = {Projet {RNTL} {A}veriles~-- Fourniture F2.2~: Algorithmes de
v{\'e}rification~-- Rapport final},
year = 2009,
month = nov,
type = {Contract Report},
note = {25~pages},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/averiles-f22.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/averiles-f22.pdf}
}
@inproceedings{haar-cdcccc09,
address = {Shanghai, China},
month = dec,
year = 2009,
publisher = {{IEEE} Control System Society},
acronym = {{CDC/CCC}'09},
booktitle = {{P}roceedings of the Joint 48th {IEEE} {C}onference on {D}ecision
and {C}ontrol ({CDC}'09) and 28th {C}hinese {C}ontrol {C}onference ({CCC}'09)},
author = {Haar, Stefan},
title = {Qualitative Diagnosability of Labeled {P}etri Nets Revisited},
pages = {1248-1253},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/haar-cdc09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/haar-cdc09.pdf},
doi = {10.1109/CDC.2009.5400917},
abstract = {In recent years, classical discrete event fault diagnosis
techniques have been extended to Petri Net system models under partial
order semantics. In~a recent paper, we showed how to take further
advantage of the partial order representation of concurrent processes, by
decomposing the unfolding into 'facets', formed by subnets whose events
either all occur eventually, or none of them occurs. A~notion of
\emph{q(ualitative)}-diagnosability was proposed based on this
decomposition. The present paper corrects the definition of
q-diagnosability and develops its properties. Sufficient and necessary
criteria, on the transition labeling, for q-diagnosability are shown; for
their verification, and diagnosis itself, compact data structures are
sufficient.}
}
@misc{Quasimodo-3.5,
author = {Laroussinie, Fran{\c{c}}ois and Vaandrager, Frits and
Neuh{\"a}u{\ss}er, Martin},
title = {Extended timed automata for scheduling},
howpublished = {Deliverable QUASIMODO~3.5 (ICT-FP7-STREP-214755)},
year = 2009,
month = jul
}
@misc{Quasimodo-3.4,
author = {Markey, Nicolas and Li, Shuhao and
Raskin, Jean-Fran{\c{c}}ois and Stoelinga, Mari{\"e}lle},
title = {Synthesizing controllers with bounded resources},
howpublished = {Deliverable QUASIMODO~3.4 (ICT-FP7-STREP-214755)},
year = 2010,
month = jan
}
@misc{Quasimodo-2.2,
author = {Markey, Nicolas and Berendsen, Jasper
and David, Alexandre and Han, Tingting and
Hermanns, Holger and Larsen, Kim G. and Neuh{\"a}u{\ss}er, Martin},
title = {Symbolic data structures and analysis of models
with multiple quantitative aspects},
howpublished = {Deliverable QUASIMODO~2.2 (ICT-FP7-STREP-214755)},
year = 2009,
month = jul
}
@article{LS-ipl10,
publisher = {Elsevier Science Publishers},
journal = {Information Processing Letters},
author = {Libkin, Leonid and Sirangelo, Cristina},
title = {Disjoint pattern matching and implication in strings},
volume = 110,
number = 4,
pages = {143-147},
year = 2010,
month = jan,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-ipl10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-ipl10.pdf},
doi = {10.1016/j.ipl.2009.11.009},
abstract = {We deal with the problem of deciding whether a given set of
string patterns implies the presence of a fixed pattern. While checking
whether a set of patterns occurs in a string is solvable in polynomial
time, this implication problem is well known to be intractable. Here we
consider a version of the problem when patterns in the set are required to
be disjoint. We show that for such a version of the problem the situation
is reversed: checking whether a set of patterns occurs in a string is
NP-complete, but the implication problem is solvable in polynomial time.}
}
@mastersthesis{sankur-master,
author = {Sankur, Ocan},
title = {Model-checking robuste des automates temporis{\'e}s
\textit{via} les machines {\`a} canaux},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2010},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/sankur-m2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/sankur-m2.pdf}
}
@mastersthesis{soulat-master,
author = {Soulat, Romain},
title = {Am{\'e}liorations algorithmiques d'un moteur
de model-checking et {\'e}tudes de cas},
school = {{M}aster 2 {R}echerche {I}nformatique {P}aris {S}ud~11},
type = {Rapport de {M}aster},
year = {2010},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/soulat-m2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/soulat-m2.pdf}
}
@mastersthesis{boiret-master,
author = {Boiret, Adrien},
title = {Grammaires context-free pour les arbres sans rang},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2010},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/boiret-m2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/boiret-m2.pdf}
}
@mastersthesis{dimino-master,
author = {Dimino, J{\'e}r{\'e}mie},
title = {Sur les arbres de rang non born{\'e} avec donn{\'e}es},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2010},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/dimino-m2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/dimino-m2.pdf}
}
@mastersthesis{monmege-master,
author = {Monmege, Benjamin},
title = {Propri{\'e}t{\'e}s quantitatives des mots et des arbres~--
Applications aux langages~{XML}},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2010},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/monmege-m2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/monmege-m2.pdf}
}
@inproceedings{ABGM-time09,
address = {Brixen-Bressanone, Italy},
month = jul,
year = 2009,
publisher = {{IEEE} Computer Society Press},
noeditor = {Lutz, Carsten and Raskin, Jean-Fran{\c{c}}ois},
acronym = {{TIME}'09},
booktitle = {{P}roceedings of the 16th {I}nternational {S}ymposium on
{T}emporal {R}epresentation and {R}easoning
({TIME}'09)},
title = {The {AXML} Artifact Model},
author = {Abiteboul, Serge and Bourhis, Pierre and Galland, Alban and
Marinoiu, Bogdan},
pages = {11-17},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABGM-time09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABGM-time09.pdf},
abstract = {Towards a data-centric workflow approach, we introduce an
\emph{artifact model} to capture data and workflow management activities
in distributed settings. The model is built on Active XML, \textit{i.e.},
XML trees including Web service calls. We argue that the model captures
the essential features of business artifacts as described informally in
[Nigam and Caswell~(2003)] or discussed in [Hull~(2008)]. To illustrate,
we briefly consider the \emph{monitoring} of distributed systems and the
\emph{verification} of temporal properties for them.}
}
@inproceedings{ABMG-vldb10,
address = {Singapore},
month = sep,
year = 2010,
volume = 3,
series = {Proceedings of the {VLDB} Endowment},
publisher = {ACM Press},
editor = {Chen, Yi and Tay, Y.C.},
acronym = {{VLDB}'10},
booktitle = {{P}roceedings of the 36th {I}nternational
{C}onference on {V}ery {L}arge {D}ata {B}ases
({VLDB}'10)},
author = {Abiteboul, Serge and Bourhis, Pierre and Marinoiu, Bogdan and
Galland, Alban},
title = {{AXART}~-- {E}nabling Collaborative Work with {AXML} Artifacts},
pages = {1553-1556},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABMG-vldb10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABMG-vldb10.pdf},
abstract = {The workflow models have been essentially operation-centric for
many years, ignoring almost completely the data aspects. Recently, a new
paradigm of data-centric workflows, called \emph{business artifacts}, has
been introduced by Nigam and Caswell. We follow this approach and propose
a model where artifacts are XML documents that evolve in time due to
interactions with their environment, i.e. human users or Web services.
This paper proposes the AXART system as a distributed platform for
collaborative work that harnesses the power of our model. We will
illustrate AXART with an example taken from the movie industry. Indeed,
applying for a role in a film is a typical collaborative process that
involves various participants, inside and outside the film company. The
demonstration scenario considers both standard workflow process and
dynamic workflow modifications, based on two extension mechanisms:
workflow specialization and workflow exception. The workflows, modeled
using artifacts, are supported by the AXART system by combining techniques
specific to active documents, like view maintenance, with security
techniques to manage access rights.}
}
@inproceedings{GAMS-wsdm10,
address = {New~York, New~York, USA},
month = feb,
year = 2010,
publisher = {ACM Press},
editor = {Davison, Brian D. and Suel, Torsten and Craswell, Nick and Liu, Bing},
acronym = {{WSDM}'10},
booktitle = {{P}roceedings of the 3rd {I}nternational {C}onference on {W}eb {S}earch and
{W}eb {D}ata {M}ining ({WSDM}'10)},
author = {Galland, Alban and Abiteboul, Serge and Marian, Am{\'e}lie
and Senellart, Pierre},
title = {Corroborating information from disagreeing views},
pages = {131-140},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GAMS-wsdm10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GAMS-wsdm10.pdf},
doi = {10.1145/1718487.1718504},
abstract = {We consider a set of views stating possibly conflicting facts.
Negative facts in the views may come, e.g., from functional dependencies
in the underlying database schema. We want to predict the truth values of
the facts. Beyond simple methods such as voting (typically rather
accurate), we explore techniques based on {"}corroboration{"}, i.e., taking
into account trust in the views. We introduce three fixpoint algorithms
corresponding to different levels of complexity of an underlying
probabilistic model. They all estimate both truth values of facts and
trust in the views. We present experimental studies on synthetic and
real-world data. This analysis illustrates how and in which context these
methods improve corroboration results over baseline methods. We believe
that corroboration can serve in a wide range of applications such as
source selection in the semantic Web, data quality assessment or semantic
annotation cleaning in social networks. This work sets the bases for a
wide range of techniques for solving these more complex problems.}
}
@inproceedings{BHB-sbmf10,
address = {},
month = nov,
year = 2010,
volume = 6527,
series = {Lecture Notes in Computer Science},
editor = {Davies, Jim and Silva, Leila and da~Silva Sim{\~a}o, Adenilso},
publisher = {Springer},
acronym = {{SBMF}'10},
booktitle = {{R}evised {S}elected {P}apers of the 13th {B}razilian {S}ymposium on {F}ormal
{M}ethods ({SBMF}'10)},
author = {Bauer, Sebastian S. and Hennicker, Rolf and Bidoit, Michel},
title = {A~Modal Interface Theory with Data Constraints},
pages = {80-95},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHB-sbmf10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHB-sbmf10.pdf},
doi = {10.1007/978-3-642-19829-8_6},
abstract = {For the design of component-based software, the behavioral
specification of component interfaces is crucial. We propose an extension
of the theory of modal I{\slash}O-transition systems by Larsen
\textit{et~al.} to cope with both control flow and data states of reactive
components at the same time. In our framework, transitions model incoming
or outgoing operation calls which are constrained by pre- and
postconditions expressing the mutual assumptions and guarantees of the
receiver and the sender of a message. We define a new interface theory by
adapting synchronous composition, modal refinement and modal compatibility
to the case of modal I{\slash}O-transition systems with data constraints.
We show that in this formalism modal compatibility is preserved by
refinement and modal refinement is preserved by composition which are
basic requirements for any interface theory.}
}
@article{AGM-jcss11,
publisher = {Elsevier Science Publishers},
journal = {Journal of Computer and System Sciences},
author = {Abiteboul, Serge and Gottlob, Georg and Manna, Marco},
title = {Distributed {XML} design},
volume = 77,
number = 6,
pages = {936-964},
month = nov,
year = 2011,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AGM-jcss11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGM-jcss11.pdf},
doi = {10.1016/j.jcss.2011.02.003},
abstract = {A distributed XML document is an XML document that spans several
machines. We assume that a distribution design of the document tree is
given, consisting of an \emph{XML kernel-document}
\(T_{[\mathbf{f}_{1},...,\mathbf{f}_{n}]}\) where some leaves are
{"}docking points{"} for external resources providing XML subtrees
(\(\mathbf{f}_{1},...,\mathbf{f}_{n}\) standing, e.g., for Web services or
peers at remote locations). The top-down design problem consists in, given
a \emph{type} (a~schema document that may vary from a DTD to a tree
automaton) for the distributed document, {"}propagating{"} locally this
type into a collection of types, that we call \emph{typing}, while
preserving desirable properties. We also consider the bottom-up design
which consists in, given a type for each external resource, exhibiting a
global type that is enforced by the local types, again with natural
desirable properties. In the article, we lay out the fundamentals of a
theory of distributed XML design, analyze problems concerning typing
issues in this setting, and study their complexity.}
}
@article{ACKNS-tods11,
publisher = {ACM Press},
journal = {ACM Transactions on Database Systems},
author = {Abiteboul, Serge and Chan, T.-H. Hubert and Kharlamov, Evgeny
and Nutt, Werner and Senellart, Pierre},
title = {Capturing continuous data and answering aggregate
queries in probabilistic~{XML}},
volume = {36},
number = {4:25},
month = dec,
year = 2011,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ACKNS-tods11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACKNS-tods11.pdf},
doi = {10.1145/2043652.2043658},
abstract = {Sources of data uncertainty and imprecision are numerous. A way
to handle this uncertainty is to associate probabilistic annotations to
data. Many such probabilistic database models have been proposed, both in
the relational and in the semi-structured setting. The latter is
particularly well adapted to the management of uncertain data coming from
a variety of automatic processes. An important problem, in the context of
probabilistic XML databases, is that of answering aggregate queries
(count, sum, avg, etc.), which has received limited attention so~far. In a
model unifying the various (discrete) semi-structured probabilistic models
studied up to now, we present algorithms to compute the distribution of
the aggregation values (exploiting some regularity properties of the
aggregate functions) and probabilistic moments (especially expectation and
variance) of this distribution. We also prove the intractability of some
of these problems and investigate approximation techniques. We finally
extend the discrete model to a continuous one, in order to take into
account continuous data values, such as measurements from sensor networks,
and extend our algorithms and complexity results to the continuous case.}
}
@inproceedings{SGA-iswc11,
address = {Bonn, Germany},
month = oct,
year = 2011,
volume = 7031,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Aroyo, Lora and Welty, Chris and Alani, Harith and Taylor, Jamie
and Bernstein, Abraham and Kagal, Lalana and
Fridman{ }Noy,Natasha and Blomqvist, Eva},
acronym = {{ISWC}'11},
booktitle = {{P}roceedings of the 10th {I}nternational {S}emantic {W}eb {C}onference
({ISWC}'11)},
author = {Suchanek, Fabian M. and Gross{-}Amblard, David and
Abiteboul, Serge},
title = {Watermarking for Ontologies},
pages = {697-713},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SGA-iswc11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SGA-iswc11.pdf},
doi = {10.1007/978-3-642-25073-6_44},
abstract = {In this paper, we study watermarking methods to prove the
ownership of an ontology. Different from existing approaches, we propose
to watermark not by altering existing statements, but by removing them.
Thereby, our approach does not introduce false statements into the
ontology. We show how ownership of ontologies can be established with
provably tight probability bounds, even if only parts of the ontology are
being re-used. We finally demonstrate the viability of our approach on
real-world ontologies.}
}
@inproceedings{AGP-webdb11,
address = {Athens, Greece},
month = jun,
year = 2011,
editor = {Marian, Am{\'e}lie and Vassalos, Vasilis},
acronym = {({W}eb{DB}'11)},
booktitle = {{P}roceedings of the 14th {I}nternational {W}orkshop on the
{W}eb and {D}atabases ({W}eb{DB}'11)},
author = {Abiteboul, Serge and Galland, Alban and Polyzotis, Neoklis},
title = {Web information management with access control},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AGP-webdb11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGP-webdb11.pdf},
abstract = {We investigate the problem of sharing private information on the
Web, where the information is hosted on different machines that may use
different access control and distribution schemes. We introduce a
distributed knowledge-base model, termed WebdamExchange, that comprises
logical statements for specifying data, access control, distribution and
knowledge about other peers. The statements can be communicated,
replicated, queried, and updated, while keeping track of time and
provenance. This unified base allows applications to reason declaratively
about what data is accessible, where it resides, and how to retrieve it
securely.}
}
@inproceedings{ABKT-icde11,
editor = {Abiteboul, Serge and B{\"o}hm, Klemens and Koch, Christoph and
Tan, Kian-Lee},
author = {Abiteboul, Serge and B{\"o}hm, Klemens and Koch, Christoph and
Tan, Kian-Lee},
title = {{P}roceedings of the 27th {I}nternational {C}onference on
{D}ata {E}ngineering ({ICDE}'11)},
booktitle = {{P}roceedings of the 27th {I}nternational {C}onference on
{D}ata {E}ngineering ({ICDE}'11)},
year = 2011,
month = apr,
publisher = {{IEEE} Computer Society Press},
address = {Hannover, Germany},
doi = {10.1109/ICDE.2011.5767975},
url = {http://ieeexplore.ieee.org/xpl/tocresult.jsp?punumber=5765035}
}
@inproceedings{ACK-icdt11,
address = {Uppsala, Sweden},
month = mar,
year = 2011,
publisher = {ACM Press},
editor = {Milo, Tova},
acronym = {{ICDT}'11},
booktitle = {{P}roceedings of the 14th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'11)},
author = {Abiteboul, Serge and ten~Cate, Balder and Katsis, Yannis},
title = {On the equivalence of distributed systems with queries and communication},
pages = {126-137},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ACK-icdt11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACK-icdt11.pdf},
doi = {10.1145/1938551.1938570},
abstract = {Distributed data management systems consist of peers
that store, exchange and process data in order to collaboratively
achieve a common goal, such as evaluate some query. We study the
equivalence of such systems. We model a distributed system by a
collection of Active XML documents, i.e., trees augmented with
function calls for performing tasks such as sending, receiving and
querying data. As our model is quite general, the equivalence
problem turns out to be undecidable. However, we exhibit several
restrictions of the model, for which equivalence can be
effectively decided. We also study the computational complexity of
the equivalence problem, and present an axiomatization of
equivalence, in the form of a set of equivalence-preserving
rewrite rules allowing us to optimize a system by rewriting it
into an equivalent, but possibly more efficient system.}
}
@inproceedings{ABV-icdt11,
address = {Uppsala, Sweden},
month = mar,
year = 2011,
publisher = {ACM Press},
editor = {Milo, Tova},
acronym = {{ICDT}'11},
booktitle = {{P}roceedings of the 14th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'11)},
author = {Abiteboul, Serge and Bourhis, Pierre and Vianu, Victor},
title = {Comparing workflow specification languages: a~matter of views},
pages = {78-89},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABV-icdt11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABV-icdt11.pdf},
doi = {10.1145/1938551.1938564},
abstract = {We address the problem of comparing the expressiveness
of workflow specification formalisms using a notion of view of a
workflow. Views allow to compare widely different workflow systems
by mapping them to a common representation capturing the
observables relevant to the comparison. Using this framework, we
compare the expressiveness of several workflow specification
mechanisms, including automata, temporal constraints, and
pre-and-post conditions, with XML and relational databases as
underlying data models. One surprising result shows the
considerable power of static constraints to simulate apparently
much richer workflow control mechanisms.}
}
@inproceedings{ltc-GardentPPS11,
address = {Pozna\'n, Poland},
month = nov,
year = 2014,
volume = {8387},
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer},
editor = {Vetulani, Zygmunt and Mariani, Joseph},
acronym = {{LTC}'11},
booktitle = {{P}roceedings of the 5th {L}anguage {\&} {T}echnology
{C}onference ({LTC}'11)},
author = {Gardent, Claire and Perrier, Guy and Parmentier, Yannick
and Schmitz, Sylvain},
title = {Lexical Disambiguation in {LTAG} using Left Context},
nopages = {},
url = {http://hal.archives-ouvertes.fr/hal-00629902/},
abstract = {In this paper, we present an automaton-based lexical
disambiguation process for Lexicalized Tree-Adjoining
Grammar (LTAG). This process builds on previous work
of Bonfante \textit{et~al.}~(2004), and extends it by
computing a polarity-based abstraction, which
contains information about left context. This
extension allows for a faster lexical disambiguation
by reducing the filtering automaton.}
}
@inproceedings{DMS-iwigp11,
address = {Saarbr{\"u}cken, Germany},
month = mar,
year = 2011,
volume = 50,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Reich, Johannes and Finkbeiner, Bernd},
acronym = {{iWIGP}'11},
booktitle = {{P}roceedings of the {I}nternational
{W}orkshop on {I}nteractions, {G}ames and {P}rotocols ({iWIGP}'11)},
author = {Doyen, Laurent and Massart, {\relax Th}ierry and Shirmohammadi, Mahsa},
title = {Synchronizing Objectives for {M}arkov Decision Processes},
pages = {61-75},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DMS-iwigp11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DMS-iwigp11.pdf}
}
@inproceedings{CD-memics11,
address = {Lednice, Czech Republic },
month = oct,
year = 2011,
volume = 7119,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Bouda, Jan and {\v{C}}ern{\'a}, Ivana and Sekanina, Luk{\'a}{\v{s}}
and Vojnar, Tom{\'a}{\v{s}}},
acronym = {{MEMICS}'11},
booktitle = {{P}roceedings of the 7th {A}nnual {D}octoral {W}orkshop on {M}athematical
and {E}ngineering {M}ethods in {C}omputer {S}cience
({MEMICS}'11)},
author = {Chatterjee, Krishnendu and Doyen, Laurent},
title = {Games and Markov Decision Processes with Mean-payoff
Parity and Energy Parity Objectives},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-memics11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-memics11.pdf},
abstract = {The analysis of games and probabilistic systems with
quantitative objectives (such as mean-payoff and energy objectives) and
\(\omega\)-regular objectives (such as parity objectives) provide the
mathematical foundation for performance analysis and verification of
various classes of systems. In this talk, we will present a survey of both
classical results and recent results about mean-payoff, energy, and parity
objectives. We will discuss about how to solve their combinations, their
inter-relationship, and mention interesting open problems.}
}
@inproceedings{BBDDR-atva11,
address = {Taipei, Taiwan},
month = oct,
year = {2011},
volume = 6996,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Bultan, Tevfik and Hsiung, Pao-Ann},
acronym = {{ATVA}'11},
booktitle = {{P}roceedings of the 9th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'11)},
author = {Brihaye, {\relax Th}omas and Bruy{\`e}re, V{\'e}ronique and
Doyen, Laurent and Ducobu, Marc and Raskin, Jean-Fran{\c{c}}ois},
title = {Antichain-based {QBF} Solving},
pages = {183-197},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBDDR-atva11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBDDR-atva11.pdf},
doi = {10.1007/978-3-642-24372-1_14}
}
@article{BCDGR-fmsd2011,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Brim, Lubos and Chaloupka, Jakub and Doyen, Laurent and
Gentilini, Raffaella and Raskin, Jean-Fran{\c{c}}ois},
title = {Faster algorithms for mean-payoff games},
year = {2011},
month = apr,
volume = {38},
number = {2},
pages = {97-118},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCDGR-fmsd2011.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCDGR-fmsd2011.pdf},
doi = {10.1007/s10703-010-0105-x}
}
@misc{JGL-tacl11,
author = {Jean Goubault{-}Larrecq},
title = {A Few Pearls in the Theory of Quasi-Metric Spaces},
year = {2011},
month = jul,
howpublished = {Invited talk, Fifth International Conference on Topology,
Algebra, and Categories in Logic (TACL'11), Marseilles,
France, July~2011}
}
@article{FG-lmcs12,
journal = {Logical Methods in Computer Science},
author = {Finkel, Alain and Goubault{-}Larrecq, Jean},
title = {Forward Analysis for {WSTS}, Part~{II}: Complete {WSTS}},
year = 2012,
month = sep,
volume = 8,
number = {3:28},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FG-lmcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FG-lmcs12.pdf},
doi = {10.2168/LMCS-8(3:28)2012},
abstract = {We describe a simple, conceptual forward analysis procedure for
\(\infty\)-complete WSTS~\(\mathfrak{S}\). This computes the so-called
\emph{clover} of a state. When \(\mathfrak{S}\) is the completion of a
WSTS~\(\mathfrak{X}\), the clover in~\(\mathfrak{S}\) is a finite
description of the downward closure of the reachability set. We show
that such completions are infinity-complete exactly when
\(\mathfrak{X}\) is an \(\omega^2\)-WSTS, a~new robust class of WSTS.
We show that our procedure terminates in more cases than the
generalized Karp-Miller procedure on extensions of Petri nets and on
lossy channel systems. We characterize the WSTS where our procedure
terminates as those that are \emph{clover-flattable}. Finally, we
apply this to well-structured counter systems.}
}
@article{JGL-lmcs12,
journal = {Logical Methods in Computer Science},
author = {Goubault{-}Larrecq, Jean},
title = {{QRB}-Domains and the Probabilistic Powerdomain},
year = 2012,
volume = 8,
number = {1:14},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-lmcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-lmcs12.pdf},
doi = {10.2168/LMCS-8(1:14)2012},
abstract = {Is there any Cartesian-closed category of continuous
domains that would be closed under Jones and Plotkin's
probabilistic powerdomain construction? This is a major open
problem in the area of denotational semantics of probabilistic
higher-order languages. We relax the question, and look for
quasi-continuous dcpos instead.\par
We introduce a natural class of such quasi-continuous dcpos, the
omega-QRB-domains. We show that they form a category omega-QRB
with pleasing properties: omega-QRB is closed under the
probabilistic powerdomain functor, under finite products, under
taking bilimits of expanding sequences, under retracts, and
even under so-called quasi-retracts. But... omega-QRB is
not Cartesian closed. We conclude by showing that the QRB
domains are just one half of an FS-domain, merely lacking
control.}
}
@article{BGGLP-comp11,
publisher = {Springer},
journal = {Computing},
author = {Bouissou, Olivier and Goubault, {\'E}ric and
Goubault{-}Larrecq, Jean and Putot, Sylvie},
title = {A Generalization of {P}-boxes to Affine Arithmetic, and Applications to
Static Analysis of Programs},
year = 2012,
month = mar,
volume = 94,
number = {2-4},
pages = {189-201},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGGLP-comp11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGGLP-comp11.pdf},
doi = {10.1007/s00607-011-0182-8},
abstract = {We often need to deal with information that contains
both interval and probabilistic uncertainties. P-boxes and
Dempster-Shafer structures are models that unify both kind of
information, but they suffer from the main defect of intervals,
the wrapping effect. We present here a new arithmetic that
mixes, in a guaranteed manner, interval uncertainty with
probabilities, while using some information about variable
dependencies, hence limiting the loss from not accounting for
correlations. This increases the precision of the result and
decreases the computation time compared to standard p-box
arithmetic.}
}
@article{BDMSS-tocl11,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Boja{\'n}czyk, Miko{\l}aj and David, Claire and Muscholl,
Anca and Schwentick, {\relax Th}omas and Segoufin, Luc},
title = {Two-variable logic on data words},
volume = 12,
number = {4:27},
nopages = {},
year = 2011,
month = jul,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDMSS-tocl11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDMSS-tocl11.pdf},
doi = {10.1145/1970398.1970403}
}
@article{KS-lmcs11,
journal = {Logical Methods in Computer Science},
author = {Kazana, Wojciech and Segoufin, Luc},
title = {First-order query evaluation on structures of
bounded degree},
volume = 7,
number = {2:20},
year = 2011,
month = jun,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-lmcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-lmcs11.pdf},
doi = {10.2168/LMCS-7(2:20)2011}
}
@article{PS-lmcs11,
journal = {Logical Methods in Computer Science},
author = {Place, {\relax Th}omas and Segoufin, Luc},
title = {A decidable characterization of locally testable
tree languages},
volume = 7,
number = {4:03},
year = 2011,
month = nov,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/PS-lmcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/PS-lmcs11.pdf},
doi = {10.2168/LMCS-7(4:3)2011}
}
@inproceedings{AGLMP-icde11,
address = {Hannover, Germany},
month = apr,
year = 2011,
publisher = {{IEEE} Computer Society Press},
editor = {Abiteboul, Serge and B{\"o}hm, Klemens and Koch, Christoph and Tan, Kian-Lee},
acronym = {{ICDE}'11},
booktitle = {{P}roceedings of the 27th {I}nternational {C}onference on
{D}ata {E}ngineering ({ICDE}'11)},
author = {Antoine, {\'E}milien and Galland, Alban and
Lyngbaek, Kristian and Marian, Am{\'e}lie and
Polyzotis, Neoklis},
title = {Social networking on top of the WebdamExchange system},
pages = {1300-1303},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AGLMP-icde11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGLMP-icde11.pdf},
doi = {10.1109/ICDE.2011.5767939},
abstract = {The demonstration presents the WebdamExchange system,
\emph{a~distributed knowledge base management system with access rights,
localization and provenance}. This system is based on the exchange of
logical statements that describe documents, collections, access rights,
keys and localization information and updates of this data.\par We
illustrate how the model can be used in a social-network context to help
users keep control on their data on the web. In particular, we show how
users within very different schemes of data-distribution (centralized,
dht, unstructured P2P,~etc.) can still transparently collaborate while
keeping a good control over their own data.}
}
@inproceedings{ABGA-pods11,
address = {Athens, Greece},
month = jun,
year = 2011,
publisher = {ACM Press},
editor = {Lenzerini, Maurizio and Schwentick, {\relax Th}omas},
acronym = {{PODS}'11},
booktitle = {{P}roceedings of the 30th {A}nnual
{ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium
on {P}rinciples of {D}atabase {S}ystems
({PODS}'11)},
author = {Abiteboul, Serge and Bienvenu, Meghyn and
Galland, Alban and Antoine, {\'E}milien},
title = {A rule-based language for Web data management},
pages = {293-304},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABGA-pods11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABGA-pods11.pdf},
doi = {10.1145/1989284.1989320},
abstract = {There is a new trend to use Datalog-style rule-based languages
to specify modern distributed applications, notably on the Web. We
introduce here such a language for a distributed data model where peers
exchange messages (i.e.,~logical facts) as well as rules. The model is
formally defined and its interest for distributed data management is
illustrated through a variety of examples. A~contribution of our work is a
study of the impact on expressiveness of {"}delegations{"} (the
installation of rules by a peer in some other peer) and explicit
timestamps. We also validate the semantics of our model by showing that
under certain natural conditions, our semantics converges to the same
semantics as the centralized system with the same rules. Indeed, we show
this is even true when updates are considered.}
}
@inproceedings{BC-post12,
address = {Tallinn, Estonia},
month = mar,
year = 2012,
volume = {7215},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Degano, Pierpaolo and Guttman, Joshua D.},
acronym = {{POST}'12},
booktitle = {{P}roceedings of the 1st {I}nternational {C}onference on
{P}rinciples of {S}ecurity and {T}rust
({POST}'12)},
author = {Bana, Gergei and Comon{-}Lundh, Hubert},
title = {Towards Unconditional Soundness: Computationally Complete Symbolic Attacker},
pages = {189-208},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BC-post12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BC-post12.pdf},
doi = {10.1007/978-3-642-28641-4_11},
abstract = {We consider the question of the adequacy of symbolic models
versus computational models for the verification of security protocols. We
neither try to include properties in the symbolic model that reflect the
properties of the computational primitives nor add computational
requirements that enforce the soundness of the symbolic model. We propose
in this paper a different approach: everything is possible in the symbolic
model, unless it contradicts a computational assumption. In this way, we
obtain unconditional soundness almost by construction. And we do not need
to assume the absence of dynamic corruption or the absence of key-cycles,
which are examples of hypotheses that are always used in related works. We
set the basic framework, for arbitrary cryptographic primitives and
arbitrary protocols, however for trace security properties only.}
}
@inproceedings{CCS-post12,
address = {Tallinn, Estonia},
month = mar,
year = 2012,
volume = {7215},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Degano, Pierpaolo and Guttman, Joshua D.},
acronym = {{POST}'12},
booktitle = {{P}roceedings of the 1st {I}nternational {C}onference on
{P}rinciples of {S}ecurity and {T}rust
({POST}'12)},
author = {Comon{-}Lundh, Hubert and Cortier, V{\'e}ronique and Scerri, Guillaume},
title = {Security proof with dishonest keys},
pages = {149-168},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCS-post12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCS-post12.pdf},
doi = {10.1007/978-3-642-28641-4_9},
abstract = {Symbolic and computational models are the two families of models
for rigorously analysing security protocols. Symbolic models are abstract
but offer a high level of automation while computational models are more
precise but security proof can be tedious. Since the seminal work of Abadi
and Rogaway, a new direction of research aims at reconciling the two views
and many soundness results establish that symbolic models are actually
sound w.r.t. computational models.\par
This is however not true for the prominent case of encryption. Indeed, all
existing soundness results assume that the adversary only uses honestly
generated keys. While this assumption is acceptable in the case of
asymmetric encryption, it is clearly unrealistic for symmetric encryption.
In this paper, we provide with several examples of attacks that do not
show-up in the classical Dolev-Yao model, and that do not break the
IND-CPA nor INT-CTXT properties of the encryption scheme.\par
Our main contribution is to show the first soundness result for symmetric
encryption and arbitrary adversaries. We consider arbitrary
indistinguishability properties and an unbounded number of sessions. This
result relies on an extension of the symbolic model, while keeping
standard security assumptions: IND-CPA and IND-CTXT for the encryption
scheme.}
}
@inproceedings{CDD-post12,
address = {Tallinn, Estonia},
month = mar,
year = 2012,
volume = {7215},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Degano, Pierpaolo and Guttman, Joshua D.},
acronym = {{POST}'12},
booktitle = {{P}roceedings of the 1st {I}nternational {C}onference on
{P}rinciples of {S}ecurity and {T}rust
({POST}'12)},
author = {Cortier, V{\'e}ronique and Degrieck, Jan and Delaune, St{\'e}phanie},
title = {Analysing routing protocols: four nodes topologies are sufficient},
pages = {30-50},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDD-post12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDD-post12.pdf},
doi = {10.1007/978-3-642-28641-4_3},
abstract = {Routing protocols aim at establishing a route between nodes on a
network. Secured versions of routing protocols have been proposed in order
to provide more guarantees on the resulting routes. Formal methods have
proved their usefulness when analysing standard security protocols such as
confidentiality or authentication protocols. However, existing results and
tools do not apply to routing protocols. This is due in particular to the
fact that all possible topologies (infinitely many) have to be considered.\par
In this paper, we propose a simple reduction result: when looking for
attacks on properties such as the validity of the route, it is sufficient
to consider topologies with only four nodes, resulting in a number of just
five distinct topologies to consider. As an application, we analyse the
SRP applied to DSR and the SDMSR protocols using the ProVerif tool.}
}
@techreport{LSV-11-24,
author = {Arnaud, Mathilde and Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
title = {Modeling and Verifying Ad~Hoc Routing Protocols},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2011},
month = dec,
type = {Research Report},
number = {LSV-11-24},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2011-24.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2011-24.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2011-24-v1.pdf, 20111220},
note = {66~pages},
abstract = {Mobile ad hoc networks consist of mobile wireless devices which
autonomously organize their infrastructure. In such networks, a central
issue, ensured by routing protocols, is to find a route from one device to
another. Those protocols use cryptographic mechanisms in order to prevent
malicious nodes from compromising the discovered route.\par
Our contribution is twofold. We first propose a calculus for modeling and
reasoning about security protocols, including in particular secured
routing protocols. Our calculus extends standard symbolic models to take
into account the characteristics of routing protocols and to model
wireless communication in a more accurate way. Our second main
contribution is a decision procedure for analyzing routing protocols for
any network topology. By using constraint solving techniques, we show that
it is possible to automatically discover (in~NPTIME) whether there exists
a network topology that would allow malicious nodes to mount an attack
against the protocol, for a bounded number of sessions. We also provide a
decision procedure for detecting attacks in case the network topology is
given a priori. We demonstrate the usage and usefulness of our approach by
analyzing protocols of the literature, such as SRP applied to DSR and
SDMSR.}
}
@inproceedings{BHP-tacas12,
address = {Tallinn, Estonia},
month = mar,
year = 2012,
volume = {7214},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Flanagan, Cormac and K{\"o}nig, Barbara},
acronym = {{TACAS}'12},
booktitle = {{P}roceedings of the 18th {I}nternational
{C}onference on {T}ools and {A}lgorithms for
{C}onstruction and {A}nalysis of {S}ystems
({TACAS}'12)},
author = {Barbot, Beno{\^\i}t and Haddad, Serge and Picaronny, Claudine},
title = {Coupling and Importance Sampling for Statistical Model Checking},
pages = {331-346},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHP-tacas12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHP-tacas12.pdf},
doi = {10.1007/978-3-642-28756-5_23},
abstract = {Statistical model-checking is an alternative verification
technique applied on stochastic systems whose size is beyond numerical
analysis ability. Given a model (most often a Markov chain) and a formula,
it provides a confidence interval for the probability that the model
satisfies the formula. One of the main limitations of the statistical
approach is the computation time explosion triggered by the evaluation of
very small probabilities. In order to solve this problem we develop a new
approach based on importance sampling and coupling. The corresponding
algorithms have been implemented in our tool cosmos. We present
experimentation on several relevant systems, with estimated time
reductions reaching a factor of~\(10^{120}\).}
}
@inproceedings{CMV-tacas12,
address = {Tallinn, Estonia},
month = mar,
year = 2012,
volume = {7214},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Flanagan, Cormac and K{\"o}nig, Barbara},
acronym = {{TACAS}'12},
booktitle = {{P}roceedings of the 18th {I}nternational
{C}onference on {T}ools and {A}lgorithms for
{C}onstruction and {A}nalysis of {S}ystems
({TACAS}'12)},
author = {Chadha, Rohit and Madhusudan, P. and Viswanathan, Mahesh},
title = {Reachability under Contextual Locking},
pages = {437-450},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CMV-tacas12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CMV-tacas12.pdf},
doi = {10.1007/978-3-642-28756-5_30},
abstract = {The pairwise reachability problem for a multi-threaded program
asks, given control locations in two threads, whether they can be
simultaneously reached in an execution of the program. The problem is
important for static analysis and is used to detect statements that are
concurrently enabled. This problem is in general undecidable even when
data is abstracted and when the threads (with recursion) synchronize only
using a finite set of locks. Popular programming paradigms that limit the
lock usage patterns have been identified under which the pairwise
reachability problem becomes decidable. In this paper, we consider a new
natural programming paradigm, called contextual locking, which ties the
lock usage to calling patterns in each thread: we assume that locks are
released in the same context that they were acquired and that every lock
acquired by a thread in a procedure call is released before the procedure
returns. Our main result is that the pairwise reachability problem is
polynomial-time decidable for this new programming paradigm as well.}
}
@inproceedings{BCGK-fossacs12,
address = {Tallinn, Estonia},
month = mar,
year = 2012,
volume = 7213,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Birkedal, Lars},
acronym = {{FoSSaCS}'12},
booktitle = {{P}roceedings of the 15th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'12)},
author = {Bollig, Benedikt and Cyriac, Aiswarya and Gastin, Paul and
Narayan Kumar, K.},
title = {Model Checking Languages of Data Words},
pages = {391-405},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCGK-fossacs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCGK-fossacs12.pdf},
doi = {10.1007/978-3-642-28729-9_26},
abstract = {We consider the model-checking problem for data multi-pushdown
automata (DMPA). DMPA generate data words, i.e, strings enriched with
values from an infinite domain. The latter can be used to represent an
unbounded number of process identifiers so that DMPA are suitable to model
concurrent programs with dynamic process creation. To specify properties
of data words, we use monadic second-order (MSO) logic, which comes with a
predicate to test two word positions for data equality. While
satisfiability for MSO logic is undecidable (even for weaker fragments
such as first-order logic), our main result states that one can decide if
all words generated by a DMPA satisfy a given formula from the full MSO
logic.}
}
@inproceedings{BBMU-fossacs12,
address = {Tallinn, Estonia},
month = mar,
year = 2012,
volume = 7213,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Birkedal, Lars},
acronym = {{FoSSaCS}'12},
booktitle = {{P}roceedings of the 15th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'12)},
author = {Bouyer, Patricia and Brenguier, Romain and Markey, Nicolas and Ummels, Michael},
title = {Concurrent games with ordered objectives},
pages = {301-315},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBMU-fossacs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBMU-fossacs12.pdf},
doi = {10.1007/978-3-642-28729-9_20},
abstract = {We consider concurrent games played on graphs, in which each
player has several qualitative (e.g. reachability or B{\"u}chi)
objectives, and a preorder on these objectives (for instance the counting
order, where the aim is to maximise the number of objectives that are
fulfilled).\par
We study two fundamental problems in that setting: (1)~the \emph{value
problem}, which aims at deciding the existence of a strategy that ensures
a given payoff; (2)~the \emph{Nash equilibrium problem}, where we want to
decide the existence of a Nash equilibrium (possibly with a condition on
the payoffs). We characterise the exact complexities of these problems for
several relevant preorders, and several kinds of objectives.}
}
@phdthesis{bourhis-phd2011,
author = {Bourhis, Pierre},
title = {On the dynamics of active documents for distributed data management},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2011,
month = feb,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/bourhis-these.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/bourhis-these.pdf}
}
@phdthesis{arnaud-phd2011,
author = {Arnaud, Mathilde},
title = {Formal verification of secured routing protocols},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2011,
month = dec,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/arnaud-these11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/arnaud-these11.pdf}
}
@phdthesis{ciobaca-phd2011,
author = {Ciob{\^a}c{\u{a}}, {\c{S}}tefan},
title = {Automated Verification of Security Protocols
with Appplications to Electronic Voting},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2011,
month = dec,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ciobaca-these11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ciobaca-these11.pdf}
}
@article{haar-deds11,
publisher = {Springer},
journal = {Discrete Event Dynamic Systems: Theory and Applications},
author = {Haar, Stefan},
title = {What topology tells us about diagnosability in partial order semantics},
pages = {383-402},
volume = 22,
number = 4,
year = {2012},
month = dec,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/haar-deds11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/haar-deds11.pdf},
doi = {10.1007/s10626-011-0121-z},
abstract = {From a partial observation of the behaviour of a labeled
Discrete Event System, \emph{fault diagnosis} strives to determine whether
or not a given {"}invisible{"} fault event has occurred. The
\emph{diagnosability problem} can be stated as follows: does the labeling
allow for an outside observer to determine the occurrence of the fault, no
later than a bounded number of events after that unobservable occurrence?
When this problem is investigated in the context of concurrent systems,
partial order semantics adds to the difficulty of the problem, but also
provides a richer and more complex picture of observation and diagnosis.
In particular, it is crucial to clarify the intuitive notion of
{"}\emph{time after fault occurrence}{"}. To this end, we will use a
unifying metric framework for event structures, providing a general
topological description of diagnosability in both sequential and
nonsequential semantics for Petri nets.}
}
@techreport{lsv-11-23,
author = {Lozes, {\'E}tienne and Villard, Jules},
title = {Sharing Contract-Obedient Endpoints},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2011},
month = dec,
type = {Research Report},
number = {LSV-11-23},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2011-23.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2011-23.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2011-23-v1.pdf, 20111207},
note = {42~pages},
abstract = {Most of the existing verification techniques for programs based
on message passing suppose either that channel endpoints are used in a
linear fashion, where at most one thread can be considered as the owner of
an endpoint at any given time, or that endpoints may be used arbitrarily
by any number of threads. The former approach forbids the sharing of
channels, while the latter limits what is provable about programs, since
no constraint is put on the usage of channels. In this paper, we propose a
midpoint between these techniques by extending a previously published
proof system based on separation logic to allow the sharing of endpoints.
We identify two independent mechanisms for supporting sharing: the
standard technique based on reasoning with permissions, and a new
technique based on what we call ownership on demand. We formalize these
two techniques in a proof system, illustrate them on several examples, and
we extend Villard's semantics and soundness proofs to support sharing.}
}
@article{BCJST-ijis11,
publisher = {Springer},
journal = {International Journal on Information Security},
author = {Backes, Michael and Cervesato, Iliano and Jaggard, Aaron and
Scedrov, Andre and Tsay, Joe-Kai},
title = {Cryptographically sound security proofs for basic and public-key
{K}erberos},
pages = {107-134},
volume = {10},
number = {2},
year = {2011},
month = jun,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCJST-ijis11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCJST-ijis11.pdf},
doi = {10.1007/s10207-011-0125-6}
}
@inproceedings{ILV-imacc11,
address = {Oxford, UK},
month = dec,
year = 2011,
volume = {7089},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Chen, Liqun},
acronym = {{IMACC}'11},
booktitle = {{P}roceedings of the 13th {IMA} {I}nternational {C}onference
on {C}ryptography and {C}oding
({IMACC}'11)},
author = {Izabach{\`e}ne, Malika and Libert, Beno{\^\i}t and
Vergnaud, Damien},
title = {Block-wise {P}-Signatures and Non-Interactive Anonymous
Credentials with Efficient Attributes},
pages = {431-450},
doi = {10.1007/978-3-642-25516-8_26},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ILV-imacc11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ILV-imacc11.pdf},
abstract = {Anonymous credentials are protocols in which users obtain
certificates from organizations and subsequently demonstrate their
possession in such a way that transactions carried out by the same user
cannot be linked. We present an anonymous credential scheme with
non-interactive proofs of credential possession where credentials are
associated with a number of attributes. Following recent results of
Camenisch and Gro\ss{} (CCS~2008), the proof simultaneously convinces the
verifier that certified attributes satisfy a certain predicate. Our
construction relies on a new kind of P-signature, termed \emph{block-wise
P-signature}, that allows a user to obtain a signature on a committed
vector of messages and makes it possible to generate a short witness that
serves as a proof that the signed vector satisfies the predicate.
A~non-interactive anonymous credential is obtained by combining our
\emph{block-wise} P-signature scheme with the Groth-Sahai proof system. It
allows efficiently proving possession of a credential while simultaneously
demonstrating that underlying attributes satisfy a predicate corresponding
to the evaluation of inner products (and therefore disjunctions or
polynomial evaluations). The security of our scheme is proved in the
standard model under non-interactive assumptions.}
}
@inproceedings{CD-lopstr11,
address = {Odense, Denmark},
year = 2012,
volume = {7225},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Vidal, Germ{\'a}n},
acronym = {{LOPSTR}'11},
booktitle = {{P}roceedings of the 21st {I}nternational
{W}orkshop on {L}ogic {P}rogram {S}ynthesis
and {T}ransformation
({LOPSTR}'11)},
author = {Cabalar, Pedro and Demri, St{\'e}phane},
title = {Automata-Based Computation of Temporal Equilibrium Models},
pages = {57-72},
doi = {10.1007/978-3-642-32211-2_5},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-lopstr11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-lopstr11.pdf},
abstract = {Temporal Equilibrium Logic~(TEL) is a formalism for temporal
logic programming that generalizes the paradigm of Answer Set
Programming~(ASP) introducing modal temporal operators from standard
Linear-time Temporal Logic~(LTL). In this paper we solve some problems
that remained open for TEL like decidability, bounds for computational
complexity as well as computation of temporal equilibrium models for
arbitrary theories. We propose a method for the latter that consists in
building a B{\"u}chi automaton that accepts exactly the temporal
equilibrium models of a given theory, providing an automata-based decision
procedure and illustrating the \(\omega\)-regularity of such sets. We show
that TEL satisfiability can be solved in exponential space and it is hard
for polynomial space. Finally, given two theories, we provide a decision
procedure to check if they have the same temporal equilibrium models.}
}
@book{LPS-book11,
author = {Luccio, Fabrizio and Pagli, Linda and Steel, Graham},
title = {Mathematical and Algorithmic Foundations of the Internet},
publisher = {CRC Press},
year = 2011,
month = jul,
url = {https://www.crcpress.com/9781439831380}
}
@incollection{steel-crypt2011,
author = {Steel, Graham},
title = {Formal Analysis of Security~{API}s},
booktitle = {Encyclopedia of Cryptography and Security},
edition = {2nd},
editor = {van Tilborg, Henk C. A. and Jajodia, Sushil},
year = {2011},
pages = {492-494},
publisher = {Springer},
doi = {10.1007/978-1-4419-5906-5_873}
}
@article{BJ-jal11,
publisher = {Elsevier Science Publishers},
journal = {Journal of Applied Logic},
author = {Bouhoula, Adel and Jacquemard, Florent},
title = {Sufficient completeness verification for conditional and constrained~{TRS}},
year = {2012},
month = mar,
volume = {10},
number = {1},
pages = {127-143},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BJ-jal11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BJ-jal11.pdf},
doi = {10.1016/j.jal.2011.09.001},
abstract = {We present a procedure for checking sufficient completeness of
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 into 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.\par
The procedure is presented by an inference system which is shown sound and
complete. A~precondition of one inference of this system refers to a
(undecidable) property called strong ground reducibility which is
discharged to the above inductive theorem proving system. We have
successfully applied our method to several examples, yielding readable
proofs and, in case of negative answer, a counter-example suggesting how
to complete the specification. Moreover, we show that it is a decision
procedure when the TRS is unconditional but constrained, for an expressive
class of constrained constructor axioms.}
}
@inproceedings{JKS-frocos11,
address = {Saarbr{\"u}cken, Germany},
month = oct,
year = 2011,
volume = 6989,
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer},
editor = {Tinelli, Cesare and Sofronie-Stokkermans, Viorica},
acronym = {{FroCoS}'11},
booktitle = {{P}roceedings of the 8th {I}nternational {S}ymposium on {F}rontiers of
{C}ombining {S}ystems ({FroCoS}'11)},
author = {Jacquemard, Florent and Kojima, Yoshiharu and Sakai, Masahiko},
title = {Controlled Term Rewriting},
pages = {179-194},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JKS-frocos11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JKS-frocos11.pdf},
doi = {},
abstract = {Motivated by the problem of verification of imperative tree
transformation programs, we study the combination, called controlled term
rewriting systems~(CTRS), of term rewriting rules with constraints
selecting the possible rewrite positions. These constraints are specified,
for each rewrite rule, by a selection automaton which defines a set of
positions in a term based on tree automata computations.\par
We show that reachability is PSPACE-complete for so-called monotonic CTRS,
such that the size of every left-hand-side of every rewrite rule is larger
or equal to the size of the corresponding right-hand-side, and also for
the class of context-free non-collapsing CTRS, which transform CF tree
language into CF tree languages.\par
When allowing size-reducing rules, reachability becomes undecidable, even
for flat CTRS (both sides of rewrite rules are of depth at most one) when
restricting to words (i.e. function symbols have arity at most one), and
for ground CTRS (rewrite rules have no variables).\par
We also consider a restricted version of the control such that a position
is selected if the sequence of symbols on the path from that position to
the root of the tree belongs to a given regular language. This restriction
enables decision results in the above cases.}
}
@phdthesis{jacquemard-HDR11,
author = {Jacquemard, Florent},
title = {Extended Tree Automata for the Verification of Infinite State Systems},
year = 2011,
month = nov,
type = {M{\'e}moire d'habilitation},
school = {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-fj11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-fj11.pdf}
}
@article{CSV-lmcs11,
journal = {Logical Methods in Computer Science},
author = {Chadha, Rohit and Sistla, A. Prasad and Viswanathan, Mahesh},
title = {Power of Randomization in Automata on Infinite Strings},
year = {2011},
month = sep,
volume = {7},
number = {3:22},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CSV-lmcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CSV-lmcs11.pdf},
doi = {10.2168/LMCS-7(3:22)2011},
abstract = {Probabilistic B{\"u}chi Automata~(PBA) are randomized,
finite state automata that process input strings of
infinite length. Based on the threshold chosen for
the acceptance probability, different classes of
languages can be defined. In this paper, we present
a number of results that clarify the power of such
machines and properties of the languages they
define. The broad themes we focus on are as
follows. We present results on the decidability and
precise complexity of the emptiness, universality
and language containment problems for such machines,
thus answering questions central to the use of these
models in formal verification. Next, we characterize
the languages recognized by PBAs topologically,
demonstrating that though general PBAs can recognize
languages that are not regular, topologically the
languages are as simple as \(\omega\)-regular
languages. Finally, we introduce Hierarchical PBAs,
which are syntactically restricted forms of PBAs
that are tractable and capture exactly the class of
\(\omega\)-regular languages.}
}
@inproceedings{FRS-infinity11,
address = {Taipei, Taiwan},
month = oct,
year = 2011,
volume = 73,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Chen, Yu-Fang and Wang, Chao},
acronym = {{INFINITY}'11},
booktitle = {{P}roceedings of the 13th {I}nternational
{W}orkshops on {V}erification of {I}nfinite
{S}tate {S}ystems
({INFINITY}'11)},
author = {Fribourg, Laurent and Revol, Bertrand and Soulat, Romain},
title = {Synthesis of Switching Rules for Ensuring Reachability
Properties of Sampled Linear Systems},
pages = {35-48},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FRS-infinity11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FRS-infinity11.pdf},
doi = {10.4204/EPTCS.73.6},
abstract = {We consider here systems with piecewise linear dynamics that are
periodically sampled with a given period~\(\tau\). At each sampling time,
the mode of the system, i.e., the parameters of the linear dynamics, can
be switched, according to a switching rule. Such systems can be modelled
as a special form of hybrid automata, called {"}switched systems{"}, that
are automata with an \emph{infinite} real state space. The problem is to
find a switching rule that guarantees the system to still be in a given
area~\(V\) at the next sampling time, and so on indefinitely. In this
paper, we will consider two approaches: the~\emph{indirect} one that
abstracts the system under the form of a finite discrete event system, and
the \emph{direct} one that works on the continuous state space.\par
Our methods rely on previous works, but we specialize them to a simplified
context (linearity, periodic switching instants, absence of control
input), which is motivated by the features of a focused case study:
a~DC-DC boost converter built by electronics laboratory SATIE
(ENS~Cachan). Our enhanced methods allow us to treat successfully this
real-life example.}
}
@mastersthesis{kumardhar-master,
author = {Kumar Dhar, Amit},
title = {Counter Systems with {P}resburger-definable Reachability Sets:
Decidability and Complexity},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2011},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/akd11-m2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/akd11-m2.pdf}
}
@inproceedings{BD-frocos11,
address = {Saarbr{\"u}cken, Germany},
month = oct,
year = 2011,
volume = 6989,
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer},
editor = {Tinelli, Cesare and Sofronie-Stokkermans, Viorica},
acronym = {{FroCoS}'11},
booktitle = {{P}roceedings of the 8th {I}nternational {S}ymposium on {F}rontiers of
{C}ombining {S}ystems ({FroCoS}'11)},
author = {Bersani, Marcello and Demri, St{\'e}phane},
title = {The complexity of reversal-bounded model-checking},
pages = {71-86},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BD-frocos11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BD-frocos11.pdf},
doi = {10.1007/978-3-642-24364-6_6},
abstract = {We study model-checking problems on counter systems when guards
are quantifier-free Presburger formulae, the specification
languages are LTL-like dialects with arithmetical
constraints and the runs are restricted to reversal-bounded
ones. We introduce a generalization of reversal-boundedness
and we show the NExpTime-completeness of the
reversal-bounded model-checking problem as well as for
related reversalbounded reachability problems. As a
by-product, we show the effective Presburger definability
for sets of configurations for which there is a
reversal-bounded run verifying a given temporal formula. Our
results generalize existing results about reversal-bounded
counter automata and provides a uniform and more general
framework.}
}
@phdthesis{chambart-phd2011,
author = {Chambart, Pierre},
title = {Du Probl{\`e}me de sous-mot de {P}ost et de la complexit{\'e} des canaux non
fiables},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2011,
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/chambart-these11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/chambart-these11.pdf}
}
@phdthesis{galland-phd2011,
author = {Galland, Alban},
title = {Distributed Data Management with Access Control},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2011,
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/galland-these11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/galland-these11.pdf}
}
@book{webdam2011,
author = {Abiteboul, Serge and Manolescu, Ioana and
Rigaux, {\relax Ph}ilippe and Rousset, Marie-{\relax Ch}ristine
and Senellart, Pierre},
title = {Web Data Management},
year = 2011,
publisher = {Cambridge University Press},
url = {http://webdam.inria.fr/Jorge/}
}
@article{UW-lmcs11,
journal = {Logical Methods in Computer Science},
author = {Ummels, Michael and Wojtczak, Dominik},
title = {The Complexity of {N}ash Equilibria in Stochastic Multiplayer Games},
year = {2011},
month = sep,
volume = {7},
number = {3:20},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/UW-lmcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/UW-lmcs11.pdf},
doi = {10.2168/LMCS-7(3:20)2011},
abstract = {We analyse the computational complexity of finding Nash
equilibria in turn-based stochastic multiplayer games with omega-regular
objectives. We show that restricting the search space to equilibria whose
payoffs fall into a certain interval may lead to undecidability. In
particular, we prove that the following problem is undecidable: Given a
game~\(G\), does there exist a Nash equilibrium of~\(G\) where
Player~\(0\) wins with probability~\(1\)? Moreover, this problem remains
undecidable when restricted to pure strategies or (pure) strategies with
finite memory. One way to obtain a decidable variant of the problem is to
restrict the strategies to be positional or stationary. For the complexity
of these two problems, we obtain a common lower bound of NP and upper
bounds of NP and PSPACE respectively. Finally, we single out a special
case of the general problem that, in many cases, admits an efficient
solution. In particular, we prove that deciding the existence of an
equilibrium in which each player either wins or loses with
probability~\(1\) can be done in polynomial time for games where the
objective of each player is given by a parity condition with a bounded
number of priorities.}
}
@techreport{lsv-11-20,
author = {Berwanger, Dietmar and Kaiser, {\L}ukasz and Le{\ss}enich, Simon},
title = {Imperfect Recall and Counter Games},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2011},
month = oct,
type = {Research Report},
number = {LSV-11-20},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2011-20.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2011-20.pdf},
note = {21~pages},
abstract = {We study a class of omega-regular games with imperfect
information and imperfect recall, and present a
solution method which relies on the
MSO-compatibility of graph unfoldings. Furthermore,
we show a reduction from a large class of counter
parity games to such games with imperfect recall.
By combining the two results, we obtain the first
elementary algorithm for solving counter parity
games, which provides substantially improved
complexity bounds for several problems in
computational logic.}
}
@phdthesis{dacosta-phd2011,
author = {Da{~}Costa, Arnaud},
title = {Propri{\'e}t{\'e}s de jeux multi-agents},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2011,
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/dacosta-these11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/dacosta-these11.pdf}
}
@mastersthesis{pasaila-master,
author = {Pasail{\u{a}}, Daniel},
title = {Verifying equivalence properties of security protocols},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2011},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/dp11-m2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/dp11-m2.pdf}
}
@mastersthesis{degriek-master,
author = {Degrieck, Jan},
title = {R{\'e}duction de graphes pour l'analyse de protocoles de routage
s{\'e}curis{\'e}s},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2011},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/jd11-m2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/jd11-m2.pdf}
}
@inproceedings{CFM-ncma11,
address = {Milano, Italy},
month = jul,
year = 2011,
volume = 282,
series = {books@ocg.at},
publisher = {Austrian Computer Society},
editor = {Freund, Rudolf and Holzer, Markus and Mereghetti, Carlo
and Otto, Friedrich and Palano, Beatrice},
acronym = {{NCMA}'11},
booktitle = {{P}roceedings of the 3rd {W}orkshop on {N}on-{C}lassical {M}odels
of {A}utomata and {A}pplications ({NCMA}'11)},
author = {Cadilhac, Micha{\"e}l and Finkel, Alain and McKenzie, Pierre},
title = {On the Expressiveness of {P}arikh Automata and Related Models},
pages = {103-119},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-ncma11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-ncma11.pdf},
doi = {}
}
@inproceedings{CFM-words11,
address = {Prague, Czech Republic},
month = sep,
year = 2011,
volume = {63},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Ambro{\v{z}}, Petr and Holub, {\v{S}}t{\v{e}}p{\'a}n and
Mas{\'a}kov{\'a}, Zuzana},
acronym = {{WORDS}'11},
booktitle = {{P}roceedings of the 8th {I}nternational {C}onference {WORDS} ({WORDS}'11)},
author = {Cadilhac, Micha{\"e}l and Finkel, Alain and McKenzie, Pierre},
title = {Bounded {P}arikh Automata},
pages = {93-102},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-words11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-words11.pdf},
doi = {10.4204/EPTCS.63.13}
}
@inproceedings{SR-dcfs11,
address = {Limburg, Germany},
month = jul,
year = 2011,
volume = {6808},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Holzer, Markus and Kutrib, Martin and Pighizzini, Giovanni},
acronym = {{DCFS}'11},
booktitle = {{P}roceedings of the 13th {I}nternational {W}orkshop on
{D}escriptional {C}omplexity of {F}ormal {S}ystems ({DCFS}'11)},
author = {Schwoon, Stefan and Rodr{\'\i}guez, C{\'e}sar},
title = {Construction and {SAT}-based verification
of Contextual Unfoldings},
pages = {34-42},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SR-dcfs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SR-dcfs11.pdf},
doi = {10.1007/978-3-642-22600-7_3},
nonote = {Invited paper},
abstract = {Unfoldings succinctly represent the set of reachable markings of
a Petri net. Here, we shall consider the case of contextual nets, which
extend Petri nets with read arcs, and which are more suitable to represent
the case of concurrent read access. We discuss the problem of
(efficiently) constructing unfoldings of such nets. On the basis of these
unfoldings, various verification problems can be encoded as satisfiability
problems in propositional logic.}
}
@inproceedings{HKS-gandalf11,
address = {Minori, Italy},
month = jun,
year = 2011,
volume = 54,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {D'Agostino, Giovanna and La{~}Torre, Salvatore},
acronym = {{GandALF}'11},
booktitle = {{P}roceedings of the 2nd {I}nternational {S}ymposium
on {G}ames, {A}utomata, {L}ogics, and {F}ormal {V}erification
({GandALF}'11)},
author = {Haar, Stefan and Kern, Christian and Schwoon, Stefan},
title = {Computing the Reveals Relation in Occurrence Nets},
pages = {31-44},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HKS-gandalf11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HKS-gandalf11.pdf},
doi = {10.4204/EPTCS.54.3},
abstract = {Petri net unfoldings are a useful tool to tackle state-space
explosion in verification and related tasks. Moreover, their structure
allows to access directly the relations of causal precedence, concurrency,
and conflict between events. Here, we explore the data structure further,
to determine the following relation: event~\(a\) is said to reveal
event~\(b\) iff the occurrence of~\(a\) implies that~\(b\) inevitably
occurs, too, be it before, after, or concurrently with~\(a\). Knowledge of
reveals facilitates in particular the analysis of partially observable
systems, in the context of diagnosis, testing, or verification; it can
also be used to generate more concise representations of behaviours via
abstractions. The reveals relation was previously introduced in the
context of fault diagnosis, where it was shown that the reveals relation
was decidable: for a given pair~\(a,b\) in the unfolding~\(U\) of a safe
Petri net~\(N\), a finite prefix~\(P\) of~\(U\) is sufficient to decide
whether or not \(a\) reveals~\(b\). In this paper, we first considerably
improve the bound on~\(|P|\). We then show that there exists an efficient
algorithm for computing the relation on a given prefix. We have
implemented the algorithm and report on experiments.}
}
@inproceedings{bbcks-icgt10,
address = {Enschede, The Netherlands},
month = sep # {-} # oct,
year = 2010,
volume = 6372,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ehrig, Hartmut and Rensink, Arend
and Rozenberg, Grzegorz and Sch{\"u}rr, Andy},
acronym = {{ICGT}'10},
booktitle = {{P}roceedings of the 5th {I}nternational {C}onference on {G}raph
{T}ransformations ({ICGT}'10)},
author = {Baldan, Paolo and Bruni, Alessandro and Corradini, Andrea
and K{\"o}nig, Barbara and Schwoon, Stefan},
title = {On the Computation of {M}c{M}illan's Prefix for Contextual Nets
and Graph Grammars},
pages = {91-106},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/bbcks-icgt10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/bbcks-icgt10.pdf},
doi = {10.1007/978-3-642-15928-2_7},
abstract = {In recent years, a research thread focused on the use of the
unfolding semantics for verification purposes. This started with a paper
by McMillan, which devises an algorithm for constructing a finite complete
prefix of the unfolding of a safe Petri net, providing a compact
representation of the reachability graph. The extension to contextual nets
and graph transformation systems is far from being trivial because events
can have multiple causal histories. Recently, we proposed an abstract
algorithm that generalizes McMillan's construction to bounded contextual
nets without resorting to an encoding into plain P\slash T nets. Here, we
provide a more explicit construction that renders the algorithm effective.
To allow for an inductive definition of concurrency, missing in the
original proposal and essential for an efficient unfolding procedure, the
key intuition is to associate histories not only with events, but also
with places. Additionally, we outline how the proposed algorithm can be
extended to graph transformation systems, for which previous algorithms
based on the encoding of read arcs would not be applicable.}
}
@inproceedings{CDS-fct11,
address = {Oslo, Norway},
month = aug,
year = 2011,
volume = 6914,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Owe, Olaf and Steffen, Martin and Telle, Jan Arne},
acronym = {{FCT}'11},
booktitle = {{P}roceedings of the 18th {I}nternational {S}ymposium
on {F}undamentals of {C}omputation {T}heory
({FCT}'11)},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Singh, Rohit},
title = {On Memoryless Quantitative Objectives},
pages = {148-159},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDS-fct11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDS-fct11.pdf},
doi = {10.1007/978-3-642-22953-4_13},
abstract = {In two-player games on graph, the players construct an infinite
path through the game graph and get a reward computed by a payoff function
over infinite paths. Over weighted graphs, the typical and most studied
payoff functions compute the limit-average or the discounted sum of the
rewards along the path. Besides their simple definition, these two payoff
functions enjoy the property that memoryless optimal strategies always
exist.\par
In an attempt to construct other simple payoff functions, we define a
class of payoff functions which compute an (infinite) weighted average of
the rewards. This new class contains both the limit-average and the
discounted sum functions, and we show that they are the only members of
this class which induce memoryless optimal strategies, showing that there
is essentially no other simple payoff functions.}
}
@inproceedings{DDMM-fsttcs11,
address = {Mumbai, India},
month = dec,
year = 2011,
volume = 13,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chakraborty, Supratik and Kumar, Amit},
acronym = {{FSTTCS}'11},
booktitle = {{P}roceedings of the 31st {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'11)},
author = {Darondeau, {\relax Ph}ilippe and Demri, St{\'e}phane and
Meyer, Roland and Morvan, {\relax Ch}ristophe},
title = {{P}etri Net Reachability Graphs: Decidability Status of {FO}
Properties},
pages = {140-151},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DDMM-fsttcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DDMM-fsttcs11.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2011.140},
abstract = {We investigate the decidability and complexity status of
model-checking problems on unlabelled reachability graphs of Petri nets by
considering first-order, modal and pattern-based languages without labels
on transitions or atomic propositions on markings. We consider several
parameters to separate decidable problems from undecidable ones. Not only
are we able to provide precise borders and a systematic analysis, but we
also demonstrate the robustness of our proof techniques.}
}
@inproceedings{SBM-fsttcs11,
address = {Mumbai, India},
month = dec,
year = 2011,
volume = 13,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chakraborty, Supratik and Kumar, Amit},
acronym = {{FSTTCS}'11},
booktitle = {{P}roceedings of the 31st {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'11)},
author = {Sankur, Ocan and Bouyer, Patricia and Markey, Nicolas},
title = {Shrinking Timed Automata},
pages = {90-102},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SBM-fsttcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SBM-fsttcs11.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2011.90},
abstract = {We define and study a new approach to the implementability
of timed automata, where the semantics is perturbed by imprecisions and
finite frequency of the hardware. In order to circumvent these effects, we
introduce \emph{parametric shrinking} of clock constraints, which
corresponds to tightening the guards. We propose symbolic procedures to
decide the existence of (and then compute) parameters under which the
shrunk version of a given timed automaton is non-blocking and can
time-abstract simulate the exact semantics. We then define an
implementation semantics for timed automata with a digital clock and
positive reaction times, and show that for shrinkable timed automata both
properties are preserved in implementation.}
}
@inproceedings{CDK-fsttcs11,
address = {Mumbai, India},
month = dec,
year = 2011,
volume = 13,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chakraborty, Supratik and Kumar, Amit},
acronym = {{FSTTCS}'11},
booktitle = {{P}roceedings of the 31st {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'11)},
author = {Chevalier, C{\'e}line and Delaune, St{\'e}phanie and Kremer, Steve},
title = {Transforming Password Protocols to Compose},
pages = {204-216},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDK-fsttcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDK-fsttcs11.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2011.204},
abstract = {Formal, symbolic techniques are extremely useful for modelling
and analysing security protocols. They improved our understanding of
security protocols, allowed to discover flaws, and also provide support for
protocol design. However, such analyses usually consider that the protocol
is executed in isolation or assume a bounded number of protocol sessions.
Hence, no security guarantee is provided when the protocol is executed in a
more complex environment.\par
In this paper, we study whether password protocols can be safely composed,
even when a same password is reused. More precisely, we present a
transformation which maps a password protocol that is secure for a single
protocol session (a~decidable problem) to a protocol that is secure for an
unbounded number of sessions. Our result provides an effective strategy to
design secure password protocols: (i)~design a protocol intended to be
secure for one protocol session; (ii)~apply our transformation and obtain a
protocol which is secure for an unbounded number of sessions. Our technique
also applies to compose different password protocols allowing us to obtain
both inter-protocol and inter-session composition.}
}
@inproceedings{BBMU-fsttcs11,
address = {Mumbai, India},
month = dec,
year = 2011,
volume = 13,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chakraborty, Supratik and Kumar, Amit},
acronym = {{FSTTCS}'11},
booktitle = {{P}roceedings of the 31st {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'11)},
author = {Bouyer, Patricia and Brenguier, Romain and Markey, Nicolas
and Ummels, Michael},
title = {{N}ash Equilibria in Concurrent Games with {B}{\"u}chi Objectives},
pages = {375-386},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBMU-fsttcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBMU-fsttcs11.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2011.375},
abstract = {We study the problem of the existence (and computation) of Nash
equilibria in multi-player concurrent games with B{\"u}chi-definable
objectives. First, when the objectives are B{\"u}chi conditions on the
game, we prove that the existence problem can be solved in polynomial
time. In a second part, we extend our technique to objectives defined by
deterministic B{\"u}chi automata, and prove that the problem then becomes
EXPTIME-complete. We prove PSPACE-completeness for the case where the
B{\"u}chi automata are 1-weak.}
}
@inproceedings{BLP-fsttcs11,
address = {Mumbai, India},
month = dec,
year = 2011,
volume = 13,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chakraborty, Supratik and Kumar, Amit},
acronym = {{FSTTCS}'11},
booktitle = {{P}roceedings of the 31st {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'11)},
author = {Berwanger, Dietmar and Kaiser, {\L}ukasz and Puchala, Bernd},
title = {Perfect-Information Construction for Coordination in Games},
pages = {387-398},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BLP-fsttcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BLP-fsttcs11.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2011.387},
abstract = {We present a general construction for eliminating imperfect
information from games with several players who coordinate against nature,
and to transform them into two-player games with perfect information while
preserving winning strategy profiles. The construction yields an infinite
game tree with epistemic models associated to nodes. To obtain a more
succinct representation, we define an abstraction based on homomorphic
equivalence, which we prove to be sound for games with observable winning
conditions. The abstraction generates finite game graphs in several
relevant cases, and leads to a new semi-decision procedure for
multi-player games with imperfect information.}
}
@incollection{FLS-fosad11,
noaddress = {},
month = sep,
year = 2011,
volume = 6858,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Aldini, Alessandro and Gorrieri, Roberto},
acronym = {{FOSAD}'{VI}},
booktitle = {{F}oundations of {S}ecurity {A}nalysis and {D}esign~-- {FOSAD}
{T}utorial {L}ectures ({FOSAD}'{VI})},
author = {Focardi, Riccardo and Luccio, Flaminia L. and Steel, Graham},
title = {An Introduction to Security {API} Analysis},
pages = {35-65},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FLS-fosad11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FLS-fosad11.pdf},
doi = {10.1007/978-3-642-23082-0_2},
abstract = {A~security API is an Application Program Interface that allows
untrusted code to access sensitive resources in a secure way. Examples of
security APIs include the interface between the tamper-resistant chip on a
smartcard (trusted) and the card reader (untrusted), the~interface between
a~cryptographic Hardware Security Module, or~HSM (trusted) and the client
machine (untrusted), and the Google maps API (an~interface between a
server, trusted by Google, and the rest of the Internet).}
}
@inproceedings{CCD-ccs11,
address = {Chicago, Illinois, USA},
month = oct,
year = 2011,
publisher = {ACM Press},
editor = {Chen, Yan and Danezis, George and Shmatikov, Vitaly},
acronym = {{CCS}'11},
booktitle = {{P}roceedings of the 18th {ACM} {C}onference
on {C}omputer and {C}ommunications {S}ecurity
({CCS}'11)},
author = {Cheval, Vincent and Comon{-}Lundh, Hubert and
Delaune, St{\'e}phanie},
title = {Trace Equivalence Decision: Negative Tests and Non-determinism},
pages = {321-330},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-ccs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-ccs11.pdf},
doi = {10.1145/2046707.2046744},
abstract = {We consider security properties of cryptographic protocols that
can be modeled using the notion of trace equivalence. The notion of
equivalence is crucial when specifying privacy-type properties, like
anonymity, vote-privacy, and unlinkability.\par
In this paper, we give a calculus that is close to the applied pi calculus
and that allows one to capture most existing protocols that rely on
classical cryptographic primitives. First, we propose a symbolic semantics
for our calculus relying on constraint systems to represent infinite sets
of possible traces, and we reduce the decidability of trace equivalence to
deciding a notion of symbolic equivalence between sets of constraint
systems. Second, we develop an algorithm allowing us to decide whether two
sets of constraint systems are in symbolic equivalence or not. Altogether,
this yields the first decidability result of trace equivalence for a
general class of processes that may involve else branches and\slash or private
channels (for a bounded number of sessions).}
}
@incollection{haddad-DS11b,
author = {Haddad, Serge},
title = {Introduction to Verification},
booktitle = {Models and Analysis in Distributed Systems},
editor = {Haddad, Serge and Kordon, Fabrice and Pautet, Laurent and
Petrucci, Laure},
publisher = {John Wiley \& Sons, Ltd.},
chapter = 6,
pages = {137-154},
year = 2011
}
@incollection{DP-DS11b,
author = {Demri, St{\'e}phane and Poitrenaud, Denis},
title = {Verification of Infinite-State Systems},
booktitle = {Models and Analysis in Distributed Systems},
editor = {Haddad, Serge and Kordon, Fabrice and Pautet, Laurent and
Petrucci, Laure},
publisher = {John Wiley \& Sons, Ltd.},
chapter = 8,
pages = {221-269},
year = 2011,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DP-DS11b.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DP-DS11b.pdf}
}
@book{HKPP-DS11a,
editor = {Haddad, Serge and Kordon, Fabrice and Pautet, Laurent and
Petrucci, Laure},
title = {Distributed Systems Design and Algorithms},
publisher = {John Wiley \& Sons, Ltd.},
year = {2011},
url = {http://www.iste.co.uk/index.php?f=a&ACTION=View&id=415}
}
@book{HKPP-DS11b,
editor = {Haddad, Serge and Kordon, Fabrice and Pautet, Laurent and
Petrucci, Laure},
title = {Models and Analysis in Distributed Systems},
publisher = {John Wiley \& Sons, Ltd.},
year = {2011},
url = {http://www.iste.co.uk/index.php?f=a&ACTION=View&id=416}
}
@inproceedings{ECGJ-msr11,
address = {Lille, France},
month = nov,
year = 2011,
number = {1-3},
volume = {45},
series = {Journal Europ{\'e}en des Syst{\`e}mes Automatis{\'e}s},
publisher = {Herm{\`e}s},
editor = {Craye, {\'E}tienne and Gamati{\'e}, Abdoulaye},
acronym = {{MSR}'11},
booktitle = {{A}ctes du 8{\`e}me {C}olloque sur la
{M}od{\'e}lisation des {S}yst{\`e}mes
{R}{\'e}actifs
({MSR}'11)},
author = {Echeveste, Jod{\'e} and Cont, Arshia and Giavitto,
Jean-Louis and Jacquemard, Florent},
title = {Formalisation des relations temporelles entre une partition et une
performance musicale dans un contexte d'accompagnement automatique},
pages = {109-124},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ECGJ-msr11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ECGJ-msr11.pdf},
doi = {10.3166/jesa.45.109-124},
abstract = {We sketch the real-time features required by automatic musical
accompaniment seen as a reactive system. We formalize the datation of
musical event taking into account the various temporal scales used in
music. Various strategies for the handling of synchronization constraints
and the handling of errors are presented.}
}
@inproceedings{BHP-msr11,
address = {Lille, France},
month = nov,
year = 2011,
number = {1-3},
volume = {45},
series = {Journal Europ{\'e}en des Syst{\`e}mes Automatis{\'e}s},
publisher = {Herm{\`e}s},
editor = {Craye, {\'E}tienne and Gamati{\'e}, Abdoulaye},
acronym = {{MSR}'11},
booktitle = {{A}ctes du 8{\`e}me {C}olloque sur la
{M}od{\'e}lisation des {S}yst{\`e}mes
{R}{\'e}actifs
({MSR}'11)},
author = {Barbot, Beno{\^\i}t and Haddad, Serge and Picaronny, Claudine},
title = {{\'E}chantillonnage pr{\'e}f{\'e}rentiel pour le model checking statistique},
pages = {237-252},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-msr11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-msr11.pdf},
doi = {10.3166/jesa.45.237-252},
abstract = {The statistical model checking can be usefully substituted for
numerical model checking when the models to be studied are huge. However
the statistical approach cannot evaluate too small probabilities. In order
to solve the problem, we develop here a new approach based on importance
sampling. While most of the techniques related to importance sampling are
based on heuristics, we establish theoretical results under some
hypotheses. These results ensure a reduction of the variance during
application of importance sampling. We also characterize situations that
fulfill the hypotheses and we extend our approach for handling other
situations but then without theoretical guarantee. We have implemented
this approach with the tool \textsc{Cosmos} after some extensions. At~last
we have evaluated this approach for two examples and analysed the
experimentations.}
}
@inproceedings{BMS-formats11,
address = {Aalborg, Denmark},
month = sep,
year = 2011,
volume = 6919,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Fahrenberg, Uli and Tripakis, Stavros},
acronym = {{FORMATS}'11},
booktitle = {{P}roceedings of the 9th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'11)},
author = {Bouyer, Patricia and Markey, Nicolas and Sankur, Ocan},
title = {Robust Model-Checking of Timed Automata via Pumping in
Channel Machines},
pages = {97-112},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-formats11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-formats11.pdf},
doi = {10.1007/978-3-642-24310-3_8},
abstract = {Timed automata are governed by a mathematical semantics which
assumes perfectly continuous and precise clocks. This requirement is not
satised by digital hardware on which the models are implemented. In~fact,
it~was shown that the presence of imprecisions, however small they may be,
may yield extra behaviours. Therefore correctness proven on the formal
model does not imply correctness of the real system.\par
The problem of robust model-checking was then dened to circumvent this
inconsistency. It consists in computing a bound on the imprecision under
which the system will be correct.\par
In this work, we show that robust model-checking against
\(\omega\)-regular properties for timed automata can be reduced to
standard model-checking of timed automata, by computing an adequate bound
on the imprecision. This yields a new algorithm for robust model-checking
of \(\omega\)-regular properties, which is both optimal and valid for
general timed automata.}
}
@inproceedings{bonnet-RP11,
address = {Genova, Italy},
month = sep,
year = 2011,
volume = {6945},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Delzanno, Giorgio and Potapov, Igor},
acronym = {{RP}'11},
booktitle = {{P}roceedings of the 5th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'11)},
author = {Bonnet, R{\'e}mi},
title = {Decidability of {LTL} Model Checking for Vector Addition
Systems with one Zero-test},
pages = {85-95},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/bonnet-RP11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/bonnet-RP11.pdf},
doi = {10.1007/978-3-642-24288-5_9},
abstract = {We consider the class of Vector Addition Systems with one
zero-test and we show that the model-checking problem for LTL is decidable
thanks to a reduction to the computability of the cover and the
decidability of reachability. Our proof uses the notion of increasing
loop, that we refine to fit the non-standard monotony of our system.}
}
@inproceedings{FK-RP11,
address = {Genova, Italy},
month = sep,
year = 2011,
volume = {6945},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Delzanno, Giorgio and Potapov, Igor},
acronym = {{RP}'11},
booktitle = {{P}roceedings of the 5th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'11)},
author = {Fribourg, Laurent and K{\"u}hne, Ulrich},
title = {Parametric Verification and Test Coverage for Hybrid Automata
Using the Inverse Method},
pages = {191-204},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FK-RP11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FK-RP11.pdf},
doi = {10.1007/978-3-642-24288-5_17},
abstract = {Hybrid systems combine continuous and discrete behavior. Hybrid
Automata are a powerful formalism for the modeling and verification of
such systems. A~common problem in hybrid system verification is the good
parameters problem, which consists in identifying a set of parameter
valuations which guarantee a certain behavior of a system. Recently, a
method has been presented for attacking this problem for Timed Automata.
In this paper, we show the extension of this methodology for hybrid
automata with linear and affine dynamics. The method is demonstrated with
a hybrid system benchmark from the literature.}
}
@inproceedings{AS-RP11,
address = {Genova, Italy},
month = sep,
year = 2011,
volume = {6945},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Delzanno, Giorgio and Potapov, Igor},
acronym = {{RP}'11},
booktitle = {{P}roceedings of the 5th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'11)},
author = {Andr{\'e}, {\'E}tienne and Soulat, Romain},
title = {Synthesis of Timing Parameters Satisfying Safety Properties},
pages = {31-44},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AS-RP11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AS-RP11.pdf},
doi = {10.1007/978-3-642-24288-5_5},
abstract = {Safety properties are crucial when verifying real-time
concurrent systems. When reasoning parametrically, i.e., with unknown
constants, it is of high interest to infer a set of parameter valuations
consistent with such safety properties. We present here algorithms based
on the inverse method for parametric timed automata: given a reference
parameter valuation, it infers a constraint such that, for any valuation
satisfying this constraint, the discrete behavior of the system is the
same as under the reference valuation in terms of traces, i.e.,
alternating sequences of locations and actions. These algorithms do not
guarantee the equality of the trace sets, but are significantly quicker,
synthesize larger sets of parameter valuations than the original method,
and still preserve various properties including safety (i.e.,
non-reachability) properties. Those algorithms have been implemented in
Imitator~II and applied to various examples of asynchronous circuits and
communication protocols. }
}
@techreport{lsv-11-18,
author = {Florentin, {\'E}ric and Fribourg, Laurent and K{\"u}hne, Ulrich and
Lefebvre, St{\'e}phane and Rey, {\relax Ch}ristian},
title = {{COUPLET}: Coupled Electrothermal Simulation},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2011},
month = jun,
type = {Research Report},
number = {LSV-11-18},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2011-18.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2011-18.pdf},
note = {32~pages},
abstract = {The~aim of the project COUPLET (supported by Institut
Farman) is to study the electrothermal effects of
the degradation of the metallisation layer of power
semiconductor dies. In this first technical report
of the project, we describe our work of modeling and
simulation of the behavior of a power
transistor. The die is represented by four
elementary transistors driven by a distributed gate
signal. A~simplified electrical model is used to
simulate the transistor behavior at turn-off. The
thermal model is realized by finite elements methods
and allows to estimate the maximum temperature on
each elementary transistor. By~coupling the thermal
model with the electric simulation, it is possible
to take into account silicon and metallisation
heating in the electrical model.}
}
@inproceedings{SC-unif11,
address = {Wroc{\l}aw, Poland},
month = jul,
year = 2011,
editor = {Baader, Franz},
acronym = {{UNIF}'11},
booktitle = {{P}roceedings of the 25th {I}nternational
{W}orkshop on {U}nification
({UNIF}'11)},
author = {Ciob{\^a}c{\u{a}}, {\c{S}}tefan},
title = {Computing finite variants for subterm convergent rewrite systems},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SC-unif11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SC-unif11.pdf},
abstract = {Driven by an application in the verification of security
protocols, we introduce the strong finite variant property, an extention
of the finite variant property, and we show that subterm convergent
rewrite systems enjoy the strong finite variant property modulo the empty
equational theory.\par
We argue that the strong finite variant property is more natural and more
useful in practice than the finite variant property. We also compare the
two properties and we provide a prototype implementation of an algorithm
that computes a finite strongly complete set of variants for any term t
with respect to a subterm convergent rewrite system.}
}
@inproceedings{BMOU-atva11,
address = {Taipei, Taiwan},
month = oct,
year = {2011},
volume = 6996,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Bultan, Tevfik and Hsiung, Pao-Ann},
acronym = {{ATVA}'11},
booktitle = {{P}roceedings of the 9th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'11)},
author = {Bouyer, Patricia and Markey, Nicolas and Olschewski, J{\"o}rg
and Ummels, Michael},
title = {Measuring Permissiveness in Parity Games: Mean-Payoff
Parity Games Revisited},
pages = {135-149},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMOU-atva11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMOU-atva11.pdf},
doi = {10.1007/978-3-642-24372-1_11},
abstract = {We study nondeterministic strategies in parity games with the
aim of computing a most permissive winning strategy. Following earlier
work, we measure permissiveness in terms of the average
number{\slash}weight of transitions blocked by a strategy. Using a
translation into mean-payoff parity games, we prove that deciding (the
permissiveness~of) a~most permissive winning strategy is in
\(\textsf{NP}\cap\textsf{coNP}\). Along the way, we~provide a new study of
mean-payoff parity games. In particular, we give a new algorithm for
solving these games, which beats all previously known algorithms for this
problem.}
}
@inproceedings{CKVAK-qest11,
address = {Aachen, Germany},
month = sep,
year = 2011,
publisher = {{IEEE} Computer Society Press},
acronym = {{QEST}'11},
booktitle = {{P}roceedings of the 8th {I}nternational
{C}onference on {Q}uantitative
{E}valuation of {S}ystems
({QEST}'11)},
author = {Chadha, Rohit and Korthikranthi, Vijay and Viswanathan,
Mahesh and Agha, Gul and Kwon, Youngmin},
title = {Model Checking {MDP}s with a Unique Compact Invariant Set of
Distributions},
pages = {121-130},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CKVAK-qest11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CKVAK-qest11.pdf},
doi = {10.1109/QEST.2011.22},
abstract = {The semantics of Markov Decision Processes (MDPs), when viewed
as transformers of probability distributions, can described as a labeled
transition system over the probability distributions over the states of
the MDP. The MDP can be seen as defining a set of executions, where each
execution is a sequence of probability distributions. Reasoning about
sequences of distributions allows one to express properties not
expressible in logics like PCTL; examples include expressing bounds on
transient rewards and expected values of random variables, as well as
comparing the probability of being in one set of states at a given time
with another set of states. With respect to such a semantics, the problem
of checking that the MDP never reaches a bad distribution is undecidable.
In this paper, we identify a special class of MDPs called
\emph{semi-regular} MDPs that have a unique non-empty, compact, invariant
set of distributions, for which we show that checking any
\(\omega\)-regular property is decidable. Our decidability result also
implies that for semi-regular probabilistic finite automata with isolated
cut-points, the emptiness problem is decidable.}
}
@inproceedings{CD-mfcs11,
address = {Warsaw, Poland},
month = aug,
year = 2011,
volume = 6907,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Murlak, Filip and Sankowski, Piotr},
acronym = {{MFCS}'11},
booktitle = {{P}roceedings of the 36th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'11)},
author = {Chatterjee, Krishnendu and Doyen, Laurent},
title = {Energy and Mean-Payoff Parity {M}arkov
Decision Processes},
pages = {206-218},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-mfcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-mfcs11.pdf},
doi = {10.1007/978-3-642-22993-0_21},
abstract = {We consider Markov Decision Processes (MDPs) with mean-payoff
parity and energy parity objectives. In system design, the parity
objective is used to encode \(\omega\)-regular specifications, while the
mean-payoff and energy objectives can be used to model quantitative
resource constraints. The energy condition requires that the resource
level never drops below~\(0\), and the mean-payoff condition requires that
the limit-average value of the resource consumption is within a threshold.
While these two (energy and mean-payoff) classical conditions are
equivalent for two-player games, we~show that they differ for MDPs. We
show that the problem of deciding whether a state is almost-sure winning
(i.e., winning with probability~\(1\)) in energy parity MDPs is in
\(\textsf{NP}\cap\textsf{coNP}\), while for mean-payoff parity MDPs, the
problem is solvable in polynomial time.}
}
@inproceedings{DMS-mfcs11,
address = {Warsaw, Poland},
month = aug,
year = 2011,
volume = 6907,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Murlak, Filip and Sankowski, Piotr},
acronym = {{MFCS}'11},
booktitle = {{P}roceedings of the 36th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'11)},
author = {Doyen, Laurent and Massart, {\relax Th}ierry and
Shirmohammadi, Mahsa},
title = {Infinite Synchronizing Words for Probabilistic Automata},
pages = {278-289},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DMS-mfcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DMS-mfcs11.pdf},
doi = {10.1007/978-3-642-22993-0_27},
abstract = {Probabilistic automata are finite-state automata where the
transitions are chosen according to fixed probability distributions. We
consider a semantics where on an input word the automaton produces a
sequence of probability distributions over states. An~infinite word is
accepted if the produced sequence is synchronizing, i.e. the sequence of
the highest probability in the distributions tends to~\(1\). We show that
this semantics generalizes the classical notion of synchronizing words for
deterministic automata. We consider the emptiness problem, which asks
whether some word is accepted by a given probabilistic automaton, and the
universality problem, which asks whether all words are accepted. We
provide reductions to establish the PSPACE-completeness of the two
problems.}
}
@inproceedings{BCGZ-mfcs11,
address = {Warsaw, Poland},
month = aug,
year = 2011,
volume = 6907,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Murlak, Filip and Sankowski, Piotr},
acronym = {{MFCS}'11},
booktitle = {{P}roceedings of the 36th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'11)},
author = {Bollig, Benedikt and Cyriac, Aiswarya and Gastin, Paul and Zeitoun, Marc},
title = {Temporal Logics for Concurrent Recursive Programs: Satisfiability
and Model Checking},
pages = {132-144},
url = {http://hal.archives-ouvertes.fr/hal-00591139/en/},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCGZ-mfcs11.pdf},
doi = {10.1007/978-3-642-22993-0_15},
abstract = {We develop a general framework for the design of temporal logics
for concurrent recursive programs. A program execution is modeled as a
partial order with multiple nesting relations. To specify properties of
executions, we consider any temporal logic whose modalities are definable
in monadic second-order logic and that, in addition, allows PDL-like path
expressions. This captures, in a unifying framework, a wide range of
logics defined for trees, nested words, and Mazurkiewicz traces that have
been studied separately. We show that satisfiability and model checking
are decidable in EXPTIME and 2EXPTIME, depending on the precise path
modalities.}
}
@inproceedings{Schmitz-fsmnlp11,
address = {Blois, France},
month = jul,
year = 2011,
publisher = {ACL Press},
editor = {Maletti, Andreas},
acronym = {{FSMNLP}'11},
booktitle = {{P}roceedings of the 9th {I}nternational {W}orkshop on
{F}inite-{S}tate {M}ethods and {N}atural {L}anguage
{P}rocessing ({FSMNLP}'11)},
author = {Sylvain Schmitz},
title = {A~Note on Sequential Rule-Based {POS} Tagging},
pages = {83-87},
url = {http://hal.archives-ouvertes.fr/hal-00600260/},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Schmitz-fsmnlp11.pdf},
abstract = {Brill's part-of-speech tagger is defined through a cascade of
leftmost rewrite rules. We revisit the compilation of such rules into a
single sequential transducer given by Roche and Schabes (\textit{Comput.
Ling.}~1995) and provide a direct construction of the minimal sequential
transducer for each individual rule.}
}
@inproceedings{BS-mfcs11,
address = {Warsaw, Poland},
month = aug,
year = 2011,
volume = 6907,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Murlak, Filip and Sankowski, Piotr},
acronym = {{MFCS}'11},
booktitle = {{P}roceedings of the 36th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'11)},
author = {Blockelet, Michel and Schmitz, Sylvain},
title = {Model-Checking Coverability Graphs of Vector Addition Systems},
pages = {108-119},
url = {http://hal.archives-ouvertes.fr/hal-00600077/},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-mfcs11.pdf},
doi = {10.1007/978-3-642-22993-0_13},
abstract = {A large number of properties of a vector addition system---for
instance coverability, boundedness, or regularity---can be decided using its
coverability graph, by looking for some characteristic pattern. We propose
to unify the known exponential-space upper bounds on the complexity of
such problems on vector addition systems, by seeing them as instances of
the model-checking problem for a suitable extension of computation tree
logic, which allows to check for the existence of these patterns. This
provides new insights into what constitutes a {"}coverability-like{"}
property.}
}
@inproceedings{Sankur-mfcs11,
address = {Warsaw, Poland},
month = aug,
year = 2011,
volume = 6907,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Murlak, Filip and Sankowski, Piotr},
acronym = {{MFCS}'11},
booktitle = {{P}roceedings of the 36th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'11)},
author = {Sankur, Ocan},
title = {Untimed Language Preservation in Timed Systems},
pages = {556-567},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/OS-mfcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/OS-mfcs11.pdf},
corrigendumpdf = {http://www.lsv.fr/Publis/PAPERS/PDF/OS-mfcs11-erratum.pdf},
doi = {10.1007/978-3-642-22993-0_50},
abstract = {Timed automata are a model that is extensively used in formal
verification of real-time systems. However, their mathematical semantics
is an idealization which assumes perfectly precise clocks, but does not
correspond to real hardware. In fact, it is known that imprecisions,
however small they may be, may yield extra behaviours. Several works
concentrated on a relaxation of the semantics of timed automata to model
the imprecisions of the clocks. Algorithms were given, first for safety,
then for richer linear-time properties, to decide the robustness of timed
systems, that is, the existence of a bound on the imprecisions under which
the system satisfies a given property. In this work, we study a stronger
notion of robustness: we show how to decide whether the untimed language
of a timed automaton is preserved under small enough imprecisions, and
provide a bound on the imprecision parameter.}
}
@inproceedings{Bonnet-mfcs11,
address = {Warsaw, Poland},
month = aug,
year = 2011,
volume = 6907,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Murlak, Filip and Sankowski, Piotr},
acronym = {{MFCS}'11},
booktitle = {{P}roceedings of the 36th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'11)},
author = {Bonnet, R{\'e}mi},
title = {The reachability problem for Vector Addition Systems with one zero-test},
pages = {145-157},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/RB-mfcs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/RB-mfcs11.pdf},
doi = {10.1007/978-3-642-22993-0_16},
abstract = {We consider here a variation of Vector Addition Systems where
one counter can be tested for zero. We extend the reachability proof for
Vector Addition System recently published by Leroux to this model. This
provides an alternate, more conceptual proof of the reachability problem
that was originally proved by Reinhardt.}
}
@inproceedings{NM-sies11,
address = {V{\"a}ster{\aa}s, Sweden},
month = jun,
year = 2011,
publisher = {{IEEE} Computer Society Press},
noeditor = {},
acronym = {{SIES}'11},
booktitle = {{P}roceedings of the 6th {IEEE} {I}nternational {S}ymposium
on {I}ndustrial {E}mbedded {S}ystems ({SIES}'11)},
author = {Markey, Nicolas},
title = {Robustness in Real-time Systems},
pages = {28-34},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/NM-sies11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/NM-sies11.pdf},
doi = {10.1109/SIES.2011.5953652},
abstract = {We~review several aspects of robustness of real-time systems,
and present recent results on the robust verification of timed automata.}
}
@inproceedings{BDDHP-case11,
address = {Trieste, Italy},
month = aug,
year = 2011,
publisher = {{IEEE} Robotics \& Automation Society},
noeditor = {},
acronym = {{CASE}'11},
booktitle = {{P}roceedings of the 7th {IEEE} {C}onference on {A}utomation
{S}cience and {E}ngineering ({CASE}'11)},
author = {Ballarini, Paolo and Djafri, Hilal and Duflot, Marie and
Haddad, Serge and Pekergin, Nihal},
title = {{P}etri Nets Compositional Modeling and Verification
of Flexible Manufacturing Systems},
pages = {588-593},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDDHP-case11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDDHP-case11.pdf},
doi = {10.1109/CASE.2011.6042488},
abstract = {Flexible Manufacturing Systems (FMS) are amongst the
most studied types of systems, however due to their
increasing complexity, there is still room for
improvement in their modeling and analysis. In this
paper we consider the design and the analysis of
stochastic models of FMS in two complementary
respects. First we describe a (stochastic) Petri
Nets based compositional framework which enables to
model an FMS by combination of an arbitrary number
of basic components. Second we demonstrate how
classical transient-analysis of manufacturing
systems, including reliability and performability
analysis, can be enriched by application of a novel,
sophisticated stochastic logic, namely the Hybrid
Automata Stochastic Logic (HASL). We demonstrate the
proposed methodology on an FMS example.}
}
@inproceedings{BDDHP-qest11,
address = {Aachen, Germany},
month = sep,
year = 2011,
publisher = {{IEEE} Computer Society Press},
acronym = {{QEST}'11},
booktitle = {{P}roceedings of the 8th {I}nternational
{C}onference on {Q}uantitative
{E}valuation of {S}ystems
({QEST}'11)},
author = {Ballarini, Paolo and Djafri, Hilal and Duflot, Marie and
Haddad, Serge and Pekergin, Nihal},
title = {{COSMOS}: a~Statistical Model Checker for the
Hybrid Automata Stochastic Logic},
pages = {143-144},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDDHP-qest11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDDHP-qest11.pdf},
doi = {10.1109/QEST.2011.24},
abstract = {This tool paper introduces COSMOS, a statistical model
checker for the Hybrid Automata Stochastic Logic
(HASL). HASL employs Linear Hybrid Automata (LHA), a
generalization of Deterministic Timed Automata
(DTA), to describe accepting execution paths of a
Discrete Event Stochastic Process (DESP), a class of
stochastic models which includes, but is not limited
to, Markov chains. As a result HASL verification
turns out to be a unifying framework where
sophisticated temporal reasoning is naturally
blended with elaborate reward-based analysis. COSMOS
takes as input a DESP (described in terms of a
Generalized Stochastic Petri Net), an LHA and an
expression~\(Z\) representing the quantity to be
estimated. It returns a confidence interval
estimation of~\(Z\). COSMOS is written in C++ and is
freely available to the research community.}
}
@article{BFH-ijpe11,
publisher = {RAMS Consultants},
journal = {International Journal of Performability Engineering},
author = {Beccuti, Marco and Franceschinis, Giuliana and Haddad, Serge},
title = {{MDWN}solver: A~Framework to Design and Solve {M}arkov Decision {P}etri Nets},
year = {2011},
month = sep,
volume = 7,
number = 5,
pages = {417-428},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFH-ijpe11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFH-ijpe11.pdf},
abstract = {MDWNsolver is a framework for system modeling and optimization
of performability measures based on Markov Decision Petri Net (MDPN) and
Markov Decision Well-formed Net (MDWN) formalisms, two Petri Net
extensions for high level specification of Markov Decision Processes
(MDP). It is integrated in the GreatSPN suite which provides a GUI to
design MDPN/MDWN models. From the analysis point of view, MDWNsolver uses
efficient algorithms that take advantage of system symmetries, thus
reducing the analysis complexity. In this paper the MDWNsolver framework
features and architecture are presented, and some application examples are
discussed.}
}
@inproceedings{UW-concur11,
address = {Aachen, Germany},
month = sep,
year = 2011,
volume = 6901,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Katoen, Joost-Pieter and K{\"o}nig, Barbara},
acronym = {{CONCUR}'11},
booktitle = {{P}roceedings of the 22nd
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'11)},
author = {Ummels, Michael and Wojtczak, Dominik},
title = {The Complexity of {N}ash Equilibria in Limit-Average Games},
pages = {482-496},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/UW-concur11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/UW-concur11.pdf},
doi = {10.1007/978-3-642-23217-6_32},
abstract = {We study the computational complexity of Nash equilibria in
concurrent games with limit-average objectives. In particular, we prove
that the existence of a Nash equilibrium in randomised strategies is
undecidable, while the existence of a Nash equilibrium in pure strategies
is decidable, even if we put a constraint on the payoff of the
equilibrium. Our undecidability result holds even for a restricted class
of concurrent games, where nonzero rewards occur only on terminal states.
Moreover, we show that the constrained existence problem is undecidable
not only for concurrent games but for turn-based games with the same
restriction on rewards. Finally, we prove that the constrained existence
problem for Nash equilibria in (pure or randomised) stationary strategies
is decidable and analyse its complexity.}
}
@inproceedings{Bol-concur11,
address = {Aachen, Germany},
month = sep,
year = 2011,
volume = 6901,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Katoen, Joost-Pieter and K{\"o}nig, Barbara},
acronym = {{CONCUR}'11},
booktitle = {{P}roceedings of the 22nd
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'11)},
author = {Bollig, Benedikt},
title = {An automaton over data words that captures {EMSO} logic},
pages = {171-186},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/B-concur11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/B-concur11.pdf},
doi = {10.1007/978-3-642-23217-6_12},
abstract = {We develop a general framework for the specification and
implementation of systems whose executions are words, or partial orders,
over an infinite alphabet. As a model of an implementation, we introduce
class register automata, a one-way automata model over words with multiple
data values. Our model combines register automata and class memory
automata. It has natural interpretations. In particular, it captures
communicating automata with an unbounded number of processes, whose
semantics can be described as a set of (dynamic) message sequence charts.
On the specification side, we provide a local existential monadic
second-order logic that does not impose any restriction on the number of
variables. We study the realizability problem and show that every formula
from that logic can be effectively, and in elementary time, translated
into an equivalent class register automaton.}
}
@inproceedings{RSB-concur11,
address = {Aachen, Germany},
month = sep,
year = 2011,
volume = 6901,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Katoen, Joost-Pieter and K{\"o}nig, Barbara},
acronym = {{CONCUR}'11},
booktitle = {{P}roceedings of the 22nd
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'11)},
author = {Rodr{\'\i}guez, C{\'e}sar and Schwoon, Stefan and Baldan, Paolo},
title = {Efficient contextual unfolding},
pages = {342-357},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/RSB-concur11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/RSB-concur11.pdf},
doi = {10.1007/978-3-642-23217-6_23},
abstract = {A~contextual net is a Petri net extended with read arcs, which
allow transitions to check for tokens without consuming them. Contextual
nets allow for better modelling of concurrent read access than Petri nets,
and their unfoldings can be exponentially more compact than those of a
corresponding Petri net. A~constructive but abstract procedure for
generating those unfoldings was proposed in earlier work; however, no
concrete implementation existed. Here, we~close this gap providing two
concrete methods for computing contextual unfoldings, with a view to
efficiency. We report on experiments carried out on a number of
benchmarks. These show that not only are contextual unfoldings more
compact than Petri net unfoldings, but they can be computed with the same
or better efficiency, in~particular with respect to the place-replication
encoding of contextual nets into Petri nets.}
}
@inproceedings{BLMST-concur11,
address = {Aachen, Germany},
month = sep,
year = 2011,
volume = 6901,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Katoen, Joost-Pieter and K{\"o}nig, Barbara},
acronym = {{CONCUR}'11},
booktitle = {{P}roceedings of the 22nd
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'11)},
author = {Bouyer, Patricia and Larsen, Kim~G. and Markey, Nicolas and
Sankur, Ocan and Thrane, Claus},
title = {Timed automata can always be made implementable},
pages = {76-91},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BLMST-concur11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BLMST-concur11.pdf},
doi = {10.1007/978-3-642-23217-6_6},
abstract = {Timed automata follow a mathematical semantics, which
assumes perfect precision and synchrony of
clocks. Since this hypothesis does not hold in
digital systems, properties proven formally on a
timed automaton may be lost at implementation. In
order to ensure implementability, several approaches
have been considered, corresponding to different
hypotheses on the implementation platform. We
address two of these: a~timed automaton is samplable
if its semantics is preserved under a discretization
of time; it is robust if its semantics is preserved
when all timing constraints are relaxed by some
small positive parameter. We propose a construction
which makes timed automata implementable in the
above sense: From any timed automaton~\(\mathcal{A}\),
we build a timed automaton~\(\mathcal{A}'\) that
exhibits the same behaviour as~\(\mathcal{A}\), and
moreover is both robust and samplable by
construction.}
}
@article{DDG-jlc11,
publisher = {Oxford University Press},
journal = {Journal of Logic and Computation},
author = {Demri, St{\'e}phane and D'Souza, Deepak and Gascon, R{\'e}gis},
title = {Temporal Logics of Repeating Values},
year = {2012},
month = oct,
volume = 22,
number = 5,
pages = {1059-1096},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DDG-jlc11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DDG-jlc11.pdf},
doi = {10.1093/logcom/exr013},
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 that suggests such a
restricted use of the freeze operator. We show decidability of finitary
and infinitary satisfiability by reduction into the verification of
temporal properties in Petri nets by proposing a symbolic representation
of models. This is a quite surprising result in view of the expressive
power of the logic 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
also contains developments about the relationships between temporal logics
with the freeze operator and counter automata as well as reductions into
first-order logics over data words.}
}
@inproceedings{BBBS-icalp11,
address = {Z{\"u}rich, Switzerland},
month = jul,
year = 2011,
volume = 6756,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Aceto, Luca and Henzinger, Monika and Sgall, Jir{\'\i}},
acronym = {{ICALP}'11},
booktitle = {{P}roceedings of the 38th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'11)~-- {P}art~{II}},
author = {Bertrand, Nathalie and Bouyer, Patricia and Brihaye, {\relax
Th}omas and Stainer, Am{\'e}lie},
title = {Emptiness and Universality Problems in Timed Automata with Positive Frequency},
pages = {246-257},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBBS-icalp11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBBS-icalp11.pdf},
doi = {10.1007/978-3-642-22012-8_19},
abstract = {The languages of infinite timed words accepted by timed automata
are traditionally dened using B{\"u}chi-like conditions. These acceptance
conditions focus on the set of locations visited infinitely often along a
run, but completely ignore quantitative timing aspects. In this paper we
propose a natural quantitative semantics for timed automata based on the
so-called frequency, which measures the proportion of time spent in the
accepting locations. We study various properties of timed languages
accepted with positive frequency, and in particular the emptiness and
universality problems.}
}
@inproceedings{BDGORW-icalp11,
address = {Z{\"u}rich, Switzerland},
month = jul,
year = 2011,
volume = 6756,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Aceto, Luca and Henzinger, Monika and Sgall, Jir{\'\i}},
acronym = {{ICALP}'11},
booktitle = {{P}roceedings of the 38th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'11)~-- {P}art~{II}},
author = {Brihaye, {\relax Th}omas and Doyen, Laurent and Geeraerts,
Gilles and Ouaknine, Jo{\"e}l and Raskin, Jean-Fran{\c{c}}ois
and Worrell, James},
title = {On~Reachability for Hybrid Automata over Bounded Time},
pages = {416-427},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDGORW-icalp11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDGORW-icalp11.pdf},
doi = {10.1007/978-3-642-22012-8_33},
abstract = {This paper investigates the time-bounded version of the
reachability problem for hybrid automata. This problem asks whether a
given hybrid automaton can reach a given target location
within~\(\mathbf{T}\) time units, where \(\mathbf{T}\) is a constant
rational value. We show that, in contrast to the classical (unbounded)
reachability problem, the timed-bounded version is decidable for
rectangular hybrid automata provided only non-negative rates are allowed.
This class of systems is of practical interest and subsumes, among others,
the class of stopwatch automata. We also show that the problem becomes
undecidable if either diagonal constraints or both negative and positive
rates are allowed.}
}
@inproceedings{BCS-icalp11,
address = {Z{\"u}rich, Switzerland},
month = jul,
year = 2011,
volume = 6756,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Aceto, Luca and Henzinger, Monika and Sgall, Jir{\'\i}},
acronym = {{ICALP}'11},
booktitle = {{P}roceedings of the 38th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'11)~-- {P}art~{II}},
author = {B{\'a}r{\'a}ny, Vince and ten~Cate, Balder and Segoufin, Luc},
title = {Guarded negation},
pages = {356-367},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCS-icalp11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCS-icalp11.pdf},
doi = {10.1007/978-3-642-22012-8_28},
abstract = {We consider restrictions of first-order logic and of fixpoint
logic in which all occurrences of negation are required to be guarded by
an atomic predicate. In terms of expressive power, the logics in
question, called GNFO and GNFP, extend the guarded fragment of first-order
logic and guarded least fixpoint logic, respectively. They also extend the
recently introduced unary negation fragments of first-order logic and of
least fixpoint logic.\par
We show that the satisfiability problem for GNFO and for GNFP is
2ExpTime-complete, both on arbitrary structures and on finite structures.
We also study the complexity of the associated model checking problems.
Finally, we show that GNFO and GNFP are not only computationally well
behaved, but also model theoretically: we show that GNFO and GNFP have the
tree-like model property and that GNFO has the finite model property, and
we characterize the expressive power of GNFO in terms of invariance for an
appropriate notion of bisimulation.}
}
@inproceedings{SS-icalp11,
address = {Z{\"u}rich, Switzerland},
month = jul,
year = 2011,
volume = 6756,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Aceto, Luca and Henzinger, Monika and Sgall, Jir{\'\i}},
acronym = {{ICALP}'11},
booktitle = {{P}roceedings of the 38th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'11)~-- {P}art~{II}},
author = {Schmitz, Sylvain and Schnoebelen, {\relax Ph}ilippe},
title = {Multiply-Recursive Upper Bounds with {H}igman's Lemma},
pages = {441-452},
url = {http://arxiv.org/abs/1103.4399},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SS-icalp11.pdf},
doi = {10.1007/978-3-642-22012-8_35},
abstract = {We develop a new analysis for the length of controlled
bad sequences in well-quasi-orderings based on
Higman's Lemma. This leads to tight
multiply-recursive upper bounds that readily apply
to several verification algorithms for
well-structured systems.}
}
@inproceedings{AMSS-icalp11,
address = {Z{\"u}rich, Switzerland},
month = jul,
year = 2011,
volume = 6756,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Aceto, Luca and Henzinger, Monika and Sgall, Jir{\'\i}},
acronym = {{ICALP}'11},
booktitle = {{P}roceedings of the 38th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'11)~-- {P}art~{II}},
author = {Anderson, Matthew and van~Melkebeek, Dieter and Schweikardt,
Nicole and Segoufin, Luc},
title = {Locality of queries definable in invariant first-order logic
with arbitrary built-in predicates},
pages = {368-379},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AMSS-icalp11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AMSS-icalp11.pdf},
doi = {10.1007/978-3-642-22012-8_29},
abstract = {We consider first-order formulas over relational structures
which may use arbitrary numerical predicates. We require that the validity
of the formula is independent of the particular interpretation of the
numerical predicates and refer to such formulas as Arb-invariant
first-order.\par
Our main result shows a Gaifman locality theorem: two tuples of a
structure with n elements, having the same neighborhood up to distance
\((\log n)^{\omega(1)}\), cannot be distinguished by Arb-invariant
first-order formulas. When restricting attention to word structures, we
can achieve the same quantitative strength for Hanf locality. In both
cases we show that our bounds are tight.\par
Our proof exploits the close connection between Arb-invariant first-order
formulas and the complexity class \(\textsf{AC}^{0}\), and hinges on the
tight lower bounds for parity on constant-depth circuits.}
}
@techreport{rr-lsv-11-08,
author = {Bollig, Benedikt and Gastin, Paul and Monmege, Benjamin and
Zeitoun, Marc},
title = {Weighted Expressions and {DFS} Tree Automata},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2011},
month = apr,
type = {Research Report},
number = {LSV-11-08},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2011-08.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2011-08.pdf},
note = {32~pages},
abstract = {We introduce weighted expressions, a~calculus to express
quantitative properties over unranked trees. They involve products and
sums from a semiring as well as classical boolean formulas. We~show that
weighted expressions are expressively equivalent to a new class of
weighted tree-walking automata. This new automata model is equipped with
pebbles, and follows a depth-first-search policy in the tree.}
}
@article{BS-lmcs10,
journal = {Logical Methods in Computer Science},
author = {Boja{\'n}czyk, Miko{\l}aj and Segoufin, Luc},
title = {Tree Languages Defined in First-Order Logic with One Quantifier Alternation},
volume = 6,
number = {4:1},
nopages = {},
month = oct,
year = 2010,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-lmcs10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-lmcs10.pdf},
doi = {10.2168/LMCS-6(4:1)2010},
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^{*}\). For the quantifier free part we
consider two signatures, either the descendant relation alone or together
with the lexicographical order relation on nodes. We provide an effective
characterization of tree and forest 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{benzina-iccans11,
address = {Republic of Maldives},
month = may,
year = 2011,
noeditor = {},
acronym = {{ICCANS}'11},
booktitle = {{P}roceedings of the {I}nternational {C}onference on {C}omputer {A}pplications
and {N}etwork {S}ecurity ({ICCANS}'11)},
author = {Benzina, Hedi},
title = {Logic in Virtualized Systems},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/benzina-iccans11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/benzina-iccans11.pdf},
abstract = {As virtualized systems grow in complexity, they are
increasingly vulnerable to denial-of-service (DoS)
attacks involving resource exhaustion. A malicious
driver downloaded and installed by the system
administrator can trigger high-complexity behavior
exhausting CPU time or stack space and making the
whole system unavailable. Virtualized systems such
as Xen or VirtualBox have been proposed to increase
the level of security on computers. On the other
hand, such virtualized systems are now targets for
attacks. The weak spot of such systems is domain
zero administration, which is left entirely under
the administrator's responsibility, and is in
particular vulnerable to attacks. \par
We propose to let
the administrator write and deploy security policies
and rely on RuleGen, a policy compiler, and Orchids'
fast, real-time monitoring engine to raise alerts in
case any policy violation, expressed in a fragment
of linear temporal logic, is detected. This approach
has shown its efficiency against real DoS exploits.
}
}
@phdthesis{markey-HDR11,
author = {Markey, Nicolas},
title = {Verification of Embedded Systems -- Algorithms and Complexity},
year = 2011,
month = apr,
type = {M{\'e}moire d'habilitation},
school = {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hdr-nm.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hdr-nm.pdf}
}
@incollection{CDM-fmtasp11,
author = {Comon{-}Lundh, Hubert and Delaune, St{\'e}phanie and Millen, Jonathan K.},
title = {Constraint solving techniques and enriching the model with
equational theories},
booktitle = {Formal Models and Techniques for Analyzing Security Protocols},
editor = {Cortier, V{\'e}ronique and Kremer, Steve},
series = {Cryptology and Information Security Series},
volume = 5,
publisher = {{IOS} Press},
nochapter = {},
pages = {35-61},
year = 2011,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDM-fmtasp11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDM-fmtasp11.pdf},
abstract = {Derivability constraints represent in a symbolic way the
infinite set of possible executions of a finite protocol, in presence of
an arbitrary active attacker. Solving a derivability constraint consists
in computing a simplified representation of such executions, which is
amenable to the verification of any (trace) security property. Our goal is
to explain this method on a non-trivial combination of primitives.\par
In this chapter we explain how to model the protocol executions using
derivability constraints, and how such constraints are interpreted,
depending on the cryptographic primitives and the assumed attacker
capabilities. Such capabilities are represented as a deduction system that
has some specific properties. We choose as an example the combination of
exclusive-or, symmetric encryption{\slash}decryption and pairing{\slash}unpairing. We
explain the properties of the deduction system in this case and give a
complete and terminating set of rules that solves derivability
constraints. A similar set of rules has been already published for the
classical Dolev-Yao attacker, but it is a new result for the combination
of primitives that we consider. This allows to decide trace security
properties for this combination of primitives and arbitrary finite
protocols.}
}
@inproceedings{ACD-cade11,
address = {Wroc{\l}aw, Poland},
month = jul,
year = 2011,
volume = {6803},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Bj{\o}rner, Nikolaj and Sofronie-Stokkermans, Viorica},
acronym = {{CADE}'11},
booktitle = {{P}roceedings of the 23rd {I}nternational
{C}onference on {A}utomated {D}eduction
({CADE}'11)},
author = {Arnaud, Mathilde and Cortier, V{\'e}ronique and Delaune,
St{\'e}phanie},
title = {Deciding security for protocols with recursive tests},
pages = {49-63},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ACD-cade11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACD-cade11.pdf},
doi = {10.1007/978-3-642-22438-6_6},
abstract = {Security protocols aim at securing communications over public
networks. Their design is notoriously dicult and error-prone. Formal
methods have shown their usefulness for providing a careful security
analysis in the case of standard authentication and condentiality
protocols. However, most current techniques do not apply to protocols that
perform recursive computation e.g. on a list of messages received from the
network.\par
While considering general recursive input{\slash}output actions very quickly
yields undecidability, we focus on protocols that perform recursive tests
on received messages but output messages that depend on the inputs in a
standard way. This is in particular the case of secured routing protocols,
distributed right delegation or PKI certication paths. We provide NPTIME
decision procedures for protocols with recursive tests and for a bounded
number of sessions. We also revisit constraint system solving, providing a
complete symbolic representation of the attacker knowledge.}
}
@inproceedings{KSW-csf11,
address = {Cernay-la-Ville, France},
month = jun,
year = 2011,
publisher = {{IEEE} Computer Society Press},
acronym = {{CSF}'11},
booktitle = {{P}roceedings of the
24th {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'11)},
author = {Kremer, Steve and Steel, Graham and Warinschi, Bogdan},
title = {Security for Key Management Interfaces},
pages = {266-280},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KSW-csf11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KSW-csf11.pdf},
nolongps = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PS/
rr-lsv-2011-07.ps},
nolongpsgz = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PSGZ/
rr-lsv-2011-07.ps.gz},
doi = {10.1109/CSF.2011.25},
abstract = {We propose a much-needed formal definition of security
for cryptographic key management APIs. The
advantages of our definition are that it is general,
intuitive, and applicable to security proofs in both
symbolic and computational models of
cryptography. Our definition relies on an idealized
API which allows only the most essential functions
for generating, exporting and importing keys, and
takes into account dynamic corruption of keys.
Based on this we can define the security of more
expressive APIs which support richer
functionality. We illustrate our approach by showing
the security of APIs both in symbolic and
computational models.}
}
@inproceedings{DKRS-csf11,
address = {Cernay-la-Ville, France},
month = jun,
year = 2011,
publisher = {{IEEE} Computer Society Press},
acronym = {{CSF}'11},
booktitle = {{P}roceedings of the
24th {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'11)},
author = {Delaune, St{\'e}phanie and Kremer, Steve and Ryan, Mark D. and
Steel, Graham},
title = {Formal analysis of protocols based on {TPM} state registers},
pages = {66-82},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DKRS-csf11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DKRS-csf11.pdf},
doi = {10.1109/CSF.2011.12},
abstract = {We~present a Horn-clause-based framework for analysing security
protocols that use platform configuration registers~(PCRs), which are
registers for maintaining state inside the Trusted Platform Module~(TPM).
In~our model, the~PCR state space is unbounded, and our experience shows
that a na{\"i}ve analysis using ProVerif or SPASS does not terminate. To
address this, we extract a set of instances of the Horn clauses of our
model, for which ProVerif does terminate on our examples. We~prove the
soundness of this extraction process: no~attacks are lost, that~is, any
query derivable in the more general set of clauses is also derivable from
the extracted instances. The~effectiveness of our framework is
demonstrated in two case studies: a~simplified version of Microsoft
Bitlocker, and a digital envelope protocol that allows a user to choose
whether to perform a decryption, or to verifiably renounce the ability to
perform the decryption.}
}
@techreport{rr-lsv-11-04,
author = {Fribourg, Laurent and K{\"u}hne, Ulrich},
title = {Parametric Verification of Hybrid Automata Using the Inverse Method},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2011},
month = mar,
type = {Research Report},
number = {LSV-11-04},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2011-04.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2011-04.pdf},
note = {25~pages},
abstract = {Hybrid systems combine continuous and discrete behavior. Hybrid
Automata are a powerful formalism for the modeling and verification of
such systems. A~common problem in hybrid system verification is the good
parameters problem, which consists in identifying a subset of parameters
which guarantee a certain behavior of a system. Recently, a method has
been presented for attacking this problem for Timed Automata. In this
report, we show the extension of this methodology for hybrid automata with
linear and affine dynamics. The method is demonstrated with a distributed
temperature control system and several other hybrid system benchmarks from
the literature.}
}
@inproceedings{CLC-stacs11,
address = {Dortmund, Germany},
month = mar,
year = 2011,
volume = 9,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {D{\"u}rr, Christoph and Schwentick, {\relax Th}omas},
acronym = {{STACS}'11},
booktitle = {{P}roceedings of the 28th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'11)},
author = {Comon{-}Lundh, Hubert and Cortier, V{\'e}ronique},
title = {How to prove security of communication protocols?
A~discussion on the soundness of formal models w.r.t. computational ones},
pages = {29-44},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CLC-stacs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CLC-stacs11.pdf},
doi = {10.4230/LIPIcs.STACS.2011.29},
abstract = {Security protocols are short programs that aim at
securing communication over a public network. Their
design is known to be error-prone with flaws found
years later. That is why they deserve a careful
security analysis, with rigorous proofs. Two main
lines of research have been (independently)
developed to analyse the security of protocols. On
the one hand, formal methods provide with symbolic
models and often automatic proofs. On the other
hand, cryptographic models propose a tighter
modeling but proofs are more difficult to write and
to check. An approach developed during the last
decade consists in bridging the two approaches,
showing that symbolic models are sound
w.r.t. symbolic ones, yielding strong security
guarantees using automatic tools. These results have
been developed for several cryptographic primitives
(e.g. symmetric and asymmetric encryption,
signatures, hash) and security properties. While
proving soundness of symbolic models is a very
promising approach, several technical details are
often not satisfactory. Focusing on symmetric
encryption, we describe the difficulties and
limitations of the available results.}
}
@inproceedings{CS-stacs11,
address = {Dortmund, Germany},
month = mar,
year = 2011,
volume = 9,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {D{\"u}rr, Christoph and Schwentick, {\relax Th}omas},
acronym = {{STACS}'11},
booktitle = {{P}roceedings of the 28th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'11)},
author = {ten~Cate, Balder and Segoufin, Luc},
title = {Unary negation},
pages = {344-355},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-stacs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-stacs11.pdf},
doi = {10.4230/LIPIcs.STACS.2011.344},
abstract = {We study fragments of first-order logic and of least fixed point
logic that allow only unary negation: negation of formulas with at most
one free variable. These logics generalize many interesting known
formalisms, including modal logic and the \(\mu\)-calculus, as well as
conjunctive queries and monadic Datalog. We show that satisfiability and
finite satisfiability are decidable for both fragments, and we pinpoint
the complexity of satisfiability, finite satisfiability, and model
checking. We also show that the unary negation fragment of first-order
logic is model-theoretically very well behaved. In particular, it enjoys
Craig interpolation and the Beth property.}
}
@inproceedings{ST-stacs11,
address = {Dortmund, Germany},
month = mar,
year = 2011,
volume = 9,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {D{\"u}rr, Christoph and Schwentick, {\relax Th}omas},
acronym = {{STACS}'11},
booktitle = {{P}roceedings of the 28th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'11)},
author = {Segoufin, Luc and Toru{\'n}czyk, Szymon},
title = {Automata based verification over linearly ordered data domains},
pages = {81-92},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ST-stacs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ST-stacs11.pdf},
doi = {10.4230/LIPIcs.STACS.2011.81},
abstract = {In this paper we work over linearly ordered data domains
equipped with finitely many unary predicates and constants. We consider
nondeterministic automata processing words and storing finitely many
variables ranging over the domain. During a transition, these automata can
compare the data values of the current configuration with those of the
previous configuration using the linear order, the unary predicates and
the constants.\par
We show that emptiness for such automata is decidable, both over finite
and infinite words, under reasonable computability assumptions on the
linear order.\par
Finally, we show how our automata model can be used for verifying
properties of workflow specifications in the presence of an underlying
database.}
}
@article{LS-jcss11,
publisher = {Elsevier Science Publishers},
journal = {Journal of Computer and System Sciences},
author = {Libkin, Leonid and Sirangelo, Cristina},
title = {Data exchange and schema mappings in open and closed worlds},
year = {2011},
month = may,
volume = {77},
number = {3},
pages = {542-571},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-jcss11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-jcss11.pdf},
doi = {10.1016/j.jcss.2010.04.010}
}
@article{BLPS-jacm10,
publisher = {ACM Press},
journal = {Journal of the~{ACM}},
author = {Barcel{\'o}, Pablo and Libkin, Leonid and
Poggi, Antonella and Sirangelo, Cristina},
title = {{XML} with incomplete information},
volume = {58},
number = {1},
year = {2010},
month = dec,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BLPS-jacm10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BLPS-jacm10.pdf},
doi = {10.1145/1870103.1870107}
}
@phdthesis{kremer-HDR11,
author = {Kremer, Steve},
title = {Modelling and analyzing security protocols in cryptographic process calculi},
year = 2011,
month = mar,
type = {M{\'e}moire d'habilitation},
school = {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hdr-SK.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hdr-SK.pdf},
noslides = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/SLIDES/}
}
@phdthesis{steel-HDR11,
author = {Steel, Graham},
title = {Formal Analysis of Security {API}s},
year = 2011,
month = mar,
type = {M{\'e}moire d'habilitation},
school = {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hdr-GS.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hdr-GS.pdf},
noslides = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/SLIDES/}
}
@phdthesis{delaune-HDR11,
author = {Delaune, St{\'e}phanie},
title = {Verification of security protocols: from confidentiality to privacy},
year = 2011,
month = mar,
type = {M{\'e}moire d'habilitation},
school = {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hdr-SD.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hdr-SD.pdf},
abstract = {Security is a very old concern, which until quite recently was
mostly of interest for military purposes. The deployment of electronic
commerce changes this drastically. The security of exchanges is ensured by
cryptographic protocols which are notoriously error prone. The formal
verification of cryptographic protocols is a difficult problem that can be
seen as a particular model-checking problem in an hostile environment.
Many results and tools have been developed to automatically verify
cryptographic protocols.\par
Recently, new type of applications have emerged, in order to face new
technological and societal challenges, e.g. electronic voting protocols,
secure routing protocols for mobile ad hoc networks,~... These
applications involve some features that are not taken into account by the
existing verification tools, e.g. complex cryptographic primitives,
privacy-type security properties,~... This prevents us from modelling
these protocols in an accurate way. Moreover, protocols are often analysed
in isolation and this is well-known to be not sufficient. In this thesis,
we use formal methods to study these aspects concerning the verification
of cryptographic protocols.}
}
@inproceedings{pas-icdt11,
address = {Uppsala, Sweden},
month = mar,
year = 2011,
publisher = {ACM Press},
editor = {Milo, Tova},
acronym = {{ICDT}'11},
booktitle = {{P}roceedings of the 14th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'11)},
author = {Pasail{\u{a}}, Daniel},
title = {Conjunctive queries determinacy and rewriting},
pages = {220-231},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/pasaila-icdt11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/pasaila-icdt11.pdf},
doi = {10.1145/1938551.1938580}
}
@inproceedings{BCH-acsd11,
address = {Newcastle upon Tyne, UK},
month = jun,
year = 2011,
publisher = {{IEEE} Computer Society Press},
editor = {Caillaud, Beno{\^\i}t and Carmona, Josep},
acronym = {{ACSD}'11},
booktitle = {{P}roceedings of the 11th {I}nternational
{C}onference on {A}pplication of {C}oncurrency
to {S}ystem {D}esign
({ACSD}'11)},
author = {Balaguer, Sandie and Chatain, {\relax Th}omas and Haar, Stefan},
title = {Building Tight Occurrence Nets from Reveals Relations},
pages = {44-53},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCH-acsd11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCH-acsd11.pdf},
doi = {10.1109/ACSD.2011.16},
abstract = {Occurrence nets are a well known partial order model for the
concurrent behavior of Petri nets. The causality and conflict relations
between events, which are explicitly represented in occurrence nets,
induce logical dependencies between event occurrences: the occurrence of
an event~\(e\) in a run implies that all its causal predecessors also
occur, and that no event in conflict with \(e\) occurs. But these
structural relations do not express all the logical dependencies between
event occurrences in maximal runs: in particular, the occurrence of~\(e\)
in any maximal run may imply the occurrence of another event that is not a
causal predecessor of~\(e\), in that run. The \emph{reveals} relation has
been introduced in~[Haar, IEEE TAC 55(10):2310-2320, 2010] to express this
dependency between two events. Here we generalize the reveals relation to
express more general dependencies, involving more than two events, and we
introduce ERL logic to express them as boolean formulas. Finally we answer
the synthesis problem that arises: given an ERL formula~\(\varphi\), is
there an occurrence net~\(\mathcal{N}\) such that \(\varphi\) describes
exactly the dependencies between the events of~\(\mathcal{N}\)?}
}
@inproceedings{HMN-atpn11,
address = {Newcastle upon Tyne, UK},
month = jun,
year = 2011,
volume = {6709},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Kristensen, Lars M. and Petrucci, Laure},
acronym = {{PETRI~NETS}'11},
booktitle = {{P}roceedings of the 32nd
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'11)},
author = {Haddad, Serge and Mairesse, Jean and Nguyen, Hoang-Thach},
title = {Synthesis and Analysis of Product-form {P}etri Nets},
pages = {288-307},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HMN-atpn11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HMN-atpn11.pdf},
doi = {10.1007/978-3-642-21834-7_16},
abstract = {For a large Markovian model, a {"}product form{"} is an explicit
description of the steady-state behaviour which is otherwise generally
untractable. Being first introduced in queueing networks, it has been
adapted to Markovian Petri nets. Here we address three relevant issues for
product-form Petri nets which were left fully or partially open:
(1)~we~provide a sound and complete set of rules for the synthesis;
(2)~we~characterise the exact complexity of classical problems like
reachability; (3)~we~introduce a new subclass for which the normalising
constant (a crucial value for product-form expression) can be efficiently
computed.}
}
@inproceedings{CFS-atpn2011,
address = {Newcastle upon Tyne, UK},
month = jun,
year = 2011,
volume = {6709},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Kristensen, Lars M. and Petrucci, Laure},
acronym = {{PETRI~NETS}'11},
booktitle = {{P}roceedings of the 32nd
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'11)},
author = {Chambart, Pierre and Finkel, Alain and Schmitz, Sylvain},
title = {Forward Analysis and Model Checking for Trace Bounded {WSTS}},
nopages = {49-68},
url = {http://arxiv.org/abs/1004.2802},
doi = {10.1007/978-3-642-21834-7_4},
abstract = {We investigate a subclass of well-structured transition
systems~(WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans.
AMS 1964)---complete deterministic ones, which we claim provide an
adequate basis for the study of forward analyses as developed by Finkel
and Goubault-Larrecq (ICALP~2009). Indeed, we prove that, unlike other
conditions considered previously for the termination of forward analysis,
boundedness is decidable. Boundedness turns out to be a valuable
restriction for WSTS verification, as we show that it further allows to
decide all \(\omega\)-regular properties on the set of infinite traces of
the system.}
}
@inproceedings{ACGP-rsa11,
address = {San Francisco, California, USA},
month = feb,
year = 2011,
volume = 6558,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Kiayias, Aggelos},
acronym = {{CT-RSA}'11},
booktitle = {{P}roceedings of the {C}ryptographers' {T}rack at the {RSA}
{C}onference 2011 ({CT-RSA}'11)},
author = {Abdalla, Michel and Chevalier, C{\'e}line and Granboulan, Louis and
Pointcheval, David},
title = {Contributory Password-Authenticated Group Key Exchange with
Join Capability},
pages = {142-160},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ACGP-rsa11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACGP-rsa11.pdf},
doi = {10.1007/978-3-642-19074-2_11},
abstract = {Password-based authenticated group key exchange allows any group
of users in possession of a low-entropy secret key to establish a common
session key even in the presence of adversaries. In this paper, we propose
a new generic construction of password-authenticated group key exchange
protocol from any two-party password-authenticated key exchange with
explicit authentication. Our new construction has several advantages when
compared to existing solutions. First, our construction only assumes a
common reference string and does not rely on any idealized models. Second,
our scheme enjoys a simple and intuitive security proof in the universally
composable framework and is optimal in the sense that it allows at most
one password test per user instance. Third, our scheme also achieves a
strong notion of security against insiders in that the adversary cannot
bias the distribution of the session key as long as one of the players
involved in the protocol is honest. Finally, we show how to easily extend
our protocol to the dynamic case in a way that the costs of establishing a
common key between two existing groups is significantly smaller than
computing a common key from scratch.}
}
@inproceedings{FFSS-lics2011,
address = {Toronto, Canada},
month = jun,
year = 2011,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'11},
booktitle = {{P}roceedings of the 26th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'11)},
author = {Figueira, Diego and Figueira, Santiago and Schmitz, Sylvain and
Schnoebelen, {\relax Ph}ilippe},
title = {{A}ckermannian and Primitive-Recursive Bounds with {D}ickson's Lemma},
pages = {269-278},
url = {http://arxiv.org/abs/1007.2989},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FFSS-lics11.pdf},
doi = {10.1109/LICS.2011.39},
abstract = {Dickson's Lemma is a simple yet powerful tool widely used in
decidability proofs, especially when dealing with counters or related data
structures in algorithmics, verification and model-checking, constraint
solving, logic, etc. While Dickson's Lemma is well-known, most computer
scientists are not aware of the complexity upper bounds that are entailed
by its use. This is mainly because, on this issue, the existing literature
is not very accessible.\par
We propose a new analysis of the length of bad sequences over
\((\mathbb{N}^{k},\leq)\), improving on earlier results and providing
upper bounds that are essentially tight. This analysis is complemented by
a {"}user guide{"} explaining through practical examples how to easily
derive complexity upper bounds from Dickson's Lemma.}
}
@inproceedings{GLV-lics2011,
address = {Toronto, Canada},
month = jun,
year = 2011,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'11},
booktitle = {{P}roceedings of the 26th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'11)},
author = {Goubault{-}Larrecq, Jean and Varacca, Daniele},
title = {Continuous Random Variables},
pages = {97-106},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GLV-lics2011.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GLV-lics2011.pdf},
corrigendumpdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GLV-lics2011-errata.pdf},
doi = {10.1109/LICS.2011.23},
abstract = {We introduce the domain of continuous random variables (CRV)
over a domain, as an alternative to Jones and Plotkin's probabilistic
powerdomain. While no known Cartesian-closed category is stable under the
latter, we show that the so-called thin (uniform) CRVs define a strong
monad on the Cartesian-closed category of bc-domains. We also characterize
their inequational theory, as (fair-)coin algebras. We apply this to solve
a recent problem posed by M. Escard{\'o}: testing is semi-decidable for
EPCF terms. CRVs arose from the study of the second author's (layered)
Hoare indexed valuations, and we also make the connection apparent.}
}
@inproceedings{Fig-lics2011,
address = {Toronto, Canada},
month = jun,
year = 2011,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'11},
booktitle = {{P}roceedings of the 26th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'11)},
author = {Figueira, Diego},
title = {A decidable two-way logic on data words},
pages = {365-374},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/Fig-lics2011.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Fig-lics2011.pdf},
doi = {10.1109/LICS.2011.18},
abstract = {We study the satisfiability problem for a logic on data words.
A~data word is a finite word where every position carries a label from a
finite alphabet and a data value from an infinite domain. The logic we
consider is two-way, contains \emph{future} and \emph{past} modalities,
which are considered as reflexive and transitive relations, and data
equality and inequality tests. This logic corresponds to the fragment of
XPath with the 'followingsibling- or-self' and 'preceding-sibling-or-self'
axes over data words. We show that this problem is decidable,
EXPSPACE-complete. This is surprising considering that with the strict
(non-reflexive) navigation relations the satisfiability problem is
undecidable. To~prove this, we~first reduce the problem to a derivation
problem for an infinite transition system, and then we show how to
abstract this problem into a reachability problem of a finite transition
system.}
}
@article{LBDLNP-fmsd2010,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Li, Shuhao and Balaguer, Sandie and David, Alexandre and Larsen,
Kim G. and Nielsen, Brian and Pusinskas, Saulius},
title = {Scenario-based verification of real-time systems using {\textsc{Uppaal}}},
year = {2010},
month = nov,
volume = {37},
number = {2-3},
pages = {200-264},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LBDLNP-fmsd2010.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LBDLNP-fmsd2010.pdf},
doi = {10.1007/s10703-010-0103-z},
abstract = {This article proposes two approaches to tool-supported automatic
verification of dense real-time systems against scenario-based
requirements, where a system is modeled as a network of timed automata
(TAs) or as a set of driving live sequence charts (LSCs), and a
requirement is specified as a separate monitored LSC chart. We make timed
extensions to a kernel subset of the LSC language and define a trace-based
semantics. By translating a monitored LSC chart to a behavior-equivalent
observer TA and then non-intrusively composing this observer with the
original TA-modeled real-time system, the problems of scenario-based
verification reduce to computation tree logic (CTL) real-time model
checking problems. When the real-time system is modeled as a set of
driving LSC charts, we translate these driving charts and the monitored
chart into a behavior-equivalent network of TAs by using a
{"}one-TA-per-instance line{"} approach, and then reduce the problems of
scenario-based verification also to CTL real-time model checking problems.
We show how we exploit the expressivity of the TA formalism and the CTL
query language of the real-time model checker Uppaal to accomplish these
tasks. The proposed two approaches are implemented in the Uppaal tool and
built as a tool chain, respectively. We carry out a number of experiments
with both verification approaches, and the results indicate that these
methods are viable, computationally feasible, and the tools are effective.}
}
@phdthesis{villard-phd2010,
author = {Villard, Jules},
title = {Heaps and Hops},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2011,
month = feb,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/villard-phd.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/villard-phd.pdf},
abstract = {This thesis is about the specification and verification of
copyless message-passing programs, a particular kind of concurrent
programs that communicate by message passing. Instead of copying messages
over channels, processes exchange pointers into a shared memory where the
actual contents of messages are stored. Channels are themselves objects in
the heap that can be communicated, thus achieving full mobility. This
flexible and efficient programming paradigm must be used carefully: every
pointer that is communicated becomes shared between its sender and its
recipient, which may introduce races. To err on the side of caution, the
sender process should not attempt to access the area of storage
circumscribed by a message once it has been sent. Indeed, this right is
now reserved to the recipient, who may already have modified it or even
disposed of it. In other words, the ownership of pieces of heap hops from
process to process following the flow of messages.\par
Copyless message passing combines two features of programs that make
formal verification challenging: explicit memory management and
concurrency. To tackle these difficulties, we base our approach on two
recent developments. On the one hand, concurrent separation logic produces
concise proofs of pointer-manipulating programs by keeping track only of
those portions of storage owned by the program. We use such local
reasoning techniques to analyse the fluxes of ownership in programs, and
ensure in particular that no dangling pointer will be dereferenced or
freed at runtime. On the other hand, channel contracts, a form of session
types introduced by the Sing\# programming language, provide an abstraction
of the exchanges of messages that can be used to statically verify that
programs never face unexpected message receptions and that all messages
are delivered before a channel is closed.\par
The contributions contained in this thesis fall into three categories.
First, we give a semantics to copyless message-passing programs, the
ownership transfers they induce and contracts, and link the three
together. In doing so, we provide the first formal model of a
theoretically significant subset of the Sing\# programming language. In
particular, we show that some properties of their contracts rub off on
programs, which justifies their use as protocol specifications. Second, we
introduce the first proof system for copyless message passing, based on
separation logic and contracts. The proof system discharges parts of the
verification of programs on the verification of their contracts. The
marriage of these two techniques allows one to prove that programs are
free from memory faults, race conditions and message-passing errors such
as unspecified receptions and undelivered messages. Moreover, we show how
the logic and contracts cooperate to prove the absence of memory leaks.
Third, we give an implementation of our analysis, Heap-Hop, that takes
annotated programs as input and automatically checks the given
specifications and deduces which of the properties above are enjoyed by
the program. The only annotations needed by Heap-Hop are pre and
postconditions of each function, loop invariants, and the contracts
followed by the communications.}
}
@article{DFGD-jancl10,
publisher = {Taylor \& Francis},
journal = {Journal of Applied Non-Classical Logics},
author = {Demri, St{\'e}phane and Finkel, Alain and Goranko, Valentin
and van Drimmelen, Govert},
title = {Model-checking \(\textsf{CTL}^{*}\) over Flat {P}resburger Counter
Systems},
year = {2010},
volume = {20},
number = {4},
pages = {313-344},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DFGD-jancl10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DFGD-jancl10.pdf},
doi = {10.3166/jancl.20.313-344},
abstract = {This paper studies model-checking of fragments and extensions of
\(\textsf{CTL}^{*}\) on infinite-state counter systems, where the states
are vectors of integers and the transitions are determined by means of
relations definable within Presburger arithmetic. In general, reachability
properties of counter systems are undecidable, but we have identified a
natural class of admissible counter systems (ACS) for which we show that
the quantification over paths in \(\textsf{CTL}^{*}\) can be simulated by
quantification over tuples of natural numbers, eventually allowing
translation of the whole Presburger-\(\textsf{CTL}^{*}\) into Presburger
arithmetic, thereby enabling effective model checking. We provide evidence
that our results are close to optimal with respect to the class of counter
systems described above.}
}
@book{CK-ios2011,
editor = {Cortier, V{\'e}ronique and Kremer, Steve},
title = {Formal Models and Techniques for Analyzing Security Protocols},
publisher = {{IOS} Press},
year = {2011},
series = {Cryptology and Information Security Series},
volume = 5,
url = {http://www.iospress.nl/loadtop/load.php?isbn=9781607507130}
}
@inproceedings{DDS-tosca11,
address = {Saarbr{\"u}cken, Germany},
month = jan,
year = 2012,
volume = 6993,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {M{\"o}dersheim, Sebastian A. and Palamidessi, Catuscia},
acronym = {{TOSCA}'11},
booktitle = {{R}evised {S}elected {P}apaers of the {W}orkshop on {T}heory of {S}ecurity and
{A}pplications ({TOSCA}'11)},
author = {Dahl, Morten and Delaune, St{\'e}phanie and Steel, Graham},
title = {Formal Analysis of Privacy for Anonymous Location Based Services},
pages = {98-112},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-tosca11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-tosca11.pdf},
doi = {10.1007/978-3-642-27375-9_6},
abstract = {We propose a framework for formal analysis of privacy in
location based services such as anonymous electronic toll collection. We
give a formal definition of privacy, and apply it to the VPriv scheme for
vehicular services. We analyse the resulting model using the ProVerif
tool, concluding that our privacy property holds only if certain
conditions are met by the implementation. Our analysis includes some novel
features such as the formal modelling of privacy for a protocol that
relies on interactive zero-knowledge proofs of knowledge and list
permutations. }
}
@inproceedings{JLTV-tosca11,
address = {Saarbr{\"u}cken, Germany},
month = jan,
year = 2012,
volume = 6993,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {M{\"o}dersheim, Sebastian A. and Palamidessi, Catuscia},
acronym = {{TOSCA}'11},
booktitle = {{R}evised {S}elected {P}apaers of the {W}orkshop on {T}heory of {S}ecurity and
{A}pplications ({TOSCA}'11)},
author = {Jacquemard, Florent and Lozes, {\'E}tienne and Treinen, Ralf and
Villard, Jules},
title = {Multiple Congruence Relations, First-Order Theories on
Terms, and the Frames of the Applied Pi-Calculus},
pages = {166-185},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JLTV-tosca11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JLTV-tosca11.pdf},
doi = {10.1007/978-3-642-27375-9_10},
abstract = {We investigate the problem of deciding first-order theories of
finite trees with several distinguished congruence relations, each of them
given by some equational axioms. We give an automata-based solution for
the case where the different equational axiom systems are linear and
variable-disjoint (this includes the case where all axioms are ground),
and where the logic does not permit to express tree relations
\(x=f(y,z)\). We~show that the problem is undecidable when these
restrictions are relaxed. As motivation and application, we show how to
translate the model-checking problem of \(A\pi\mathcal{L}\), a~spatial
equational logic for the applied pi-calculus, to the validity of
first-order formulas in term algebras with multiple congruence
relations.}
}
@inproceedings{BDDHP-valuetools11,
address = {Cachan, France},
month = may,
year = 2011,
acronym = {{VALUETOOLS}'11},
booktitle = {{P}roceedings of the 5th {I}nternational {C}onference
on {P}erformance {E}valuation {M}ethodologies and {T}ools
({VALUETOOLS}'11)},
author = {Ballarini, Paolo and Djafri, Hilal and Duflot, Marie and
Haddad, Serge and Pekergin, Nihal},
title = {{HASL}: An~Expressive Language for Statistical Verification
of Stochastic Models},
pages = {306-315},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDDHP-valuetools11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDDHP-valuetools11.pdf},
abstract = {We introduce the Hybrid Automata Stochastic Logic (HASL), a new
temporal logic formalism for the verification of discrete event stochastic
processes (DESP). HASL employs Linear Hybrid Automata (LHA) as machineries
to select prefixes of relevant execution paths of a DESP~\(\mathcal{D}\).
The advantage with LHA is that rather elaborate information can be
collected \emph{on-the-fly} during path selection, providing the user with
a powerful means to express sophisticated measures. A formula of HASL
consists of an LHA~\(\mathcal{A}\) and an expression~\(Z\) referring to
moments of \emph{path random variables}. A~simulation-based statistical
engine is employed to obtained a confidence-interval estimate of the
expected value of~\(Z\). In essence HASL provide a unifying verification
framework where sophisticated temporal reasoning is naturally blended with
elabo- rate reward-based analysis. We illustrate the HASL approach by
means of some examples and a discussion about its expressivity. We also
provide empirical evidence obtained through COSMOS, a prototype software
tool for HASL verification.}
}
@article{BFLM-cacm11,
publisher = {ACM Press},
journal = {Communications of the~{ACM}},
author = {Bouyer, Patricia and Fahrenberg, Uli and Larsen, Kim~G. and
Markey, Nicolas},
title = {Quantitative analysis of real-time systems
using priced timed automata},
volume = 54,
number = 9,
month = sep,
pages = {78-87},
year = 2011,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFLM-cacm11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFLM-cacm11.pdf},
doi = {10.1145/1995376.1995396},
abstract = {The problems of time-dependent behavior in general, and dynamic
resource allocation in particular, pervade many aspects of modern life.
Prominent examples range from reliability and efficient use of
communication resources in a telecommunication network to the allocation
of tracks in a continental railway network, from scheduling the usage of
computational resources on a chip for durations of nano-seconds to the
weekly, monthly, or longer-range reactive planning in a factory or a
supply chain.}
}
@inproceedings{BFHR-fossacs11,
address = {Saarbr{\"u}cken, Germany},
month = mar # {-} # apr,
year = 2011,
volume = {6604},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Hofmann, Martin},
acronym = {{FoSSaCS}'11},
booktitle = {{P}roceedings of the 14th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'11)},
author = {Bonnet, R{\'e}mi and Finkel, Alain and Haddad, Serge and
Rosa{-}Velardo, Fernando},
title = {Ordinal Theory for Expressiveness of Well Structured Transition Systems},
pages = {153-167},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFHR-fossacs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFHR-fossacs11.pdf},
doi = {10.1007/978-3-642-19805-2_11}
}
@inproceedings{FS-stacs11,
address = {Dortmund, Germany},
month = mar,
year = 2011,
volume = 9,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {D{\"u}rr, Christoph and Schwentick, {\relax Th}omas},
acronym = {{STACS}'11},
booktitle = {{P}roceedings of the 28th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'11)},
author = {Figueira, Diego and Segoufin, Luc},
title = {Bottom-up automata on data trees and vertical {XP}ath},
pages = {93-104},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FS-stacs11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FS-stacs11.pdf},
doi = {10.4230/LIPIcs.STACS.2011.93},
abstract = {A data tree is a tree whose every node carries a label from a
finite alphabet and a datum from some infinite domain. We introduce a new
model of automata over unranked data trees with a decidable emptiness
problem. It is essentially a bottom-up alternating automaton with one
register, enriched with epsilon-transitions that perform tests on the data
values of the subtree. We show that it captures the expressive power of
the vertical fragment of XPath --containing the child, descendant, parent
and ancestor axes-- obtaining thus a decision procedure for its
satisfiability problem.}
}
@inproceedings{BKKL-ceeset2008,
address = {Brno, Czech Republic},
year = 2011,
volume = {4980},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Huzar, Zbigniew and Koc{\'\i}, Radek and Meyer, Bertrand and
Walter, Bartosz and Zendulka, Jaroslav},
acronym = {{CEE-SET}'08},
booktitle = {{R}evised {S}elected {P}apars of the 3rd {IFIP} {TC2} {C}entral and
{E}ast {E}uropean {C}onference on {S}oftware {E}ngineering
{T}echniques ({CEE-SET}'08)},
author = {Bollig, Benedikt and Katoen, Joost-Pieter and Kern,
Carsten and Leucker, Martin},
title = {{SMA}---The {S}myle Modeling Approach},
pages = {103-117},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-ceeset2008.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-ceeset2008.pdf},
doi = {10.1007/978-3-642-22386-0_8},
abstract = {This paper introduces the model-based software development
methodology SMA---the Smyle Modeling Approach---which is centered around
Smyle, a dedicated learning procedure to support engineers to
interactively obtain design models from requirements, characterized as
either being desired (positive) or unwanted (negative) system behavior.
The learning approach is complemented by scenario patterns where the
engineer can specify clearly desired or unwanted behavior. This~way, user
interaction is reduced to the interesting scenarios limiting the design
effort considerably. In~SMA, the learning phase is complemented by an
effective analysis phase that allows for detecting design flaws at an
early design stage. This paper describes the approach and reports on first
practical experiences.}
}
@article{JGL-jyg10,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Goubault{-}Larrecq, Jean},
title = {Musings Around the Geometry of Interaction, and Coherence},
volume = 412,
number = 20,
pages = {1998-2014},
year = 2011,
month = apr,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/jgl-jyg10.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/jgl-jyg10.pdf},
doi = {10.1016/j.tcs.2010.12.023},
abstract = {We introduce the Danos-R{\'e}gnier category \(\mathcal{DR}(M)\)
of a linear inverse monoid~\(M\), as~a categorical description of
geometries of interaction~(GOI) inspired from the weight algebra. The
natural setting for GOI is that of a so-called weakly Cantorian linear
inverse monoid, in which case \(\mathcal{DR}(M)\) is a kind of symmetrized
version of the classical Abramsky-Haghverdi-Scott construction of a weak
linear category from a GOI situation. 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 \(\star\)-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 of any two objects, and no exponential---whatever
\(M\)~is, unless \(M\)~is trivial. However, a form of coherence completion
of \(\mathcal{DR}(M)\) \textit{{\`a} la} Hu-Joyal (which for additives
resembles a layered approach \textit{{\`a} la} Hughes-van Glabbeek),
provides a model of full classical linear logic, as soon as \(M\) is
weakly Cantorian. One finally notes that Girard's notion of \emph{coherence} is
pervasive, and instrumental in every aspect of this work.}
}
@incollection{DG-iis09,
author = {Demri, St{\'e}phane and Gastin, Paul},
title = {Specification and Verification using Temporal Logics},
booktitle = {Modern applications of automata theory},
editor = {D'Souza, Deepak and Shankar, Priti},
series = {IISc Research Monographs},
volume = 2,
publisher = {World Scientific},
chapter = 15,
pages = {457-494},
year = 2012,
month = jul,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DG-iis09.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DG-iis09.pdf},
abstract = {This chapter illustrates two aspects of automata theory related
to linear-time temporal logic LTL used for the verification of computer
systems. First, we present a translation from LTL formulae to B{\"u}chi
automata. The aim is to design an elementary translation which is
reasonably efficient and produces small automata so that it can be easily
taught and used by hand on real examples. Our translation is in the spirit
of the classical tableau constructions but is optimized in several ways.
Secondly, we recall how temporal operators can be defined from regular
languages and we explain why adding even a single operator definable by a
context-free language can lead to undecidability.}
}
@mastersthesis{cyriac-master,
author = {Cyriac, Aiswarya},
title = {Temporal Logics for Concurrent Recursive Programs},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2010},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ac-m2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ac-m2.pdf}
}
@inproceedings{AC-clodem10,
address = {Edinburgh, Scotland, UK},
month = jul,
year = 2010,
acronym = {{CL}o{D}e{M}'10},
booktitle = {{P}roceedings of the {W}orkshop on {C}omparing {L}ogical {D}ecision
{M}ethods ({CL}o{D}e{M}'10)},
author = {Cyriac, Aiswarya},
title = {A~New Version of Focus Games for {LTL} Satisfiability},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ac-clodem10.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ac-clodem10.pdf}
}
@inproceedings{CU-fsttcs12,
address = {Hyderabad, India},
month = dec,
year = 2012,
volume = 18,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {D'Souza, Deepak and Radhakrishnan, Jaikumar and Telikepalli, Kavitha},
acronym = {{FSTTCS}'12},
booktitle = {{P}roceedings of the 32nd {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'12)},
author = {Chadha, Rohit and Ummels, Michael},
title = {The complexity of quantitative information flow in recursive
programs},
pages = {534-545},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-15.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-15.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2012.534},
abstract = {Information-theoretic measures based upon mutual information can
be employed to quantify the information that an \emph{execution} of a
program reveals about its \emph{secret inputs}. The \emph{information
leakage bounding problem} asks whether the information leaked by a program
does not exceed a certain amount. We consider this problem for two
scenarios: a)~the \emph{outputs} of the program are revealed, and b)~the
\emph{timing} (measured in the number of execution steps) of the program
is revealed. For both scenarios, we establish complexity results in the
context of deterministic boolean programs, both for programs with and
without recursion. In particular, we prove that for recursive programs the
information leakage bounding problem is no harder than checking
reachability.}
}
@inproceedings{ASV-www12comp,
address = {Lyon, France},
month = apr,
year = 2012,
publisher = {ACM Press},
editor = {Mille, Alain and Gandon, Fabien L. and Misselis, Jacques and
Rabinovich, Michael and Staab, Steffen},
acronym = {{WWW}'12},
booktitle = {{P}roceedings of the 21st {W}orld {W}ide {W}eb {C}onference
({WWW}'12)~-- {C}ompanion {V}olume},
author = {Abiteboul, Serge and Senellart, Pierre and Vianu, Victor},
title = {The {ERC} webdam on foundations of web data management},
pages = {211-214},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ASV-www12comp.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ASV-www12comp.pdf},
abstract = {The Webdam ERC grant is a five-year project that started
in December~2008. The goal is to develop a formal model for Web
data management that would open new horizons for the development
of the Web in a well-principled way, enhancing its functionality,
performance, and reliability. Specifically, the goal is to develop
a universally accepted formal framework for describing complex and
flexible interacting Web applications featuring notably data
exchange, sharing, integration, querying, and updating. We also
propose to develop formal foundations that will enable peers to
concurrently reason about global data management activities,
cooperate in solving specific tasks, and support services with
desired quality of service. Although the proposal addresses
fundamental issues, its goal is to serve as the basis for future
software development for Web data management.}
}
@inproceedings{ABD-webdb12,
address = {Scottsdale, Arizona, USA},
month = may,
year = 2012,
editor = {Ives, Zachary G. and Velegrakis, Yannis},
acronym = {({W}eb{DB}'12)},
booktitle = {{P}roceedings of the 15th {I}nternational {W}orkshop on the
{W}eb and {D}atabases ({W}eb{DB}'12)},
author = {Abiteboul, Serge and Bienvenu, Meghyn and Deutch, Daniel},
title = {Deduction in the Presence of Distribution and Contradictions},
pages = {31-36},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABD-webdb12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABD-webdb12.pdf},
abstract = {We study deduction, captured by \emph{datalog}-style
rules, in the presence of contradictions, captured by
\emph{functional dependency} (FD) violation. We propose a simple
non-deterministic semantics for datalog with FDs based on
inferring facts one at a time, never violating the FDs. We present
a novel \emph{proof theory} for this semantics. We also discuss a
set-at-a-time semantics, where at each iteration, all facts that
can be inferred are added to the database, and then choices are
made between contradicting facts. We then build upon a distributed
datalog idiom, namely \emph{Webdamlog}, to define a semantics for
the \emph{distributed setting}. Observe that contradictions
naturally arise in such a setting, with different peers having
conflicting information or opinions. We study different semantics
for this setting.}
}
@inproceedings{AAMS-sigmod12,
address = {Scottsdale, Arizona, USA},
month = may,
year = 2012,
publisher = {ACM Press},
editor = {Candan, K. Sel{\c{c}}uk and Chen, Yi and Snodgrass, Richard T. and
Gravano, Luis and Fuxman, Ariel},
acronym = {{SIGMOD}'12},
booktitle = {{P}roceedings of the {ACM} {SIGMOD} {I}nternaitonal
{C}onference on {M}anagement of {D}ata ({SIGMOD}'12)},
author = {Abiteboul, Serge and Amsterdamer, Yael and
Milo, Tova and Senellart, Pierre},
title = {Auto-completion learning for~{XML}},
pages = {669-672},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AAMS-sigmod12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AAMS-sigmod12.pdf},
doi = {10.1145/2213836.2213928},
abstract = {Editing an XML document manually is a complicated task.
While many XML editors exist in the market, we argue that some
important functionalities are missing in all of them. Our goal is
to makes the editing task simpler and faster. We~present ALEX
(Auto-completion Learning Editor for~XML), an editor that assists
the users by providing intelligent autocompletion
suggestions. These suggestions are adapted to the user needs,
simply by feeding ALEX with a set of example XML documents to
learn from. The~suggestions are also guaranteed to be compliant
with a given XML schema, possibly including integrity
constraints. To~fulfill this challenging goal, we rely on novel,
theoretical foundations by us and others, which are combined here
in a system for the first time.}
}
@inproceedings{ABV-icdt12,
address = {Berlin, Germany},
month = mar,
year = 2012,
publisher = {ACM Press},
editor = {Deutsch, Alin},
acronym = {{ICDT}'12},
booktitle = {{P}roceedings of the 15th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'12)},
author = {Abiteboul, Serge and Bourhis, Pierre and Vianu, Victor},
title = {Highly expressive query languages for unordered data trees},
pages = {46-60},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABV-icdt12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABV-icdt12.pdf},
doi = {10.1145/2274576.2274583},
abstract = {We study highly expressive query languages for unordered
data trees, using as formal vehicles Active XML and extensions of
languages in the while family. All languages may be seen as adding
some form of control on top of a set of basic pattern queries. The
results highlight the impact and interplay of different factors:
the expressive power of basic queries, the embedding of
computation into data (as~in Active~XML), and the use of
deterministic vs. nondeterministic control. All languages are
Turing complete, but not necessarily query complete in the sense
of Chandra and Harel. Indeed, we show that some combinations of
features yield serious limitations, analogous to \(FO^{k}\)
definability in the relational context. On the other hand, the
limitations come with benefits such as the existence of powerful
normal forms. Other languages are {"}almost{"} complete, but fall
short because of subtle limitations reminiscent of the copy
elimination problem in object databases.}
}
@inproceedings{AADMS-icdt12,
address = {Berlin, Germany},
month = mar,
year = 2012,
publisher = {ACM Press},
editor = {Deutsch, Alin},
acronym = {{ICDT}'12},
booktitle = {{P}roceedings of the 15th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'12)},
author = {Abiteboul, Serge and Amsterdamer, Yael and Deutch, Daniel and
Milo, Tova and Senellart, Pierre},
title = {Finding optimal probabilistic generators for {XML} collections},
pages = {127-139},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AADMS-icdt12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AADMS-icdt12.pdf},
doi = {10.1145/2274576.2274591},
abstract = {We study the problem of, given a corpus of XML documents
and its schema, finding an optimal (generative) probabilistic
model, where optimality here means maximizing the likelihood of
the particular corpus to be generated. Focusing first on the
structure of documents, we present an efficient algorithm for
finding the best generative probabilistic model, in the absence of
constraints. We further study the problem in the presence of
integrity constraints, namely key, inclusion, and domain
constraints. We study in this case two different kinds of
generators. First, we consider a continuation-test generator that
performs, while generating documents, tests of schema
satisfiability; these tests prevent from generating a document
violating the constraints but, as we will see, they are
computationally expensive. We also study a restart generator that
may generate an invalid document and, when this is the case,
restarts and tries again. Finally, we consider the injection of
data values into the structure, to obtain a full XML document. We
study different approaches for generating these values.}
}
@inproceedings{AAS-icde12,
address = {Washington, D.C., USA},
month = apr,
year = 2012,
publisher = {{IEEE} Computer Society Press},
editor = {Kementsietsidis, Anastasios and Vaz{~}Salles, Marcos Antonio},
acronym = {{ICDE}'12},
booktitle = {{P}roceedings of the 28th {I}nternational {C}onference on
{D}ata {E}ngineering ({ICDE}'12)},
author = {Abiteboul, Serge and Antoine, {\'E}milien and Stoyanovich, Julia},
title = {Viewing the Web as a Distributed Knowledge Base},
pages = {1-4},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AAS-icde12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AAS-icde12.pdf},
doi = {10.1109/ICDE.2012.150},
abstract = {This papers addresses the challenges faced by everyday
Web users, who interact with inherently heterogeneous and
distributed information. Managing such data is currently beyond
the skills of casual users. We describe ongoing work that has as
its goal the development of foundations for declarative
distributed data management. In this approach, we see the Web as a
knowledge base consisting of distributed logical facts and
rules. Our objective is to enable automated reasoning over this
knowledge base, ultimately improving the quality of service and of
data. For this, we use Webdamlog, a Datalog-style language with
rule delegation. We outline ongoing efforts on the WebdamExchange
platform that combines Webdamlog evaluation with communication and
security protocols.}
}
@inproceedings{SA-dl12,
address = {Rome, Italy},
month = jun,
year = 2012,
volume = 846,
series = {CEUR Workshop Proceedings},
publisher = {RWTH Aachen, Germany},
editor = {Kazakov, Yevgeny and Lembo, Domenico and Wolter, Frank },
acronym = {{DL}'12},
booktitle = {{P}roceedings of the 2012 {I}nternational
{W}orkshop {D}escription {L}ogic ({DL}'09)},
author = {Abiteboul, Serge},
title = {Viewing the Web as a Distributed Knowledge Base},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SA-dl12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SA-dl12.pdf}
}
@inproceedings{SA-csl12,
address = {Fontainebleau, France},
month = sep,
year = 2012,
volume = 16,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {C{\'e}gielski, Patrick and Durand, Arnaud},
acronym = {{CSL}'12},
booktitle = {{P}roceedings of the 21st {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'12)},
author = {Abiteboul, Serge},
title = {Sharing Distributed Knowledge on the Web (Invited Talk)},
pages = {6-8},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SA-csl12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SA-csl12.pdf},
doi = {10.4230/LIPIcs.CSL.2012.6},
abstract = {To share information, we propose to see the Web as a
knowledge base consisting of distributed logical facts and
rules. Our objective is to help Web users finding information, as
well as controlling their own, using automated reasoning over
this knowledge base towards improving the quality of service and
of data. For this, we introduce Webdamlog, a Datalog-style
language with rule delegation. We~mention the implementation of a
system to support this language as well as standard communications
and security protocols.}
}
@article{ABV-tods12,
publisher = {ACM Press},
journal = {ACM Transactions on Database Systems},
author = {Abiteboul, Serge and Bourhis, Pierre and Vianu, Victor},
title = {Comparing workflow specification languages: A~matter of views},
volume = 37,
number = {2:10},
nopages = {},
year = 2012,
month = may,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABV-tods12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABV-tods12.pdf},
doi = {10.1145/2188349.2188352},
abstract = {We address the problem of comparing the expressiveness
of workflow specification formalisms using a notion of view of a
workflow. Views allow to compare widely different workflow systems
by mapping them to a common representation capturing the
observables relevant to the comparison. Using this framework, we
compare the expressiveness of several workflow specification
mechanisms, including automata, temporal constraints, and
pre-and-post conditions, with XML and relational databases as
underlying data models. One surprising result shows the
considerable power of static constraints to simulate apparently
much richer workflow control mechanisms.}
}
@article{BSS-lmcs12,
journal = {Logical Methods in Computer Science},
author = {Boja{\'n}czyk, Miko{\l}aj and Segoufin, Luc and Straubing,
Howard},
title = {Piecewise testable tree languages},
volume = 8,
number = {3:26},
nopages = {},
year = 2012,
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BSS-lmcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BSS-lmcs12.pdf},
doi = {10.2168/LMCS-8(3:26)2012},
abstract = {This paper presents a decidable characterization of tree
languages that can be defined by a boolean combination of \(\Sigma_{1}\)
sentences. 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}\)
sentences if and only if its syntactic monoid is \(\mathcal{J}\)-trivial.}
}
@article{AMSS-siamjc12,
publisher = {SIAM},
journal = {SIAM Journal on Computing},
author = {Anderson, Matthew and van Melkebeek, Dieter and Schweikardt,
Nicole and Segoufin, Luc},
title = {Locality from Circuit Lower Bounds},
volume = 41,
number = 6,
pages = {1481-1523},
year = {2012},
month = nov,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AMSS-siamjc12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AMSS-siamjc12.pdf},
doi = {10.1137/110856873},
abstract = {We study the locality of an extension of first-order logic that
captures graph queries computable in \(\textsf{AC}^{0}\), i.e., by
families of polynomial-size constant-depth circuits. The extension
considers first-order formulas over relational structures which may use
arbitrary numerical predicates in such a way that their truth value is
independent of the particular interpretation of the numerical predicates.
We refer to such formulas as Arb-invariant first-order. We consider the
two standard notions of locality, Gaifman and Hanf locality. Our main
result gives a Gaifman locality theorem: An Arb-invariant first-order
formula cannot distinguish between two tuples that have the same
neighborhood up to distance \((\log n)^{c}\), where \(n\) represents the
number of elements in the structure and \(c\) is a constant depending on
the formula. When restricting attention to string structures, we achieve
the same quantitative strength for Hanf locality. In both cases we show
that our bounds are tight. We also present an application of our results
to the study of regular languages. Our proof exploits the close connection
between first-order formulas and the complexity class \(\textsf{AC}^{0}\)
and hinges on the tight lower bounds for parity on constant-depth
circuits.}
}
@inproceedings{CB-post13,
address = {Rome, Italy},
month = mar,
year = 2013,
volume = {7796},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Basin, David and Mitchell, John},
acronym = {{POST}'13},
booktitle = {{P}roceedings of the 2nd {I}nternational {C}onference on
{P}rinciples of {S}ecurity and {T}rust
({POST}'13)},
author = {Cheval, Vincent and Blanchet, Bruno},
title = {Proving More Observational Equivalences with ProVerif},
pages = {226-246},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CB-post13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CB-post13.pdf},
doi = {10.1007/978-3-642-36830-1_12},
abstract = {This paper presents an extension of the automatic protocol
verifier ProVerif in order to prove more observational
equivalences. ProVerif can prove observational equivalence
between processes that have the same structure but differ by
the messages they contain. In order to extend the class of
equivalences that ProVerif handles, we extend the language
of terms by defining more functions (destructors) by rewrite
rules. In particular, we allow rewrite rules with
inequalities as side-conditions, so that we can express
tests {"}if then else{"} inside terms. Finally,
we provide an automatic procedure that translates a process
into an equivalent process that performs as many actions as
possible inside terms, to allow ProVerif to prove the
desired equivalence. These extensions have been implemented
in ProVerif and allow us to automatically prove anonymity in
the private authentication protocol by Abadi and Fournet.}
}
@inproceedings{CD-post13,
address = {Rome, Italy},
month = mar,
year = 2013,
volume = {7796},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Basin, David and Mitchell, John},
acronym = {{POST}'13},
booktitle = {{P}roceedings of the 2nd {I}nternational {C}onference on
{P}rinciples of {S}ecurity and {T}rust
({POST}'13)},
author = {Chr{\'e}tien, R{\'e}my and Delaune, St{\'e}phanie},
title = {Formal analysis of privacy for routing protocols in mobile ad~hoc networks},
pages = {1-20},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-post13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-post13.pdf},
doi = {10.1007/978-3-642-36830-1_1},
abstract = {Routing protocols aim at establishing a route between
distant nodes in ad hoc networks. Secured versions
of routing protocols have been proposed to provide
more guarantees on the resulting routes, and some of
them have been designed to protect the privacy of
the users. In this paper, we propose a framework for
analysing privacy-type properties for routing
protocols. We use a variant of the applied-pi
calculus as our basic modelling formalism. More
precisely, using the notion of equivalence between
traces, we formalise three security properties
related to privacy, namely indistinguishability,
unlinkability, and anonymity. We study the
relationship between these definitions and we
illustrate them using two versions of the ANODR
routing protocol.}
}
@phdthesis{benzina-phd2012,
author = {Benzina, Hedi},
title = {Enforcing Virtualized Systems Security},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2012,
month = dec,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/benzina-these12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/benzina-these12.pdf}
}
@phdthesis{balaguer-phd2012,
author = {Balaguer, Sandie},
title = {La concurrence dans les syst{\`e}mes distribu{\'e}s temps-r{\'e}el},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2012,
month = dec,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/balaguer-these12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/balaguer-these12.pdf}
}
@book{SA-bookCDF,
author = {Abiteboul, Serge},
title = {Sciences des donn{\'e}es: De la logique du premier ordre {\`a} la Toile},
publisher = {Fayard},
year = {2012},
series = {Le{\c{c}}ons inaugurales du {C}oll{\`e}ge de {F}rance}
}
@article{BFHR-icomp13,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Bonnet, R{\'e}mi and Finkel, Alain and Haddad, Serge and
Rosa{-}Velardo, Fernando},
title = {Ordinal Theory for Expressiveness of Well-Structured
Transition Systems},
year = 2013,
month = mar,
volume = 224,
pages = {1-22},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFHR-icomp12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFHR-icomp12.pdf},
doi = {10.1016/j.ic.2012.11.003},
abstract = {We characterize the importance of resources (like counters,
channels, or alphabets) when measuring the expressiveness of
Well-Structured Transition Systems~(WSTS). We establish, for usual classes
of well partial orders, the equivalence between the existence of order
reflections (non-monotonic order embeddings) and the simulations with
respect to coverability languages. We show that the non-existence of order
reflections can be proved by the computation of order types. This allows
us to extend the current classification of WSTS, in particular solving
some open problems, and to unify the existing proofs.}
}
@article{BCHLR-tcs13,
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 = {The Expressive Power of Time {P}etri Nets},
year = 2013,
month = feb,
volume = 474,
ftturenumber = {},
pages = {1-20},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCHLR-tcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCHLR-tcs12.pdf},
doi = {10.1016/j.tcs.2012.12.005},
abstract = {We investigate expressiveness questions for time Petri nets
(TPNs) and some their most usefull extensions. We first introduce
generalised time Petri nets (GTPNs) as an abstract model that encompasses
variants of TPNs such as self modifications and read, reset and inhibitor
arcs.\par
We give a syntactical translation from bounded GTPNs to timed automata
(TA) that generates isomorphic transition systems. We prove that the class
of bounded GTPNs is stricly less expressive than TA w.r.t. weak timed
bisimilarity. We prove that bounded GTPNs, bounded TPNs and TA are equally
expressive w.r.t. timed language acceptance. Finally, we characterise a
syntactical subclass of TA that is equally expressive to bounded GTPNs
{"}\`a~la Merlin{"} w.r.t. weak timed bisimilarity. These results provide
a unified comparison of the expressiveness of many variants of timed
models often used in practice. It leads to new important results for TPNs.
Among them are: 1-safe TPNs and bounded-TPNs are equally expressive;
\(\epsilon\)-transitions strictly increase the expressive power of TPNs;
self modifying nets as well as read, inhibitor and reset arcs do not add
expressiveness to bounded TPNs.}
}
@techreport{rr-lsv-12-25,
author = {Feld, Gilles and Fribourg, Laurent and Labrousse, Denis and
Revol, Bertrand and Soulat, Romain},
title = {Correct-by-Design Control of 5-level and 7-level Power Converters},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2012},
month = dec,
type = {Research Report},
number = {LSV-12-25},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-25.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-25.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2012-25-v1.pdf, 20121205},
note = {8~pages},
abstract = {High-power converters based on elementary switching cells are
more and more used in the industry of power electronics owing to various
advantages such as lower voltage stress and reduced power loss. However,
the complexity of controlling such converters is a major challenge that
the power manufacturing industry has to face with. The synthesis of
industrial switching controllers relies today on heuristic rules and
empiric simulation. The state of the system is not guaranteed to stay
within the limits that are admissible for its correct electrical behavior.
We show here how to apply a formal method in order to synthesise a
correct-by-design control that guarantees that the power converter will
always stay within a predened safe zone of variations for its input
parameters. Our method nds local invariants by decomposing the safety
space into smaller zones. The method is applied in order to synthesize
correct-by-design controls for a 5-level and 7-level power converters. We
check the validity of our approach by numerical simulations and physical
experimentations done with a prototype built by SATIE laboratory.}
}
@techreport{rr-lsv-12-24,
author = {Fribourg, Laurent and Soulat, Romain},
title = {Controlled Recurrent Subspaces for Sampled Switched Linear Systems},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2012},
month = dec,
type = {Research Report},
number = {LSV-12-24},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-24.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-24.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2012-24-v1.pdf, 20121205},
note = {11~pages},
abstract = {Sampled switched linear systems are governed by piecewise linear
dynamics that are periodically sampled with a given period~\(\tau\). At
each sampling time, the {"}mode{"} of the system, i.e., the parameters of
the linear dynamics, are switched according to a control rule. We give
here a procedure for showing that a given area~\(R\) of the state space
has a {"}\(k\)-recurrent decomposition: such a decomposition induces a
control that makes every trajectory starting from~\(R\) go back to~\(R\)
within at most \(k\) steps (i.e, \(k\tau\)\ time). We can then determine
an extended zone that contains all the trajectories issued from~\(R\);
this allows us to check safety properties of the system. We show the
practical interest of our approach on several examples of the literature.
We also give a geometrical condition on~\(R\) that ensures the existence
of a \(k\)-recurrent decomposition.}
}
@techreport{rr-lsv-12-23,
author = {Vester, Steen},
title = {Symmetric {N}ash equilibria},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2012},
month = dec,
type = {Research Report},
number = {LSV-12-23},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-23.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-23.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2012-23-v1.pdf, 20121204},
note = {51~pages}
}
@mastersthesis{m2-chretien,
author = {Chr{\'e}tien, R{\'e}my},
title = {Trace equivalence of protocols for an unbounded number of sessions},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2012},
month = sep,
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-22.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-22.pdf},
note = {30~pages},
abstract = {The problem of deciding reachability for cryptographic protocols
has been thoroughly studied for an unbounded number of sessions and proven
to be undecidable in general. Nevertheless some fragments were shown to be
decidable, either by tagging or by restricting the number of blind-copies.
On the other hand, trace equivalenc has only been proven to be decidable
for a bounded number of sessions. The objective of this talk is to provide
the first results of decidability of trace equivalence for an unbounded
number of sessions by lifting the approach followed by Comon-Lundh and
Cortier to trace equivalence.\par
Trace equivalence for a first class of protocols was shown undecidable
under scarce restrictions one variable and symmetric encryption are indeed
enough. Consequently, we restrained our class of protocols a step further
by making the protocols deterministic in some sense and preventing it from
disclosing secret keys. This tighter class of protocols was then shown to
be decidable after reduction to an equivalence between deterministic
pushdown automata.}
}
@phdthesis{brenguier-phd2012,
author = {Brenguier, Romain},
title = {{\'E}quilibres de {N}ash dans les Jeux Concurrents~--
{A}pplication aux Jeux Temporis{\'e}s},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2012,
month = nov,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/brenguier-these12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/brenguier-these12.pdf}
}
@phdthesis{cheval-phd2012,
author = {Cheval, Vincent},
title = {Automatic verification of cryptographic protocols: privacy-type properties},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2012,
month = dec,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/cheval-these12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/cheval-these12.pdf}
}
@article{ABG-fmsd12,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Akshay, S. and Bollig, Benedikt and Gastin, Paul},
title = {Event-clock Message Passing Automata: A~Logical
Characterization and an Emptiness-Checking Algorithm},
year = 2013,
month = jun,
volume = 42,
number = {3},
pages = {262-300},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABG-fmsd12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABG-fmsd12.pdf},
doi = {10.1007/s10703-012-0179-8},
abstract = {We are interested in modeling behaviors and verifying
properties of systems in which time and concurrency play a crucial
role. We introduce a model of distributed automata which are
equipped with event clocks as in [Alur, Fix,
Henzinger. Event-clock automata: A~determinizable class of timed
automata. TCS 211(1-2):253-273, 1999.], which we call Event Clock
Message Passing Automata (ECMPA). To describe the behaviors of
such systems we use timed partial orders (modeled as message
sequence charts with timing).\par
Our first goal is to extend the classical
B{\"u}chi-Elgot-Trakhtenbrot equivalence to the timed and
distributed setting, by showing an equivalence between ECMPA and a
timed extension of monadic second-order (MSO) logic. We obtain
such a constructive equivalence in two different ways:
(1)~by~restricting the semantics by bounding the set of timed
partial orders (2)~by~restricting the timed MSO logic to its
existential fragment. We next consider the emptiness problem for
ECMPA, which asks if a given ECMPA has some valid timed
execution. In general this problem is undecidable and we show that
by considering only bounded timed executions, we can obtain
decidability. We do this by constructing a timed automaton which
accepts all bounded timed executions of the ECMPA and checking
emptiness of this timed automaton.}
}
@article{CFM-ijfcs12,
publisher = {World Scientific},
journal = {International Journal of Foundations of Computer Science},
author = {Cadilhac, Micha{\"e}l and Finkel, Alain and McKenzie, Pierre},
title = {Bounded {P}arikh automata},
year = 2012,
month = dec,
volume = {23},
number = {8},
pages = {1691-1710},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-ijfcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-ijfcs12.pdf},
doi = {10.1142/S0129054112400709},
abstract = {The Parikh finite word automaton model~(PA) was introduced and
studied by Klaedtke and Rue{\ss}. Here, we present some expressiveness
properties of a restriction of the deterministic affine PA recently
introduced, and use them as a tool to show that the bounded languages
recognized by PA are the same as those recognized by deterministic PA.
Moreover, this class of languages is shown equal to the class of bounded
languages with a semilinear iteration set.}
}
@article{CFM-rairo12,
address = {Les Ulis, France},
publisher = {EDP Sciences},
journal = {RAIRO Informatique Th{\'e}orique et Applications},
author = {Cadilhac, Micha{\"e}l and Finkel, Alain and McKenzie, Pierre},
title = {Affine {P}arikh automata},
year = 2012,
month = oct,
volume = 46,
number = 4,
pages = {511-545},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-rairo12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-rairo12.pdf},
doi = {10.1051/ita/2012013},
abstract = {The Parikh finite word automaton (PA) was introduced and studied
in 2003 by Klaedtke and Rue\ss. Natural variants of the PA arise from
viewing a PA equivalently as an automaton that keeps a count of its
transitions and semilinearly constrains their numbers. Here we adopt this
view and define the affine PA, that extends the PA by having each
transition induce an affine transformation on the PA registers, and the PA
on letters, that restricts the PA by forcing any two transitions on the
same letter to affect the registers equally. Then we report on the
expressiveness, closure, and decidability properties of such PA variants.
We note that deterministic PA are strictly weaker than deterministic
reversal-bounded counter machines.}
}
@inproceedings{CFM-dlt12,
address = {Taipei, Taiwan},
month = aug,
year = 2012,
volume = 7410,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Yen, Hsu-Chun and Ibarra, Oscar H.},
acronym = {{DLT}'12},
booktitle = {{P}roceedings of the 16th {I}nternational
{C}onference on {D}evelopments in {L}anguage {T}heory
({DLT}'12)},
author = {Cadilhac, Micha{\"e}l and Finkel, Alain and McKenzie, Pierre},
title = {Unambiguous Constrained Automata},
pages = {239-250},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-dlt12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-dlt12.pdf},
doi = {10.1007/978-3-642-31653-1_22},
abstract = {The class of languages captured by Constrained Automata~(CA)
that are unambiguous is shown to possess more closure properties than the
provably weaker class captured by deterministic~CA. Problems decidable for
deterministic CA are nonetheless shown to remain decidable for unambiguous
CA, and testing for \emph{regularity} is added to this set of decidable
problems. Unambiguous CA are then shown incomparable with deterministic
reversal-bounded machines in terms of expressivity, and a
\emph{deterministic} model equivalent to unambiguous CA is identified.}
}
@article{BCH-fi12,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {Balaguer, Sandie and Chatain, {\relax Th}omas and Haar, Stefan},
title = {Building Occurrence Nets from Reveals Relations},
year = 2013,
month = may,
volume = 123,
number = 3,
pages = {245-272},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCH-fi12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCH-fi12.pdf},
doi = {10.3233/FI-2013-809},
abstract = {Occurrence nets are a well known partial order model for the
concurrent behavior of Petri nets. The causality and conflict relations
between events, which are explicitly represented in occurrence nets,
induce logical dependencies between event occurrences: the occurrence of
an event~\(e\) in a run implies that all its causal predecessors also
occur, and that no event in conflict with~\(e\) occurs. But these
structural relations do not express all the logical dependencies between
event occurrences in maximal runs: in particular, the occurrence of~\(e\)
in any maximal run may imply the occurrence of another event that is not a
causal predecessor of~\(e\), in that run. The \emph{reveals} relation has
been introduced to express this dependency between two events. Here we
generalize the reveals relation to express more general dependencies,
involving more than two events, and we introduce ERL logic to express them
as boolean formulas. Finally we answer the synthesis problem that arises:
given an ERL formula~\(\varphi\), is there an occurrence
net~\(\mathcal{N}\) such that \(\varphi\)~describes exactly the
dependencies between the events of~\(\mathcal{N}\)?}
}
@article{DDMM-lmcs12,
journal = {Logical Methods in Computer Science},
author = {Darondeau, {\relax Ph}ilippe and Demri, St{\'e}phane and
Meyer, Roland and Morvan, {\relax Ch}ristophe},
title = {{P}etri Net Reachability Graphs: Decidability Status of {FO}
Properties},
volume = 8,
number = {4:9},
nopages = {},
month = oct,
year = 2012,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DDMM-lmcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DDMM-lmcs12.pdf},
doi = {10.2168/LMCS-8(4:9)2012},
abstract = {We investigate the decidability and complexity status of
model-checking problems on unlabelled reachability graphs of Petri nets by
considering first-order and modal languages without labels on transitions
or atomic propositions on markings. We consider several parameters to
separate decidable problems from undecidable ones. Not only are we able to
provide precise borders and a systematic analysis, but we also demonstrate
the robustness of our proof techniques.}
}
@techreport{AGL-arxiv12,
author = {Adj{\'e}, Assal{\'e} and Goubault{-}Larrecq, Jean},
title = {Concrete Semantics of Programs with Non-Deterministic and
Random Inputs},
year = {2012},
month = oct,
type = {Research Report},
institution = {Computing Research Repository},
number = {cs.LO/1210.2605},
url = {http://arxiv.org/abs/1210.2605},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGL-arxiv12.pdf},
originalpdf = {http://arxiv.org/pdf/1210.2605},
note = {19~pages},
abstract = {This document gives semantics to programs written in a C-like
programming language, featuring interactions with an external environment
with noisy and imprecise data.}
}
@inproceedings{BHP-simul12,
address = {Lisbon, Portugal},
month = nov,
year = 2012,
publisher = {XPS},
editor = {Dini, Petre and Lorenz, Pascal},
acronym = {{SIMUL}'12},
booktitle = {{P}roceedings of the 4th {I}nternational {C}onference on {A}dvances in
{S}ystem {S}imulation ({SIMUL}'12)},
author = {Barbot, Beno{\^\i}t and Haddad, Serge and Picaronny, Claudine},
title = {Importance Sampling for Model Checking of Continuous Time
{M}arkov Chains},
pages = {30-35},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHP-simul12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHP-simul12.pdf},
abstract = {Model checking real time properties on probabilistic systems
requires computing transient probabilities on continuous time Markov
chains. Beyond numerical analysis ability, a probabilistic framing can
only be obtained using simulation. This statistical approach fails when
directly applied to the estimation of very small probabilities. Here
combining the uniformization technique and extending our previous results,
we design a method which applies to continuous time Markov chains and
formulas of a timed temporal logic. The corresponding algorithm has been
implemented in our tool \textsc{cosmos}. We present experimentations on a
relevant system, with drastic time reductions with respect to standard
statistical model checking.}
}
@misc{verydic-d2,
author = {Iosif, Radu and Habermehl, Peter and Labbe, Sebastien and
Lozes, {\'E}tienne and Yakobowski, Boris},
title = {Concurrent Programs with Simple Data Structures {{\slash}}
Sequential Programs with Composite Data Structures},
howpublished = {Deliverable VERIDYC D~2 (ANR-09-SEGI-016)},
month = mar,
year = {2012},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/veridyc-d2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/veridyc-d2.pdf}
}
@inproceedings{LV-wsfm11,
address = {Clermont-Ferrand, France},
year = 2012,
volume = 7176,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Carbone, Marco and Petit, Jean-Marc},
acronym = {{WS-FM}'11},
booktitle = {{R}evised {S}elected {P}apers of the 8th {I}nternational {W}orkshop on {W}eb
{S}ervices and {F}ormal {M}ethods ({WS}-{FM}'11)},
author = {Lozes, {\'E}tienne and Villard, Jules},
title = {Reliable Contracts for Unreliable Half-Duplex Communications},
pages = {2-16},
doi = {10.1007/978-3-642-29834-9_2},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LV-wsfm11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LV-wsfm11.pdf},
abstract = {Recent trends in formal models of web services description
languages and session types focus on the asynchronicity of communications.
In this paper, we study a core of these models that arose from our
modelling of the Sing\# programming language, and demonstrate
correspondences between Sing\# contracts, asynchronous session behaviors,
and the subclass of communicating automata with two participants that
satisfy the half-duplex property. This correspondence better explains the
criteria proposed by Stengel and Bultan for Sing\# contracts to be
reliable, and possibly indicate useful criteria for the design of WSDL. We
moreover establish a polynomial-time complexity for the analysis of
communication contracts under arbitrary models of asynchronicity, and we
investigate the model-checking problems against LTL formulas.}
}
@inproceedings{LL-fics12,
address = {Tallinn, Estonia},
month = mar,
year = 2012,
volume = 77,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Miller, Dale and {\'E}sik, Zolt{\'a}n},
acronym = {{FICS}'12},
booktitle = {{P}roceedings of the 8th {W}orkshop on {F}ixed {P}oints in
{C}omputer {S}cience ({FICS}'12)},
author = {Lange, Martin and Lozes, {\'E}tienne},
title = {Model-Checking the Higher-Dimensional Modal \(\mu\)-Calculus},
pages = {39-46},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LL-fics12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LL-fics12.pdf},
doi = {10.4204/EPTCS.77.6},
abstract = {The higher-dimensional modal \(\mu\)-calculus is an extension of
the \(\mu\)-calculus in which formulas are interpreted in tuples of states
of a labeled transition system. Every property that can be expressed in
this logic can be checked in polynomial time, and conversely every
polynomial-time decidable problem that has a bisimulation-invariant
encoding into labeled transition systems can also be defined in the
higher-dimensional modal \(\mu\)-calculus. We exemplify the latter
connection by giving several examples of decision problems which reduce to
model checking of the higher-dimensional modal \(\mu\)-calculus for some fixed
formulas. This way generic model checking algorithms for the logic can
then be used via partial evaluation in order to obtain algorithms for
theses problems which may benefit from improvements that are
well-established in the field of program verification, namely on-the-fly
and symbolic techniques. The aim of this work is to extend such techniques
to other fields as well, here exemplarily done for process equivalences,
automata theory, parsing, string problems, and games.}
}
@inproceedings{CD-lics12,
address = {Dubrovnik, Croatia},
month = jun,
year = 2012,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'12},
booktitle = {{P}roceedings of the 27th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'12)},
author = {Chatterjee, Krishnendu and Doyen, Laurent},
title = {Partial-Observation Stochastic Games: How to Win when Belief Fails},
pages = {175-184},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-lics12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-lics12.pdf},
doi = {10.1109/LICS.2012.28},
abstract = {We consider two-player stochastic games played on finite graphs
with reachability objectives where the first player tries to ensure a
target state to be visited almost-surely (i.e., with probability~\(1\)),
or positively (i.e., with positive probability), no matter the strategy of
the second player.\par
We classify such games according to the information and the power of
randomization available to the players. On the basis of information, the
game can be one-sided with either (a)~player~1, or (b)~player~2 having
partial observation (and the other player has perfect observation), or
two-sided with (c)~both players having partial observation. On the basis
of randomization, the players (a)~may not be allowed to use randomization
(pure strategies), or (b)~may choose a probability distribution over
actions but the actual random choice is external and not visible to the
player (actions invisible), or (c)~may use full randomization.\par
Our main results for pure strategies are as follows. (1)~For one-sided
games with player~1 having partial observation we show that (in contrast
to full randomized strategies) belief-based (subset-construction based)
strategies are not sufficient, and we present an exponential upper bound
on memory both for almost-sure and positive winning strategies; we show
that the problem of deciding the existence of almost-sure and positive
winning strategies for player~1 is EXPTIME-complete. (2)~For one-sided
games with player~2 having partial observation we show that non-elementary
memory is both necessary and sufficient for both almost-sure and positive
winning strategies. (3)~We~show that for the general (two-sided) case
finite-memory strategies are sufficient for both positive and almost-sure
winning, and at least non-elementary memory is required.\par
We establish the equivalence of the almost-sure winning problems for pure
strategies and for randomized strategies with actions invisible. Our
equivalence result exhibits serious flaws in previous results of the
literature: we show a non-elementary memory lower bound for almost-sure
winning whereas an exponential upper bound was previously claimed.}
}
@article{CD-tcs12,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Chatterjee, Krishnendu and Doyen, Laurent},
title = {Energy parity games},
volume = 458,
year = 2012,
month = nov,
pages = {49-60},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-tcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-tcs12.pdf},
doi = {10.1016/j.tcs.2012.07.038},
abstract = {Energy parity games are infinite two-player turn-based games
played on weighted graphs. The objective of the game combines a
(qualitative) parity condition with the (quantitative) requirement that
the sum of the weights (i.e., the level of energy in the game) must remain
positive. Beside their own interest in the design and synthesis of
resource-constrained omega-regular specifications, energy parity games
provide one of the simplest model of games with combined qualitative and
quantitative objectives. Our main results are as follows: (a)~exponential
memory is sufficient and may be necessary for winning strategies in energy
parity games; (b)~the~problem of deciding the winner in energy parity
games can be solved in \(\textsf{NP} \cap \textsf{coNP}\); and (c)~we~give
an algorithm to solve energy parity by reduction to energy games. We also
show that the problem of deciding the winner in energy parity games is
logspace-equivalent to the problem of deciding the winner in mean-payoff
parity games, which can thus be solved in \(\textsf{NP} \cap
\textsf{coNP}\). As a consequence we also obtain a conceptually simple
algorithm to solve mean-payoff parity games.}
}
@misc{impro-D4.1,
author = {Balaguer, Sandie and Chatain, {\relax Th}omas and Haar, Stefan},
title = {Concurrent semantics for timed distributed systems},
howpublished = {Deliverable ImpRo D~4.1 (ANR-2010-BLAN-0317)},
year = 2012,
month = mar,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/impro-d41.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/impro-d41.pdf}
}
@misc{impro-D2.1,
author = {Akshay, S. and B{\'e}rard, B{\'e}atrice and Bouyer, Patricia
and Haar, Stefan and Haddad, Serge and Jard, Claude and
Lime, Didier and Markey, Nicolas and Reynier, Pierre-Alain
and Sankur, Ocan and Thierry-Mieg, Yann},
title = {Overview of Robustness in Timed Systems},
howpublished = {Deliverable ImpRo D~2.1 (ANR-2010-BLAN-0317)},
year = 2012,
month = jan,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/impro-d21.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/impro-d21.pdf}
}
@inproceedings{KS-stm12,
address = {Pisa, Italy},
month = sep,
year = 2012,
volume = 7783,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {J{\o}sang, Audun and Samarati, Pierangela and Petrocchi, Marinella},
acronym = {{STM}'12},
booktitle = {{R}evised {S}elected {P}apers of the 8th {W}orkshop
on {S}ecurity and {T}rust {M}anagement
({STM}'12)},
author = {K{\"u}nnemann, Robert and Steel, Graham},
title = {{Y}ubi{S}ecure? Formal Security Analysis Results for the
{Y}ubikey and {Y}ubi{HSM}},
pages = {257-272 },
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-stm12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-stm12.pdf},
doi = {10.1007/978-3-642-38004-4_17},
abstract = {The Yubikey is a small hardware device designed to authenticate
a user against network-based services. Despite its widespread adoption
(over a million devices have been shipped by Yubico to more than 20~000
customers including Google and Microsoft), the Yubikey protocols have
received relatively little security analysis in the academic literature.
In the first part of this paper, we give a formal model for the operation
of the Yubikey one-time password (OTP) protocol. We prove security
properties of the protocol for an unbounded number of fresh OTPs using a
protocol analysis tool, tamarin.\par
In the second part of the paper, we analyze the security of the protocol
with respect to an adversary that has temporary access to the
authentication server. To address this scenario, Yubico offers a small
Hardware Security Module (HSM) called the YubiHSM, intended to protect
keys even in the event of server compromise. We show if the same YubiHSM
configuration is used both to set up Yubikeys and run the authentication
protocol, then there is inevitably an attack that leaks all of the keys to
the attacker. Our discovery of this attack lead to a Yubico security
advisory in February 2012. For the case where separate servers are used
for the two tasks, we give a configuration for which we can show using the
same verification tool that if an adversary that can compromise the server
running the Yubikey-protocol, but not the server used to set up new
Yubikeys, then he cannot obtain the keys used to produce one-time
passwords.}
}
@article{BGKR-tcs12,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Berwanger, Dietmar and Gr{\"a}del, Erich and Kaiser, {\L}ukasz and
Rabinovich, Roman},
title = {Entanglement and the complexity of directed graphs},
volume = 463,
year = 2012,
month = dec,
pages = {2-25},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGKR-tcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGKR-tcs12.pdf},
doi = {10.1016/j.tcs.2012.07.010},
abstract = {Entanglement is a parameter for the complexity of
finite directed graphs that measures to which extent the cycles of
the graph are intertwined. It is defined by way of a game
similar in spirit to the cops and robber games used to
describe tree width, directed tree width, and hypertree width.
Nevertheless, on many classes of graphs, there are
significant differences between entanglement
and the various incarnations of tree width.\par
Entanglement is intimately related with the computational and
descriptive complexity of the modal \(\mu\)-calculus.
The number of fixed-point variables needed to
describe a finite graph up to bisimulation is captured by its
entanglement. This plays a crucial role in the proof
that the variable hierarchy of the \(\mu\)-calculus is strict.\par
We study complexity issues for entanglement and compare it to
other structural parameters of directed graphs.
One of our main results is that parity games of
bounded entanglement can be solved in polynomial time.
Specifically, we establish that the
complexity of solving a parity game can be parametrised in terms of
the minimal entanglement of subgames induced by a winning strategy.\par
Furthermore, we discuss the case of graphs of entanglement two.
While graphs of entanglement zero and one are very simple,
graphs of entanglement two allow arbitrary nesting of
cycles, and they form a sufficiently rich class for
modelling relevant classes of structured systems.
We provide characterisations
of this class, and propose decomposition notions similar
to the ones for tree width, DAG-width, and Kelly-width.}
}
@inproceedings{BKL-mfcs12,
address = {Bratislava, Slovakia},
month = aug,
year = 2012,
volume = 7464,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Rovan, Branislav and Sassone, Vladimiro and Widmayer, Peter},
acronym = {{MFCS}'12},
booktitle = {{P}roceedings of the 37th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'12)},
author = {Berwanger, Dietmar and Kaiser, {\L}ukasz and Le{\ss}enich, Simon},
title = {Solving Counter Parity Games},
pages = {160-171},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BKL-mfcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BKL-mfcs12.pdf},
doi = {10.1007/978-3-642-32589-2_17},
abstract = {We study a class of parity games equipped with counters
that evolve according to arbitrary non-negative
affine functions. These games capture several cost
models for dynamic systems from the literature. We
present an elementary algorithm for computing the
exact value of a counter parity game, which both
generalizes previous results and improves their
complexity. To this end, we introduce a class of
\(\omega\)-regular games with imperfect information
and imperfect recall, solve them using
automata-based techniques, and prove a
correspondence between finite-memory strategies in
such games and strategies in counter parity games.}
}
@proceedings{rp2012-FLP,
title = {{P}roceedings of the 6th
{I}nternational {W}okshop on {R}eachability {P}roblems
({RP}'12)},
booktitle = {{P}roceedings of the 6th
{I}nternational {W}okshop on {R}eachability {P}roblems
({RP}'12)},
acronym = {{RP}'12},
editor = {Finkel, Alain and Leroux, J{\'e}r{\^o}me and Potapov, Igor},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = 7550,
year = 2012,
month = sep,
address = {Bordeaux, France},
doi = {10.1007/978-3-642-33512-9},
url = {http://www.springerlink.com/content/978-3-642-33511-2/}
}
@article{BDHKO-jctB12,
publisher = {Elsevier Science Publishers},
journal = {Journal of Combinatorial Theory, Series~B},
author = {Berwanger, Dietmar and Dawar, Anuj and Hunter, Paul and Kreutzer, Staphan
and Obdrz{\'a}lek, Jan},
title = {The {DAG}-width of directed graphs},
volume = 102,
number = 4,
year = 2012,
month = jul,
pages = {900-923},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDHKO-jctB12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDHKO-jctB12.pdf},
doi = {10.1016/j.jctb.2012.04.004},
abstract = {Tree-width is a well-known metric on undirected graphs
that measures how tree-like a graph is and gives a
notion of graph decomposition that proves useful in
algorithm design. Tree-width can be characterised
by a graph searching game where a number of cops
attempt to capture a robber. We consider the
natural adaptation of this game to directed graphs
and show that monotone strategies in the game yield
a measure, called DAG-width, that can be seen to
describe how close a directed graph is to a directed
acyclic graph (DAG). We also provide an associated
decomposition and show how it is useful for
developing algorithms on directed graphs. In
particular, we show that the problem of determining
the winner of a parity game is solvable in
polynomial time on graphs of bounded DAG-width. We
also consider the relationship between DAG-width and
other connectivity measures such as directed
tree-width and path-width. A consequence we obtain
is that certain NP-complete problems such as
Hamiltonicity and disjoint paths are polynomial-time
computable on graphs of bounded DAG-width.}
}
@article{FLC-rts12,
publisher = {Springer},
journal = {Real-Time Systems},
author = {Faggioli, Dario and Lipari, Giuseppe and Cucinotta, Tommaso},
title = {Analysis and Implementation of the Multiprocessor Bandwidth
Inheritance Protocol},
volume = {48},
number = {6},
year = {2012},
month = nov,
pages = {789-825},
doi = {10.1007/s11241-012-9162-0},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FLC-rts12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FLC-rts12.pdf},
abstract = {The Multiprocessor Bandwidth Inheritance (M-BWI) protocol is an
extension of the Bandwidth Inheritance (BWI) protocol for symmetric
multiprocessor systems. Similar to Priority Inheritance, M-BWI lets a task
that has locked a resource execute in the resource reservations of the
blocked tasks, thus reducing their blocking time. The protocol is
particularly suitable for open systems where different kinds of tasks
dynamically arrive and leave, because it guarantees temporal isolation
among independent subsets of tasks without requiring any information on
their temporal parameters. Additionally, if the temporal parameters of the
interacting tasks are known, it is possible to compute an upper bound to
the interference suffered by a task due to other interacting tasks. Thus,
it is possible to provide timing guarantees for a subset of interacting
hard real-time tasks. Finally, the M-BWI protocol is neutral to the
underlying scheduling policy: it can be implemented in global, clustered
and semi-partitioned scheduling.\par
After introducing the M-BWI protocol, in this paper we formally prove its
isolation properties, and propose an algorithm to compute an upper bound
to the interference suffered by a task. Then, we describe our
implementation of the protocol for the LITMUS\textsuperscript{RT}
real-time testbed, and measure its overhead. Finally, we compare M-BWI
against FMLP and OMLP, two other protocols for resource sharing in
multiprocessor systems.}
}
@article{SLBC-rts12,
publisher = {Springer},
journal = {Real-Time Systems},
author = {Santos, Rodrigo M. and
Lipari, Giuseppe and
Bini, Enrico and
Cucinotta, Tommaso},
title = {On-line schedulability tests for adaptive reservations in
fixed priority scheduling},
volume = {48},
number = {5},
year = {2012},
month = sep,
pages = {601-634},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SLBC-rts12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SLBC-rts12.pdf},
doi = {10.1007/s11241-012-9156-y},
abstract = {Adaptive reservation is a real-time scheduling technique in
which each application is associated a fraction of the computational
resource (a reservation) that can be dynamically adapted to the varying
requirements of the application by using appropriate feedback control
algorithms. An adaptive reservation is typically implemented by using an
aperiodic server (e.g. sporadic server) algorithm with fixed period and
variable budget. When the feedback law demands an increase of the
reservation budget, the system must run a schedulability test to check if
there is enough spare bandwidth to accommodate such increase. The
schedulability test must be very fast, as it may be performed at each
budget update, i.e. potentially at each instance of a task; yet, it must
be as efficient as possible, to maximize resource usage.\par
In this paper, we tackle the problem of performing an efficient on-line
schedulability test for adaptive resource reservations in fixed priority
schedulers. In the literature, a number of algorithms have been proposed
for on-line admission control in fixed priority systems. We describe four
of these tests, with increasing complexity and performance. In addition,
we propose a novel on-line test, called Spare-Pot algorithm, which has
been specifically designed for the problem at hand, and which shows a good
cost/performance ratio compared to the other tests.}
}
@proceedings{atpn2012-HP,
title = {{P}roceedings of the 33rd
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({ICATPN}'12)},
booktitle = {{P}roceedings of the 33rd
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({ICATPN}'12)},
acronym = {{ICATPN}'12},
editor = {Haddad, Serge and Pomello, Lucia},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = 7347,
year = 2012,
month = jun,
address = {Hamburg, Germany},
doi = {10.1007/978-3-642-31131-4},
url = {http://www.springer.com/978-3-642-31131-4}
}
@inproceedings{FGL-pn12,
address = {Hamburg, Germany},
month = jun,
year = 2012,
volume = 7347,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Haddad, Serge and Pomello, Lucia},
acronym = {{PETRI~NETS}'12},
booktitle = {{P}roceedings of the 33rd
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'12)},
author = {Finkel, Alain and Goubault{-}Larrecq, Jean},
title = {The~Theory of~{WSTS}: The~Case of Complete~{WSTS}},
pages = {3-31},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FGL-atpn12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FGL-atpn12.pdf},
doi = {10.1007/978-3-642-31131-4_2},
abstract = {We describe a simple, conceptual forward analysis procedure for
\(\infty\)-complete WSTS~\(\mathfrak{S}\). This computes the so-called
\emph{clover} of a state. When \(\mathfrak{S}\) is the completion of a
WSTS~\(\mathfrak{X}\), the clover in~\(\mathfrak{S}\) is a finite
description of the downward closure of the reachability set. We show that
such completions are \(\infty\)-complete exactly when \(\mathfrak{X}\) is
an \emph{\(\omega^{2}\)-WSTS}, a new robust class of WSTS. We show that
our procedure terminates in more cases than the generalized Karp-Miller
procedure on extensions of Petri nets. We characterize the WSTS where our
procedure terminates as those that are \emph{clover-flattable}. Finally,
we apply this to well-structured Presburger counter systems.}
}
@inproceedings{BFP-fsttcs12,
address = {Hyderabad, India},
month = dec,
year = 2012,
volume = 18,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {D'Souza, Deepak and Radhakrishnan, Jaikumar and Telikepalli, Kavitha},
acronym = {{FSTTCS}'12},
booktitle = {{P}roceedings of the 32nd {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'12)},
author = {Bonnet, R{\'e}mi and Finkel, Alain and Praveen, M.},
title = {Extending the {R}ackoff technique to affine nets},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFP-fsttcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFP-fsttcs12.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2012.301},
abstract = {We study the possibility of extending the Rackoff
technique to Affine nets, which are Petri nets
extended with affine functions. The Rackoff
technique has been used for establishing \textsc{Expspace}
upper bounds for the coverability and boundedness
problems for Petri nets. We show that this technique
can be extended to strongly increasing Affine nets,
obtaining better upper bounds compared to known
results. The possible copies between places of a
strongly increasing Affine net make this extension
non-trivial. One cannot expect similar results for
the entire class of Affine nets since coverability
is Ackermann-hard and boundedness is
undecidable. Moreover, it can be proved that model
checking a logic expressing generalized coverability
properties is undecidable for strongly increasing
Affine nets, while it is known to be
\textsc{Expspace}-complete for Petri nets.}
}
@article{bs-ipl12,
publisher = {Elsevier Science Publishers},
journal = {Information Processing Letters},
author = {Berwanger, Dietmar and Serre, Olivier},
title = {Parity games on undirected graphs},
volume = 112,
number = 23,
year = 2012,
month = dec,
pages = {928-932},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/bs-ipl12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/bs-ipl12.pdf},
doi = {10.1016/j.ipl.2012.08.021},
abstract = {We examine the complexity of solving parity games in the special
case when the underlying game graph is undirected. For strictly
alternating games, that is, when the game graph is bipartite between the
players, we observe that the solution can be computed in linear time. In
contrast, when the assumption of strict alternation is dropped, we show
that the problem is as hard in the undirected case as it is in the
general, directed, case.}
}
@article{bbckrs-tcs12,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Baldan, Paolo and Bruni, Alessandro and Corradini, Andrea
and K{\"o}nig, Barbara and Rodr{\'\i}guez, C{\'e}sar and Schwoon, Stefan},
title = {Efficient unfolding of contextual {P}etri nets},
volume = 449,
number = 1,
year = 2012,
month = aug,
pages = {2-22},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/bbckrs-tcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/bbckrs-tcs12.pdf},
doi = {10.1016/j.tcs.2012.04.046},
abstract = {A contextual net is a Petri net extended with read arcs, which
allows transitions to check for tokens without consuming them. Contextual
nets allow for better modelling of concurrent read access than Petri nets,
and their unfoldings can be exponentially more compact than those of a
corresponding Petri net. A constructive but abstract procedure for
generating those unfoldings was proposed in previous work. However, it
remained unclear whether the approach was useful in practice and which data
structures and algorithms would be appropriate to implement it. Here, we
address this question. We provide two concrete methods for computing
contextual unfoldings, with a view to efficiency. We report on experiments
carried out on a number of benchmarks. These show that not only are
contextual unfoldings more compact than Petri net unfoldings, but they can
be computed with the same or better efficiency, in particular with respect
to alternative approaches based on encodings of contextual nets into Petri
nets.}
}
@inproceedings{BFKSST-crypto12,
address = {Santa Barbara, California, USA},
month = aug,
year = 2012,
volume = 7417,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Safavi-Naini, Reihaneh and Canetti, Ran},
acronym = {{CRYPTO}'12},
booktitle = {{P}roceedings of the 32nd {A}nnual {I}nternational
{C}ryptology {C}onference ({CRYPTO}'12)},
author = {Bardou, Romain and Focardi, Riccardo and Kawamoto, Yusuke and
Simionato, Lorenzo and Steel, Graham and Tsay, Joe-Kai},
title = {Efficient Padding Oracle Attacks on Cryptographic Hardware},
pages = {608-625},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFKSST-crypto12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFKSST-crypto12.pdf},
doi = {10.1007/978-3-642-32009-5_36},
abstract = {We show how to exploit the encrypted key import functions of a
variety of different cryptographic devices to reveal the imported key. The
attacks are padding oracle attacks, where error messages resulting from
incorrectly padded plaintexts are used as a side channel. In the
asymmetric encryption case, we modify and improve Bleichenbacher's attack
on RSA PKCS\#1v1.5 padding, giving new cryptanalysis that allows us to
carry out the 'million message attack' in a mean of 49 000 and median of
14 500 oracle calls in the case of cracking an unknown valid ciphertext
under a 1024 bit key (the original algorithm takes a mean of 215 000 and a
median of 163 000 in the same case). We show how implementation details of
certain devices admit an attack that requires only 9 400 operations on
average (3 800 median). For the symmetric case, we adapt Vaudenay's CBC
attack, which is already highly efficient. We demonstrate the
vulnerabilities on a number of commercially available cryptographic
devices, including security tokens, smartcards and the Estonian electronic
ID card. The attacks are efficient enough to be practical: we give timing
details for all the devices found to be vulnerable, showing how our
optimisations make a qualitative difference to the practicality of the
attack. We give mathematical analysis of the effectiveness of the attacks,
extensive empirical results, and a discussion of countermeasures.}
}
@article{GS-tocl12,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Gastin, Paul and Sznajder, Nathalie},
title = {Fair Synthesis for Asynchronous Distributed Systems},
nopages = {},
volume = 14,
number = {2:9},
month = jun,
year = 2013,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GS-tocl12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GS-tocl12.pdf},
doi = {10.1145/2480759.2480761},
abstract = {We study the synthesis problem in an asynchronous distributed
setting: a finite set of processes interact locally with an uncontrollable
environment and communicate with each other by sending signals---actions
controlled by a sender process and that are immediately received by the
target process. The fair synthesis problem is to come up with a local
strategy for each process such that the resulting fair behaviors of the
system meet a given specification. We consider external specifications
satisfying some natural closure properties related to the architecture. We
present this new setting for studying the fair synthesis problem for
distributed systems, and give decidability results for the subclass of
networks where communications happen through a strongly connected graph.
We claim that this framework for distributed synthesis is natural,
convenient and avoids most of the usual sources of undecidability for the
synthesis problem. Hence, it may open the way to a decidable theory of
distributed synthesis.}
}
@article{GS-ipl12,
publisher = {Elsevier Science Publishers},
journal = {Information Processing Letters},
author = {Gastin, Paul and Sznajder, Nathalie},
title = {Decidability of well-connectedness for distributed synthesis},
pages = {963-968},
volume = {112},
number = {24},
month = dec,
year = 2012,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GS-ipl12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GS-ipl12.pdf},
doi = {10.1016/j.ipl.2012.08.018},
abstract = {Although the synthesis problem is often undecidable for
distributed, synchronous systems, it becomes decidable for the subclass of
uniformly well-connected (UWC) architectures, provided that only robust
specifications are considered. It is then an important issue to be able to
decide whether a given architecture falls in this class. This is the
problem addressed in this paper: we establish the decidability and precise
complexity of checking this property. This problem is in EXPSPACE and
NP-hard in the general case, but falls into PSPACE when restricted to a
natural subclass of architectures.}
}
@article{BS-fmsd2012,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Bertrand, Nathalie and Schnoebelen, {\relax Ph}ilippe},
title = {Computable fixpoints in well-structured symbolic model
checking},
pages = {233-267},
volume = 43,
number = 2,
month = oct,
year = 2013,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-fmsd12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-fmsd12.pdf},
doi = {10.1007/s10703-012-0168-y},
abstract = {We prove a general finite-time convergence theorem for fixpoint
expressions over a well-quasi-ordered set. This has immediate applications
for the verification of well-structured systems, where a main issue is the
computability of fixpoint expressions, and in particular for
game-theoretical properties and probabilistic systems where nesting and
alternation of least and greatest fixpoints are common.}
}
@incollection{HM-lncis433,
author = {Haar, Stefan and Masopust, Tom{\'a}{\v{s}}},
title = {Languages, Decidability, and Complexity},
booktitle = {Control of Discrete-Event Systems~-- Automata and {P}etri Net Perspectives},
editor = {Seatzu, Carla and Silva, Manuel and van Schuppen, Jan H.},
year = {2013},
pages = {23-43},
publisher = {Springer},
series = {Lecture Notes in Control and Information Sciences},
volume = 433,
doi = {10.1007/978-1-4471-4276-8_2},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HM-lncis433.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HM-lncis433.pdf}
}
@incollection{HS-lncis433,
author = {Haar, Stefan and Fabre, {\'E}ric},
title = {Diagnosis with {P}etri Net Unfoldings},
booktitle = {Control of Discrete-Event Systems~-- Automata and {P}etri Net Perspectives},
editor = {Seatzu, Carla and Silva, Manuel and van Schuppen, Jan H.},
year = {2013},
pages = {301-318},
publisher = {Springer},
series = {Lecture Notes in Control and Information Sciences},
volume = 433,
doi = {10.1007/978-1-4471-4276-8_15},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HS-lncis433.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HS-lncis433.pdf}
}
@inproceedings{BDF-cdc12,
address = {Maui, Hawaii, USA},
month = dec,
year = 2012,
publisher = {{IEEE} Control System Society},
acronym = {{CDC}'12},
booktitle = {{P}roceedings of the 51st {IEEE} {C}onference on
{D}ecision and {C}ontrol ({CDC}'12)},
author = {Bu{\v{s}}i{\'c}, Ana and Djafri, Hilal and Fourneau,
Jean-Michel},
title = {Bounded state space truncation and censored {M}arkov chains},
pages = {5828-5833},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDF-cdc12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDF-cdc12.pdf},
doi = {10.1109/CDC.2012.6426156},
abstract = {Censored Markov chains (CMC) allow to represent the conditional
behavior of a system within a subset of observed states. They provide a
theoretical framework to study the truncation of a discrete-time Markov
chain when the generation of the state-space is too hard or when the
number of states is too large. However, the stochastic matrix of a CMC may
be difficult to obtain. Dayar \emph{et~al.} (2006) have proposed an
algorithm, called DPY, that computes a stochastic bounding matrix for a
CMC with a smaller complexity with only a partial knowledge of the chain.
We prove that this algorithm is optimal for the information they take into
account. We also show how some additional knowledge on the chain can
improve stochastic bounds for~CMC.}
}
@article{AFS-fmsd12,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Andr{\'e}, {\'E}tienne and Fribourg, Laurent and Sproston,
Jeremy},
title = {An~Extension of the Inverse Method to Probabilistic Timed
Automata},
year = 2013,
month = apr,
volume = 42,
number = 2,
pages = {119-145},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AFS-fmsd12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AFS-fmsd12.pdf},
doi = {10.1007/s10703-012-0169-x},
abstract = {Probabilistic timed automata can be used to model systems in
which probabilistic and timing behaviour coexist. Verification of
probabilistic timed automata models is generally performed with regard to
a single reference valuation pi0 of the timing parameters. Given such a
parameter valuation, we present a method for obtaining automatically a
constraint~\(K_0\) on timing parameters for which the reachability
probabilities (1)~remain invariant and (2)~are equal to the reachability
probabilities for the reference valuation. The method relies on parametric
analysis of a non-probabilistic version of the probabilistic timed
automata model using the {"}inverse method{"}. The method presents the
following advantages. First, since \(K_0\) corresponds to a dense domain
around pi0 on which the system behaves uniformly, it gives us a measure of
robustness of the system. Second, it allows us to obtain a valuation
satisfying \(K_0\) which is as small as possible while preserving
reachability probabilities, thus making the probabilistic analysis of the
system easier and faster in practice. We provide examples of the
application of our technique to models of randomized protocols, and
introduce an extension of the method allowing the generation of a
{"}probabilistic cartography{"} of a system.}
}
@inproceedings{jks-ifiptcs12,
address = {Amsterdam, The Netherlands},
month = sep,
year = 2012,
volume = {7604},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Baeten, Jos and Ball, Tom and de~Boer, Frank},
acronym = {{IFIP~TCS}'12},
booktitle = {{P}roceedings of the 7th {IFIP} {I}nternational
{C}onference on {T}heoretical {C}omputer
{S}cience
({IFIP~TCS}'12)},
author = {Jan\v{c}ar, Petr and Karandikar, Prateek and Schnoebelen,
{\relax Ph}ilippe},
title = {Unidirectional channel systems can be tested},
pages = {149-163},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JKS-ifiptcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JKS-ifiptcs12.pdf},
doi = {10.1007/978-3-642-33475-7_11},
abstract = {{"}Unidirectional channel systems{"} (Chambart~\& Schnoebelen,
CONCUR~2008) are systems where one-way communication from a sender to a
receiver goes via one reliable and one unreliable (unbounded fifo)
channel. Equipping these systems with the possibility of testing regular
properties on the contents of channels makes verification undecidable.
Decidability is preserved when only emptiness and nonemptiness tests are
considered: the proof relies on a series of reductions eventually allowing
us to take advantage of recent results on Post's Embedding Problem.}
}
@techreport{rr-lsv-12-16,
author = {Feld, Gilles and Fribourg, Laurent and Labrousse, Denis and
Revol, Bertrand and Soulat, Romain},
title = {Numerical simulation and physical experimentation of a
5-level and 7-level power converter under a control
designed by a formal method},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2012},
month = jul,
type = {Research Report},
number = {LSV-12-16},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-16.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-16.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2012-16-v1.pdf, 20120727},
note = {18~pages},
abstract = {High-power converters based on elementary switching cells are
more and more used in the industry of power electronics owing to various
advantages such as lower voltage stress and reduced power loss. However,
the complexity of controlling such converters is a major challenge that
the power manufacturing industry has to face with. The synthesis of
industrial switching controllers relies today on heuristic rules and
empiric simulation. There is no formal guarantee of correctness in zones
around nominal values. In [3], we have applied a backward-oriented formal
method to guarantee the good behavior of the systems within predefined
zones of variations for the input parameters. Here, for numerical
stability reasons, we choose to use a forward-oriented method. We apply
this method to a 5-level and 7-level power converters. We check the
correctness of our approach by numerical simulations and physical
experimentations.}
}
@article{AGG-lmcs12,
journal = {Logical Methods in Computer Science},
author = {Adj{\'e}, Assal{\'e} and Gaubert, St{\'e}phane and Goubault,
{\'E}ric},
title = {Coupling policy iteration with semi-definite relaxation to compute
accurate numerical invariants in static analysis},
year = 2012,
month = jan,
volume = {8},
number = {1:1},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AGG-lmcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGG-lmcs12.pdf},
doi = {10.2168/LMCS-8(1:01)2012},
abstract = {We introduce a new domain for finding precise numerical
invariants of programs by abstract interpretation. This domain, which
consists of level sets of non-linear functions, generalizes the domain of
linear {"}templates{"} introduced by Manna, Sankaranarayanan, and Sipma.
In the case of quadratic templates, we use Shor's semi-definite relaxation
to derive computable yet precise abstractions of semantic functionals, and
we show that the abstract fixpoint equation can be solved accurately by
coupling policy iteration and semi-definite programming. We demonstrate
the interest of our approach on a series of examples (filters, integration
schemes) including a degenerate one (symplectic scheme).}
}
@article{Fig-lmcs12,
journal = {Logical Methods in Computer Science},
author = {Figueira, Diego},
title = {Alternating register automata on finite words and trees},
year = 2012,
volume = {8},
number = {1:22},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/Fig-lmcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Fig-lmcs12.pdf},
doi = {10.2168/LMCS-8(1:22)2012},
abstract = {We study alternating register automata on data words and data
trees in relation to logics. A data word (resp. data tree) is a word
(resp. tree) whose every position carries a label from a finite alphabet
and a data value from an infinite domain. We investigate one-way automata
with alternating control over data words or trees, with one register for
storing data and comparing them for equality. This is a continuation of
the study started by Demri, Lazi{\'c} and Jurdzi{\'n}ski. From the standpoint of
register automata models, this work aims at two objectives:
(1)~simplifying the existent decidability proofs for the emptiness problem
for alternating register automata; and (2)~exhibiting decidable extensions
for these models. From the logical perspective, we show that (a)~in~the
case of data words, satisfiability of LTL with one register and
quantification over data values is decidable; and (b)~the~satisfiability
problem for the so-called forward fragment of XPath on XML documents is
decidable, even in the presence of DTDs and even of key constraints. The
decidability is obtained through a reduction to the automata model
introduced. This fragment contains the child, descendant, next-sibling and
following-sibling axes, as well as data equality and inequality tests.}
}
@article{BFLZ-lmcs12,
journal = {Logical Methods in Computer Science},
author = {Bonnet, R{\'e}mi and Finkel, Alain and Leroux, J{\'e}r{\^o}me and
Zeitoun, Marc},
title = {Model Checking Vector Addition Systems with one zero-test},
year = 2012,
volume = {8},
number = {2:11},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFLZ-lmcs12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFLZ-lmcs12.pdf},
doi = {10.2168/LMCS-8(2:11)2012},
abstract = {We design a variation of the Karp-Miller algorithm to compute,
in a forward manner, a finite representation of the cover (i.e., the
downward closure of the reachability set) of a vector addition system with
one zero-test. This algorithm yields decision procedures for several
problems for these systems, open until now, such as place-boundedness or
LTL model-checking. The proof techniques to handle the zero-test are based
on two new notions of cover: the refined and the filtered cover. The
refined cover is a hybrid between the reachability set and the classical
cover. It inherits properties of the reachability set: equality of two
refined covers is undecidable, even for usual Vector Addition Systems
(with no zero-test), but the refined cover of a Vector Addition System is
a recursive set. The second notion of cover, called the filtered cover, is
the central tool of our algorithms. It inherits properties of the
classical cover, and in particular, one can effectively compute a finite
representation of this set, even for Vector Addition Systems with one
zero-test.}
}
@phdthesis{lozes-HDR12,
author = {Lozes, {\'E}tienne},
title = {Separation Logic: Expressiveness and Copyless
Message-Passing},
year = 2012,
month = jul,
type = {M{\'e}moire d'habilitation},
school = {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-el12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-el12.pdf}
}
@techreport{rr-lsv-12-14,
author = {Feld, Gilles and Fribourg, Laurent and Labrousse, Denis and
Lefebvre, St{\'e}phane and Revol, Bertrand
and Soulat, Romain},
title = {Control of Multilevel Power Converters using Formal Methods},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2012},
month = jun,
type = {Research Report},
number = {LSV-12-14},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-14.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-14.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2012-14-v1.pdf, 20120626},
note = {14~pages},
abstract = {High-power converters based on elementary switching cells are
more and more used in the industry of power electronics owing to various
advantages such as lower voltage stress and reduced power loss. However,
the complexity of controlling such converters is a major challenge that
the power manufacturing industry has to face with. The synthesis of
industrial switching controllers relies today on heuristic rules and
empiric simulation. There is no formal guarantee of correctness in zones
around nominal values. It is therefore interesting to apply formal methods
to guarantee the good behavior of the systems within predefined zones of
variations for the input parameters. As far as we know, such formal
methods have been applied only to small electronic power devices (like
DC-DC boost converters) containing one switching cell. We show in this
paper that one can apply formal methods to more complicated systems, such
as multi-level converters containing several pairs of switching cells.}
}
@inproceedings{GM-ciaa12,
address = {Porto, Portugal},
month = jul,
year = 2012,
volume = {7381},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
editor = {Moreira, Nelma and Reis, Rog{\'e}rio},
acronym = {{CIAA}'12},
booktitle = {{P}roceedings of the 17th {I}nternational
{C}onference on {I}mplementation and
{A}pplication of {A}utomata
({CIAA}'12)},
author = {Gastin, Paul and Monmege, Benjamin},
title = {Adding Pebbles to Weighted Automata},
pages = {28-51},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GM-ciaa12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GM-ciaa12.pdf},
doi = {10.1007/978-3-642-31606-7_4},
abstract = {We extend weighted automata and weighted rational expressions
with 2-way moves and (reusable) pebbles. We show with examples from
natural language modeling and quantitative model-checking that weighted
expressions and automata with pebbles are more expressive and allow much
more natural and intuitive specifications than classical ones.\par
We extend Kleene-Sch{\"u}tzenberger theorem showing that weighted
expressions and automata with pebbles have the same expressive power. We
focus on an efficient translation from expressions to automata.\par
We also prove that the evaluation problem for weighted automata can be
done very efficiently if the number of (reusable) pebbles is low.}
}
@inproceedings{BGMZ-atva12,
address = {Thiruvananthapuram, India},
month = oct,
year = {2012},
volume = {7561},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Mukund, Madhavan and Chakraborty, Supratik},
acronym = {{ATVA}'12},
booktitle = {{P}roceedings of the 10th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'12)},
author = {Bollig, Benedikt and Gastin, Paul and Monmege, Benjamin and
Zeitoun, Marc},
title = {A Probabilistic {K}leene Theorem},
pages = {400-415},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGMZ-atva12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGMZ-atva12.pdf},
doi = {10.1007/978-3-642-33386-6_31},
abstract = {We provide a Kleene Theorem for (Rabin) probabilistic automata
over finite words. Probabilistic automata generalize deterministic finite
automata and assign to a word an acceptance probability. We provide
probabilistic expressions with probabilistic choice, guarded choice,
concatenation, and a star operator. We prove that probabilistic
expressions and probabilistic automata are expressively equivalent. Our
result actually extends to two-way probabilistic automata with pebbles and
corresponding expressions.}
}
@phdthesis{djafri-phd2011,
author = {Djafri, Hilal},
title = {Approches num{\'e}riques et statistiques pour le model checking
des processus stochastiques},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2012,
month = jun,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/djafri-these11.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/djafri-these11.pdf}
}
@inproceedings{CD-aiml12,
address = {Copenhagen, Denmark},
month = aug,
year = 2012,
publisher = {College Publications},
editor = {Bolander, Thomas and Bra{\"u}ner, Torben and Ghilardi, Silvio and Moss, Lawrence},
acronym = {{AiML}'12},
booktitle = {{S}elected {P}apers from the 9th
{W}orkshop on {A}dvances in {M}odal {L}ogics
({AiML}'12)},
author = {Carreiro, Facundo and Demri, St{\'e}phane},
title = {Beyond Regularity for {P}resburger Modal Logics},
pages = {161-182},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-aiml12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-aiml12.pdf},
abstract = {Satisfiability problem for modal logic~K with quantifier-free
Presburger and regularity constraints~(EML) is known to be
pspace-complete. In this paper, we consider its extension with nonregular
constraints, and more specifically those expressed by visibly pushdown
languages~(VPL). This class of languages behaves nicely, in particular
when combined with Propositional Dynamic Logic~(PDL). By extending EML, we
show that decidability is preserved if we allow at most one positive
VPL-constraint at each modal depth. However, the presence of two
VPL-contraints or the presence of a negative occurrence of a single
VPL-constraint leads to undecidability. These results contrast with the
decidability of PDL augmented with VPL-constraints.}
}
@inproceedings{PHL-tap12,
address = {Prague, Czech Republic},
month = may # {-} # jun,
year = 2012,
volume = 7305,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Brucker, Achim D. and Julliand, Jacques},
acronym = {{TAP}'12},
booktitle = {{P}roceedings of the 6th {I}nternational {C}onference
on {T}ests and {P}roofs ({TAP}'12)},
author = {Ponce{ }de{~}Le{\'o}n, Hern{\'a}n and Haar, Stefan and Longuet, Delphine},
title = {Conformance Relations for Labeled Event Structures},
pages = {83-98},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/PHL-tap12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/PHL-tap12.pdf},
doi = {10.1007/978-3-642-30473-6_8},
abstract = {We propose a theoretical framework for testing concurrent
systems from true concurrency models like Petri nets or networks of
automata. The underlying model of computation of such formalisms are
labeled event structures, which allow to represent concurrency explicitly.
The activity of testing relies on the definition of a conformance relation
that depends on the observable behaviors on the system under test, which
is given for sequential systems by ioco type relations. However, these
relations are not capable of capturing and exploiting concurrency of non
sequential behavior. We~study different conformance relations for labeled
event structures, relying on different notions of observation, and
investigate their properties and connections.}
}
@inproceedings{HSS-lics2012,
address = {Dubrovnik, Croatia},
month = jun,
year = 2012,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'12},
booktitle = {{P}roceedings of the 27th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'12)},
author = {Haddad, Serge and Schmitz, Sylvain and Schnoebelen, {\relax Ph}ilippe},
title = {The Ordinal-Recursive Complexity of Timed-Arc {P}etri
Nets, Data Nets, and Other Enriched Nets},
pages = {355-364},
url = {http://hal.archives-ouvertes.fr/hal-00793811},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HSS-lics12.pdf},
doi = {10.1109/LICS.2012.46},
abstract = {We show how to reliably compute fast-growing functions
with timed-arc Petri nets and data nets. This
construction provides ordinal-recursive lower bounds
on the complexity of the main decidable properties
(safety, termination, regular simulation,~etc.) of
these models. Since these new lower bounds match the
upper bounds that one can derive from wqo theory,
they precisely characterise the computational power
of these so-called {"}enriched{"} nets.}
}
@inproceedings{DDS-ijcar12,
address = {Manchester, UK},
month = jun,
year = 2012,
volume = {7364},
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer-Verlag},
editor = {Gramlich, Bernhard and Miller, Dale and Sattler, Uli},
acronym = {{IJCAR}'12},
booktitle = {{P}roceedings of the 6th {I}nternational {J}oint
{C}onference on {A}utomated {R}easoning
({IJCAR}'12)},
author = {Demri, St{\'e}phane and Dhar, Amit Kumar and Sangnier, Arnaud},
title = {Taming Past {LTL} and Flat Counter Systems},
pages = {179-193},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-ijcar12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-ijcar12.pdf},
doi = {10.1007/978-3-642-31365-3_16},
abstract = {Reachability and LTL model-checking problems for flat counter
systems are known to be decidable but whereas the reachability problem can
be shown in NP, the best known complexity upper bound for the latter
problem is made of a tower of several exponentials. Herein, we show that
the problem is only NP-complete even if LTL admits past-time operators and
arithmetical constraints on counters. Actually, the NP upper bound is shown
by adequately combining a new stuttering theorem for Past LTL and the
property of small integer solutions for quantifier-free Presburger
formulae. Other complexity results are proved, for instance for restricted
classes of flat counter systems.}
}
@inproceedings{RS-concur12,
address = {Newcastle, UK},
month = sep,
year = 2012,
volume = 7454,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Koutny, Maciej and Ulidowski, Irek},
acronym = {{CONCUR}'12},
booktitle = {{P}roceedings of the 23rd
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'12)},
author = {Rodr{\'\i}guez, C{\'e}sar and Schwoon, Stefan},
title = {Verification of {P}etri Nets with Read Arcs},
pages = {471-485},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/RS-concur12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/RS-concur12.pdf},
doi = {10.1007/978-3-642-32940-1_33},
abstract = {Recent work studied the unfolding construction for contextual
nets, i.e. nets with read arcs. Such unfoldings are more concise and can
usually be constructed more efficiently than for Petri nets. However,
concrete verification algorithms exploiting these advantages were lacking
so far. We address this question and propose SAT-based verification
algorithms for deadlock and reachability of contextual nets. Moreover, we
study optimizations of the SAT encoding and report on experiments.}
}
@inproceedings{CGN-concur12,
address = {Newcastle, UK},
month = sep,
year = 2012,
volume = 7454,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Koutny, Maciej and Ulidowski, Irek},
acronym = {{CONCUR}'12},
booktitle = {{P}roceedings of the 23rd
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'12)},
author = {Cyriac, Aiswarya and Gastin, Paul and Narayan Kumar, K.},
title = {{MSO} Decidability of Multi-Pushdown Systems via Split-Width},
pages = {547-561},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CGN-concur12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CGN-concur12.pdf},
doi = {10.1007/978-3-642-32940-1_38},
abstract = {Multi-threaded programs with recursion are naturally modeled as
multi-pushdown systems. The behaviors are represented as multiply nested
words (MNWs), which are words enriched with additional binary relations
for each stack matching a push operation with the corresponding pop
operation. Any MNW can be decomposed by two basic and natural operations:
shuffle of two sequences of factors and merge of consecutive factors of a
sequence. We say that the split-width of a MNW is~\(k\) if it admits a
decomposition where the number of factors in each sequence is at most~\(k\).
The MSO theory of MNWs with split-width~\(k\) is decidable. We introduce two
very general classes of MNWs that strictly generalize known decidable
classes and prove their MSO decidability via their split-width and obtain
comparable or better bounds of tree-width of known classes.}
}
@inproceedings{BGS-concur12,
address = {Newcastle, UK},
month = sep,
year = 2012,
volume = 7454,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Koutny, Maciej and Ulidowski, Irek},
acronym = {{CONCUR}'12},
booktitle = {{P}roceedings of the 23rd
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'12)},
author = {Brenguier, Romain and G{\"o}ller, Stefan and Sankur, Ocan},
title = {A~Comparison of Succinctly Represented Finite-State Systems},
pages = {147-161},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGS-concur12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGS-concur12.pdf},
doi = {10.1007/978-3-642-32940-1_12},
abstract = {We study the succinctness of different classes of succinctly
presented finite transition systems with respect to bisimulation
equivalence. Our results show that synchronized product of finite
automata, hierarchical graphs, and timed automata are pairwise
incomparable in this sense. We moreover study the computational complexity
of deciding simulation preorder and bisimulation equivalence on these
classes.}
}
@inproceedings{BHSS-concur12,
address = {Newcastle, UK},
month = sep,
year = 2012,
volume = 7454,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Koutny, Maciej and Ulidowski, Irek},
acronym = {{CONCUR}'12},
booktitle = {{P}roceedings of the 23rd
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'12)},
author = {B{\'e}rard, B{\'e}atrice and Haddad, Serge and Sassolas,
Mathieu and Sznajder, Nathalie},
title = {Concurrent Games on~{VASS} with Inhibition},
pages = {39-52},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHSS-CONCUR12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHSS-CONCUR12.pdf},
doi = {10.1007/978-3-642-32940-1_5},
abstract = {We propose to study concurrent games on a new extension of
Vector Addition Systems with States, where inhibition conditions are added
for modeling purposes. Games are a well-suited framework to solve control
problems, and concurrent semantics reflect realistic situations where the
environment can always produce a move before the controller, although it
is never required to do so. This is in contrast with previous works, which
focused mainly on turn-based semantics. Moreover, we consider asymmetric
games, where environment and controller do not have the same capabilities,
although they both have restricted power. In this setting, we investigate
reachability and safety objectives, which are not dual to each other
anymore, and we prove that (i)~reachability games are undecidable for
finite targets, (ii)~they are 2-EXPTIME-complete for upward-closed targets
and (iii)~safety games are co-NP-complete for finite, upward-closed and
semi-linear targets. Moreover, for the decidable cases, we build a finite
representation of the corresponding controllers.}
}
@inproceedings{BC-concur12,
address = {Newcastle, UK},
month = sep,
year = 2012,
volume = 7454,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Koutny, Maciej and Ulidowski, Irek},
acronym = {{CONCUR}'12},
booktitle = {{P}roceedings of the 23rd
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'12)},
author = {Balaguer, Sandie and Chatain, {\relax Th}omas},
title = {Avoiding Shared Clocks in Networks of Timed Automata},
pages = {100-114},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BC-concur12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BC-concur12.pdf},
doi = {10.1007/978-3-642-32940-1_9},
abstract = {Networks of timed automata~(NTA) are widely used to model
distributed real-time systems. Quite often in the literature, the automata
are allowed to share clocks. This is a problem when one considers
implementing such model in a distributed architecture, since reading
clocks a priori requires communications which are not explicitly described
in the model. We focus on the following question: given a NTA \(A_{1}
\parallel A_{2}\) where \(A_{2}\) reads some clocks reset by~\(A_{1}\),
does there exist a NTA \(A'_{1} \parallel A'_{2}\) without shared clocks
with the same behavior as the initial NTA? For this, we allow the automata
to exchange information during synchronizations only. We discuss a
formalization of the problem and give a criterion using the notion of
contextual timed transition system, which represents the behavior
of~\(A_{2}\) when in parallel with~\(A_{1}\). Finally, we effectively
build \(A'_{1} \parallel A'_{2}\) when it exists.}
}
@inproceedings{DLM-concur12,
address = {Newcastle, UK},
month = sep,
year = 2012,
volume = 7454,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Koutny, Maciej and Ulidowski, Irek},
acronym = {{CONCUR}'12},
booktitle = {{P}roceedings of the 23rd
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'12)},
author = {Da{~}Costa, Arnaud and Laroussinie, Fran{\c{c}}ois and
Markey, Nicolas},
title = {Quantified {CTL}: expressiveness and model checking},
pages = {177-192},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DLM-concur12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DLM-concur12.pdf},
doi = {10.1007/978-3-642-32940-1_14},
abstract = {While it was defined long ago, the extension of CTL with
quantification over atomic propositions has never been studied
extensively. Considering two different semantics (depending whether
propositional quantification refers to the Kripke structure or to its
unwinding tree), we study its expressiveness (showing in particular that
QCTL coincides with Monadic Second-Order Logic for both semantics) and
characterize the complexity of its model-checking problem, depending on
the number of nested propositional quantifiers (showing that the structure
semantics populates the polynomial hierarchy while the tree semantics
populates the exponential hierarchy). We also show how these results apply
to model checking ATL-like temporal logics for games.}
}
@inproceedings{FLMS-time12,
address = {Leicester, UK},
month = sep,
year = 2012,
publisher = {{IEEE} Computer Society Press},
editor = {Reynolds, Mark and Terenziani, Paolo and Moszkowski, Ben},
acronym = {{TIME}'12},
booktitle = {{P}roceedings of the 19th {I}nternational {S}ymposium on
{T}emporal {R}epresentation and {R}easoning
({TIME}'12)},
author = {Fribourg, Laurent and Lesens, David and Moro, Pierre and
Soulat, Romain},
title = {Robustness Analysis for Scheduling Problems using the Inverse
Method},
pages = {73-80},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FLMS-time12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FLMS-time12.pdf},
doi = {10.1109/TIME.2012.10},
abstract = {Given a Parametric Timed Automaton (PTA)~\(\mathcal{A}\) and a
tuple~\(\pi_{0}\) of reference valuations for timings, the \emph{Inverse
Method~(IM)} synthesizes a constraint around~\(\pi_{0}\) where
\(\mathcal{A}\) behaves in the same time-abstract manner. This provides us
with a quantitative measure of robustness of the behavior
of~\(\mathcal{A}\) around~\(\pi_{0}\). We~show in this paper how
\textit{IM} can be applied in a specific way to treat the robustness of
scheduling systems. We also explain how to use the method in order to
synthesize large zones of the timing parameter space where the system is
guaranteed to be schedulable. We illustrate the method on several examples
of the literature as well as a case study originating from an industrial
design project.}
}
@inproceedings{AFKS12,
address = {Paris, France},
month = aug,
year = 2012,
volume = {7436},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Giannakopoulou, Dimitra and M{\'e}ry, Dominique},
acronym = {{FM}'12},
booktitle = {{P}roceedings of the 18th {I}nternational {S}ymposium on {F}ormal
{M}ethods ({FM}'12)},
author = {Andr{\'e}, {\'E}tienne and Fribourg, Laurent and K{\"u}hne,
Ulrich and Soulat, Romain},
title = {{IMITATOR}~2.5: A~Tool for Analyzing Robustness in Scheduling
Problems},
pages = {33-36},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AFKS-fm12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AFKS-fm12.pdf},
doi = {10.1007/978-3-642-32759-9_6},
abstract = {The tool \textsc{Imitator} implements the \emph{Inverse
Method~(IM)} for Timed Automata~(TAs). Given a TA~\(\mathcal{A}\) and a
tuple~\(\pi_{0}\) of reference valuations for timings, \textit{IM}
synthesizes a constraint around~\(\pi_{0}\) where \(\mathcal{A}\) behaves
in the same discrete manner. This provides us with a quantitative measure
of robustness of the behavior of~\(\mathcal{A}\) around~\(\pi_{0}\). The
new version \textsc{Imitator}~2.5 integrates the new features of
stopwatches (in~addition to standard clocks) and updates (in addition to
standard clock resets), as well as powerful algorithmic improvements for
state space reduction. These new features make the tool well-suited to
analyze the robustness of solutions in several classes of preemptive
scheduling problems.}
}
@inproceedings{AMH-safep12,
address = {Mexico City, Mexico},
month = aug,
year = 2012,
publisher = {IFAC},
acronym = {{SAFEPROCESS}'12},
booktitle = {{P}roceedings of the 8th {IFAC} {S}ymposium on {F}ault {D}etection,
{S}upervision and {S}afety for {T}echnical {P}rocesses ({SAFEPROCESS}'12)},
author = {Agarwal, Anoopam and Madalinski, Agnes and Haar, Stefan},
title = {Effective Verification of Weak Diagnosability},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AMH-safep12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AMH-safep12.pdf},
doi = {10.3182/20120829-3-MX-2028.00083},
abstract = {The \emph{diagnosability} problem can be stated as follows: does
a given labeled Discrete Event System allow for an outside observer to
determine the occurrence of the {"}invisible{"} fault, no later than a
bounded number of events after that unobservable occurrence, and based on
the partial observation of the behaviour? When this problem is
investigated in the context of concurrent systems, partial order semantics
induces a separation between classical or strong diagnosability on the one
hand, and \emph{weak diagnosability} on the other hand. The present paper
presents the first solution for checking weak diagnosability, via a
\emph{verifier} construction.}
}
@inproceedings{BBJM-qest12,
address = {London, UK},
month = sep,
year = 2012,
publisher = {{IEEE} Computer Society Press},
acronym = {{QEST}'12},
booktitle = {{P}roceedings of the 9th {I}nternational
{C}onference on {Q}uantitative
{E}valuation of {S}ystems
({QEST}'12)},
author = {Bouyer, Patricia and Brihaye, {\relax Th}omas and
Jurdzi{\'n}ski, Marcin and Menet, Quentin},
title = {Almost-Sure Model-Checking of Reactive Timed Automata},
pages = {138-147},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBJM-qest12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBJM-qest12.pdf},
doi = {10.1109/QEST.2012.10},
abstract = {We consider the model of stochastic timed automata, a model in
which both delays and discrete choices are made probabilistically. We are
interested in the almost-sure model-checking problem, which asks whether
the automaton satisfies a given property with probability~\(1\). While
this problem was shown decidable for single-clock automata few years ago,
it was also proven that the algorithm for this decidability result could
not be used for general timed automata. In this paper we describe the
subclass of reactive timed automata, and we prove decidability of the
almost-sure model-checking problem under that restriction. Decidability
relies on the fact that this model is almost-surely fair. As a desirable
property of real systems, we show that reactive automata are almost-surely
non-Zeno. Finally we show that the almost-sure model-checking problem can
be decided for specifications given as deterministic timed automata.}
}
@inproceedings{BLM-qest12,
address = {London, UK},
month = sep,
year = 2012,
publisher = {{IEEE} Computer Society Press},
acronym = {{QEST}'12},
booktitle = {{P}roceedings of the 9th {I}nternational
{C}onference on {Q}uantitative
{E}valuation of {S}ystems
({QEST}'12)},
author = {Bouyer, Patricia and Larsen, Kim G. and Markey, Nicolas},
title = {Lower-Bound Constrained Runs in Weighted Timed Automata},
pages = {128-137},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BLM-qest12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BLM-qest12.pdf},
doi = {10.1109/QEST.2012.28},
noontract = {},
abstract = {We investigate a number of problems related to infinite runs of
weighted timed automata, subject to lower-bound constraints on the
accumulated weight. Closing an open problem from [Bouyer \textit{et~al.},
{"}Infinite runs in weighted timed automata with energy constraints{"},
FORMATS'08], we show that the existence of an infinite
lower-bound-constrained run is---for us somewhat
unexpectedly---undecidable for weighted timed automata with four or more
clocks.\par
This undecidability result assumes a fixed and know initial credit. We
show that the related problem of existence of an initial credit for which
there ex- ist a feasible run is decidable in PSPACE. We also investigate
the variant of these problems where only bounded-duration runs are
considered, showing that this restriction makes our original problem
decidable in NEXPTIME. Finally, we prove that the universal versions of
all those problems (i.e, checking that all the considered runs satisfy the
lower-bound constraint) are decidable in PSPACE.}
}
@article{BMOSW-fac12,
publisher = {Springer},
journal = {Formal Aspects of Computing},
author = {Bouyer, Patricia and Markey, Nicolas and Ouaknine, Jo{\"e}l
and Schnoebelen, {\relax Ph}ilippe and Worrell, James},
title = {On Termination and Invariance for Faulty Channel Systems},
year = 2012,
month = jul,
volume = 24,
number = {4-6},
pages = {595-607},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMOSU-fac12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMOSU-fac12.pdf},
doi = {10.1007/s00165-012-0234-7},
abstract = {A~\emph{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}, i.e.,
machines in whose channels messages can spontaneously appear. We consider
the invariance problem: does a given insertion channel machine have an
infinite computation all of whose configurations satisfy a given
predicate? We show that this problem is primitive-recursive if the
predicate is closed under message losses. We also give a non-elementary
lower bound for the invariance problem under this restriction. Finally,
using the previous result, we show that the satisfiability problem for the
safety fragment of Metric Temporal Logic is non-elementary.}
}
@inproceedings{BDL-tase12,
address = {Beijing, China},
month = jul,
year = 2012,
publisher = {{IEEE} Computer Society Press},
noeditor = {},
acronym = {{TASE}'12},
booktitle = {{P}roceedings of the 6th {I}nternational {S}ymposium
on {T}heoretical {A}spects of {S}oftware {E}ngineering
({TASE}'12)},
author = {Bollig, Benedikt and Decker, Normann and Leucker, Martin},
title = {Frequency Linear-time Temporal Logic},
pages = {85-92},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDL-tase12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDL-tase12.pdf},
doi = {10.1109/TASE.2012.43},
abstract = {We propose fLTL, an extension to linear-time temporal logic
(LTL) that allows for expressing relative frequencies by a generalization
of temporal operators. This facilitates the specification of requirements
such as the deadlines in a real-time system must be met in at least~\(95\%\)
of all cases. For our novel logic, we establish an undecidability result
regarding the satisfiability problem but identify a decidable fragment
which strictly increases the expressiveness of LTL by allowing, e.g., to
express non-context-free properties.}
}
@inproceedings{IL-pairing12,
address = {Cologne, Germany},
month = may,
year = 2012,
volume = 7708,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abdalla, Michel and Lange, Tanja},
acronym = {{PAIRING}'12},
booktitle = {{P}roceedings of the 5th {I}nternational
{C}onference on {P}airing-Based {C}ryptography
({PAIRING}'12)},
author = {Izabach{\`e}ne, Malika and Libert, Beno{\^\i}t},
title = {Divisible E-Cash in the Standard Model},
pages = {314-332},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/IL-pairing12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/IL-pairing12.pdf},
doi = {10.1007/978-3-642-36334-4_20},
abstract = {Off-line e-cash systems are the digital analogue of regular
cash. One of the main desirable properties is anonymity: spending a coin
should not reveal the identity of the spender and, at the same time, users
should not be able to double-spend coins without being detected. Compact
e-cash systems make it possible to store a wallet of \(O(2^{L})\) coins
using \(O(L + \lambda)\) bits, where \(\lambda\) is the security
parameter. They are called \emph{divisible} whenever the user has the
flexibility of spending an amount of~\(2^{\ell}\), for some \(\ell\leq
L\), more efficiently than by repeatedly spending individual coins. This
paper presents the first construction of divisible e-cash in the standard
model (i.e., without the random oracle heuristic). The scheme allows a
user to obtain a wallet of~\(2^{L}\) coins by running a withdrawal
protocol with the bank. Our construction is built on the traditional
binary tree approach, where the wallet is organized in such a way that the
monetary value of a coin depends on how deep the coin is in the tree.}
}
@inproceedings{BMS-icalp12,
address = {Warwick, UK},
month = jul,
year = 2012,
volume = {7392},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Czumaj, Artur and Mehlhorn, Kurt and Pitts, Andrew and Wattenhofer, Roger},
acronym = {{ICALP}'12},
booktitle = {{P}roceedings of the 39th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'12)~-- {P}art~{II}},
author = {Bouyer, Patricia and Markey, Nicolas and Sankur, Ocan},
title = {Robust Reachability in Timed Automata: A~Game-based
Approach},
pages = {128-140},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-icalp12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-icalp12.pdf},
doi = {10.1007/978-3-642-31585-5_15},
abstract = {Reachability checking is one of the most basic problems in
verification. By solving this problem, one synthesizes a strategy that
dictates the actions to be performed for ensuring that the target location
is reached. In this work, we are interested in synthesizing {"}robust{"}
strategies for ensuring reachability of a location in a timed automaton;
with {"}robust{"}, we mean that it must still ensure reachability even
when the delays are perturbed by the environment. We model this perturbed
semantics as a game between the controller and its environment, and solve
the parameterized robust reachability problem: we show that the existence
of an upper bound on the perturbations under which there is a strategy
reaching a target location is EXPTIME-complete.}
}
@incollection{topnoc12-ehh,
year = 2012,
volume = 6900,
series = {Lecture Notes in Computer Science},
editor = {Jensen, Kurt and Donatelli, Susanna and Kleijn, Jetty},
publisher = {Springer},
booktitle = {Transactions on {P}etri Nets and Other Models of Concurrency~{V}},
author = {El{~}Hog{-}Benzina, Dorsaf and Haddad, Serge and Hennicker, Rolf},
title = {Refinement and Asynchronous Composition of Modal {P}etri Nets},
pages = {96-120},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/topnoc12-ehh.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/topnoc12-ehh.pdf},
doi = {10.1007/978-3-642-29072-5_4},
abstract = {We propose a framework for the specification of infinite state
systems based on Petri nets with distinguished \emph{may}- and
\emph{must}-transitions (called modalities) which specify the allowed and
the required behavior of refinements and hence of implementations. For any
modal Petri net, we define its generated modal language specification
which abstracts away silent transitions. On this basis we consider
refinements of modal Petri nets by relating their generated modal language
specifications. We show that this refinement relation is decidable if the
underlying modal Petri nets are weakly deterministic. We also show that
the membership problem for the class of weakly deterministic modal Petri
nets is decidable. As an important application scenario of our approach we
consider I/O-Petri nets and their asynchronous composition which typically
leads to an infinite state system.}
}
@inproceedings{benzina-dictap12,
address = {Bangkok, Thailand},
month = may,
year = 2012,
publisher = {{IEEE} Computer Society Press},
acronym = {{DICTAP}'12},
booktitle = {{P}roceedings of the 2nd {I}nternational {C}onference on {D}igital
{I}nformation and {C}ommunication {T}echnology and its
{A}pplication ({DICTAP}'12)},
author = {Benzina, Hedi},
title = {Towards Designing Secure Virtualized Systems},
pages = {250-255},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HB-dictap12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HB-dictap12.pdf},
doi = {10.1109/DICTAP.2012.6215385},
abstract = {Virtual machine technology is rapidly gaining acceptance as a
fundamental building block in enterprise data centers. It is most known
for improving efficiency and ease of management. However, it also provides
a compelling approach to enhancing system security, offering new ways to
rearchitect todays systems and opening the door for a wide range of future
security technologies. While this technology is meant to enhance the
security of computer systems, some recent attacks show that virtual
machine technology has many weaknesses and becomes exposed to many
security threats. In this paper we present some of these threats and show
how we protect these systems through intrusion detection and security
policies mechanisms.}
}
@article{jcss12-DJLL,
publisher = {Elsevier Science Publishers},
journal = {Journal of Computer and System Sciences},
author = {Demri, St{\'e}phane and Jurdzi{\'n}ski, Marcin and Lachish, Oded and
Lazi{\'c}, Ranko},
title = {The covering and boundedness problems for branching
vector addition systems},
year = {2012},
volume = 79,
number = 1,
pages = {23-38},
month = feb,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/djll-jcss12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/djll-jcss12.pdf},
doi = {10.1016/j.jcss.2012.04.002},
abstract = {The covering and boundedness problems for branching vector
addition systems are shown complete for doubly-exponential time.}
}
@inproceedings{ACD-csf12,
address = {Cambridge Massachusetts, USA},
month = jun,
year = 2012,
publisher = {{IEEE} Computer Society Press},
acronym = {{CSF}'12},
booktitle = {{P}roceedings of the
25th {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'12)},
author = {Arapinis, Myrto and Cheval, Vincent and Delaune, St{\'e}phanie},
title = {Verifying privacy-type properties in a modular way},
pages = {95-109},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ACD-csf12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACD-csf12.pdf},
doi = {10.1109/CSF.2012.16},
abstract = {Formal methods have proved their usefulness for analysing the
security of protocols. In this setting, privacy-type security properties
(e.g. vote-privacy, anonymity, unlinkability) that play an important role
in many modern applications are formalised using a notion of
equivalence.\par
In this paper, we study the notion of trace equivalence and we show how to
establish such an equivalence relation in a modular way. It is well-known
that composition works well when the processes do not share secrets.
However, there is no result allowing us to compose processes that rely on
some shared secrets such as long term keys. We show that composition works
even when the processes share secrets provided that they satisfy some
reasonable conditions. Our composition result allows us to prove various
equivalence-based properties in a modular way, and works in a quite
general setting. In particular, we consider arbitrary cryptographic
primitives and processes that use non-trivial else branches.\par
As an example, we consider the ICAO e-passport standard, and we show how
the privacy guarantees of the whole application can be derived from the
privacy guarantees of its sub-protocols.}
}
@inproceedings{benzina-iscc12,
address = {Nev{\c{s}}ehir, Turkey},
month = jul,
year = 2012,
publisher = {{IEEE} Computer Society Press},
noeditor = {},
acronym = {{ISCC}'12},
booktitle = {{P}roceedings of the 17th {IEEE} {S}ymposium on {C}omputers and
{C}ommunications ({ISCC}'12)},
author = {Benzina, Hedi},
title = {A~Network Policy Model for Virtualized Systems},
pages = {680-683},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/benzina-iscc12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/benzina-iscc12.pdf},
doi = {10.1109/ISCC.2012.6249376},
abstract = {Modern hypervisors offer the ability to build virtual networks
between virtual machines. These networks are very useful in both personal
and professional activities since they offer the same opportunities as
physical networks, but in a much lower cost in terms of hardware and time.
On the other hand, these networks are facing many security threats due to
the absence of rigourous security policies that protect the sensitive
ressources of the network. In this paper, we propose a multilevel security
policy model for these networks, this policy covers not only network
operations, but also operations related to the management of the virtual
architecture.}
}
@inproceedings{DKP-ijcar12,
address = {Manchester, UK},
month = jun,
year = 2012,
volume = {7364},
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer-Verlag},
editor = {Gramlich, Bernhard and Miller, Dale and Sattler, Uli},
acronym = {{IJCAR}'12},
booktitle = {{P}roceedings of the 6th {I}nternational {J}oint
{C}onference on {A}utomated {R}easoning
({IJCAR}'12)},
author = {Delaune, St{\'e}phanie and Kremer, Steve and Pasail{\u{a}}, Daniel},
title = {Security protocols, constraint systems, and
group theories},
pages = {164-178},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DKP-ijcar12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DKP-ijcar12.pdf},
doi = {10.1007/978-3-642-31365-3_15},
abstract = {When formally analyzing security protocols it is often
important to express properties in terms of an
adversary's inability to distinguish two
protocols. It has been shown that this problem
amounts to deciding the equivalence of two
constraint systems, i.e., whether they have the same
set of solutions. In this paper we study this
equivalence problem when cryptographic primitives
are modeled using a group equational theory, a
special case of monoidal equational theories. The
results strongly rely on the isomorphism between
group theories and rings. This allows us to reduce
the problem under study to the problem of solving
systems of equations over rings.\par We provide
several new decidability and complexity results,
notably for equational theories which have
applications in security protocols, such as
exclusive or and Abelian groups which may
additionally admit a unary, homomorphic symbol.}
}
@article{BCD-tocl12,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Baudet, Mathieu and Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
title = {{YAPA}: A~generic tool for computing intruder knowledge},
year = 2013,
month = feb,
nopages = {},
number = {1:4},
volume = 14,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCD-tocl12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCD-tocl12.pdf},
doi = {10.1145/2422085.2422089},
abstract = {Reasoning about the knowledge of an attacker is a
necessary step in many formal analyses of security
protocols. In the framework of the applied pi
calculus, as in similar languages based on
equational logics, knowledge is typically expressed
by two relations: deducibility and static
equivalence. Several decision procedures have been
proposed for these relations under a variety of
equational theories. However, each theory has its
particular algorithm, and none has been implemented
so far. \par We provide a generic procedure for
deducibility and static equivalence that takes as
input any convergent rewrite system. We show that
our algorithm covers most of the existing decision
procedures for convergent theories. We also provide
an efficient implementation, and compare it briefly
with the tools ProVerif and KiSs.}
}
@inproceedings{KS-csr12,
address = {Nizhni Novgorod, Russia},
month = jul,
year = 2012,
volume = {7353},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Hirsch, Edward A. and Karhum{\"a}ki, Juhani and Lepist{\"o},
Arto and Prilutskii, Michail},
acronym = {{CSR}'12},
booktitle = {{P}roceedings of the 7th {I}nternational {C}omputer {S}cience
{S}ymposium in {R}ussia ({CSR}'12)},
author = {Karandikar, Prateek and Schnoebelen, {\relax Ph}ilippe},
title = {Cutting Through Regular {P}ost Embedding Problems},
pages = {229-240},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-csr12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-csr12.pdf},
doi = {10.1007/978-3-642-30642-6_22},
abstract = {The Regular Post Embedding Problem extended with partial
(co)directness is shown decidable. This extends to universal and{\slash}or
counting versions. It is also shown that combining directness and
codirectness in Post Embedding problems leads to undecidability.}
}
@phdthesis{doyen-HDR11,
author = {Doyen, Laurent},
title = {Games and Automata: From Boolean to Quantitative Verification},
year = 2012,
month = mar,
type = {M{\'e}moire d'habilitation},
school = {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hdr-ld.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hdr-ld.pdf},
noslides = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/SLIDES/hdr-ld-slides.pdf}
}
@techreport{rr-lsv-12-05,
author = {Soulat, Romain},
title = {Scheduling with {IMITATOR}: Some Case Studies},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2012},
month = mar,
type = {Research Report},
number = {LSV-12-05},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-05.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-05.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2012-05-v1.pdf, 20120313},
note = {13~pages},
abstract = {The tool IMITATOR implements the \emph{Inverse Method (IM)} for
Timed Automata (TAs). Given a TA~\(\mathcal{A}\) and a tuple~\(\pi_0\) of
reference valuations for timings, IM synthesizes a constraint around pi0
where A behaves in the same discrete manner. This provides us with a
quantitative measure of robustness of the behavior of~\(\mathcal{A}\)
around~\(\pi_0\).\par
The new version IMITATOR~2.5 integrates the new features of stopwatches
(in addition to standard clocks) and updates (in addition to standard
clock resets), as well as powerful algorithmic improvements for state
space reduction. We illustrate on several case studies of preemptive
scheduling problems how such features make the tool well-suited to analyze
robustness.}
}
@article{BCH-fmsd12,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Balaguer, Sandie and Chatain, {\relax Th}omas and Haar,
Stefan},
title = {A~Concurrency-Preserving Translation from Time {P}etri Nets to
Networks of Timed Automata},
year = 2012,
month = jun,
volume = 40,
number = 3,
pages = {330-355},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCH-fmsd12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCH-fmsd12.pdf},
doi = {10.1007/s10703-012-0146-4},
abstract = {Several formalisms to model distributed real-time systems
coexist in the literature. This naturally induces a need to compare their
expressiveness and to translate models from one formalism to another when
possible. The first formal comparisons of the expressiveness of these
models focused on the preservation of the sequential behavior of the
models, using notions like timed language equivalence or timed
bisimilarity. They do not consider preservation of concurrency. In~this
paper we define timed traces as a partial order representation of
executions of our models for real-time distributed systems. Timed traces
provide an alternative to timed words, and take the distribution of
actions into account. We propose a translation between two popular
formalisms that describe timed concurrent systems: \(1\)-bounded time Petri
nets~(TPN) and networks of timed automata~(NTA). Our translation preserves
the distribution of actions, that is we require that if the TPN represents
the product of several components (called processes), then each process
should have its counterpart as one timed automaton in the resulting~NTA.}
}
@techreport{rr-lsv-12-04,
author = {Barbot, Beno{\^\i}t and Haddad, Serge and Picaronny, Claudine},
title = {Importance Sampling for Model Checking of Time-Bounded Until},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2012},
month = feb,
type = {Research Report},
number = {LSV-12-04},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2012-04.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2012-04.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2012-04-v1.pdf, 20120227},
note = {14~pages},
abstract = {Statistical model-checking is an alternative verification
technique applied on stochastic systems whose size is beyond numerical
analysis ability. Given a model (most often a Markov chain) and a formula,
it provides a confidence interval for the probability that the model
satisfies the formula. In a previous contribution, we have overtaken the
main limitation of the statistical approach, i.e. the computation time
explosion associated with the evaluation of very small probabilities. This
method was valid only for the standard ``Until'' of temporal logics. We
establish a similar validity condition which applies to the ``Bounded
Until'', using more elaborate arguments. We also address the problem of
additional memory requirements necessary to apply the method and we design
several algorithms depending on the intended trade-off between time and
memory. The corresponding algorithms have been implemented in our tool
Cosmos. We present experimentations on several relevant systems, with
drastic time reductions w.r.t. standard statistical model checking.}
}
@book{JGL-topology,
author = {Goubault{-}Larrecq, Jean},
title = {Non-{H}ausdorff Topology and Domain Theory---Selected Topics
in Point-Set Topology},
publisher = {Cambridge University Press},
series = {New Mathematical Monographs},
volume = {22},
year = {2013},
month = mar,
url = {http://www.cambridge.org/9781107034136},
isbn = {9781107034136}
}
@inproceedings{AFS-nfm12,
address = {Norfolk, Virginia, USA},
month = apr,
year = 2012,
volume = 7226,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Goodloe, Alwyn and Person, Suzette},
acronym = {{NFM}'12},
booktitle = {{P}roceedings of the 4th {NASA} {F}ormal {M}ethods {S}ymposium ({NFM}'12)},
author = {Andr{\'e}, {\'E}tienne and Fribourg, Laurent and Soulat,
Romain},
title = {Enhancing the Inverse Method with State Merging},
pages = {100-105},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AFS-nfm12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AFS-nfm12.pdf},
doi = {10.1007/978-3-642-28891-3_10},
abstract = {Keeping the state space small is essential when verifying
real-time systems using Timed Automata~(TA). In~the model-checker Uppaal,
the merging operation has been used extensively in order to reduce the
number of states. Actually, Uppaal's merging technique applies within the
more general setting of Parametric Timed Automata (PTA). The \emph{Inverse
Method~(IM)} for a PTA~\(\mathcal{A}\) is a procedure that synthesizes a
zone around a given point~\(\pi^{0}\) (parameter valuation) over which
\(\mathcal{A}\) is guaranteed to behave similarly. We show that the
integration of merging into~\emph{IM} leads to the synthesis of larger
zones around~\(\pi^{0}\). It~also often improves the performance
of~\emph{IM}, both in terms of computational space and time, as shown by
our experimental results.}
}
@article{BHS-fmsd2012,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {B{\'e}rard, B{\'e}atrice and Haddad, Serge and Sassolas, Mathieu},
title = {Interrupt Timed Automata: Verification and Expressiveness},
year = {2012},
month = feb,
volume = {40},
number = {1},
pages = {41-87},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHS-fmsd12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHS-fmsd12.pdf},
doi = {10.1007/s10703-011-0140-2},
abstract = {We introduce the class of Interrupt Timed Automata (ITA), a
subclass of hybrid automata well suited to the description of timed
multi-task systems with interruptions in a single processor environment.\par
While the reachability problem is undecidable for hybrid automata we show
that it is decidable for ITA. More precisely we prove that the untimed
language of an ITA is regular, by building a finite automaton as a
generalized class graph. We then establish that the reachability problem
for ITA is in NEXPTIME and in PTIME when the number of clocks is fixed. To
prove the first result, we define a subclass ITA\(_{-}\) of ITA, and show
that (1)~any ITA can be reduced to a language-equivalent automaton in
ITA\(_{-}\) and (2)~the reachability problem in this subclass is in NEXPTIME
(without any class graph).\par
In the next step, we investigate the verification of real time properties
over ITA. We prove that model checking SCL, a fragment of a timed linear
time logic, is undecidable. On the other hand, we give model checking
procedures for two fragments of timed branching time logic.\par
We also compare the expressive power of classical timed automata and ITA
and prove that the corresponding families of accepted languages are
incomparable. The result also holds for languages accepted by controlled
real-time automata (CRTA), that extend timed automata. We finally combine
ITA with CRTA, in a model which encompasses both classes and show that the
reachability problem is still decidable. Additionally we show that the
languages of ITA are neither closed under complementation nor under
intersection.}
}
@article{BK-jal12,
publisher = {Elsevier Science Publishers},
journal = {Journal of Applied Logic},
author = {Bollig, Benedikt and Kuske, Dietrich},
title = {An optimal construction of {H}anf sentences},
year = {2012},
month = jun,
volume = {10},
number = {2},
pages = {179-186},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BK-jal12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BK-jal12.pdf},
doi = {10.1016/j.jal.2012.01.002},
abstract = {We give a new construction of formulas in Hanf normal form that
are equivalent to first-order formulas over structures of bounded degree.
This is the first algorithm whose running time is shown to be elementary.
The triply exponential upper bound is complemented by a matching lower
bound.}
}
@article{GMM-fmsd2012,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Ganty, Pierre and Majumdar, Rupak and Monmege, Benjamin},
title = {Bounded underapproximations},
year = {2012},
month = apr,
volume = {40},
number = {2},
pages = {206-231},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GMM-fmsd12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GMM-fmsd12.pdf},
doi = {10.1007/s10703-011-0136-y},
abstract = {We show a new and constructive proof of the following
language-theoretic result: for every context-free language~\(L\), there is
a bounded context-free language \(L'\subseteq L\) which has the same
Parikh (commutative) image as~\(L\). Bounded languages, introduced by
Ginsburg and Spanier, are subsets of regular languages of the form
\(w_{1}^{*}w_{2}^{*}\cdots w_{m}^{*}\) for some \(w_1,\cdots,w_{m}\in
\Sigma^{*}\). In particular bounded context-free languages have nice
structural and decidability properties. Our proof proceeds in two parts.
First, we give a new construction that shows that each context free
language~\(L\) has a subset~\(L_{N}\) that has the same Parikh image
as~\(L\) and that can be represented as a sequence of substitutions on a
linear language. Second, we inductively construct a Parikh-equivalent
bounded context-free subset of~\(L_{N}\).\par
We show two applications of this result in model checking: to
underapproximate the reachable state space of multithreaded procedural
programs and to underapproximate the reachable state space of recursive
counter programs. The bounded language constructed above provides a
decidable underapproximation for the original problems. By iterating the
construction, we get a semi-algorithm for the original problems that
constructs a sequence of underapproximations such that no two
underapproximations of the sequence can be compared. This provides a
progress guarantee: every word~\(w\in L\) is in some underapproximation of
the sequence, and hence, a program bug is guaranteed to be found. In
particular, we show that verification with bounded languages generalizes
context-bounded reachability for multithreaded programs.}
}
@inproceedings{CCK-esop12,
address = {Tallinn, Estonia},
month = mar,
year = 2012,
volume = {7211},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Seidl, Helmut},
acronym = {{ESOP}'12},
booktitle = {{P}rogramming {L}anguages and {S}ystems~---
{P}roceedings of the 22nd
{E}uropean {S}ymposium on {P}rogramming
({ESOP}'12)},
author = {Chadha, Rohit and Ciob{\^a}c{\u{a}}, {\c{S}}tefan and Kremer, Steve},
title = {Automated verification of equivalence properties of
cryptographic protocols},
pages = {108-127},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCK-esop12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCK-esop12.pdf},
doi = {10.1007/978-3-642-28869-2_6},
abstract = {Indistinguishability properties are essential in formal
verification of cryptographic protocols. They are needed to model
anonymity properties, strong versions of confidentiality and resistance to
offline guessing attacks, and can be conveniently modeled using process
equivalences. We present a novel procedure to verify equivalence
properties for bounded number of sessions. Our procedure is able to verify
trace equivalence for determinate cryptographic protocols. On determinate
protocols, trace equivalence coincides with observational equivalence
which can therefore be automatically verified for such processes. When
protocols are not determinate our procedure can be used for both under-
and over-approximations of trace equivalence, which proved successful on
examples. The procedure can handle a large set of cryptographic
primitives, namely those which can be modeled by an optimally reducing
convergent rewrite system. Although, we were unable to prove its
termination, it has been implemented in a prototype tool and has been
effectively tested on examples, some of which were outside the scope of
existing tools.}
}
@article{BDL-icomp12,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Brochenin, R{\'e}mi and Demri, St{\'e}phane and Lozes, {\'E}tienne},
title = {On the Almighty Wand},
year = {2012},
volume = 211,
pages = {106-137},
month = feb,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDL-icomp12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDL-icomp12.pdf},
doi = {10.1016/j.ic.2011.12.003},
abstract = {We investigate decidability, complexity and expressive power
issues for (first-order) separation logic with one record field (herein
called~\texttt{SL}) and its fragments. \texttt{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 \texttt{SL} and as a by-product we get undecidability of~\texttt{SL}.
This is refined by showing that \texttt{SL} without the separating
conjunction is as expressive as~\texttt{SL}, whence undecidable too. As a
consequence, in \texttt{SL} the separating implication (also known as the
magic wand) can simulate the separating conjunction. By~contrast, we
establish that \texttt{SL} without the magic wand is decidable, and
we~prove a non-elementary complexity by reduction from satisfiability for
the first-order theory over finite words. This result is extended with a
bounded use of the magic wand that appears in Hoare-style rules. As a
generalisation, it~is shown that~\(k\texttt{SL}\), the separation logic
over heaps with \(k\geq 1\) record fields, is equivalent
to~\(k\texttt{SO}\), the second-order logic over heaps with \(k\) record
fields.}
}
@inproceedings{GLS-rr13,
address = {Mannheim, Germany},
month = jul,
year = 2013,
volume = 7994,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Faber, Wolfgang and Lembo, Domenico},
acronym = {{WRRS}'13},
booktitle = {{P}roceedings of the 7th {I}nternational {C}onference on
{W}eb {R}easoning and {R}ule {S}ystems ({WRRS}'13)},
author = {Gheerbrant, Am{\'e}lie and Libkin, Leonid and Sirangelo,
Cristina},
affiliaton = {Scotland, University of Edinburgh, School of Informatics and Scotland, University of Edinburgh, School of Informatics and France, ENS Cachan \& CNRS \& INRIA, LSV[Dahu]},
title = {Reasoning About Pattern-Based {XML} Queries},
pages = {4-18},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GLS-rr13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GLS-rr13.pdf},
doi = {10.1007/978-3-642-39666-3_2},
abstract = {We survey results about static analysis of pattern-based queries
over XML documents. These queries are analogs of conjunctive queries,
their unions and Boolean combinations, in which tree patterns play the
role of atomic formulae. As in the relational case, they can be viewed as
both queries and incomplete documents, and thus static analysis problems
can also be viewed as finding certain answers of queries over such
documents. We look at satisfiability of patterns under schemas,
containment of queries for various features of XML used in queries,
finding certain answers, and applications of pattern-based queries in
reasoning about schema mappings for data exchange.}
}
@incollection{AV-buneman13,
noaddress = {},
month = sep,
year = 2013,
volume = 8000,
series = {Lecture Notes in Computer Science},
editor = {Tannen, Val and Wong, Limsoon and Libkin, Leonid and
Fan, Wenfei and Tan, Wang-Chiew and Fourman, Michael},
publisher = {Springer},
booktitle = {{I}n~{S}earch of {E}legance in the {T}heory and {P}ractice of
{C}omputation~-- {E}ssays {D}edicated to {P}eter~{B}uneman},
author = {Abiteboul, Serge and Vianu, Victor},
title = {Models for Data-Centric Workflows},
pages = {1-12},
doi = {10.1007/978-3-642-41660-6_1},
abstract = {We present two models for data-centric workflows: the first
based on business artifacts and the second on Active XML. We then compare
the two models and argue that Active XML is strictly more expressive,
based on a natural semantics and choice of observables. Finally, we
mention several verification results for the two models.}
}
@inproceedings{AAMST-sigmod13,
address = {New~York, New~York, USA},
month = jun,
year = 2013,
publisher = {ACM Press},
editor = {Ross, Kenneth A. and Srivastava, Divesh and Papadias, Dimitris},
acronym = {{SIGMOD}'13},
booktitle = {{P}roceedings of the {ACM} {SIGMOD} {I}nternaitonal
{C}onference on {M}anagement of {D}ata ({SIGMOD}'13)},
author = {Abiteboul, Serge and Antoine, {\'E}milien and Miklau,
Gerome and Stoyanovich, Julia and Testard, Jules},
title = {Rule-based application development using Webdamlog},
pages = {965-968},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AAMST-sigmod13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AAMST-sigmod13.pdf},
doi = {10.1145/2463676.2465251},
abstract = {We present the WebdamLog system for managing distributed data on
the Web in a peer-to-peer manner. We demonstrate the main features of the
system through an application called Wepic for sharing pictures between
attendees of the sigmod conference. Using Wepic, the attendees will be
able to share, download, rate and annotate pictures in a highly
decentralized manner. We show how WebdamLog handles heterogeneity of the
devices and services used to share data in such a Web setting. We exhibit
the simple rules that define the Wepic application and show how to easily
modify the Wepic application.}
}
@inproceedings{BD-csr13,
address = {Ekaterinburg, Russia},
month = jun,
year = 2013,
volume = {7913},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Bulatov, Andrei A. and Shur, Arseny M.},
acronym = {{CSR}'13},
booktitle = {{P}roceedings of the 8th {I}nternational {C}omputer {S}cience
{S}ymposium in {R}ussia ({CSR}'13)},
author = {Bansal, Kshitij and Demri, St{\'e}phane},
title = {Model-checking bounded multi-pushdown systems},
pages = {405-417},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BD-csr13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BD-csr13.pdf},
doi = {10.1007/978-3-642-38536-0_35},
abstract = {We provide complexity characterizations of model checking
multi-pushdown systems. We consider three standard notions for
boundedness: context boundedness, phase boundedness and stack ordering.
The logical formalism is a linear-time temporal logic extending well-known
logic \texttt{CaRet} but dedicated to multi-pushdown systems in which abstract
operators are parameterized by stacks. We show that the problem is
ExpTime-complete for context-bounded runs and unary encoding of the number
of context switches; we also prove that the problem is 2ExpTime-complete
for phase-bounded runs and unary encoding of the number of phase switches.
In both cases, the value~\(k\) is given as an input, which makes a
substantial difference in the complexity.}
}
@misc{cassting-D41,
author = {Markey, Nicolas and Larsen, Kim G. and Skou, Arne and Lux, Daniel
and Rozenkilde, Jesper and Pedersen, Keld L. and
S{\o}rensen, Susanne M.},
title = {Description of case studies},
howpublished = {Cassting deliverable~D4.1 (FP7-ICT-601148)},
month = oct,
year = {2013},
note = {19~pages},
type = {Contract Report},
nourlnote = {confidentiel}
}
@misc{cassting-D51,
author = {Valette, Sophie and Markey, Nicolas},
title = {Cassting website},
howpublished = {Cassting deliverable~D6.1 (FP7-ICT-601148)},
month = jun,
year = {2013},
note = {10~pages},
type = {Contract Report},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/cassting-d51.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/cassting-d51.pdf}
}
@misc{cassting-D61,
author = {Valette, Sophie and Markey, Nicolas},
title = {Minutes of the Kick-Off Meeting},
howpublished = {Cassting deliverable~D6.1 (FP7-ICT-601148)},
month = apr,
year = {2013},
note = {9~pages},
type = {Contract Report},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/cassting-d61.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/cassting-d61.pdf}
}
@phdthesis{chatain-HDR13,
author = {Chatain, {\relax Th}omas},
title = {Concurrency in Real-Time Distributed Systems, from Unfoldings
to Implementability},
year = 2013,
month = dec,
type = {M{\'e}moire d'habilitation},
school = {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-chatain13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-chatain13.pdf}
}
@phdthesis{crodriguez-phd2013,
author = {Rodr{\'\i}guez, C{\'e}sar},
title = {Verification Based on Unfoldings of {P}etri Nets with Read Arcs},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2013,
month = dec,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/cr-phd13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/cr-phd13.pdf}
}
@misc{impro-D31,
author = {B{\'e}rard, B{\'e}atrice and Bouyer, Patricia and Larsen, Kim G. and
Markey, Nicolas and Mullins, John and Sankur, Ocan and Sassolas,
Mathieu and Thrane, Claus},
title = {Measuring the robustness},
howpublished = {Deliverable ImpRo~3.1, (ANR-10-BLAN-0317)},
month = jan,
year = {2013},
note = {59~pages},
type = {Contract Report},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/impro-d31.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/impro-d31.pdf}
}
@misc{impro-D51,
author = {Bouyer, Patricia and Faucou, S{\'e}bastien and Haar, Stefan and
Jovanivi{\'c}, Aleksandra and Lime, Didier and Markey, Nicolas and
Roux, Olivier H. and Sankur, Ocan},
title = {Control tasks for Timed System; Robustness issues},
howpublished = {Deliverable ImpRo~5.1, (ANR-10-BLAN-0317)},
month = jan,
year = {2013},
note = {34~pages},
type = {Contract Report},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/impro-d51.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/impro-d51.pdf}
}
@phdthesis{schwoon-HDR13,
author = {Schwoon, Stefan},
title = {Efficient verification of sequential and concurrent systems},
year = 2013,
month = dec,
type = {M{\'e}moire d'habilitation},
school = {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-schwoon13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-schwoon13.pdf}
}
@phdthesis{eantoine-phd2013,
author = {Antoine, {\'E}milien},
title = {Distributed data management with a declarative rule-based language: \emph{Webdamlog}},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2013,
month = dec,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/eantoine-phd13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/eantoine-phd13.pdf}
}
@article{CS-lmcs13,
journal = {Logical Methods in Computer Science},
author = {ten~Cate, Balder and Segoufin, Luc},
title = {Unary negation},
volume = 9,
number = {3:25},
month = sep,
year = 2013,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-lmcs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-lmcs13.pdf},
doi = {10.2168/LMCS-9(3:25)2013},
abstract = {We study fragments of first-order logic and of least fixed point
logic that allow only unary negation: negation of formulas with at most
one free variable. These logics generalize many interesting known
formalisms, including modal logic and the \(\mu\)-calculus, as well as
conjunctive queries and monadic Datalog. We show that satisfiability and
finite satisfiability are decidable for both fragments, and we pinpoint
the complexity of satisfiability, finite satisfiability, and model
checking. We also show that the unary negation fragment of first-order
logic is model-theoretically very well behaved. In particular, it enjoys
Craig Interpolation and the Projective Beth Property.}
}
@inproceedings{BC-fossacs13,
address = {Rome, Italy},
month = mar,
year = 2013,
volume = {7794},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Pfenning, Frank},
acronym = {{FoSSaCS}'13},
booktitle = {{P}roceedings of the 16th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'13)},
author = {Bonnet, R{\'e}mi and Chadha, Rohit},
title = {Bounded Context-Switching and Reentrant Locking},
pages = {65-80},
doi = {10.1007/978-3-642-37075-5_5},
abstract = {Reentrant locking is a \emph{recursive locking} mechanism which allows
a thread in a multi-threaded program to acquire the reentrant lock
multiple times. The thread must release this lock an equal number of times
before another thread can acquire this lock. We consider the control state
reachability problem for recursive multi-threaded programs synchronizing
via a finite number of reentrant locks. Such programs can be abstracted as
multi-pushdown systems with a finite number of counters. The pushdown
stacks model the call stacks of the threads and the counters model the
reentrant locks. The control state reachability problem is already
undecidable for non-reentrant locks. As a consequence, for non-reentrant
locks, under-approximation techniques which restrict the search space have
gained traction. One popular technique is to limit the number of context
switches. Our main result is that the problem of checking whether a
control state is reachable within a bounded number of context switches is
decidable for recursive multi-threaded programs synchronizing via a finite
number of reentrant locks if we restrict the lock-usage to contextual
locking: a release of an instance of reentrant lock can only occur if the
instance was acquired before in the same procedure and each instance of a
reentrant lock acquired in a procedure call must be released before the
procedure returns. The decidability is obtained by a reduction to the
reachability problem of Vector Addition Systems with States~(VASS).}
}
@article{BCMV-lmcs13,
journal = {Logical Methods in Computer Science},
author = {Bonnet, R{\'e}mi and Chadha, Rohit and Madhusudan, P. and
Viswanathan, Mahesh},
title = {Reachability under contextual locking},
volume = 9,
number = {3:21},
month = sep,
year = 2013,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCMV-lmcs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCMV-lmcs13.pdf},
doi = {10.2168/LMCS-9(3:21)2013},
abstract = {The pairwise reachability problem for a multi-threaded program
asks, given control locations in two threads, whether they can be
simultaneously reached in an execution of the program. The problem is
important for static analysis and is used to detect statements that are
concurrently enabled. This problem is in general undecidable even when
data is abstracted and when the threads (with recursion) synchronize only
using a finite set of locks. Popular programming paradigms that limit the
lock usage patterns have been identified under which the pairwise
reachability problem becomes decidable. In this paper, we consider a new
natural programming paradigm, called contextual locking, which ties the
lock usage to calling patterns in each thread: we assume that locks are
released in the same context that they were acquired and that every lock
acquired by a thread in a procedure call is released before the procedure
returns. Our main result is that the pairwise reachability problem is
polynomial-time decidable for this new programming paradigm as well. The
problem becomes undecidable if the locks are reentrant; reentrant locking
is a recursive locking mechanism which allows a thread in a multi-threaded
program to acquire the reentrant lock multiple times.}
}
@proceedings{BF-formats2013,
title = {{P}roceedings of the 11th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'13)},
booktitle = {{P}roceedings of the 11th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'13)},
acronym = {{FORMATS}'13},
editor = {Braberman, V{\'\i}ctor and Fribourg, Laurent},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = 8053,
url = {http://link.springer.com/978-3-642-40228-9},
year = 2013,
month = aug,
address = {Buenos Aires, Argentina}
}
@article{BC-lmcs13,
journal = {Logical Methods in Computer Science},
author = {Balaguer, Sandie and Chatain, {\relax Th}omas},
title = {Avoiding Shared Clocks in Networks of Timed Automata},
volume = 9,
number = {4:13},
nopages = {},
year = 2013,
month = nov,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BC-lmcs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BC-lmcs13.pdf},
doi = {10.2168/LMCS-9(4:13)2013},
abstract = {Networks of timed automata~(NTA) are widely used to model
distributed real-time systems. Quite often in the literature, the automata
are allowed to share clocks. This is a problem when one considers
implementing such model in a distributed architecture, since reading
clocks a priori requires communications which are not explicitly described
in the model. We focus on the following question: given a NTA \(A_{1}
\parallel A_{2}\) where \(A_{2}\) reads some clocks reset by~\(A_{1}\),
does there exist a NTA \(A'_{1} \parallel A'_{2}\) without shared clocks
with the same behavior as the initial NTA? For this, we allow the automata
to exchange information during synchronizations only. We discuss a
formalization of the problem and give a criterion using the notion of
contextual timed transition system, which represents the behavior
of~\(A_{2}\) when in parallel with~\(A_{1}\). Finally, we effectively
build \(A'_{1} \parallel A'_{2}\) when it exists.}
}
@article{CD-pourlascience13,
publisher = {Belin},
journal = {Pour La Science},
author = {Chr{\'e}tien, R{\'e}my and Delaune, St{\'e}phanie},
title = {La protection des informations sensibles},
volume = {433},
month = nov,
year = 2013,
pages = {70-77},
url = {http://www.pourlascience.fr/ewb_pages/a/article-la-protection-des-informations-sensibles-32228.php}
}
@phdthesis{monmege-phd2013,
author = {Monmege, Benjamin},
title = {Sp{\'e}cification et v{\'e}rification de propri{\'e}t{\'e}s
quantitatives~: expressions, logiques, et automates},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2013,
month = oct,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/monmege-phd13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/monmege-phd13.pdf}
}
@book{FS-book13,
author = {Fribourg, Laurent and Soulat, Romain},
title = {Control of Switching Systems by Invariance Analysis: Application to Power Electronics},
publisher = {Wiley-ISTE},
year = 2013,
month = jul,
isbn = {9781848216068},
note = {144~pages},
url = {http://www.iste.co.uk/index.php?f=a&ACTION=View&id=684},
abstract = {This book presents correct-by-design control techniques for
switching systems, using different methods of stability analysis.
Switching systems are increasingly used in the electronics and mechanical
industries; in power electronics and the automotive industry, for example.
This is due to their flexibility and simplicity in accurately controlling
industrial mechanisms. By adopting appropriate control rules, we can steer
a switching system to a region centered at a desired equilibrium point,
while avoiding {"}unsafe{"} regions of parameter saturation.\par
The authors explain various correct-by-design methods for control
synthesis, using different methods of stability and invariance analysis.
They also provide several applications of these methods to industrial
examples of power electronics.}
}
@inproceedings{BL-ewili13,
address = {Toulouse, France},
month = aug,
year = 2013,
noeditor = {},
acronym = {{EW}i{L}i'13},
booktitle = {{P}roceedings of the 3rd {E}mbedded {O}perating {S}ystems
{W}orkshop ({EW}i{L}i'13)},
author = {Benedetto, Salvatore and Lipari, Giuseppe},
title = {{{ADOK}: A~Minimal Object Oriented Real-Time Operating System in~{C++}}},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BL-ewili13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BL-ewili13.pdf},
abstract = {Most embedded software is currently developed using the C
programming language, even though its low level of abstraction requires a
lot of effort to the programmer. The C++ language is a better choice
because: it raises the level of abstraction; it is strongly typed, so it
prevents many common programming mistakes; it can be made as efficient as
C through fine-grained customisation of memory mechanisms; it can be
easily adapted to domain-specific needs. In addition, recent compilers
have grown in maturity and performance, and the new standard
considerably improves the language by introducing new concepts and an
easier syntax.\par
In this paper we present ADOK, a minimal Real-Time Operating System
entirely written in C++ with the exception of a few lines of assembler
code. It directly offers a C++ interface to the developer, and it provides
a flexible scheduling framework which allows the developer to customise
the scheduling to its needs. In particular, we implement a two-level
scheduler based on Earliest Deadline First, the Stack Resource Policy
protocol for sharing resources and support for mode changes. We
demonstrate through examples and a small case-study that ADOK can
substantially improve productivity without sacrificing on performance.}
}
@inproceedings{BLBL-iceac13,
address = {Istanbul, Turkey},
month = dec,
year = 2013,
publisher = {{IEEE} Circuits and Systems Society},
noeditor = {},
acronym = {{ICEAC}'13},
booktitle = {{P}roceedings of the 4th {I}nternational {C}onference on
{E}nergy-{A}ware {C}omputing {S}ystems and {A}pplications ({ICEAC}'14),},
author = {Bambagini, Mario and Lelli, Juri and Buttazzo, Giorgio and Lipari, Giuseppe},
title = {On the Energy-Aware Partitioning of Real-Time Tasks on Homogeneous
Multi-Processor Systems},
pages = {69-74},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BLBL-iceac13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BLBL-iceac13.pdf},
doi = {10.1109/ICEAC.2013.6737640},
abstract = {In high-performance computing systems, efficient energy
management is a key feature for keeping energy bills low and avoiding
thermal dissipation problems, as well as for controlling the application
performance. This paper considers the problem of partitioning and
scheduling a set of real-time tasks on a realistic hardware platform
consisting of a number of homogeneous processors. Several well-known
heuristics are compared to identify the approach that better reduces the
overall energy consumption of the entire system. Despite the actual state
of art, the approach which minimizes the number of active cores is the
most energy efficient.}
}
@inproceedings{PLML-rtlws2013,
address = {Lugano-Manno, Switzerland},
month = oct,
year = 2013,
publisher = {Open Source Automation Development Lab (OSADL)},
noeditor = {},
acronym = {{RTLWS}'13},
booktitle = {{P}roceedings of the 15th {R}eal-{T}ime {L}inux {W}orkshop ({RTLWS}'13)},
author = {Parri, Andrea and Lelli, Juri and Marinoni, Mauro and Lipari,
Giuseppe},
title = {Design and Implementation of the Multiprocessor Bandwidth
Inheritance Protocol on {L}inux},
oldtitle = {An~implementation of the Bandwidth Inheritance Protocol in the {L}inux Kernel},
pages = {41-54},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/PLML-rtlws13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/PLML-rtlws13.pdf},
abstract = {The Resource Reservation (RR) framework has been proven very
effective in the joint scheduling of hard real time and soft real time
application in Open Systems. A fundamental problem in this context
concerns the extension of the Resource Reservation approach to systems
where tasks interact through shared resources.\par
The Bandwidth Inheritance (BWI) protocol was first proposed in
[Lamastra~G., Lipari~G., Abeni~L.~(2001). A~bandwidth inheritance
algorithm for real-time task synchronization in open systems. In:~Proc.
22nd IEEE Real-Time Systems Symposium] to preserve Bandwidth Isolation
between independent groups of tasks, and to enable a schedulability
analysis for hard real time tasks.\par
In this paper, we present the first implementation of the BWI protocol
within the Linux kernel. We describe the protocol, the way it has been
implemented in Linux, and we report some early experiments to measure its
overhead. Our work is based on the SCHED\_DEADLINE patch, a scheduling
class for the Linux kernel that provides Resource Reservation using the
Constant Bandwidth Server algorithm. The BWI implementation extends
Linux's current implementation of the Priority Inheritance protocol,
without affecting past design decisions. Our implementation is neutral to
the underlying scheduling scheme and can be adopted in global, clustered
and partitioned scheduling.\par
Results show agreement with theoretical analysis, and
performance{\slash}overheads comparable with the current implementation of
Priority Inheritance in Linux.\par
The work presented here has practical implications for applications
running on Linux with SCHED\_DEADLINE scheduling policy and share resources
through mutex semaphores. In fact, the protocol guarantees temporal
isolation between non-interacting threads, hence real-time guarantees are
possible even where no a-priori information about tasks' scheduling
parameters are available.}
}
@inproceedings{LGBB-burns13,
address = {York, UK},
month = mar,
year = 2013,
editor = {Audsley, Neil and Baruah, Sanjoy},
publisher = {CreateSpace Independent Publishing Platform},
booktitle = {Real-Time Sytems: the past, the present, and the future~--
{P}roceedings of a conference organized in celebration of
{P}rofessor {A}lan~{B}urns' sixtieth birthday},
author = {Lipari, Giuseppe and George, Laurent and Bini, Enrico and
Bertogna, Marko},
title = {On the Average Complexity of the Processor Demand Analysis for
Earliest Deadline Scheduling},
pages = {75-86},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LGBB-burns13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LGBB-burns13.pdf},
abstract = {Schedulability analysis of a set of sporadic tasks scheduled by
EDF on a single processor system is a well known and solved problem: the
Processor Demand Analysis is a necessary and sufficient test for EDF with
pseudo-polynomial complexity. Over the years, many researchers have tried
to find efficient methods for reducing the average-case running time of
this test. The problem becomes relevant when doing sensitivity analysis of
the worst-case execution times of the tasks: the number of constraints to
check is directly linked to the complexity of the analysis. In this paper
we describe the problem and present some known facts, with the aim of
summarising the state of the art and stimulate research in this
direction.}
}
@inproceedings{LB-burns13,
address = {York, UK},
month = mar,
year = 2013,
editor = {Audsley, Neil and Baruah, Sanjoy},
publisher = {CreateSpace Independent Publishing Platform},
booktitle = {Real-Time Sytems: the past, the present, and the future~--
{P}roceedings of a conference organized in celebration of
{P}rofessor {A}lan~{B}urns' sixtieth birthday},
author = {Lipari, Giuseppe and Buttazzo, Giorgio},
title = {{Resource reservation for Mixed Criticality Systems}},
pages = {60-74},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LB-burns13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LB-burns13.pdf},
abstract = {This paper presents a reservation-based approach to schedule
mixed criticality systems in a way that guarantees the schedulability of
high-criticality tasks independently of the behaviour of low-criticality
tasks. Two key ideas are presented: first, to reduce the system
uncertainty and advance the time at which a high-criticality task reveals
its actual execution time, the initial portion of its code is handled by a
dedicated server with a bandwidth reserved for the worst-case, but with a
shorter deadline; second, to avoid the pessimism related to off-line
budget allocation, an efficient reclaiming mechanism, namely the GRUB
algorithm, is used to exploit the budget left by high-criticality tasks in
favor of those low-criticality tasks that can still complete within their
deadline.}
}
@inproceedings{SSLAF-ftscs13,
address = {Queenstown, New Zealand},
month = oct,
year = 2013,
editor = {Artho, Cyrille and {\"O}lveczky, Peter Csaba},
acronym = {{FTSCS}'13},
booktitle = {{P}reproceedings of the 2nd {I}nternational {W}orkshop on
{F}ormal {T}echniques for {S}afety-{C}ritical {S}ystems ({FTSCS}'13)},
author = {Sun, Youcheng and Soulat, Romain and Lipari, Giuseppe and
Andr{\'e}, {\'E}tienne and Fribourg, Laurent},
title = {Parametric Schedulability Analysis of Fixed Priority Real-Time
Distributed Systems},
pages = {179-194},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SSLAF-ftscs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SSLAF-ftscs13.pdf},
abstract = {In this paper, we address the problem of parametric
schedulability analysis of distributed real-time systems scheduled by
fixed priority. We propose two different approaches to parametric
analysis. The first one is a novel analytic technique that extends
single-processor sensitivity analysis to the case of distributed systems.
The second approach is based on model checking of Parametric Stopwatch
Automata~(PSA): we~generate a PSA model from a high-level description of
the system, and then we apply the Inverse Method to obtain all possible
behaviours of the system. Both techniques have been implemented in two
software tools, and they have been compared with classical holistic
analysis on two meaningful test cases. The results show that the analytic
method provides results similar to classical holistic analysis in a very
efficient way, whereas the PSA approach is slower but covers the entire
space of solutions.}
}
@inproceedings{BL-etfa13,
address = {Cagliari, Italy},
month = sep,
year = 2013,
publisher = {{IEEE} Industrial Electronics Society},
noeditor = {},
acronym = {{ETFA}'13},
booktitle = {{P}roceedings of the 18th {IEEE} {I}nternational
{C}onference on {E}merging {T}echnologies and {F}actory
{A}utomation ({ETFA}'13)},
author = {Buttazzo, Giorgio and Lipari, Giuseppe},
title = {Ptask: An~Educational {C}~Library for Programming Real-Time Systems on Linux},
nopages = {},
doi = {10.1109/ETFA.2013.6648001},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BL-etfa13.pdf},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BL-etfa13.pdf},
abstract = {When learning real-time programming, the novice is faced with
many technical difficulties due to low-level C libraries that require
considerable programming effort even for implementing a simple periodic
task. For example, the POSIX Real-Time standard only provides a low level
notion of thread, hence programmers usually build higher level code on top
of the POSIX API, every time re-inventing the wheel.\par
In this paper we present a simple C library that simplifies real-time
programming in Linux by hiding low-level details of task creation,
allocation and synchronization, and provides utilities for more high-level
functionalities, like support for mode-change and adaptive systems. The
library is released as open-source and it is currently being employed to
teach real-time programming in university courses in embedded systems.}
}
@phdthesis{brochenin-phd2013,
author = {Brochenin, R{\'e}mi},
title = {Separation Logic: Expressiveness, Complexity, Temporal Extension},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2013,
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/brochenin-phd13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/brochenin-phd13.pdf}
}
@phdthesis{kazana-phd2013,
author = {Kazana, Wojciech},
title = {Query Evaluation with Constant Delay},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2013,
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/kazana-phd13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/kazana-phd13.pdf}
}
@inproceedings{HHMS-fsttcs13,
address = {Guwahati, India},
month = dec,
year = 2013,
volume = {24},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Seth, Anil and Vishnoi, Nisheeth},
acronym = {{FSTTCS}'13},
booktitle = {{P}roceedings of the 33rd {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'13)},
author = {Haar, Stefan and Haddad, Serge and Melliti, Tarek and Schwoon,
Stefan},
title = {Optimal Constructions for Active Diagnosis},
pages = {527-539},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HHMS13-fsttcs.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HHMS13-fsttcs.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2013.527},
abstract = {The task of diagnosis consists in detecting, without ambiguity,
occurrence of faults in a partially observed system. Depending on the
degree of observability, a discrete event system may be diagnosable or
not. Active diagnosis aims at controlling the system in order to make it
diagnosable. Solutions have already been proposed for the active diagnosis
problem, but their complexity remains to be improved. We solve here the
active diagnosability decision problem and the active diagnoser synthesis
problem, proving that (1)~our procedures are optimal w.r.t. to
computational complexity, and (2)~the memory required for the active
diagnoser produced by the synthesis is minimal. Furthermore, focusing on
the minimal delay before detection, we establish that the memory required
for any active diagnoser achieving this delay may be highly greater than
the previous one. So we refine our construction to build with the same
complexity and memory requirement an active diagnoser that realizes a
delay bounded by twice the minimal delay.}
}
@inproceedings{EJS-fsttcs13,
address = {Guwahati, India},
month = dec,
year = 2013,
volume = {24},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Seth, Anil and Vishnoi, Nisheeth},
acronym = {{FSTTCS}'13},
booktitle = {{P}roceedings of the 33rd {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'13)},
author = {Esparza, Javier and Jezequel, Lo{\"\i}g and Schwoon, Stefan},
title = {Computation of summaries using net unfoldings},
pages = {225-236},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/EJS-fsttcs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/EJS-fsttcs13.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2013.225},
abstract = {We study the following summarization problem: given a parallel
composition \(A = A_1\Vert\cdots\Vert A_n\) of labelled transition systems
communicating with the environment through a distinguished component
\(A_i\), efficiently compute a summary~\(S_i\) such that \(E\Vert A\) and
\(E\Vert S_i\) are trace-equivalent for every environment~\(E\). While \(S_i\)
can be computed using elementary automata theory, the resulting algorithm
suffers from the state-explosion problem. We present a new, simple but
subtle algorithm based on net unfoldings, a partial-order semantics, give
some experimental results using an implementation on top of Mole, and show
that our algorithm can handle divergences and compute weighted summaries
with minor modifications.}
}
@inproceedings{RS-fsfma13,
address = {Singapore},
month = jul,
year = 2013,
volume = 31,
series = {Open Access Series in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Choppy, {\relax Ch}ristine and Sun, Jun},
acronym = {{FSFMA}'13},
booktitle = {{P}roceedings of the 1st {F}rench-{S}ingaporean {W}orkshop
on {F}ormal {M}ethods and {A}pplications ({FSFMA}'13)},
author = {Rodr{\'\i}guez, C{\'e}sar and Schwoon, Stefan},
title = {An Improved Construction of {P}etri Net Unfoldings},
pages = {47-52},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/RS-fsfma13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/RS-fsfma13.pdf},
doi = {10.4230/OASIcs.FSFMA.2013.47},
abstract = {Petri nets are a well-known model language for concurrent
systems. The unfolding of a Petri net is an acyclic net bisimilar to the
original one. Because it is acyclic, it admits simpler decision problems
though it is in general larger than the net. In this paper, we revisit the
problem of efficiently constructing an unfolding. We propose a new method
that avoids computing the concurrency relation and therefore uses less
memory than some other methods but still represents a good time-space
tradeoff. We implemented the approach and report on experiments.}
}
@article{HMY-jocs13,
publisher = {Elsevier Science Publishers},
journal = {Journal of Computational Science},
author = {Haddad, Serge and Mokdad, Lynda and Youcef, Samir},
title = {Bounding models families for performance evaluation in composite
Web services},
volume = {4},
number = {4},
year = {2013},
pages = {232-241},
month = jul,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HMY-jocs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HMY-jocs13.pdf},
doi = {10.1016/j.jocs.2011.11.003},
abstract = {One challenge of composite Web service architectures is the
guarantee of the Quality of Service~(QoS). Performance evaluation of these
architectures is essential but complex due to synchronizations inside the
orchestration of services. We propose methods to automatically derive from
the original model a family of bounding models for the composite Web
response time. These models allow to find the appropriate trade-off
between accuracy of the bounds and the computational complexity. The
numerical results show the interest of our approach w.r.t. complexity and
accuracy of the response time bounds.}
}
@techreport{rr-lsv-13-13,
author = {Hirschi, Lucca},
title = {R{\'e}duction d'entrelacements pour l'{\'e}quivalence de traces},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2013},
month = sep,
type = {Research Report},
number = {LSV-13-13},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2013-13.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2013-13.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2013-13-v1.pdf, 20130910},
note = {22~pages},
abstract = {La trace \'equivalence permet notamment de mod\'eliser l'anonymat de
protocoles cryptographiques. Cette propri\'et\'e est d\'ecidable pour de
nombreuses classes de protocoles et quelques outils permettent de la
prouver automatiquement. Mais malheureusement, tous ces outils sont tr\`es
lents et peu de protocoles r\'eellement int\'eressants peuvent \^etre analys\'es
dans un temps raisonnable. Ces outils doivent r\'ealiser un parcours
exhaustif des traces (symboliques) possibles. Mais le parall\`ele introduit
de nombreux entrelacements dont un grand nombre sont peu pertinents. Cette
explosion combinatoire est une des causes de cette inefficacit\'e.\par
Une optimisation dont l'id\'ee est emprunt\'ee \`a la POR (Partial Order
Reduction) permet de r\'eduire significativement l'espace de recherche en
reconnaissant certaines redondances entre les traces. Elle a \'et\'e
d\'evelopp\'ee dans le cas des propri\'et\'es d'accessibilit\'e.
L'objectif est de l'adapter au cas de l'\'equivalence, de l'automatiser,
d'augmenter son champ d'action et de l'introduire dans un outil
existant.}
}
@inproceedings{BMS-rp13,
address = {Uppsala, Sweden},
month = sep,
year = 2013,
volume = {8169},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abdulla, Parosh Aziz and Potapov, Igor},
acronym = {{RP}'13},
booktitle = {{P}roceedings of the 7th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'13)},
author = {Bouyer, Patricia and Markey, Nicolas and Sankur, Ocan},
title = {Robustness in timed automata},
pages = {1-18},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-rp13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-rp13.pdf},
doi = {10.1007/978-3-642-41036-9_1},
abstract = {In this paper we survey several approaches to the robustness of
timed automata, that~is, the ability of a system to resist to slight
perturbations or errors. We will concentrate on robustness against timing
errors which can be due to measuring errors, imprecise clocks, and
unexpected runtime behaviors such as execution times that are longer or
shorter than expected.\par
We consider the perturbation model of guard enlargement and formulate
several robust verification problems that have been studied recently,
including robustness analysis, robust implementation, and robust control.}
}
@inproceedings{CH-pnse13,
address = {Milano, Italy},
month = jun,
year = 2013,
volume = 969,
series = {CEUR Workshop Proceedings},
publisher = {RWTH Aachen, Germany},
editor = {Moldt, Daniel and R{\"o}lke, Heiko},
acronym = {{PNSE}'13},
booktitle = {{P}roceedings of the 7th {I}nternational {W}orkshop on {P}etri
{N}ets and {S}oftware {E}ngineering ({PNSE}'13)},
author = {Chatain, {\relax Th}omas and Haar, Stefan},
title = {A~Canonical Contraction for Safe {P}etri Nets},
pages = {25-39},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CH-pnse13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CH-pnse13.pdf},
abstract = {Under maximal semantics, the occurrence of an event~\(a\) in a
concurrent run of an occurrence net may imply the occurrence of other
events, not causally related to~\(a\), in the same run. In recent works, we
have formalized this phenomenon as the \emph{reveals} relation, and used
it to obtain a contraction of sets of events called \emph{facets} in the
context of occurrence nets. Here, we extend this idea to propose a
canonical contraction of general safe Petri nets into pieces of
partial-order behaviour which can be seen as {"}macro-transitions{"} since
all their events must occur together in maximal semantics. On occurrence
nets, our construction coincides with the facets abstraction. Our
contraction preserves the maximal semantics in the sense that the maximal
processes of the contracted net are in bijection with those of the
original net.}
}
@inproceedings{PHL-ictss13,
address = {Istanbul, Turkey},
month = nov,
year = 2013,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Yenig{\"u}n, H{\"u}sn{\"u} and Yilmaz, Cemal and Ulrich, Andreas},
acronym = {{ICTSS}'13},
booktitle = {{P}roceedings of the 25th {IFIP} {I}nternational {C}onference on
{T}esting {S}oftware and {S}ystems ({ICTSS}'13)},
author = {Ponce{ }de{~}Le{\'o}n, Hern{\'a}n and Haar, Stefan and
Longuet, Delphine},
title = {Unfolding-based Test Selection for Concurrent Conformance},
pages = {98-113},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/PHL-ictss13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/PHL-ictss13.pdf},
doi = {10.1007/978-3-642-41707-8_7},
abstract = {Model-based testing has mainly focused on models where currency
is interpreted as interleaving (like the ioco theory for labeled
transition systems), which may be too coarse when one wants concurrency to
be preserved in the implementation. In order to test such concurrent
systems, we choose to use Petri nets as specifications and define a
concurrent conformance relation named co-ioco. We propose a test
generation algorithm based on Petri net unfolding able to build a complete
test suite w.r.t our co-ioco conformance relation. In addition we propose
a coverage criterion based on a dedicated notion of complete prefixes that
selects a manageable test suite.}
}
@inproceedings{PBB-dx13,
address = {Jerusalem, Israel},
month = oct,
year = 2013,
editor = {Kalech, Meir and Feldman, Alexander and Provan, Gregory},
acronym = {{DX}'13},
booktitle = {{P}roceedings of the 24th {I}nternational {W}orkshop on
{P}rinciples of {D}iagnosis ({DX}'13)},
author = {Ponce{ }de{~}Le{\'o}n, Hern{\'a}n and Bonigo, Gonzalo and
Brand{\'a}n{ }Briones, Laura},
title = {Distributed Analysis of Diagnosability in Concurrent Systems},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/PBB-dx13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/PBB-dx13.pdf},
abstract = {Complex systems often exhibit unexpected faults that are
difficult to handle. Such systems are desirable to be diagnosable, i.e.
faults can be automatically detected as they occur (or shortly
afterwards), enabling the system to handle the fault or recover. A system
is diagnosable if it is possible to detect every fault, in a finite time
after they occurred, by only observing the available information from the
system. Complex systems are usually built from simpler components running
concurrently. We study how to infer the diagnosability property of a
complex system (distributed and with multiple faults) from a parallelized
analysis of the diagnosability of each of its components synchronizing
with fault free versions of the others. In this paper we make the
following contributions: (1)~we~address the diagnosability problem of
concurrent systems with arbitrary faults occurring freely in each
component. (2)~We~distribute the diagnosability analysis and illustrate
our approach with examples. Moreover, (3)~we~present a prototype tool that
implements our techniques showing promising results.}
}
@inproceedings{reichert-rp13,
address = {Uppsala, Sweden},
month = sep,
year = 2013,
volume = {8169},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abdulla, Parosh Aziz and Potapov, Igor},
acronym = {{RP}'13},
booktitle = {{P}roceedings of the 7th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'13)},
author = {Reichert, Julien},
title = {On The Complexity of Counter Reachability Games},
pages = {196-208},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JR-rp13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JR-rp13.pdf},
doi = {10.1007/978-3-642-41036-9_18},
abstract = {Counter reachability games are played by two players on a graph
with labelled edges. Each move consists in picking an edge from the
current location and adding its label to a counter vector. The objective
is to reach a given counter value in a given location. We distinguish
three semantics for counter reachability games, according to what happens
when a counter value would become negative: the edge is either disabled,
or enabled but the counter value becomes zero, or enabled. We consider the
problem of deciding the winner in counter reachability games and show
that, in most cases, it has the same complexity under all semantics.
Surprisingly, under one semantics, the complexity in dimension one depends
on whether the objective value is zero or any other integer.}
}
@inproceedings{BHJL-rp13,
address = {Uppsala, Sweden},
month = sep,
year = 2013,
volume = {8169},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abdulla, Parosh Aziz and Potapov, Igor},
acronym = {{RP}'13},
booktitle = {{P}roceedings of the 7th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'13)},
author = {B{\'e}rard, B{\'e}atrice and Haddad, Serge and
Jovanovic, Aleksandra and Lime, Didier},
title = {Parametric Interrupt Timed Automata},
pages = {59-69},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHJL-rp13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHJL-rp13.pdf},
doi = {10.1007/978-3-642-41036-9_7},
abstract = {Parametric reasoning is particularly relevant for timed models,
but very often leads to undecidability of reachability problems. We
propose a parametrised version of Interrupt Timed Automata (an~expressive
model incomparable to Timed Automata), where polynomials of parameters can
occur in guards and updates. We prove that different reachability
problems, including robust reachability, are decidable for this model, and
we give complexity upper bounds for a fixed or variable number of clocks
and parameters.}
}
@inproceedings{FS-rp13,
address = {Uppsala, Sweden},
month = sep,
year = 2013,
volume = {8169},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abdulla, Parosh Aziz and Potapov, Igor},
acronym = {{RP}'13},
booktitle = {{P}roceedings of the 7th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'13)},
author = {Fribourg, Laurent and Soulat, Romain},
title = {Stability Controllers for Sampled Switched Systems},
pages = {135-145},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FS-rp13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FS-rp13.pdf},
doi = {10.1007/978-3-642-41036-9_13},
abstract = {We consider in this paper switched systems, a class of hybrid
systems recently used with success in various domains such as automotive
industry and power electonics. We propose a state-dependent control
strategy which makes the trajectories of the analyzed system converge to
finite cyclic sequences of points. Our method relies on a technique of
decomposition of the state space into local regions where the control is
uniform. We have implemented the procedure using zonotopes, and applied it
successfully to several examples of the literature.}
}
@incollection{DKNPPPS-book13,
author = {Duflot, Marie and Kwiatkowska, Marta and
Norman, Gethin and Parker, David and
Peyronnet, Sylvain and Picaronny, Claudine and
Sproston, Jeremy},
title = {Practical Applications of Probabilistic Model
Checking to Communication Protocols},
booktitle = {Formal Methods for Industrial Critical Systems: A Survey of Applications},
editor = {Gnesi, Stefania and Margaria, Tiziana},
publisher = {John Wiley \& Sons, Ltd. and {IEEE} Computer Society Press},
year = 2013,
chapter = 7,
pages = {133-150},
month = mar,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DKNPPPS-book13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DKNPPPS-book13.pdf},
doi = {10.1002/9781118459898.ch7}
}
@inproceedings{DDS-icalp13,
address = {Riga, Latvia},
month = jul,
year = 2013,
volume = {7966},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Fomin, Fedor V. and Freivalds, R{\=u}si{\c{n}}{\v{s}}
and Kwiatkowska, Marta and Peleg, David},
acronym = {{ICALP}'13},
booktitle = {{P}roceedings of the 40th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'13)~-- {P}art~{II}},
author = {Demri, St{\'e}phane and Dhar, Amit Kumar and Sangnier, Arnaud},
title = {On the Complexity of Verifying Regular Properties on Flat Counter Systems},
pages = {162-173},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-icalp13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-icalp13.pdf},
doi = {10.1007/978-3-642-39212-2_17},
abstract = {Among the approximation methods for the verification of counter
systems, one of them consists in model-checking their flat unfoldings.
Unfortunately, the complexity characterization of model-checking problems
for such operational models is not always well studied except for
reachability queries or for Past LTL. In this paper, we characterize the
complexity of model-checking problems on flat counter systems for the
specification languages including first-order logic, linear mu-calculus,
infinite automata, and related formalisms. Our results span different
complexity classes (mainly from PTime to PSpace) and they apply to
languages in which arithmetical constraints on counter values are
systematically allowed. As far as the proof techniques are concerned, we
provide a uniform approach that focuses on the main issues.}
}
@inproceedings{JGL-mfcs13,
address = {Klosterneuburg, Austria},
month = aug,
year = 2013,
volume = {8087},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Chatterjee, Krishnendu and Sgall, Ji{\v{r}}{\'\i}},
acronym = {{MFCS}'13},
booktitle = {{P}roceedings of the 38th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'13)},
author = {Goubault{-}Larrecq, Jean},
title = {A Constructive Proof of the Topological {K}ruskal Theorem},
pages = {22-41},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-mfcs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-mfcs13.pdf},
doi = {10.1007/978-3-642-40313-2_3},
abstract = {We give a constructive proof of Kruskal's Tree
Theorem---precisely, of a topological extension of~it. The proof is in the
style of a constructive proof of Higman's Lemma due to Murthy and
Russell~(1990), and illuminates the role of regular expressions there. In
the process, we discover an extension of Dershowitz' recursive path
ordering to a form of cyclic terms which we call \(\mu\)-terms. This all came
from recent research on Noetherian spaces, and serves as a teaser for
their theory.}
}
@inproceedings{Fribourg-fsfma13,
address = {Singapore},
month = jul,
year = 2013,
volume = 31,
series = {Open Access Series in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Choppy, {\relax Ch}ristine and Sun, Jun},
acronym = {{FSFMA}'13},
booktitle = {{P}roceedings of the 1st {F}rench-{S}ingaporean {W}orkshop
on {F}ormal {M}ethods and {A}pplications ({FSFMA}'13)},
author = {Fribourg, Laurent},
title = {Control of Switching Systems by Invariance Analysis (Invited~Talk)},
pages = {1},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/F-fsfma13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/F-fsfma13.pdf},
doi = {10.4230/OASIcs.FSFMA.2013.1},
abstract = {Switched systems are embedded devices widespread in industrial
applications such as power electronics and automotive
control. They consist of continuous-time dynamical
subsystems and a rule that controls the switching between
them. Under a suitable control rule, the system can improve
its steady-state performance and meet essential properties
such as safety and stability in desirable operating zones.
We explain that such controller synthesis problems are
related to the construction of appropriate invariants of the
state space, which approximate the limit sets of the system
trajectories. We present a new approach of invariant
construction based on a technique of state space
decomposition interleaved with forward fixed point
computation. The method is illustrated in a case study taken
from the field of power electronics.}
}
@inproceedings{FKS-fsfma13,
address = {Singapore},
month = jul,
year = 2013,
volume = 31,
series = {Open Access Series in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Choppy, {\relax Ch}ristine and Sun, Jun},
acronym = {{FSFMA}'13},
booktitle = {{P}roceedings of the 1st {F}rench-{S}ingaporean {W}orkshop
on {F}ormal {M}ethods and {A}pplications ({FSFMA}'13)},
author = {Fribourg, Laurent and K{\"u}hne, Ulrich and Soulat, Romain},
title = {Constructing Attractors of Nonlinear Dynamical Systems by
State Space Decomposition},
pages = {53-60},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FKS-fsfma13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FKS-fsfma13.pdf},
doi = {10.4230/OASIcs.FSFMA.2013.53},
abstract = {In a previous work, we have shown how to generate attractor sets
of affine hybrid systems using a method of state space decomposition. We
show here how to adapt the method to polynomial dynamics systems by
approximating them as switched affine systems. We show the practical
interest of the method on standard examples of the literature.}
}
@inproceedings{GHPR-pn13,
address = {Milano, Italy},
month = jun,
year = 2013,
volume = {7927},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Colom, Jos{\'e}-Manuel and Desel, J{\"o}rg},
acronym = {{PETRI~NETS}'13},
booktitle = {{P}roceedings of the 34th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'13)},
author = {Geeraerts, Gilles and Heu{\ss}ner, Alexander and Praveen, M.
and Raskin, Jean-Fran{\c{c}}ois},
title = {{{\(\omega\)}}-{P}etri nets},
pages = {49-69},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GHPR-atpn13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GHPR-atpn13.pdf},
doi = {10.1007/978-3-642-38697-8_4},
abstract = {We introduce \(\omega\)-Petri nets (\(\omega\)PN), an extension
of plain Petri nets with \(\omega\)-labeled input and output arcs, that is
well-suited to analyse parametric concurrent systems with dynamic thread
creation. Most techniques (such as the Karp and Miller tree or the Rackoff
technique) that have been proposed in the setting of plain Petri nets do
not apply directly to \(\omega\)PN because \(\omega\)PN define transition systems
that have infinite branching. This motivates a thorough analysis of the
computational aspects of~\(\omega\)PN. We show that an \(\omega\)PN can be turned
into a plain Petri net that allows to recover the reachability set of the
\(\omega\)PN, but that does not preserve termination. This yields complexity
bounds for the reachability, (place) boundedness and coverability problems
on \(\omega\)PN. We provide a practical algorithm to compute a coverability
set of the \(\omega\)PN and to decide termination by adapting the classical
Karp and Miller tree construction. We also adapt the Rackoff technique to
\(\omega\)PN, to obtain the exact complexity of the termination problem.
Finally, we consider the extension of \(\omega\)PN with reset and transfer
arcs, and show how this extension impacts the decidability and complexity
of the aforementioned problems.}
}
@article{KS-tocl13,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Kazana, Wojciech and Segoufin, Luc},
title = {Enumeration of monadic second-order queries on trees},
volume = 14,
number = {4},
year = 2013,
month = nov,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-tocl13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-tocl13.pdf},
doi = {10.1145/2528928},
abstract = {We consider the enumeration problem of monadic second-order
(MSO) queries with first-order free variables over trees. In [Bagan 2006]
it was shown that this problem is in
\textsc{Constant-Delay}\(_{\text{lin}}\). An enumeration problem belongs
to \textsc{Constant-Delay}\(_{\text{lin}}\) if for an input structure of
size~\(n\) it can be solved by:
\begin{itemize}
\item an \(O(n)\) precomputation phase building an index structure,
\item followed by a phase enumerating the answers with no repetition and a
constant delay between two consecutive outputs.
\end{itemize}
In this article we give a different proof of this result based on the
deterministic factorization forest decomposition theorem of Colcombet
[Colcombet~2007].}
}
@inproceedings{BST-pods13,
address = {New~York, New~York, USA},
month = jun,
year = 2013,
publisher = {ACM Press},
editor = {Fan, Wenfei},
acronym = {{PODS}'13},
booktitle = {{P}roceedings of the 32nd {A}nnual
{ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium
on {P}rinciples of {D}atabase {S}ystems
({PODS}'13)},
author = {Boja{\'n}czyk, Miko{\l}aj and Segoufin, Luc and Toru{\'n}czyk, Szymon},
title = {Verification of Database-driven Systems via Amalgamation},
pages = {63-74},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BST-pods13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BST-pods13.pdf},
doi = {10.1145/2463664.2465228},
abstract = {We describe a general framework for static verification of
systems that base their decisions upon queries to databases. The database
is specified using constraints, typically a schema, and is not modified
during a run of the system. The system is equipped with a finite number of
registers for storing intermediate information from the database and the
specification consists of a transition table described using
quantifier-free formulas that can query either the database or the
registers.\par
Our main result concerns systems querying XML databases---modeled as data
trees---using quantifier-free formulas with predicates such as the
descendant axis or comparison of data values. In this scenario we show an
ExpSpace algorithm for deciding reachability.\par
Our technique is based on the notion of amalgamation and is quite general.
For instance it also applies to relational databases (with an optimal
\textsc{PSpace} algorithm).\par
We also show that minor extensions of the model lead to undecidability.}
}
@inproceedings{GLS-pods13,
address = {New~York, New~York, USA},
month = jun,
year = 2013,
publisher = {ACM Press},
editor = {Fan, Wenfei},
acronym = {{PODS}'13},
booktitle = {{P}roceedings of the 32nd {A}nnual
{ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium
on {P}rinciples of {D}atabase {S}ystems
({PODS}'13)},
author = {Gheerbrant, Am{\'e}lie and Libkin, Leonid and Sirangelo, Cristina},
title = {When is Na{\"\i}ve Evaluation Possible?},
pages = {75-86},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GLS-pods13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GLS-pods13.pdf},
doi = {10.1145/2463664.2463674},
abstract = {The term na{\"\i}ve evaluation refers to evaluating queries over
incomplete databases as if nulls were usual data values, i.e., to using
the standard database query evaluation engine. Since the semantics of
query answering over incomplete databases is that of certain answers, we
would like to know when na{\"\i}ve evaluation computes them: i.e., when
certain answers can be found without inventing new specialized algorithms.
For relational databases it is well known that unions of conjunctive
queries possess this desirable property, and results on preservation of
formulae under homomorphisms tell us that within relational calculus, this
class cannot be extended under the open-world assumption.\par
Our goal here is twofold. First, we develop a general framework that
allows us to determine, for a given semantics of incompleteness, classes
of queries for which na{\"\i}ve evaluation computes certain answers.
Second, we apply this approach to a variety of semantics, showing that for
many classes of queries beyond unions of conjunctive queries, na{\"\i}ve
evaluation makes perfect sense under assumptions different from
open-world. Our key observations are: (1)~na{\"\i}ve evaluation is
equivalent to monotonicity of queries with respect to a semantics-induced
ordering, and (2)~for most reasonable semantics, such monotonicity is
captured by preservation under various types of homomorphisms. Using these
results we find classes of queries for which na{\"\i}ve evaluation works,
e.g., positive first-order formulae for the closed-world semantics. Even
more, we introduce a general relation-based framework for defining
semantics of incompleteness, show how it can be used to capture many known
semantics and to introduce new ones, and describe classes of first-order
queries for which na{\"\i}ve evaluation works under such semantics.}
}
@inproceedings{AV-pods13,
address = {New~York, New~York, USA},
month = jun,
year = 2013,
publisher = {ACM Press},
editor = {Fan, Wenfei},
acronym = {{PODS}'13},
booktitle = {{P}roceedings of the 32nd {A}nnual
{ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium
on {P}rinciples of {D}atabase {S}ystems
({PODS}'13)},
author = {Abiteboul, Serge and Vianu, Victor},
title = {Collaborative Data-Driven Workflows: Think Global, Act Local},
pages = {91-102},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AV-pods13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AV-pods13.pdf},
doi = {10.1145/2463664.2463672},
abstract = {We introduce and study a model of collaborative data-driven
workflows. In a local-as-view style, each peer has a partial view of a
global instance that remains purely virtual. Local updates have side
effects on other peers' data, defined via the global instance. We also
assume that the peers provide (an abstraction of) their specifications, so
that each peer can actually see and reason on the specification of the
entire system. We study the ability of a peer to carry out runtime
reasoning about the global run of the system, and in particular about
actions of other peers, based on its own local observations. A main
contribution is to show that, under a reasonable restriction (namely,
key-visibility ), one can construct a finite symbolic representation of
the infinite set of global runs consistent with given local observations.
Using the symbolic representation, we show that we can evaluate in pspace
a large class of properties over global runs, expressed in an extension of
first-order logic with past linear-time temporal operators, PLTL-FO. We
also provide a variant of the algorithm allowing to incrementally monitor
a statically defined property, and then develop an extension allowing to
monitor an infinite class of properties sharing the same temporal
structure, defined dynamically as the run unfolds. Finally, we consider an
extension of the language, augmeting workflow control with PLTL-FO
formulas. We prove that this does not increase the power of the workflow
specification language, thereby showing that the language is closed under
such introspective reasoning.}
}
@inproceedings{KS-pods13,
address = {New~York, New~York, USA},
month = jun,
year = 2013,
publisher = {ACM Press},
editor = {Fan, Wenfei},
acronym = {{PODS}'13},
booktitle = {{P}roceedings of the 32nd {A}nnual
{ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium
on {P}rinciples of {D}atabase {S}ystems
({PODS}'13)},
author = {Kazana, Wojciech and Segoufin, Luc},
title = {Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion},
pages = {297-308},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-pods13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-pods13.pdf},
doi = {10.1145/2463664.2463667},
abstract = {We consider the evaluation of first-order queries over classes
of databases with bounded expansion. The notion of bounded expansion is
fairly broad and generalizes bounded degree, bounded treewidth and
exclusion of at least one minor. It was known that over a class of
databases with bounded expansion, first-order sentences could be evaluated
in time linear in the size of the database. We first give a different
proof of this result. Moreover, we show that answers to first-order
queries can be enumerated with constant delay after a linear time
preprocessing. We also show that counting the number of answers to a query
can be done in time linear in the size of the database.}
}
@inproceedings{SHLRFLF-epe13,
address = {Lille, France},
month = sep,
year = 2013,
publisher = {{IEEE} Power Electronics Society},
editor = {Lataire, {\relax Ph}ilippe},
booktitle = {{P}roceedings of the 15th {E}uropean {C}onference
on {P}ower {E}lectronics and {A}pplications ({EPE}'13)},
author = {Soulat, Romain and H{\'e}rault, Guillaume and Labrousse,
Denis and Revol, Bertrand and Feld, Gilles and Lefebvre,
St{\'e}phane and Fribourg, Laurent},
title = {Use of a full wave correct-by-design command to control a
multilevel modular converter},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SHLRFLF-epe13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SHLRFLF-epe13.pdf},
doi = {10.1109/EPE.2013.6634448},
abstract = {This paper proposes a method to synthesize a full wave control
applied to a multilevel modular converter~(MMC). This method guarantees
the output waveform and the balancing of the capacitors. Numerical
simulations and experiments are used to check the validity of the
approach.}
}
@inproceedings{ABDHHKLP-icfem13,
address = {Queenstown, New~Zealand},
month = oct # {-} # nov,
year = 2013,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Groves, Lindsay and Sub, Jing},
acronym = {{ICFEM}'13},
booktitle = {{P}roceedings of the 15th {I}nternational
{C}onference on {F}ormal {E}ngineering
{M}ethods
({ICFEM}'13)},
author = {Andr{\'e}, {\'E}tienne and Barbot, Beno{\^\i}t and
D{\'e}moulins, Cl{\'e}ment and Hillah, Lom Messan and
Hulin{-}Hubard, Francis and Kordon, Fabrice and Linard, Alban
and Petrucci, Laure},
title = {A Modular Approach for Reusing Formalisms in Verification
Tools of Concurrent Systems},
pages = {199-214},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABDHHKLP-icfem13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABDHHKLP-icfem13.pdf},
doi = {10.1007/978-3-642-41202-8_14},
abstract = {Over the past two decades, numerous verification tools have been
successfully used for verifying complex concurrent systems, modelled using
various formalisms. However, it is still hard to coordinate these tools
since they rely on such a large number of formalisms. Having a proper
syntactical mechanism to interrelate them through variability would
increase the capability of effective integrated formal methods. In this
paper, we propose a modular approach for defining new formalisms by
reusing existing ones and adding new features and/or constraints. Our
approach relies on standard XML technologies; their use provides the
capability of rapidly and automatically obtaining tools for representing
and validating models. It thus enables fast iterations in developing and
testing complex formalisms. As a case study, we applied our modular
definition approach on families of Petri nets and timed automata.}
}
@inproceedings{AHHKLLP-iceccs13,
address = {Singapore},
month = jul,
year = 2013,
publisher = {{IEEE} Computer Society Press},
editor = {Liu, Yang and Martin, Andrew},
acronym = {{ICECCS}'13},
booktitle = {{P}roceedings of the 18th {IEEE} {I}nternational {C}onference on {E}ngineering of
{C}omplex {C}omputer {S}ystems ({ICECCS}'13)},
author = {Andr{\'e}, {\'E}tienne and Hillah, Lom Messan and Hulin{-}Hubard,
Francis and Kordon, Fabrice and Lembachar, Yousra and Linard, Alban
and Petrucci, Laure},
title = {{C}osy{V}erif: An~Open Source Extensible Verification
Environment},
pages = {33-36},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AHHKLLP-iceccs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AHHKLLP-iceccs13.pdf},
doi = {10.1109/ICECCS.2013.15},
abstract = {CosyVerif aims at gathering within a common framework various
existing tools for specification and verification. It has been designed in
order to 1)~support different formalisms with the ability to easily create
new ones, 2)~provide a graphical user interface for every formalism,
3)~include verification tools called via the graphical interface or via an
API as a Web service, and 4)~offer the possibility for a developer to
integrate his/her own tool without much effort, also allowing it to
interact with the other tools. Several tools have already been integrated
for the formal verification of (extensions~of) Petri nets and timed
automata.}
}
@inproceedings{LM-gandalf13,
address = {Borca di Cadore, Italy},
month = aug,
year = 2013,
volume = {119},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Puppis, Gabriele and Villa, Tiziano},
acronym = {{GandALF}'13},
booktitle = {{P}roceedings of the 4th {I}nternational {S}ymposium
on {G}ames, {A}utomata, {L}ogics, and {F}ormal {V}erification
({GandALF}'13)},
author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas},
title = {Satisfiability of {ATL} with strategy contexts},
pages = {208-223},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LM-gandalf13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LM-gandalf13.pdf},
doi = {10.4204/EPTCS.119.18},
abstract = {Various extensions of the temporal logic ATL have recently been
introduced to express rich properties of multi-agent systems. Among these,
ATLsc extends ATL with \emph{strategy contexts}, while Strategy Logic has
\emph{first-order quantification} over strategies. There is a price to pay
for the rich expressiveness of these logics: model-checking is
non-elementary, and satisfiability is undecidable.\par
We prove in this paper that satisfiability is decidable in several special
cases. The most important one is when restricting to \emph{turn-based}
games. We~prove that decidability also holds for concurrent games if the
number of moves available to the agents is bounded. Finally, we~prove that
restricting strategy quantification to memoryless strategies brings back
undecidability.}
}
@inproceedings{BDGORW-atva13,
address = {Hanoi, Vietnam},
month = oct,
year = {2013},
volume = {8172},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Dang{-}Van, Hung and Ogawa, Mizuhito},
acronym = {{ATVA}'13},
booktitle = {{P}roceedings of the 11th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'13)},
author = {Brihaye, {\relax Th}omas and Doyen, Laurent and Geeraerts, Gilles and
Ouaknine, Jo{\"e}l and Raskin, Jean-Fran{\c{c}}ois
and Worrell, James},
title = {Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed
Points},
pages = {55-70},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDGORW-atva13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDGORW-atva13.pdf},
doi = {10.1007/978-3-319-02444-8_6},
abstract = {We study the \emph{time-bounded reachability problem} for \emph{monotonic
hybrid automata} (MHA), i.e., rectangular hybrid automata for which the
rate of each variable is either always non-negative or always
non-positive. In this paper, we revisit the decidability results presented
in [Brihaye et~al., \textit{On reachability for hybrid automata over
bounded time}, ICALP~2011] and show that the problem is NExpTime-complete.
We also show that we can effectively compute fixed points that
characterise the sets of states that are reachable (resp. co-reachable)
within \(T\) time units from a given state.}
}
@inproceedings{CDRR-atva13,
address = {Hanoi, Vietnam},
month = oct,
year = {2013},
volume = {8172},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Dang{-}Van, Hung and Ogawa, Mizuhito},
acronym = {{ATVA}'13},
booktitle = {{P}roceedings of the 11th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'13)},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Randour, Mickael and
Raskin, Jean-Fran{\c{c}}ois},
title = {Looking at Mean-Payoff and Total-Payoff through Windows},
pages = {118-132},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDRR-atva13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDRR-atva13.pdf},
doi = {10.1007/978-3-319-02444-8_10},
abstract = {We consider two-player games played on weighted directed graphs
with mean-payoff and total-payoff objectives, two classical quantitative
objectives. While for single-dimensional games the complexity and memory
bounds for both objectives coincide, we show that in contrast to
multi-dimensional mean-payoff games that are known to be coNP-complete,
multi-dimensional total-payoff games are undecidable. We introduce
conservative approximations of these objectives, where the payoff is
considered over a local finite window sliding along a play, instead of the
whole play. For single dimension, we show that (i)~if the window size is
polynomial, deciding the winner takes polynomial time, and (ii)~the
existence of a bounded window can be decided in NP coNP, and is at least
as hard as solving mean-payoff games. For multiple dimensions, we show
that (i)~the problem with fixed window size is EXPTIME-complete, and
(ii)~there is no primitive-recursive algorithm to decide the existence of
a bounded window.}
}
@inproceedings{RS-atva13,
address = {Hanoi, Vietnam},
month = oct,
year = {2013},
volume = {8172},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Dang{-}Van, Hung and Ogawa, Mizuhito},
acronym = {{ATVA}'13},
booktitle = {{P}roceedings of the 11th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'13)},
author = {Rodr{\'\i}guez, C{\'e}sar and Schwoon, Stefan},
title = {Cunf: A~Tool for Unfolding and Verifying Petri Nets with Read
Arcs},
pages = {492-495},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/RS-atva13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/RS-atva13.pdf},
doi = {10.1007/978-3-319-02444-8_42},
abstract = {Cunf is a tool for building and analyzing unfoldings of Petri
nets with read arcs. An unfolding represents the behaviour of a net by a
partial order, effectively coping with the state-explosion problem
stemming from the interleaving of concurrent actions. C-net unfoldings can
be up to exponentially smaller than Petri net unfoldings, and recent work
proposed algorithms for their construction and verification. Cunf is the
first implementation of these techniques, it has been carefully engineered
and optimized to ensure that the theoretical gains are put into
practice.}
}
@inproceedings{AFS-atva13,
address = {Hanoi, Vietnam},
month = oct,
year = {2013},
volume = {8172},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Dang{-}Van, Hung and Ogawa, Mizuhito},
acronym = {{ATVA}'13},
booktitle = {{P}roceedings of the 11th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'13)},
author = {Andr{\'e}, {\'E}tienne and Fribourg, Laurent and Soulat, Romain},
title = {Merge and Conquer: State Merging in Parametric Timed Automata},
pages = {381-396},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AFS-atva13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AFS-atva13.pdf},
doi = {10.1007/978-3-319-02444-8_27},
abstract = {Parameter synthesis for real-time systems aims at synthesizing
dense sets of valuations for the timing requirements, guaranteeing a good
behavior. A popular formalism for modeling parameterized realtime systems
is parametric timed automata (PTAs). Compacting the state space of PTAs as
much as possible is fundamental. We present here a state merging reduction
based on convex union, that reduces the state space, but yields an
over-approximation of the executable paths. However, we show that it
preserves the sets of reachable locations and executable actions. We also
show that our merging technique associated with the inverse method, an
algorithm for parameter synthesis, preserves locations as well, and
outputs larger sets of parameter valuations.}
}
@article{CCD-tcs13,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Cheval, Vincent and Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
title = {Deciding equivalence-based properties using constraint solving},
year = {2013},
month = jun,
volume = {492},
pages = {1-39},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-tcs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-tcs13.pdf},
doi = {10.1016/j.tcs.2013.04.016},
abstract = {Formal methods have proved their usefulness for analyzing the
security of protocols. Most existing results focus on trace properties
like secrecy or authentication. There are however several security
properties, which cannot be defined (or cannot be naturally defined) as
trace properties and require a notion of behavioural equivalence. Typical
examples are anonymity, privacy related properties or statements closer to
security properties used in cryptography.\par
In this paper, we consider three notions of equivalence defined in the
applied pi calculus: observational equivalence, may-testing equivalence,
and trace equivalence. First, we study the relationship between these
three notions. We show that for determinate processes, observational
equivalence actually coincides with trace equivalence, a notion simpler to
reason with. We exhibit a large class of determinate processes, called
simple processes, that capture most existing protocols and cryptographic
primitives. While trace equivalence and may-testing equivalence seem very
similar, we show that may-testing equivalence is actually strictly
stronger than trace equivalence. We prove that the two notions coincide
for image-finite processes, such as processes without replication.\par
Second, we reduce the decidability of trace equivalence (for finite
processes) to deciding symbolic equivalence between sets of constraint
systems. For simple processes without replication and with trivial else
branches, it turns out that it is actually sufficient to decide symbolic
equivalence between pairs of positive constraint systems. Thanks to this
reduction and relying on a result first proved by M. Baudet, this yields
the first decidability result of observational equivalence for a general
class of equational theories (for processes without else branch nor
replication). Moreover, based on another decidability result for deciding
equivalence between sets of constraint systems, we get decidability of
trace equivalence for processes with else branch for standard
primitives.}
}
@inproceedings{SS-concur13,
address = {Buenos Aires, Argentina},
month = aug,
year = 2013,
volume = 8052,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {D'Argenio, Pedro R. and Melgratti, Hern{\'a}n)},
acronym = {{CONCUR}'13},
booktitle = {{P}roceedings of the 24th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'13)},
author = {Schmitz, Sylvain and Schnoebelen, {\relax Ph}ilippe},
title = {The Power of Well-Structured Systems},
pages = {5-24},
url = {http://arxiv.org/abs/1402.2908},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SS-concur13.pdf},
doi = {10.1007/978-3-642-40184-8_2},
abstract = {Well-structured systems, aka WSTS, are computational models
where the set of possible configurations is equipped with a
well-quasi-ordering which is compatible with the transition relation
between configurations. This structure supports generic decidability
results that are important in verification and several other fields. This
paper recalls the basic theory underlying well-structured systems and
shows how two classic decision algorithms can be formulated as an
exhaustive search for some {"}bad{"} sequences. This lets us describe new
powerful techniques for the complexity analysis of WSTS algorithms.
Recently, these techniques have been successful in precisely
characterizing the power, in a complexity-theoretical sense, of several
important WSTS models like unreliable channel systems, monotonic counter
machines, or networks of timed systems.}
}
@inproceedings{CCS-cade2013,
address = {Lake Placid, New~York, USA},
month = jun,
year = 2013,
volume = 7898,
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer},
editor = {Bonacina, Maria Paola},
acronym = {{CADE}'13},
booktitle = {{P}roceedings of the 24th {I}nternational
{C}onference on {A}utomated {D}eduction
({CADE}'13)},
author = {Comon{-}Lundh, Hubert and Cortier, V{\'e}ronique and
Scerri, Guillaume},
title = {Tractable inference systems: an extension with a
deducibility predicate},
pages = {91-108},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCS-cade2013.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCS-cade2013.pdf},
doi = {10.1007/978-3-642-38574-2_6},
abstract = {The main contribution of the paper is a PTIME decision procedure
for the satisfiability problem in a class of first-order Horn clauses. Our
result is an extension of the tractable classes of Horn clauses of Basin &
Ganzinger in several respects. For instance, our clauses may contain
atomic formulas \(S \vdash t\) where \(\vdash\) is a predicate symbol and
\(S\) is a finite set of terms instead of a term. \(\vdash\)~is used to
represent any possible computation of an attacker, given a set of
messages~\(S\). The class of clauses that we consider encompasses the
clauses designed by Bana~\& Comon-Lundh for security proofs of protocols
in a computational model. \par
Because of the (variadic) \(\vdash\) predicate symbol, we cannot use
ordered resolution strategies only, as in Basin~\& Ganzinger: given \(S
\vdash t\), we must avoid computing \(S' \vdash t\) for all subsets \(S'\)
of~\(S\). Instead, we design PTIME entailment procedures for increasingly
expressive fragments, such procedures being used as oracles for the next
fragment. \par
Finally, we obtain a PTIME procedure for arbitrary ground clauses and
saturated Horn clauses (as in Basin~\& Ganzinger), together with a
particular class of (non saturated) Horn clauses with the \(\vdash\)
predicate and constraints (which are necessary to cover the
application).}
}
@inproceedings{HRS-acsd13,
address = {Barcelona, Spain},
month = jul,
year = 2013,
publisher = {{IEEE} Computer Society Press},
editor = {Pietkiewicz{-}Koutny, Marta and Lazarescu, Mihai Teodor},
acronym = {{ACSD}'13},
booktitle = {{P}roceedings of the 13th {I}nternational
{C}onference on {A}pplication of {C}oncurrency
to {S}ystem {D}esign
({ACSD}'13)},
author = {Haar, Stefan and Rodr{\'\i}guez, C{\'e}sar and Schwoon, Stefan},
title = {Reveal Your Faults: It's Only Fair!},
pages = {120-129},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HRS-acsd13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HRS-acsd13.pdf},
doi = {10.1109/ACSD.2013.15},
abstract = {We present a methodology for fault diagnosis in
concurrent, partially observable systems with additional fairness
constraints. In this weak diagnosis, one asks whether a concurrent
chronicle of observed events allows to determine that a
non-observable fault will inevitably occur, sooner or later, on
any maximal system run compatible with the observation. The
approach builds on strengths and techniques of unfoldings of safe
Petri nets, striving to compute a compact prefix of the unfolding
that carries sufficient information for the diagnosis
algorithm. Our work extends and generalizes the unfolding-based
diagnosis approaches by Benveniste \textit{et~al.} as well as
Esparza and Kern. Both of these focused mostly on the use of
sequential observations, in particular did not exploit the
capacity of unfoldings to reveal inevitable occurrences of
concurrent or future events studied by Balaguer
\textit{et~al.}. Our diagnosis method captures such indirect,
revealed dependencies. We~develop theoretical foundations and an
algorithmic solution to the diagnosis problem, and present a SAT
solving method for practical diagnosis with our approach.}
}
@article{HKS-tcs13,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Haar, Stefan and Kern, Christian and Schwoon, Stefan},
title = {Computing the Reveals Relation in Occurrence Nets},
year = 2013,
month = jul,
volume = 493,
pages = {66-79},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HKS-tcs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HKS-tcs13.pdf},
doi = {10.1016/j.tcs.2013.04.028},
abstract = {Petri net unfoldings are a useful tool to tackle state-space
explosion in verification and related tasks. Moreover, their structure
allows to access directly the relations of causal precedence, concurrency,
and conflict between events. Here, we explore the data structure further,
to determine the following relation: event~\(a\) is said to reveal
event~\(b\) iff the occurrence of~\(a\) implies that~\(b\) inevitably
occurs, too, be it before, after, or concurrently with~\(a\). Knowledge of
reveals facilitates in particular the analysis of partially observable
systems, in the context of diagnosis, testing, or verification; it can
also be used to generate more concise representations of behaviours via
abstractions. The reveals relation was previously introduced in the
context of fault diagnosis, where it was shown that the reveals relation
was decidable: for a given pair~\(a,b\) in the unfolding~\(U\) of a safe
Petri net~\(N\), a finite prefix~\(P\) of~\(U\) is sufficient to decide
whether or not \(a\) reveals~\(b\). In this paper, we first considerably
improve the bound on~\(|P|\). We then show that there exists an efficient
algorithm for computing the relation on a given prefix. We have
implemented the algorithm and report on experiments.}
}
@inproceedings{FS-ncmip13,
address = {Cachan, France},
month = may,
year = 2013,
number = {012007},
volume = 464,
series = {Journal of Physics: Conference Series},
publisher = {{IOS} Press},
editor = {Blanc{-}F{\'e}raud, Laure and Joubert, Pierre-Yves},
acronym = {{NCMIP}'13},
booktitle = {{P}roceedings of the 3rd {I}nternational {W}orkshop on {N}ew
{C}omputational {M}ethods for {I}nverse {P}roblems ({NCMIP}'13)},
author = {Fribourg, Laurent and Soulat, Romain},
title = {Limit Cycles of Controlled Switched Systems: Existence,
Stability, Sensitivity},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FS-ncmip13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FS-ncmip13.pdf},
doi = {10.1088/1742-6596/464/1/012007},
abstract = {We present a control method which makes the trajectories
of a switched system converge to a stable limit cycle lying in a
desired region of equilibrium. The method is illustrated on the
boost DC-DC converter example. We also point out in this example
the sensitivity of limit cycles to parameter variations by showing
how the limit cycle evolves in presence of small perturbations of
some system parameters. This suggests that limit cycles are good
candidates for reliable estimations of the physical parameters of
switched systems, using an appropriate inverse approach.}
}
@inproceedings{ABHH-qest13,
address = {Buenos Aires, Argentina},
month = aug,
year = 2013,
publisher = {{IEEE} Computer Society Press},
acronym = {{QEST}'13},
booktitle = {{P}roceedings of the 10th {I}nternational
{C}onference on {Q}uantitative
{E}valuation of {S}ystems
({QEST}'13)},
author = {Akshay, S. and Bertrand, Nathalie and Haddad, Serge and
H{\'e}lou{\"e}t, Lo{\"\i}c},
title = {The steady-state control problem for Markov decision processes},
pages = {290-304},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABHH-qest13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABHH-qest13.pdf},
doi = {10.1007/978-3-642-40196-1_26},
abstract = {This paper addresses a control problem for probabilistic models
in the setting of Markov decision processes~(MDP). We~are interested in
the steady-state control problem which asks, given an ergodic MDP~\(M\)
and a distribution~\(\delta_{\text{goal}}\), whether there exists a
(history-dependent randomized) policy \(\pi\) ensuring that the
steady-state distribution of~\(M\) under~\(\pi\) is
exactly~\(\delta_{\text{goal}}\). We~first show that stationary randomized
policies suffice to achieve a given steady-state distribution. Then we
infer that the steady-state control problem is decidable for~MDP, and can
be represented as a linear program which is solvable in PTIME. This
decidability result extends to labeled MDP (LMDP) where the objective is a
steady-state distribution on labels carried by the states, and we provide
a PSPACE algorithm. We also show that a related steady-state language
inclusion problem is decidable in EXPTIME for LMDP. Finally, we prove that
if we consider MDP under partial observation (POMDP), the steady-state
control problem becomes undecidable.}
}
@inproceedings{KKS-esorics13,
address = {Egham, U.K.},
month = sep,
year = 2013,
volume = {8134},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Crampton, Jason and Jajodia, Sushil and Mayes, Keith},
acronym = {{ESORICS}'13},
booktitle = {{P}roceedings of the 18th {E}uropean {S}ymposium on
{R}esearch in {C}omputer {S}ecurity ({ESORICS}'13)},
author = {Kremer, Steve and K{\"u}nnemann, Robert and Steel, Graham},
title = {Universally Composable Key-Management},
pages = {327-344},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KKS-esorics13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KKS-esorics13.pdf},
doi = {10.1007/978-3-642-40203-6_19},
abstract = {We present the first universally composable key-management
functionality, formalized in the GNUC framework by Hofheinz and Shoup. It
allows the enforcement of a wide range of security policies and can be
extended by diverse key usage operations with no need to repeat the
security proof. We illustrate its use by proving an implementation of a
security token secure with respect to arbitrary key-usage operations and
explore a proof technique that allows the storage of cryptographic keys
externally, a novel development in simulation-based security frameworks.}
}
@phdthesis{sankur-phd2013,
author = {Sankur, Ocan},
title = {Robustness in Timed Automata: Analysis, Synthesis, Implementation},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2013,
month = may,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/sankur-phd13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/sankur-phd13.pdf}
}
@article{FK-ijfcs13,
publisher = {World Scientific},
journal = {International Journal of Foundations of Computer Science},
author = {Fribourg, Laurent and K{\"u}hne, Ulrich},
title = {Parametric Verification and Test Coverage for Hybrid Automata
using the Inverse Method},
year = 2013,
month = feb,
volume = 24,
number = 2,
pages = {233-249},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FK-ijfcs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FK-ijfcs13.pdf},
doi = {10.1142/S0129054113400091},
abstract = {Hybrid systems combine continuous and discrete behavior. Hybrid
Automata are a powerful formalism for the modeling and verification of
such systems. A~common problem in hybrid system verification is the good
parameters problem, which consists in identifying a set of parameter
valuations which guarantee a certain behavior of a system. Recently, a
method has been presented for attacking this problem for Timed Automata.
In this paper, we show the extension of this methodology for hybrid
automata with linear and affine dynamics. The method is demonstrated with
a hybrid system benchmark from the literature.}
}
@inproceedings{CJ-formats13,
address = {Buenos Aires, Argentina},
month = aug,
year = 2013,
volume = 8053,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Braberman, V{\'\i}ctor and Fribourg, Laurent},
acronym = {{FORMATS}'13},
booktitle = {{P}roceedings of the 11th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'13)},
author = {Chatain, {\relax Th}omas and Jard, Claude},
title = {Back in Time {P}etri Nets},
pages = {91-105},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CJ-formats13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CJ-formats13.pdf},
doi = {10.1007/978-3-642-40229-6_7},
abstract = {The time progress assumption is at the core of the semantics of
real-time formalisms. It is also the major obstacle to the development of
partial-order techniques for real-time distributed systems since the
events are ordered both by causality and by their occurrence in time.
Anyway, extended free choice safe time Petri nets (TPNs) were already
identified as a class where partial order semantics behaves well. We show
that, for this class, the time progress assumption can even be dropped
(time may go back in case of concurrency), which establishes a nice
relation between partial-order semantics and time progress assumption.}
}
@inproceedings{BMS-formats13,
address = {Buenos Aires, Argentina},
month = aug,
year = 2013,
volume = 8053,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Braberman, V{\'\i}ctor and Fribourg, Laurent},
acronym = {{FORMATS}'13},
booktitle = {{P}roceedings of the 11th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'13)},
author = {Bouyer, Patricia and Markey, Nicolas and Sankur, Ocan},
title = {Robust Weighted Timed Automata and Games},
pages = {31-46},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-formats13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-formats13.pdf},
doi = {10.1007/978-3-642-40229-6_3},
abstract = {Weighted timed automata extend timed automata with cost
variables that can be used to model the evolution of various quantities.
Although cost-optimal reachability is decidable (in polynomial space) on
this model, it becomes undecidable on weighted timed games. This paper
studies cost-optimal reachability problems on weighted timed automata and
games under robust semantics. More precisely, we consider two perturbation
game semantics that introduce imprecisions in the standard semantics, and
bring robustness properties w.r.t. timing imprecisions to controllers. We
give a polynomial-space algorithm for weighted timed automata, and prove
the undecidability of cost-optimal reachability on weighted timed games,
showing that the problem is robustly undecidable.}
}
@inproceedings{HSS-concur13,
address = {Buenos Aires, Argentina},
month = aug,
year = 2013,
volume = 8052,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {D'Argenio, Pedro R. and Melgratti, Hern{\'a}n)},
acronym = {{CONCUR}'13},
booktitle = {{P}roceedings of the 24th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'13)},
author = {Haase, Christoph and Schmitz, Sylvain and Schnoebelen,
{\relax Ph}ilippe},
title = {The Power of Priority Channel Systems},
pages = {319-333},
url = {http://arxiv.org/abs/1301.5500},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HSS-corr13.pdf},
arxivpdf = {http://arxiv.org/pdf/1301.5500},
doi = {10.1007/978-3-642-40184-8_23},
abstract = {We introduce Priority Channel Systems, a new natural class of
channel systems where messages carry a numeric priority and where
higher-priority messages can supersede lower-priority messages preceding
them in the fifo communication buffers. The decidability of safety and
inevitability properties is shown via the introduction of a \emph{priority
embedding}, a~well-quasi-ordering that has not previously been used in
well-structured systems. We then show how Priority Channel Systems can
compute Fast-Growing functions and prove that the aforementioned
verification problems are \(F_{\epsilon_{0}}\)-complete.}
}
@inproceedings{SBMR-concur13,
address = {Buenos Aires, Argentina},
month = aug,
year = 2013,
volume = 8052,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {D'Argenio, Pedro R. and Melgratti, Hern{\'a}n)},
acronym = {{CONCUR}'13},
booktitle = {{P}roceedings of the 24th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'13)},
author = {Sankur, Ocan and Bouyer, Patricia and Markey, Nicolas and
Reynier, Pierre-Alain},
title = {Robust Controller Synthesis in Timed Automata},
pages = {546-560},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SBMR-concur13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SBMR-concur13.pdf},
doi = {10.1007/978-3-642-40184-8_38},
abstract = {We consider the fundamental problem of B{\"u}chi acceptance in
timed automata in a robust setting. The problem is formalised in terms of
controller synthesis: timed automata are equipped with a parametrised
game-based semantics that models the possible perturbations of the
decisions taken by the controller. We characterise timed automata that are
robustly controllable for some parameter, with a simple graph theoretic
condition, by showing the equivalence with the existence of an aperiodic
lasso that satisfies the winning condition (aperiodicity was defined and
used earlier in different contexts to characterise convergence phenomena
in timed automata). We then show decidability and PSPACE-completeness of
our problem.}
}
@inproceedings{FGH-mfcs13,
address = {Klosterneuburg, Austria},
month = aug,
year = 2013,
volume = {8087},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Chatterjee, Krishnendu and Sgall, Ji{\v{r}}{\'\i}},
acronym = {{MFCS}'13},
booktitle = {{P}roceedings of the 38th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'13)},
author = {Finkel, Alain and G{\"o}ller, Stefan and Haase, Christoph},
title = {Reachability in Register Machines with Polynomial Updates},
pages = {409-420},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FGH-mfcs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FGH-mfcs13.pdf},
ps = {FGH-mfcs13.ps},
doi = {10.1007/978-3-642-40313-2_37},
abstract = {This paper introduces a class of register machines whose
registers can be updated by polynomial functions when a transition is
taken, and the domain of the registers can be constrained by linear
constraints. This model strictly generalises a variety of known formalisms
such as various classes of Vector Addition Systems with States. Our main
result is that reachability in our class is PSPACE-complete when
restricted to one register. We moreover give a classification of the
complexity of reachability according to the type of polynomials allowed
and the geometry induced by the range-constraining formula.}
}
@article{ACK-jcss13,
publisher = {Elsevier Science Publishers},
journal = {Journal of Computer and System Sciences},
author = {Abiteboul, Serge and ten~Cate, Balder and
Katsis, Yannis},
title = {On the equivalence of distributed systems with queries and
communication},
volume = 79,
number = 6,
pages = {739-762},
year = 2013,
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ACK-jcss13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACK-jcss13.pdf},
doi = {10.1016/j.jcss.2013.01.001},
abstract = {Distributed data management systems consist of peers that store,
exchange and process data in order to collaboratively achieve a common
goal, such as evaluating some query. We study the equivalence of such
systems. We model a distributed system by a collection of Active XML
documents, i.e., trees augmented with function calls for performing tasks
such as sending, receiving and querying data. As our model is quite
general, the equivalence problem turns out to be undecidable. However, we
exhibit several restrictions of the model, for which equivalence can be
effectively decided. We also study the computational complexity of the
equivalence problem, and present an axiomatization of equivalence, in the
form of a set of equivalence-preserving rewrite rules allowing us to
optimize a system by rewriting it into an equivalent, but possibly more
efficient system.}
}
@inproceedings{McK-dcfs13,
address = {London, Ontario, Canada},
month = jul,
year = 2013,
volume = {8031},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
acronym = {{DCFS}'13},
booktitle = {{P}roceedings of the 15th {W}orkshop on {D}escriptional
{C}omplexity of {F}ormal {S}ystems ({DCFS}'13)},
author = {McKenzie, Pierre},
title = {Can chimps go it alone?},
pages = {17},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/McK-dcfs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/McK-dcfs13.pdf},
doi = {10.1007/978-3-642-39310-5_3}
}
@inproceedings{CCD-icalp13,
address = {Riga, Latvia},
month = jul,
year = 2013,
volume = {7966},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Fomin, Fedor V. and Freivalds, R{\=u}si{\c{n}}{\v{s}}
and Kwiatkowska, Marta and Peleg, David},
acronym = {{ICALP}'13},
booktitle = {{P}roceedings of the 40th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'13)~-- {P}art~{II}},
author = {Chr{\'e}tien, R{\'e}my and Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
title = {From security protocols to pushdown automata},
pages = {137-149},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-icalp13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-icalp13.pdf},
doi = {10.1007/978-3-642-39212-2_15},
abstract = {Formal methods have been very successful in analyzing
security protocols for reachability properties such as secrecy or
authentication. In contrast, there are very few results for
equivalence-based properties, crucial for studying
e.g. privacy-like properties such as anonymity or vote
secrecy.\par
We study the problem of checking equivalence of security protocols
for an unbounded number of sessions. Since replication leads very
quickly to undecidability (even in the simple case of secrecy), we
focus on a limited fragment of protocols (standard primitives but
pairs, one variable per protocol's rules) for which the secrecy
preservation problem is known to be decidable. Surprisingly, this
fragment turns out to be undecidable for equivalence. Then,
restricting our attention to deterministic protocols, we propose
the first decidability result for checking equivalence of
protocols for an unbounded number of sessions. This result is
obtained through a characterization of equivalence of protocols in
terms of equality of languages of (generalized, real-time)
deterministic pushdown automata.}
}
@inproceedings{ABMW-icdt13,
address = {Genoa, Italy},
month = mar,
year = 2013,
publisher = {ACM Press},
editor = {Tan, Wang-Chiew and Guerrini, Giovanna and Catania, Barbara and
Gounaris, Anastasios},
acronym = {{ICDT}'13},
booktitle = {{P}roceedings of the 16th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'13)},
author = {Abiteboul, Serge and Bourhis, Pierre and Muscholl, Anca and Wu, Zhilin},
title = {Recursive queries on trees and data trees},
pages = {93-104},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABMW-icdt13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABMW-icdt13.pdf},
doi = {10.1145/2448496.2448509},
abstract = {The analysis of datalog programs over relational
structures has been studied in depth, most notably the problem of
containment. The analysis problems that have been considered were
shown to be undecidable with the exception of (i)~containment of
arbitrary programs in nonrecursive ones, (ii)~containment of
monadic programs, and (iii)~emptiness. In~this paper, we are
concerned with a much less studied problem, the analysis of
datalog programs over data trees. We show that the analysis of
datalog programs is more complex for data trees than for arbitrary
structures. In particular we prove that the three aforementioned
problems are undecidable for data trees. But in practice, data
trees (e.g., XML trees) are often of bounded depth. We prove that
all three problems are decidable over bounded depth data trees.
Another contribution of the paper is the study of a new form of
automata called pattern automata, that are essentially equivalent
to linear datalog programs. We use pattern automata to show that
the emptiness problem for linear monadic datalog programs with
data value inequalities is decidable over arbitrary data trees.}
}
@article{BCGJV-lmcs13,
journal = {Logical Methods in Computer Science},
author = {Bargu{\~n}{\'o}, Luis and Creus, Carles and Godoy, Guillem
and Jacquemard, Florent and Vacher, Camille},
title = {Decidable Classes of Tree Automata Mixing Local and Global
Constraints Modulo Flat Theories},
volume = 9,
number = 2,
nopages = {},
month = apr,
year = 2013,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCGJV-lmcs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCGJV-lmcs13.pdf},
doi = {10.2168/LMCS-9(2:1)2013},
abstract = {We define a class of ranked tree automata TABG generalizing both
the tree automata with local tests between brothers of Bogaert and Tison
(1992) and with global equality and disequality constraints (TAGED) of
Filiot et al. (2007). TABG can test for equality and disequality modulo a
given flat equational theory between brother subterms and between subterms
whose positions are defined by the states reached during a computation. In
particular, TABG can check that all the subterms reaching a given state
are distinct. This constraint is related to monadic key constraints for
XML documents, meaning that every two distinct positions of a given type
have different values. We prove decidability of the emptiness problem for
TABG. This solves, in particular, the open question of the decidability of
emptiness for TAGED. We further extend our result by allowing global
arithmetic constraints for counting the number of occurrences of some
state or the number of different equivalence classes of subterms (modulo a
given flat equational theory) reaching some state during a computation. We
also adapt the model to unranked ordered terms. As a consequence of our
results for TABG, we prove the decidability of a fragment of the monadic
second order logic on trees extended with predicates for equality and
disequality between subtrees, and cardinality.}
}
@inproceedings{ABGGP-vstte13,
address = {Atherton, California, USA},
year = 2014,
volume = 8164,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Cohen, Ernie and Rybalchenko, Andrey},
acronym = {{VSTTE}'13},
booktitle = {{R}evised {S}elected {P}apers of the
5th {IFIP} {TC2}\slash{WG2.3} {C}onference {V}erified
{S}oftware---{T}heories, {T}ools, and {E}xperiments
({VSTTE}'13)},
author = {Adj{\'e}, Assal{\'e} and Bouissou, Olivier and
Goubault{-}Larrecq, Jean and
Goubault, {\'E}ric and Putot, Sylvie},
title = {Static Analysis of Programs with Imprecise Probabilistic Inputs},
pages = {22-47},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABGGP-vstte13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABGGP-vstte13.pdf},
doi = {10.1007/978-3-642-54108-7},
abstract = {Having a precise yet sound abstraction of the inputs of
numerical programs is important to analyze their behavior. For many
programs, these inputs are probabilistic, but the actual distribution used
is only partially known. We present a static analysis framework for
reasoning about programs with inputs given as imprecise probabilities: we
define a collecting semantics based on the notion of previsions and an
abstract semantics based on an extension of Dempster-Shafer structures. We
prove the correctness of our approach and show on some realistic examples
the kind of invariants we are able to infer.}
}
@inproceedings{BKM-lics13,
address = {New-Orleans, Louisiana, USA},
month = jun,
year = 2013,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'13},
booktitle = {{P}roceedings of the 28th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'13)},
author = {Bollig, Benedikt and Kuske, Dietrich and Mennicke, Roy},
title = {The Complexity of Model Checking Multi-Stack Systems},
pages = {163-170},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BKM-lics13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BKM-lics13.pdf},
doi = {10.1109/LICS.2013.22},
abstract = {We consider the linear-time model-checking problem for boolean
concurrent programs with recursive procedure calls. While sequential
recursive programs are usually modeled as pushdown automata, concurrent
recursive programs involve several processes and can be naturally
abstracted as pushdown automata with multiple stacks. Their behavior can
be understood as words with multiple nesting relations, each relation
connecting a procedure call with its corresponding return. To reason about
multiply nested words, we consider the class of all temporal logics as
defined in the book by Gabbay, Hodkinson, and Reynolds~(1994). The
unifying feature of these temporal logics is that their modalities are
defined in monadic second-order~(MSO) logic. In particular, this captures
numerous temporal logics over concurrent and/or recursive programs that
have been defined so far. Since the general model checking problem is
undecidable, we restrict attention to phase bounded executions as proposed
by La~Torre, Madhusudan, and Parlato (LICS~2007). While the MSO model
checking problem in this case is non-elementary, our main result states
that the model checking (and satisfiability) problem for all MSO-definable
temporal logics is decidable in elementary time. More precisely, it is
solvable in \((n+2)\)-EXPTIME where \(n\) is the maximal level of the MSO
modalities in the monadic quantifier alternation hierarchy. We complement
this result and provide, for each level~\(n\), a~temporal logic whose
model checking problem is \(n\)-EXPSPACE-hard.}
}
@inproceedings{DFP-lics13,
address = {New-Orleans, Louisiana, USA},
month = jun,
year = 2013,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'13},
booktitle = {{P}roceedings of the 28th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'13)},
author = {Demri, St{\'e}phane and Figueira, Diego and Praveen, M.},
title = {Reasoning about Data Repetitions with Counter Systems},
pages = {33-42},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DFP-lics13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DFP-lics13.pdf},
doi = {10.1109/LICS.2013.8},
abstract = {We study linear-time temporal logics interpreted over data words
with multiple attributes. We restrict the atomic formulas to equalities of
attribute values in successive positions and to repetitions of attribute
values in the future or past. We demonstrate correspondences between
satisfiability problems for logics and reachability-like decision problems
for counter systems. We show that allowing/disallowing atomic formulas
expressing repetitions of values in the past corresponds to the
reachability\slash coverability problem in Petri nets. This gives us
2EXPSPACE upper bounds for several satisfiability problems. We prove
matching lower bounds by reduction from a reachability problem for a newly
introduced class of counter systems. This new class is a succinct version
of vector addition systems with states in which counters are accessed via
pointers, a potentially useful feature in other contexts. We strengthen
further the correspondences between data logics and counter systems by
characterizing the complexity of fragments, extensions and variants of the
logic. For instance, we precisely characterize the relationship between
the number of attributes allowed in the logic and the number of counters
needed in the counter system.}
}
@inproceedings{BS-lics13,
address = {New-Orleans, Louisiana, USA},
month = jun,
year = 2013,
publisher = {{IEEE} Computer Society Press},
acronym = {{LICS}'13},
booktitle = {{P}roceedings of the 28th
{A}nnual {IEEE} {S}ymposium on
{L}ogic in {C}omputer {S}cience
({LICS}'13)},
author = {Boral, Anudhyan and Schmitz, Sylvain},
title = {Model Checking Parse Trees},
pages = {153-162},
url = {http://arxiv.org/abs/1211.5256},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-lics13.pdf},
arxivpdf = {http://arxiv.org/pdf/1211.5256},
doi = {10.1109/LICS.2013.21},
abstract = {Parse trees are fundamental syntactic structures in both
computational linguistics and compilers construction. We argue in this
paper that, in both fields, there are good incentives for model-checking
sets of parse trees for some word according to a context-free grammar. We
put forward the adequacy of propositional dynamic logic (PDL) on trees in
these applications, and study as a sanity check the complexity of the
corresponding model-checking problem: although complete for exponential
time in the general case, we find natural restrictions on grammars for our
applications and establish complexities ranging from nondeterministic
polynomial time to polynomial space in the relevant cases.}
}
@inproceedings{ABBDF-pads13,
address = {Montreal, Canada},
month = may,
year = 2013,
publisher = {ACM Press},
editor = {Wainer, Gabriel A.},
acronym = {{PADS}'13},
booktitle = {{P}roceedings of the 1st {ACM} {SIGSIM} {C}onference on {P}rinciples of
{A}dvanced {D}iscrete {S}imulation ({PADS}'13)},
author = {Amparore, Elvio Gilberto and Barbot, Beno{\^\i}t and Beccuti,
Marco and Donatelli, Susanna and Franceschinis, Giuliana},
title = {Simulation-based Verification of Hybrid Automata Stochastic
Logic Formulas for Stochastic Symmetric Nets},
pages = {253-264},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABBDF-pads13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABBDF-pads13.pdf},
doi = {10.1145/2486092.2486124},
abstract = {The Hybrid Automata Stochastic Logic (HASL) has been recently
defined as a flexible way to express classical performance measures as well
as more complex, path-based ones (generically called {"}HASL formulas{"}).
The considered paths are executions of Generalized Stochastic Petri Nets
(GSPN), which are an extension of the basic Petri net formalism to define
discrete event stochastic processes. The computation of the HASL formulas
for a GSPN model is demanded to the COSMOS tool, that applies simulation
techniques to the formula computation. Stochastic Symmetric Nets (SSN) are
an high level Petri net formalism, of the \emph{colored} type, in which tokens can
have an identity, and it is well known that colored Petri nets allow one to
describe systems in a more compact and parametric form than basic
(uncolored) Petri nets. In this paper we propose to extend HASL and COSMOS
to support colors, so that performance formulas for SSN can be easily
defined and evaluated. This requires a new definition of the logic, to
ensure that colors are taken into account in a correct and useful manner,
and a significant extension of the COSMOS tool.}
}
@inproceedings{BHLM-dlt13,
address = {Marne-la-Vall{\'e}e, France},
month = jun,
year = 2013,
volume = {7907},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {B{\'e}al, Marie-Pierre and Carton, Olivier},
acronym = {{DLT}'13},
booktitle = {{P}roceedings of the 17th {I}nternational
{C}onference on {D}evelopments in {L}anguage {T}heory
({DLT}'13)},
author = {Bollig, Benedikt and Habermehl, Peter and Leucker, Martin and
Monmege, Benjamin},
title = {A~Fresh Approach to Learning Register Automata},
pages = {118-130},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHLM-dlt13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHLM-dlt13.pdf},
doi = {10.1007/978-3-642-38771-5_12},
abstract = {This paper provides an Angluin-style learning algorithm for a
class of register automata supporting the notion of \emph{fresh} data values.
More specifically, we introduce \emph{session automata} which are well suited for
modeling protocols in which sessions using fresh values are of major
interest, like in security protocols or ad-hoc networks. We show that
session automata (i)~have an expressiveness partly extending, partly
reducing that of register automata, (ii)~admit a symbolic regular
representation, and (iii)~have a decidable equivalence and model-checking
problem (unlike register automata). Using these results, we establish a
learning algorithm to infer session automata through membership and
equivalence queries. Finally, we strengthen the robustness of our
automaton by its characterization in monadic second-order logic.}
}
@inproceedings{BCHKS-lata13,
address = {Bilbao, Spain},
month = apr,
year = 2013,
volume = {7810},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Dediu, Adrian Horia and Mart{\'\i}n-Vide, Carlos and Truthe, Bianca},
acronym = {{LATA}'13},
booktitle = {{P}roceedings of the 7th {I}nternational {C}onference on {L}anguage
and {A}utomata {T}heory and {A}pplications ({LATA}'13)},
author = {Bollig, Benedikt and Cyriac, Aiswarya and H{\'e}lou{\"e}t,
Lo{\"\i}c and Kara, Ahmet and Schwentick, {\relax Th}omas},
title = {Dynamic Communicating Automata and Branching High-Level {MSC}s},
pages = {177-189},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCHKS-lata13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCHKS-lata13.pdf},
doi = {10.1109/REVET.2012.6195253},
abstract = {We study dynamic communicating automata~(DCA), an~extension of
classical communicating finite-state machines that allows for dynamic
creation of processes. The behavior of a DCA can be described as a set of
message sequence charts~(MSCs). While DCA serve as a model of an
implementation, we propose branching high-level MSCs~(bHMSCs) on the
specification side. Our focus is on the implementability problem: given a
bHMSC, can one construct an equivalent DCA? As this problem is
undecidable, we introduce the notion of executability, a decidable
necessary criterion for implementability. We show that executability of
bHMSCs is EXPTIME-complete. We~then identify a class of bHMSCs for which
executability effectively implies implementability.}
}
@inproceedings{BLLJKFSFR-revet12,
address = {Hammamet, Tunisia},
month = mar,
year = 2012,
publisher = {{IEEE} Power~\& Energy Society},
editor = {Neji, Rafik},
acronym = {{REVET}'12},
booktitle = {{P}roceedings of the 1st {I}nternational {C}onference on
{R}enewable {E}nergies and {VE}hicular {T}echnology
({REVET}'12)},
author = {Belkacem, Ghania and Labrousse, Denis and Lefebvre, St{\'e}phane and
Joubert, Pierre-Yves and K{\"u}hne, Ulrich and Fribourg,
Laurent and Soulat, Romain and Florentin, {\'E}ric and Rey,
{\relax Ch}ristian},
title = {Distributed and Coupled Electrothermal Model of Power
Semiconductor Devices},
pages = {84-89},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BLLJKFSFR-revet12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BLLJKFSFR-revet12.pdf},
doi = {10.1109/REVET.2012.6195253},
abstract = {Electro-thermal model of power semiconductor devices are of key
importance in order to optimize their thermal design and increase their
reliability. The development of such an electro-thermal model for power
MOSFET transistors (COOLMOS\textsuperscript{(TM)}) based on the coupling
between two computation softwares (Matlab and Cast3M) is described in the
paper. The elaborated 2D electro-thermal model is able to predict
i)~the~temperature distribution on chip surface well as in volume,
ii)~the~effect of the temperature on the distribution of the current
flowing within the die and iii)~the~effects of the ageing of the
metallization layer on the current density and the temperature. In the
paper, the used electrical and thermal models are described as well as the
implemented coupling scheme.}
}
@inproceedings{CCP-cav13,
address = {Saint Petersburg, Russia},
month = jul,
year = 2013,
volume = {8044},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Sharygina, Natasha and Veith, Helmut},
acronym = {{CAV}'13},
booktitle = {{P}roceedings of the 25th
{I}nternational {C}onference on
{C}omputer {A}ided {V}erification
({CAV}'13)},
author = {Cheval, Vincent and Cortier, V{\'e}ronique and Plet, Antoine},
title = {Lengths may break privacy~---or~how to check for
equivalences with length},
pages = {708-723},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCP-cav13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCP-cav13.pdf},
doi = {10.1007/978-3-642-39799-8_50},
abstract = {Security protocols have been successfully analyzed using
symbolic models, where messages are represented by terms and protocols by
processes. Privacy properties like anonymity or untraceability are
typically expressed as equivalence between processes. While some decision
procedures have been proposed for automatically deciding process
equivalence, all existing approaches abstract away the information an
attacker may get when observing the length of messages.\par In this paper, we
study process equivalence with length tests. We first show that, in the
static case, almost all existing decidability results (for static
equivalence) can be extended to cope with length tests. In the active
case, we prove decidability of trace equivalence with length tests, for a
bounded number of sessions and for standard primitives. Our result relies
on a previous decidability result from Cheval~\emph{et~al.} (without
length tests). Our procedure has been implemented and we have discovered a
new flaw against privacy in the biometric passport protocol.}
}
@inproceedings{HIOP-cav13,
address = {Saint Petersburg, Russia},
month = jul,
year = 2013,
volume = {8044},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Sharygina, Natasha and Veith, Helmut},
acronym = {{CAV}'13},
booktitle = {{P}roceedings of the 25th
{I}nternational {C}onference on
{C}omputer {A}ided {V}erification
({CAV}'13)},
author = {Haase, Christoph and Ishtiaq, Samin and Ouaknine, Jo{\"e}l and Parkinson, Matthew},
title = {SeLoger: A~Tool for Graph-Based Reasoning in Separation
Logic},
pages = {790-795},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HIOP-cav13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HIOP-cav13.pdf},
doi = {10.1007/978-3-642-39799-8_55},
abstract = {This paper introduces the tool SeLoger, which is a reasoner for
satisfiability and entailment in a fragment of separation logic with
pointers and linked lists. SeLoger builds upon and extends graph-based
algorithms that have recently been introduced in order to settle both
decision problems in polynomial time. Running SeLoger on standard
benchmarks shows that the tool outperforms current state-of-the-art tools
by orders of magnitude.}
}
@inproceedings{OS-cav13,
address = {Saint Petersburg, Russia},
month = jul,
year = 2013,
volume = {8044},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Sharygina, Natasha and Veith, Helmut},
acronym = {{CAV}'13},
booktitle = {{P}roceedings of the 25th
{I}nternational {C}onference on
{C}omputer {A}ided {V}erification
({CAV}'13)},
author = {Sankur, Ocan},
title = {Shrinktech: A~Tool for the Robustness Analysis of Timed Automata},
pages = {1006-1012},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/OS-cav13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/OS-cav13.pdf},
doi = {10.1007/978-3-642-39799-8_72},
abstract = {We present a tool for the robustness analysis of timed automata,
that can check whether a given time-abstract behaviour of a timed
automaton is still present when the guards are perturbed. The perturbation
model we consider is shrinking, which corresponds to increasing lower
bounds and decreasing upper bounds in the clock guards by parameters. The
tool synthesizes these parameters for which the given behaviour is
preserved in the new automaton if possible, and generates a
counter-example otherwise. This can be used for 1)~robustness analysis,
and for 2)~deriving implementations under imprecisions.}
}
@inproceedings{RB-cav13,
address = {Saint Petersburg, Russia},
month = jul,
year = 2013,
volume = {8044},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Sharygina, Natasha and Veith, Helmut},
acronym = {{CAV}'13},
booktitle = {{P}roceedings of the 25th
{I}nternational {C}onference on
{C}omputer {A}ided {V}erification
({CAV}'13)},
author = {Brenguier, Romain},
title = {{PRALINE}: A~Tool for Computing Nash Equilibria in Concurrent
Games},
pages = { 890-895},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/RB-cav13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/RB-cav13.pdf},
doi = {10.1007/978-3-642-39799-8_63},
abstract = {We present PRALINE, which is the first tool to compute Nash
equilibria in games played over graphs. We consider concurrent games: at
each step, players choose their actions independently. There can be an
arbitrary number of players. The preferences of the players are given by
payoff functions that map states to integers, the goal for a player is
then to maximize the limit superior of her payoff; this can be seen as a
generalization of B{\"u}chi objectives. PRALINE looks for pure Nash equilibria
in these games. It can construct the strategies of the equilibrium and
users can play against it to test the equilibrium. We give the idea behind
its implementation and present examples of its practical use.}
}
@inproceedings{RSK-pn13,
address = {Milano, Italy},
month = jun,
year = 2013,
volume = {7927},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Colom, Jos{\'e}-Manuel and Desel, J{\"o}rg},
acronym = {{PETRI~NETS}'13},
booktitle = {{P}roceedings of the 34th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'13)},
author = {Rodr{\'\i}guez, C{\'e}sar and Schwoon, Stefan and Khomenko,
Victor},
title = {Contextual Merged Processes},
pages = {29-48},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/RSK-atpn13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/RSK-atpn13.pdf},
doi = {10.1007/978-3-642-38697-8_3},
abstract = {We integrate two compact data structures for
representing state spaces of Petri nets: merged processes and
contextual prefixes. The resulting data structure, called
contextual merged processes (CMP), combines the advantages of the
original ones and copes with several important sources of state
space explosion: concurrency, sequences of choices, and concurrent
read accesses to shared resources. In particular, we demonstrate
on a number of benchmarks that CMPs are more compact than either
of the original data structures. Moreover, we sketch a polynomial
(in the CMP size) encoding into SAT of the model-checking problem
for reachability properties.}
}
@inproceedings{FH-pn13,
address = {Milano, Italy},
month = jun,
year = 2013,
volume = {7927},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Colom, Jos{\'e}-Manuel and Desel, J{\"o}rg},
acronym = {{PETRI~NETS}'13},
booktitle = {{P}roceedings of the 34th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'13)},
author = {Fraca, Est{\'\i}baliz and Haddad, Serge},
title = { Complexity Analysis of Continuous {P}etri Nets},
pages = {170-189},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FH-pn13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FH-pn13.pdf},
doi = {10.1007/978-3-642-38697-8_10},
abstract = {At the end of the eighties, continuous Petri nets were
introduced for: (1)~alleviating the combinatory explosion triggered by
discrete Petri nets and, (2)~modelling the behaviour of physical systems
whose state is composed of continuous variables. Since then several works
have established that the computational complexity of deciding some
standard behavioural properties of Petri nets is reduced in this
framework. Here we first establish the decidability of additional
properties like boundedness and reachability set inclusion. We also design
new decision procedures for the reachability and lim-reachability problems
with a better computational complexity. Finally we provide lower bounds
characterising the exact complexity class of the boundedness, the
reachability, the deadlock freeness and the liveness problems.}
}
@inproceedings{HHM-pn13,
address = {Milano, Italy},
month = jun,
year = 2013,
volume = {7927},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Colom, Jos{\'e}-Manuel and Desel, J{\"o}rg},
acronym = {{PETRI~NETS}'13},
booktitle = {{P}roceedings of the 34th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'13)},
author = {Haddad, Serge and Hennicker, Rolf and M{\o}ller, Mikael H.},
title = {Channel Properties of Asynchronously Composed {P}etri~Nets},
pages = {369-388},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HHM-pn13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HHM-pn13.pdf},
doi = {10.1007/978-3-642-38697-8_20},
abstract = {We consider asynchronously composed I/O-Petri nets (AIOPNs) with
built-in communication channels. They are equipped with a compositional
semantics in terms of asynchronous I/O-transition systems (AIOTSs)
admitting infinite state spaces. We study various channel properties that
deal with the production and consumption of messages exchanged via the
communication channels and establish useful relationships between them. In
order to support incremental design we show that the channel properties
considered in this work are preserved by asynchronous composition, i.e.
they are compositional. As a crucial result we prove that the channel
properties are decidable for AIOPNs.}
}
@inproceedings{AR-qapl2013,
address = {Rome, Italy},
volume = {117},
series = {Electronic Proceedings in Theoretical Computer Science},
month = jun,
year = 2013,
editor = {Bortolussi, Luca and Wiklicky, Herbert},
acronym = {{QAPL}'13},
booktitle = {{P}roceedings of the 11th {I}nternational
{W}orkshop on {Q}uantitative {A}spects of
{P}rogramming {L}anguages ({QAPl}'13)},
author = {Arul, Arjun and Reichert, Julien},
title = {The Complexity of Robot Games on the Integer Line},
pages = {132-148},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AR-qapl13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AR-qapl13.pdf},
doi = {10.4204/EPTCS.117.9},
abstract = {In robot games on~\(\mathbb{Z}\), two players add integers to a
counter. Each player has a finite set from which he picks the integer to
add, and the objective of the first player is to let the counter reach~\(0\).
We present an exponential-time algorithm for deciding the winner of a
robot game given the initial counter value, and prove a matching lower
bound.}
}
@inproceedings{BS-qapl2013,
address = {Rome, Italy},
volume = {117},
series = {Electronic Proceedings in Theoretical Computer Science},
month = jun,
year = 2013,
editor = {Bortolussi, Luca and Wiklicky, Herbert},
acronym = {{QAPL}'13},
booktitle = {{P}roceedings of the 11th {I}nternational
{W}orkshop on {Q}uantitative {A}spects of
{P}rogramming {L}anguages ({QAPl}'13)},
author = {Bertrand, Nathalie and Schnoebelen, {\relax Ph}ilippe},
title = {Solving stochastic B{\"u}chi games on infinite arenas with a
finite attractor},
pages = {116-131},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-qapl2013.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BS-qapl2013.pdf},
doi = {10.4204/EPTCS.117.8},
abstract = {We consider games played on an infinite probabilistic arena
where the first player aims at satisfying generalized B{\"u}chi objectives
almost surely, i.e., with probability one. We provide a fixpoint
characterization of the winning sets and associated winning strategies in
the case where the arena satisfies the finite-attractor property. From
this we directly deduce the decidability of these games on probabilistic
lossy channel systems.}
}
@book{AS-book13,
author = {Andr{\'e}, {\'E}tienne and Soulat, Romain},
title = {The~Inverse Method},
publisher = {Wiley-ISTE},
year = 2013,
month = jan,
isbn = {9781848214477},
note = {176~pages},
url = {http://www.iste.co.uk/index.php?f=a&ACTION=View&id=546},
abstract = {This book introduces state-of-the-art verification techniques
for real-time embedded systems, based on the inverse method for parametric
timed automata. It reviews popular formalisms for the specification and
verification of timed concurrent systems and, in particular, timed
automata as well as several extensions such as timed automata equipped
with stopwatches, linear hybrid automata and affine hybrid automata.\par
The inverse method is introduced, and its benefits for guaranteeing
robustness in real-time systems are shown. Then, it is shown how an
iteration of the inverse method can solve the good parameters problem for
parametric timed automata by computing a behavioral cartography of the
system. Different extensions are proposed particularly for hybrid systems
and applications to scheduling problems using timed automata with
stopwatches. Various examples, both from the literature and industry,
illustrate the techniques throughout the book.\par
Various parametric verifications are performed, in particular of
abstractions of a memory circuit sold by the chipset manufacturer
ST-Microelectronics, as well as of the prospective flight control system
of the next generation of spacecraft designed by ASTRIUM Space
Transportation.}
}
@article{CDH-fmsd13,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, {\relax Th}omas A.},
title = {A~survey of partial-observation stochastic parity games},
volume = 43,
number = 2,
pages = {268-284},
month = oct,
year = 2013,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDH-fmsd13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDH-fmsd13.pdf},
doi = {10.1007/s10703-012-0164-2},
abstract = {We consider two-player zero-sum stochastic games on
graphs with \(\omega\)-regular winning conditions specified as
parity objectives. These games have applications in the design and
control of reactive systems. We survey the complexity results for
the problem of deciding the winner in such games, and in classes
of interest obtained as special cases, based on the information
and the power of randomization available to the players, on the
class of objectives and on the winning mode.\par
On the basis of information, these games can be classified as
follows: (a)~partial-observation (both players have partial view
of the game); (b)~one-sided partial-observation (one player has
partial-observation and the other player has
complete-observation); and (c)~complete-observation (both players
have complete view of the game). The one-sided partial-observation
games have two important subclasses: the one-player games, known
as partial-observation Markov decision processes~(POMDPs), and the
blind one-player games, known as probabilistic automata.\par
On the basis of randomization, (a)~the players may not be allowed
to use randomization (pure strategies), or (b)~they may choose a
probability distribution over actions but the actual random choice
is external and not visible to the player (actions invisible), or
(c)~they may use full randomization.\par
Finally, various classes of games are obtained by restricting the
parity objective to a reachability, safety, B{\"u}chi, or
coB{\"u}chi condition. We also consider several winning modes,
such as sure-winning (i.e., all outcomes of a strategy have to
satisfy the winning condition), almost-sure winning (i.e., winning
with probability~\(1\)), limit-sure winning (i.e., winning with
probability arbitrarily close to~\(1\)), and value-threshold
winning (i.e., winning with probability at least~\(v\), where
\(v\) is a given rational).}
}
@article{CDKR-fmsd13,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Chevalier, C{\'e}line and Delaune, St{\'e}phanie and
Kremer, Steve and Ryan, Mark D.},
title = {Composition of Password-based Protocols},
volume = {43},
number = {3},
pages = {369-413},
month = dec,
year = 2013,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDKR-fmsd13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDKR-fmsd13.pdf},
doi = {10.1007/s10703-013-0184-6},
abstract = {Formal and symbolic techniques are extremely useful for
modelling and analysing security protocols. They have helped to improve
our understanding of such protocols, allowed us to discover flaws, and
they also provide support for protocol design. However, such analyses
usually consider that the protocol is executed in isolation or assume a
bounded number of protocol sessions. Hence, no security guarantee is
provided when the protocol is executed in a more complex environment.\par
In this paper, we study whether password protocols can be safely composed,
even when a same password is reused. More precisely, we present a
transformation which maps a password protocol that is secure for a single
protocol session (a~decidable problem) to a protocol that is secure for an
unbounded number of sessions. Our result provides an effective strategy to
design secure password protocols: (i)~design a protocol intended to be
secure for one protocol session; (ii)~apply our transformation and obtain
a protocol which is secure for an unbounded number of sessions. Our
technique also applies to compose different password protocols allowing us
to obtain both inter-protocol and inter-session composition.}
}
@article{HMN-fi13,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {Haddad, Serge and Mairesse, Jean and Nguyen, Hoang-Thach},
title = {Synthesis and Analysis of Product-form {P}etri Nets},
year = {2013},
volume = {122},
number = {1-2},
pages = {147-172},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HMN-fi13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HMN-fi13.pdf},
doi = {10.3233/FI-2013-786},
abstract = {For a large Markovian model, a {"}product form{"} is an explicit
description of the steady-state behaviour which is otherwise generally
untractable. Being first introduced in queueing networks, it has been
adapted to Markovian Petri nets. Here we address three relevant issues for
product-form Petri nets which were left fully or partially open:
(1)~we~provide a sound and complete set of rules for the synthesis;
(2)~we~characterise the exact complexity of classical problems like
reachability; (3)~we~introduce a new subclass for which the normalising
constant (a~crucial value for product-form expression) can be efficiently
computed.}
}
@inproceedings{BGM-fossacs13,
address = {Rome, Italy},
month = mar,
year = 2013,
volume = {7794},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Pfenning, Frank},
acronym = {{FoSSaCS}'13},
booktitle = {{P}roceedings of the 16th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'13)},
author = {Bollig, Benedikt and Gastin, Paul and Monmege, Benjamin},
title = {Weighted Specifications over Nested Words},
pages = {385-400},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGM-fossacs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGM-fossacs13.pdf},
doi = {10.1007/978-3-642-37075-5_25},
abstract = {This paper studies several formalisms to specify quantitative
properties of finite nested words (or~equivalently finite unranked trees).
These can be used for XML documents or recursive programs: for~instance,
counting how often a given entry occurs in an XML document, or~computing
the memory required for a recursive program execution. Our main interest
is to translate these properties, as efficiently as possible, into an
automaton, and to use this computational device to decide problems related
to the properties (e.g.,~emptiness, model checking, simulation) or to
compute the value of a quantitative specification over a given nested
word. The specification formalisms are weighted regular expressions (with
forward and backward moves following linear edges or call-return edges),
weighted first-order logic, and weighted temporal logics. We~introduce
weighted automata walking in nested words, possibly dropping\slash lifting
(reusable) pebbles during the traversal. We prove that the evaluation
problem for such automata can be done very efficiently if the number of
pebble names is small, and we also consider the emptiness problem.}
}
@article{demri-jcss13,
publisher = {Elsevier Science Publishers},
journal = {Journal of Computer and System Sciences},
author = {Demri, St{\'e}phane},
title = {On selective unboundedness of~{VASS}},
year = {2013},
volume = {79},
number = {5},
pages = {689-713},
month = aug,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/demri-jcss13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/demri-jcss13.pdf},
doi = {10.1016/j.jcss.2013.01.014},
abstract = {Numerous properties of vector addition systems with states
amount to checking the (un)boundedness of some selective feature (e.g.,
number of reversals, counter values, run lengths). Some of these features
can be checked in exponential space by using Rackoff's proof or its
variants, combined with Savitch's Theorem. However, the question is still
open for many others, e.g., regularity detection problem and
reversal-boundedness detection problem. In the paper, we introduce the
class of generalized unboundedness properties that can be verified in
exponential space by extending Rackoff's technique, sometimes in an
unorthodox way. We obtain new optimal upper bounds, for example for place
boundedness problem, reversal-boundedness detection (several variants are
present in the paper), strong promptness detection problem and regularity
detection. Our analysis is sufficiently refined so as to obtain a
polynomial-space bound when the dimension is fixed.}
}
@incollection{GLJ-hg13,
noaddress = {},
month = jan,
year = 2013,
volume = 7797,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
noacronym = {},
booktitle = {Programming Logics~-- Essays in Memory of {H}arald {G}anzinger},
editor = {Voronkov, Andrei and Weidenbach, Christoph},
author = {Goubault{-}Larrecq, Jean and Jouannaud, Jean-Pierre},
title = {The Blossom of Finite Semantic Trees},
pages = {90-122},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GLJ-hg13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GLJ-hg13.pdf}
}
@phdthesis{bonnet-phd2013,
author = {Bonnet, R{\'e}mi},
title = {Theory of Well-Structured Transition Systems and Extended Vector-Addition Systems},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2013,
month = jan,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/bonnet-phd13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/bonnet-phd13.pdf}
}
@techreport{rr-lsv-13-02,
author = {Doyen, Laurent and Rabinovich, Alexander},
title = {Robot games},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2013},
month = jan,
type = {Research Report},
number = {LSV-13-02},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2013-02.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2013-02.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2013-02-v1.pdf, 20130124},
note = {2~pages},
abstract = {We introduce robot games, and we give the simplest definition
for which decidability is open.}
}
@inproceedings{SVMM-sbbd2012,
address = {S{\~a}o~Paulo, Brazil},
month = oct,
year = 2012,
editor = {Casanova, Marco A.},
publisher = {Sociedade Brasileira de Computa{\c{c}}{\~a}o},
acronym = {{SBBD}'12},
booktitle = {{P}roceedings of the 27th {B}razilian {S}ymposium on {D}atabases ({SBBD}'12)},
author = {Sim{\~o}es{ }De{~}Sousa, Diego V. and Viana, Henrique and
Markey, Nicolas and de Mac{\^e}do, Jose Ant{\^o}nio F.},
title = {Querying Trajectories through Model Checking based on Timed
Automata},
pages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SVMM-sbbd2012.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SVMM-sbbd2012.pdf},
abstract = {The popularization of geographical position devices (e.g.~GPS)
creates new opportunities for analyzing behavior of moving objects.
However, such analysis are hindered by a lack of semantic information
associated to the basic information provided by~GPS. Previous works
propose semantic enrichment of trajectories. Through the semantic
enrichment, we~could check which trajectories have a given moving sequence
in an application. Often, this~sequence is expressed according to the
semantic application, using the approach of semantic trajectories proposed
in the literature. This~trajectory can be represented as a sequence of
predicates that holds in some time interval. However, the solutions for
querying moving sequence proposed by previous works have a high
computational cost. In~this paper, we~propose an expressive query language
to semantic trajectories that allows temporal constraints. To~evaluate a
query we will use model checking based on timed automata, that can be
performed in polynomial time. As~this model checking algorithm is not
implemented yet, we propose to use UPPAAL tool, that can be more expensive
theoretically, but we expected that will be ecient for our approach. In
addition, we will present a query example that demonstrates the expressive
power of our language. Although in this paper we will focus on semantic
trajectories data, our approach is general enough for being applied to
other purposes.}
}
@inproceedings{BNS-cc13,
address = {Rome, Italy},
month = mar,
year = 2013,
volume = {7791},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {De{~}Bosschere, Koen and Jhala, Ranjit},
acronym = {{CC}'13},
booktitle = {{P}roceedings of the 22nd {I}nternational {C}onference on {C}ompiler
{C}onstruction ({CC}'13)},
author = {Eberhard Bertsch and Mark-Jan Nederhof and Sylvain
Schmitz},
title = {On {LR} Parsing with Selective Delays},
pages = {244-263},
url = {http://hal.archives-ouvertes.fr/hal-00769668},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BNS-cc13.pdf},
doi = {10.1007/978-3-642-37051-9_13},
abstract = {The paper investigates an extension of LR parsing that allows
the delay of parsing decisions until a sufficient amount
of context has been processed. We provide two
characterizations for the resulting class of grammars, one
based on grammar transformations, the other on the direct
construction of a parser. We also report on experiments with
a grammar collection.}
}
@inproceedings{KS-fossacs13,
address = {Rome, Italy},
month = mar,
year = 2013,
volume = {7794},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Pfenning, Frank},
acronym = {{FoSSaCS}'13},
booktitle = {{P}roceedings of the 16th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'13)},
author = {Karandikar, Prateek and Schmitz, Sylvain},
title = {The Parametric Ordinal-Recursive Complexity of {P}ost
Embedding Problems},
pages = {273-288},
url = {http://arxiv.org/abs/1211.5259},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-fossacs13.pdf},
doi = {10.1007/978-3-642-37075-5_18},
abstract = {Post Embedding Problems are a family of decision problems based
on the interaction of a rational relation with the subword embedding
ordering, and are used in the literature to prove non multiply-recursive
complexity lower bounds. We refine the construction of Chambart and
Schnoebelen (LICS~2008) and prove parametric lower bounds depending on the
size of the alphabet.}
}
@mastersthesis{m2-lefaucheux,
author = {Lefaucheux, Engel},
title = {D{\'e}tection de fautes dans les syst{\`e}mes probabilistes},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2014},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-lefaucheux.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-lefaucheux.pdf},
note = {35~pages}
}
@mastersthesis{m2-dubut,
author = {Dubut, J{\'e}r{\'e}my},
title = {{H}omologie dirig{\'e}e},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2014},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-dubut.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-dubut.pdf},
note = {35~pages}
}
@mastersthesis{m2-halfon,
author = {Halfon, Simon},
title = {Non Primitive Recursive Complexity Classes},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2014},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-halfon.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-halfon.pdf},
note = {21~pages}
}
@inproceedings{FFLRS-fsfma14,
address = {Singapore},
month = may,
year = 2014,
volume = 156,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Lin, Shang{-}Wei and Petrucci, Laure},
acronym = {{FSFMA}'14},
booktitle = {{P}roceedings of the 2nd {F}rench-{S}ingaporean {W}orkshop
on {F}ormal {M}ethods and {A}pplications ({FSFMA}'14)},
author = {Feld, Gilles and Fribourg, Laurent and Labrousse, Denis and
Revol, Bertrand and Soulat, Romain},
title = {Correct-by-design Control Synthesis for Multilevel
Converters using State Space Decomposition},
pages = {5-16},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FFLRS-fsfma14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FFLRS-fsfma14.pdf},
doi = {10.4204/EPTCS.156.5},
abstract = {High-power converters based on elementary switching cells are
more and more used in the industry of power electronics owing to various
advantages such as lower voltage stress and reduced power loss. However,
the complexity of controlling such converters is a major challenge that
the power manufacturing industry has to face with. The synthesis of
industrial switching controllers relies today on heuristic rules and
empiric simulation. The state of the system is not guaranteed to stay
within the limits that are admissible for its correct electrical behavior.
We show here how to apply a formal method in order to synthesize a
correct-by-design control that guarantees that the power converter will
always stay within a predefined safe zone of variations for its input
parameters. The method is applied in order to synthesize a
correct-by-design control for 5-level and 7-level power converters with a
flying capacitor topology. We check the validity of our approach by
numerical simulations for 5 and 7 levels. We also perform physical
experimentations using a prototype built by SATIE laboratory for 5
levels}
}
@misc{reachard-18,
author = {Finkel, Alain},
title = {REACHARD~-- Compte-rendu interm{\'e}diaire},
month = mar,
year = {2013},
note = {9~pages},
type = {Contract Report},
howpublished = {Deliverable~D2 Reachard (ANR-11-BS02-001)}
}
@misc{reachard-30,
author = {Finkel, Alain},
title = {REACHARD~-- Compte-rendu interm{\'e}diaire},
month = feb,
year = {2014},
note = {18~pages},
type = {Contract Report},
howpublished = {Deliverable~D3 Reachard (ANR-11-BS02-001)}
}
@misc{cassting-D62,
author = {Markey, Nicolas and Valette, Sophie},
title = {Annual report for Year~1},
howpublished = {Cassting deliverable~D6.2 (FP7-ICT-601148)},
month = may,
year = {2014},
note = {38~pages},
type = {Contract Report}
}
@misc{cassting-D31,
author = {Markey, Nicolas and Brihaye, {\relax Th}omas and Larsen, Kim G.},
title = {Robustness of collective adaptive systems},
howpublished = {Cassting deliverable~D3.1 (FP7-ICT-601148)},
month = mar,
year = {2014},
note = {17~pages},
type = {Contract Report},
url = {http://www.cassting-project.eu/wp-content/uploads/2014/05/deliv-31.pdf},
pdf = {http://www.cassting-project.eu/wp-content/uploads/2014/05/deliv-31.pdf}
}
@misc{cassting-D24,
author = {Markey, Nicolas and Chaturvedi, Namit and Geeraerts, Gilles
and Srba, Ji{\v{r}}{\'\i}},
title = {Efficient strategy synthesis for complex objectives},
howpublished = {Cassting deliverable~D2.4 (FP7-ICT-601148)},
month = oct,
year = {2014},
note = {20~pages},
type = {Contract Report},
url = {http://www.cassting-project.eu/wp-content/uploads/2014/10/deliv-24.pdf},
pdf = {http://www.cassting-project.eu/wp-content/uploads/2014/10/deliv-24.pdf}
}
@misc{cassting-D14,
author = {Brihaye, {\relax Th}omas and Markey, Nicolas},
title = {Solution concepts for collective adaptive systems},
howpublished = {Cassting deliverable~D1.4 (FP7-ICT-601148)},
month = mar,
year = {2014},
note = {13~pages},
type = {Contract Report},
url = {http://www.cassting-project.eu/wp-content/uploads/2014/05/deliv-14.pdf},
pdf = {http://www.cassting-project.eu/wp-content/uploads/2014/05/deliv-14.pdf}
}
@article{BFCH-compj14,
publisher = {Oxford University Press},
journal = {The Computer Journal},
author = {Beccuti, Marco and Franceschinis, Giuliana and
Codetta{-}Raiteri, Daniele and Haddad, Serge},
title = {Computing Optimal Repair Strategies by Means of NdRFT
Modeling and Analysis},
volume = 57,
number = 12,
month = dec,
year = 2014,
pages = {1870-1892},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFCH-compj14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFCH-compj14.pdf},
doi = {10.1093/comjnl/bxt134},
abstract = {In this paper, the \emph{Non-deterministic Repairable Fault
Tree}~(NdRFT) formalism is proposed: it allows the modeling of failures of
complex systems in addition to their repair processes. Its originality
with respect to other Fault Tree extensions allows us to address repair
strategy optimization problems: in an NdRFT model, the decision as to
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, it allows: the specification of self-revealing events, the
representation of components degradation, the choice among local repair,
global repair, preventive maintenance, and the specification of the
resources needed to start a repair action. The optimal repair strategy
with respect to some relevant system state function, e.g. system
unavailability, can then be computed by solving an optimization problem on
a Markov Decision Process derived from the NdRFT. Such derivation is
obtained by converting the NdRFT model into an intermediate formalism
called Markov Decision Petri Net~(MDPN). In the paper, the NdRFT syntax
and semantics are formally described, together with the conversion rules
to derive from the NdRFT the corresponding MDPN model. The application of
NdRFT is illustrated through examples.}
}
@article{GLS-tods14,
publisher = {ACM Press},
journal = {ACM Transactions on Database Systems},
author = {Gheerbrant, Am{\'e}lie and Libkin, Leonid and Sirangelo, Cristina},
title = {Na{\"\i}ve Evaluation of Queries over Incomplete Databases},
volume = {39},
number = {4:31},
nopages = {},
month = dec,
year = {2014},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GLS-tods14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GLS-tods14.pdf},
doi = {10.1145/2691190.2691194},
abstract = {The term na{\"\i}ve evaluation refers to evaluating queries over
incomplete databases as if nulls were usual data values, i.e., to using
the standard database query evaluation engine. Since the semantics of
query answering over incomplete databases is that of certain answers, we
would like to know when na{\"\i}ve evaluation computes them: i.e., when
certain answers can be found without inventing new specialized algorithms.
For relational databases it is well known that unions of conjunctive
queries possess this desirable property, and results on preservation of
formulae under homomorphisms tell us that within relational calculus, this
class cannot be extended under the open-world assumption.\par
Our goal here is twofold. First, we develop a general framework that
allows us to determine, for a given semantics of incompleteness, classes
of queries for which na{\"\i}ve evaluation computes certain answers. Second,
we apply this approach to a variety of semantics, showing that for many
classes of queries beyond unions of conjunctive queries, na{\"\i}ve
evaluation makes perfect sense under assumptions different from
open-world. Our key observations are: (1)~na{\"\i}ve evaluation is equivalent
to monotonicity of queries with respect to a semantics-induced ordering,
and (2)~for most reasonable semantics of incompleteness, such monotonicity
is captured by preservation under various types of homomorphisms. Using
these results we find classes of queries for which na{\"\i}ve evaluation
works, e.g., positive first-order formulae for the closed-world semantics.
Even more, we introduce a general relation-based framework for defining
semantics of incompleteness, show how it can be used to capture many known
semantics and to introduce new ones, and describe classes of first-order
queries for which na{\"\i}ve evaluation works under such semantics.}
}
@article{BKM-cc14,
publisher = {Birkh{\"a}user},
journal = {Computational Complexity},
author = {Blondin, Michael and Krebs, Andreas and McKenzie, Pierre},
title = {The Complexity of Intersecting Finite Automata Having Few
Final States},
volume = {25},
number = {4},
pages = {775-814},
month = dec,
year = 2016,
note = {To appear},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BKM-cc14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BKM-cc14.pdf},
doi = {10.1007/s00037-014-0089-9},
abstract = {The problem of determining whether several finite automata
accept a word in common is closely related to the well-studied membership
problem in transformation monoids. We raise the issue of limiting the
number of final states in the automata intersection problem. For automata
with two final states, we show the problem to be \(\oplus{L}\)-complete
or NP-complete according to whether a nontrivial monoid other than a
direct product of cyclic groups of order~2 is allowed in the automata. We
further consider idempotent commutative automata and (Abelian, mainly)
group automata with one, two, or three final states over a singleton or
larger alphabet, elucidating (under the usual hypotheses on complexity
classes) the complexity of the intersection nonemptiness and related
problems in each case.}
}
@inproceedings{BC-ccs14,
address = {Scottsdale, Arizona, USA},
month = nov,
year = 2014,
publisher = {ACM Press},
editor = {Ahn, Gail-Joon and Yung, Moti and Li, Ninghui},
acronym = {{CCS}'14},
booktitle = {{P}roceedings of the 21st {ACM} {C}onference
on {C}omputer and {C}ommunications {S}ecurity
({CCS}'14)},
author = {Bana, Gergei and Comon{-}Lundh, Hubert},
title = {A~Computationally Complete Symbolic Attacker for
Equivalence Properties},
pages = {609-620},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BC-ccs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BC-ccs14.pdf},
doi = {10.1145/2660267.2660276},
abstract = {We consider the problem of computational indistinguishability of
protocols. We design a symbolic model, amenable to automated deduction,
such that a successful inconsistency proof implies computational
indistinguishability. Conversely, symbolic models of distinguishability
provide clues for likely computational attacks. We follow the idea we
introduced earlier for reachability properties, axiomatizing what an
attacker cannot violate. This results a computationally complete symbolic
attacker, and ensures unconditional computational soundness for the
symbolic analysis. We present a small library of computationally sound,
modular axioms, and test our technique on an example protocol. Despite
additional difficulties stemming from the equivalence properties, the
models and the soundness proofs turn out to be simpler than they were for
reachability properties.}
}
@phdthesis{ponce-phd2014,
author = {Ponce{ }de{~}Le{\'o}n, Hern{\'a}n},
title = {Testing Concurrent Systems Through Event Structures},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2014,
month = nov,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ponce-phd14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ponce-phd14.pdf}
}
@phdthesis{barbot-phd2014,
author = {Barbot, Beno{\^\i}t},
title = {Acceleration for Statistical Model Checking},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2014,
month = nov,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/barbot-phd14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/barbot-phd14.pdf}
}
@phdthesis{sirangelo-HDR14,
author = {Sirangelo, Cristina},
title = {Representing and querying incomplete information: a~data
interoperability perspective},
year = 2014,
month = dec,
type = {M{\'e}moire d'habilitation},
school = {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-CS14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-CS14.pdf}
}
@article{LLV-tcs14,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Lange, Martin and Lozes, {\'E}tienne and Vargas{ }Guzm{\'a}n,
Manuel},
title = {Model-checking process equivalences},
volume = {560},
number = {3},
year = {2014},
month = dec,
pages = {326-347},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LLV-tcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LLV-tcs14.pdf},
doi = {10.1016/j.tcs.2014.08.020},
abstract = {Process equivalences are formal methods that relate programs and
systems which, informally, behave in the same way. Since there is no
unique notion of what it means for two dynamic systems to display the same
behaviour there are a multitude of formal process equivalences, ranging
from bisimulation to trace equivalence, categorised in the linear-time
branching-time spectrum.\par
We present a logical framework based on an expressive modal fixpoint logic
which is capable of defining many process equivalence relations: for each
such equivalence there is a fixed formula which is satisfied by a pair of
processes if and only if they are equivalent with respect to this
relation.\par
We explain how to do model checking for this logic in EXPTIME. This allows
model checking technology to be used for process equivalence checking. We
introduce two fragments of the logic for which it is possible to do
model-checking in PTIME and PSPACE respectively, and show that the
formulas that define the process equivalences we consider are in one of
these fragments. This yields a generic proof technique for establishing
the complexities of these process equivalences.\par
Finally, we show how partial evaluation can be used to obtain decision
procedures for process equivalences from the generic model checking
scheme.}
}
@article{BHLM-lmcs14,
journal = {Logical Methods in Computer Science},
author = {Bollig, Benedikt and Habermehl, Peter and Leucker, Martin
and Monmege, Benjamin},
title = {A~Robust Class of Data Languages and an Application to Learning},
year = {2014},
month = dec,
volume = 10,
number = {4:19},
nopages = {},
url = {http://arxiv.org/abs/1411.6646},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHLM-lmcs14.pdf},
doi = {10.2168/LMCS-10(4:19)2014},
abstract = {We~introduce session automata, an automata model to process data
words, i.e., words over an infinite alphabet. Session automata support the
notion of fresh data values, which are well suited for modeling protocols
in which sessions using fresh values are of major interest, like in
security protocols or ad-hoc networks. Session automata have an
expressiveness partly extending, partly reducing that of classical
register automata. We~show that, unlike register automata and their
various extensions, session automata are robust: They (i)~are closed under
intersection, union, and (resource-sensitive) complementation, (ii)~admit
a symbolic regular representation, (iii)~have a decidable inclusion
problem (unlike register automata), and (iv)~enjoy logical
characterizations. Using these results, we establish a learning algorithm
to infer session automata through membership and equivalence queries.}
}
@article{JKS-lmcs14,
journal = {Logical Methods in Computer Science},
author = {Jancar, Petr and Karandikar, Prateek and Schnoebelen, {\relax Ph}ilippe},
title = {On Reachability for Unidirectional Channel Systems Extended
with Regular Tests},
year = {2015},
volume = 11,
number = {{2:2}},
month = apr,
nopages = {},
url = {http://arxiv.org/abs/1406.5067},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JKS-lmcs14.pdf},
doi = {10.2168/LMCS-11(2:2)2015},
abstract = {{"}Unidirectional channel systems{"} (Chambart~\& Schnoebelen,
CONCUR~2008) are finite-state systems where one-way communication from a
Sender to a Receiver goes via one reliable and one unreliable unbounded
fifo channel. While reachability is decidable for these systems, equipping
them with the possibility of testing regular properties on the contents of
channels makes it undecidable. Decidability is preserved when only
emptiness and nonemptiness tests are considered: the proof relies on an
elaborate reduction to a generalized version of Post's Embedding Problem.}
}
@article{KKS-ipl14,
publisher = {Elsevier Science Publishers},
journal = {Information Processing Letters},
author = {Karandikar, Prateek and Kufleitner, Manfred and Schnoebelen, {\relax Ph}ilippe},
title = {On the index of {S}imon's congruence for piecewise testability},
year = {2015},
month = apr,
volume = {15},
number = {4},
pages = {515-519},
url = {http://arxiv.org/abs/1310.1278},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KKS-ipl14.pdf},
doi = {10.1016/j.ipl.2014.11.008},
abstract = {Simon's congruence, denoted \(\sim_{n}\), relates words having
the same subwords of length up to~\(n\). We~show that, over a
\(k\)-letter alphabet, the~number of words modulo~\(\sim_{n}\) is in
\(2^{\Theta(n^{k-1}\cdot\log n)}\).}
}
@article{HSS-lmcs14,
journal = {Logical Methods in Computer Science},
author = {Haase, Christoph and Schmitz, Sylvain and Schnoebelen, {\relax Ph}ilippe},
title = {The Power of Priority Channel Systems},
year = {2014},
month = dec,
volume = 10,
number = {4:4},
nopages = {},
url = {http://arxiv.org/abs/1301.5500},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HSS-lmcs14.pdf},
doi = {10.2168/LMCS-10(4:4)2014},
abstract = {We introduce Priority Channel Systems, a new class of channel
systems where messages carry a numeric priority and where higher-priority
messages can supersede lower-priority messages preceding them in the fifo
communication buffers. The decidability of safety and inevitability
properties is shown via the introduction of a priority embedding, a
well-quasi-ordering that has not previously been used in well-structured
systems. We then show how Priority Channel Systems can compute
Fast-Growing functions and prove that the aforementioned verification
problems are \(\mathbf{F}_{\epsilon_{0}}\)-complete.}
}
@inproceedings{DSS-pods14,
address = {Snowbird, Utah, USA},
month = jun,
year = 2014,
publisher = {ACM Press},
editor = {Hull, Richard and Grohe, Martin},
acronym = {{PODS}'14},
booktitle = {{P}roceedings of the 33rd {A}nnual
{ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium
on {P}rinciples of {D}atabase {S}ystems
({PODS}'14)},
author = {Durand, Arnaud and Schweikardt, Nicole and Segoufin, Luc},
title = {Enumerating answers to first-order queries over databases of low degree},
pages = {121-131},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DSS-pods14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DSS-pods14.pdf},
doi = {10.1145/2594538.2594539},
abstract = {A~class of relational databases has low degree if for
all~\(\delta\), all but finitely many databases in the class have degree
at most~\(n^{\delta}\), where \(n\) is the size of the database. Typical
examples are databases of bounded degree or of degree bounded by
\(\textrm{log} n\).\par
It is known that over a class of databases having low degree, first-order
boolean queries can be checked in pseudo-linear time, i.e. in time bounded
by \(n^{1+\epsilon}\), for all~\(\epsilon\). We~generalise this result by
considering query evaluation.\par
We show that counting the number of answers to a query can be done in
pseudo-linear time and that enumerating the answers to a query can be done
with constant delay after a pseudo-linear time preprocessing.}
}
@inproceedings{segoufin-stacs14,
address = {Lyon, France},
month = mar,
year = 2014,
volume = 25,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Mayr, Ernst W. and Portier, Natacha},
acronym = {{STACS}'14},
booktitle = {{P}roceedings of the 31st {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'14)},
author = {Segoufin, Luc},
title = {A~glimpse on constant delay enumeration},
pages = {13-27},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/segoufin-stacs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/segoufin-stacs14.pdf},
doi = {10.4230/LIPIcs.STACS.2014.13},
abstract = {We survey some of the recent results about enumerating the
answers to queries over a database. We focus on the case where the
enumeration is performed with a constant delay between any two consecutive
solutions, after a linear time preprocessing. This cannot be always
achieved. It requires restricting either the class of queries or the class
of databases. We describe here several scenarios when this is possible.}
}
@inproceedings{ADV-icdt14,
address = {Athens, Greece},
month = mar,
year = 2014,
editor = {Schweikardt, Nicole and Christophides, Vassilis and Leroy, Vincent},
acronym = {{ICDT}'14},
booktitle = {{P}roceedings of the 17th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'14)},
author = {Abiteboul, Serge and Deutch, Daniel and Vianu, Victor},
title = {Deduction with Contradictions in Datalog},
pages = {143-154},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ADV-icdt14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ADV-icdt14.pdf},
doi = {10.5441/002/icdt.2014.17},
abstract = {We study deduction in the presence of inconsistencies. Following
previous works, we capture deduction via datalog programs and
inconsistencies through violations of functional dependencies (FDs). We
study and compare two semantics for datalog with FDs: the first, of a
logical nature, is based on inferring facts one at a time, while never
violating the FDs; the second, of an operational nature, consists in a
fixpoint computation in which maximal sets of facts consistent with the
FDs are inferred at each stage.\par
Both semantics are nondeterministic, yielding sets of possible worlds. We
introduce a PTIME (in the size of the extensional data) algorithm, that
given a datalog program, a set of FDs and an input instance, produces a
c-table representation of the set of possible worlds. Then, we propose to
quantify nondeterminism with probabilities, by means of a probabilistic
semantics. We consider the problem of capturing possible worlds along with
their probabilities via probabilistic c-tables.\par
We then study classical computational problems in this novel context. We
consider the problems of computing the probabilities of answers, of
identifying most likely supports for answers, and of determining the
extensional facts that are most influential for deriving a particular
fact. We show that the interplay of recursion and FDs leads to novel
technical challenges in the context of these problems.}
}
@article{ABV-tocsys15,
publisher = {Springer},
journal = {Theory of Computing Systems},
author = {Abiteboul, Serge and Bourhis, Pierre and Vianu, Victor},
title = {Highly Expressive Query Languages for Unordered Data Trees},
pages = {927-966},
year = 2015,
month = nov,
volume = {57},
number = {4},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABV-tocsys15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABV-tocsys15.pdf},
doi = {10.1007/s00224-015-9617-5},
abstract = {We study highly expressive query languages for unordered data
trees, using as formal vehicles Active XML and extensions of languages in
the while family. All languages may be seen as adding some form of control
on top of a set of basic pattern queries. The results highlight the impact
and interplay of different factors: the expressive power of basic queries,
the embedding of computation into data (as in Active XML), and the use of
deterministic vs. nondeterministic control. All languages are Turing
complete, but not necessarily query complete in the sense of Chandra and
Harel. Indeed, we show that some combinations of features yield serious
limitations, analogous to FO\(^{k}\) definability in the relational context. On
the other hand, the limitations come with benefits such as the existence
of powerful normal forms providing opportunities for optimization. Other
languages are {"}almost{"} complete, but fall short because of subtle
limitations reminiscent of the copy elimination problem in object
databases.}
}
@article{AADMS-tocsys14,
publisher = {Springer},
journal = {Theory of Computing Systems},
author = {Abiteboul, Serge and Amsterdamer, Yael and Deutch, Daniel
and Milo, Tova and Senellart, Pierre},
title = {Optimal Probabilistic Generation of {XML} Documents},
pages = {806-842},
year = 2015,
month = nov,
volume = {57},
number = {4},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AADMS-tocsys14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AADMS-tocsys14.pdf},
doi = {10.1007/s00224-014-9581-5},
abstract = {We study the problem of, given a corpus of XML documents and its
schema, finding an optimal (generative) probabilistic model, where
optimality here means maximizing the likelihood of the particular corpus
to be generated. Focusing first on the structure of documents, we present
an efficient algorithm for finding the best generative probabilistic
model, in the absence of constraints. We further study the problem in the
presence of integrity constraints, namely key, inclusion, and domain
constraints. We study in this case two different kinds of generators.
First, we consider a continuation-test generator that performs, while
generating documents, tests of schema satisfiability; these tests prevent
from generating a document violating the constraints but, as we will see,
they are computationally expensive. We also study a restart generator that
may generate an invalid document and, when this is the case, restarts and
tries again. Finally, we consider the injection of data values into the
structure, to obtain a full XML document. We study different approaches
for generating these values.}
}
@inproceedings{JLMX-mfps30,
address = {Ithaca, New~York, USA},
month = jun,
year = 2014,
volume = 308,
series = {Electronic Notes in Theoretical Computer Science},
publisher = {Elsevier Science Publishers},
editor = {Jacobs, Bart and Silva, Alexandra and Staton, Sam},
acronym = {{MFPS}'14},
booktitle = {{P}roceedings of the 30th {C}onference on
{M}athematical {F}oundations of {P}rogramming
{S}emantics ({MFPS}'14)},
author = {Jaziri, Samy and Larsen, Kim G. and Mardare, Radu and Xue, Bingtian},
title = {Adequacy and Complete Axiomatization for Timed Modal Logic},
pages = {183-210},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JLMX-mfps14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JLMX-mfps14.pdf},
doi = {10.1016/j.entcs.2014.10.011},
abstract = {In this paper we develop the metatheory for Timed Modal
Logic~(TML), which is the modal logic used for the analysis of timed
transition systems~(TTSs). We solve a series of long-standing open
problems related to~TML. Firstly, we prove that TML enjoys the
Hennessy-Milner property and solve one of the open questions in the field.
Secondly, we prove that the set of validities are not recursively
enumerable. Nevertheless, we develop a strongly-complete proof system
for~TML. Since the logic is not compact, the proof system contains
infinitary rules, but only with countable sets of instances. Thus, we~can
involve topological results regarding Stone spaces, such as the
Rasiowa-Sikorski lemma, to complete the proofs.}
}
@inproceedings{GLJ-mfps30,
address = {Ithaca, New~York, USA},
month = jun,
year = 2014,
volume = 308,
series = {Electronic Notes in Theoretical Computer Science},
publisher = {Elsevier Science Publishers},
editor = {Jacobs, Bart and Silva, Alexandra and Staton, Sam},
acronym = {{MFPS}'14},
booktitle = {{P}roceedings of the 30th {C}onference on
{M}athematical {F}oundations of {P}rogramming
{S}emantics ({MFPS}'14)},
author = {Goubault{-}Larrecq, Jean and Jung, Achim},
title = {{QRB}, {QFS}, and the Probabilistic Powerdomain},
pages = {167-182},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GLJ-mfps14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GLJ-mfps14.pdf},
doi = {10.1016/j.entcs.2014.10.010},
abstract = {We show that the first author's QRB-domains coincide with Li and
Xu's QFS-domains, and also with Lawson-compact quasi-continuous dcpos,
with stably-compact locally finitary compact spaces, with sober
QFS-spaces, and with sober QRB-spaces. The first three coincidences were
discovered independently by Lawson and~Xi. The equivalence with sober
QFS-spaces is then applied to give a novel, direct proof that the
probabilistic powerdomain of a QRB-domain is a QRB-domain. This improves
upon a previous, similar result, which was limited to pointed,
second-countable QRB-domains.}
}
@article{PHL-sttt14,
publisher = {Springer},
journal = {International Journal on Software Tools
for Technology Transfer},
author = {Ponce{ }de{~}Le{\'o}n, Hern{\'a}n and Haar, Stefan and
Longuet, Delphine},
title = {Model-based Testing for Concurrent Systems: Unfolding-based Test Selection},
volume = {18},
number = 3,
year = {2016},
month = jun,
pages = {305-318},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/PHL-sttt14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/PHL-sttt14.pdf},
doi = {10.1007/s10009-014-0353-y},
abstract = {Model-based testing has mainly focused on models where
concurrency is interpreted as interleaving (like the ioco theory for
labeled transition systems), which may be too coarse when one wants
concurrency to be preserved in the implementation. In order to test such
concurrent systems, we choose to use Petri nets as specifications and
define a concurrent conformance relation named co-ioco. We present a test
generation algorithm based on Petri net unfolding able to build a complete
test suite w.r.t our co-ioco conformance relation. In addition we propose
several coverage criteria that allow to select finite prefixes of an
unfolding in order to build manageable test suites.}
}
@article{CDGH-ic15,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Gimbert, Hugo
and Henzinger, Thomas A.},
title = {Randomness for free},
volume = {245},
month = dec,
year = 2015,
pages = {3-16},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDGH-ic15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDGH-ic15.pdf},
doi = {10.1016/j.ic.2015.06.003},
abstract = {We consider two-player zero-sum games on finite-state graphs.
These games can be classified on the basis of the information of the
players and on the mode of interaction between them. On the basis of
information the classification is as follows: (a)~partial-observation
(both players have partial view of the game); (b)~one-sided
complete-observation (one player has complete observation); and
(c)~complete-observation (both players have complete view of the game).
On~the basis of mode of interaction we have the following classification:
(a)~concurrent (players interact simultaneously); and (b)~turn-based
(players interact in turn). The~two sources of randomness in these games
are randomness in the transition function and randomness in the
strategies. In general, randomized strategies are more powerful than
deterministic strategies, and probabilistic transitions give more general
classes of games. We present a complete characterization for the classes
of games where randomness is not helpful~in: (a)~the transition function
(probabilistic transitions can be simulated by deterministic transitions);
and (b)~strategies (pure strategies are as powerful as randomized
strategies). As~a consequence of our characterization we obtain new
undecidability results for these games.}
}
@article{LM-ic14,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas},
title = {Augmenting {ATL} with strategy contexts},
volume = {245},
month = dec,
year = 2015,
pages = {98-123},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2014-05.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2014-05.pdf},
doi = {10.1016/j.ic.2014.12.020},
abstract = {We study the extension of the alternating-time temporal logic
(ATL) with strategy contexts: contrary to the original semantics, in this
semantics the strategy quantifiers do not reset the previously selected
strategies.\par
We show that our extension ATLsc is very expressive, but that its decision
problems are quite hard: model checking is \(k\)-EXPTIME-complete when the
formula has k nested strategy quantifiers; satisfiability is undecidable,
but we prove that it is decidable when restricting to turn-based games.
Our algorithms are obtained through a very convenient translation to QCTL
(the~computation-tree logic CTL extended with atomic quantification),
which we show also applies to Strategy Logic, as well as when strategy
quantification ranges over memoryless strategies.}
}
@inproceedings{AG-fsttcs14,
address = {New~Dehli, India},
month = dec,
year = 2014,
volume = {29},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Raman, Venkatesh and Suresh, S.~P.},
acronym = {{FSTTCS}'14},
booktitle = {{P}roceedings of the 34th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'14)},
author = {Aiswarya, C. and Gastin, Paul},
title = {Reasoning about distributed systems: {WYSIWYG}},
pages = {11-30},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AG-fsttcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AG-fsttcs14.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2014.11},
abstract = {There are two schools of thought on reasoning about distributed
systems: one~following interleaving based semantics, and one following
partial-order{{\slash}}graph based semantics. This paper compares these two
approaches and argues in favour of the latter. An~introductory treatment
of the split-width technique is also provided.}
}
@article{jgl-jlap14,
publisher = {Elsevier Science Publishers},
journal = {Journal of Logic and Algebraic Methods in Programming},
author = {Goubault{-}Larrecq, Jean},
title = {Full Abstraction for Non-Deterministic and Probabilistic
Extensions of {PCF}~{I}: the~Angelic Cases},
volume = 84,
number = 1,
year = 2015,
month = jan,
pages = {155-184},
opteditor = {Berger, Ulrich},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/jgl-jlap14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/jgl-jlap14.pdf},
doi = {10.1016/j.jlamp.2014.09.003},
abstract = {We examine several extensions and variants of Plotkin's
language~PCF, including non-deterministic and probabilistic choice
constructs. For~each, we give an operational and a denotational semantics,
and compare them. In each case, we show soundness and computational
adequacy: the two semantics compute the same values at ground types.
Beyond this, we establish full abstraction (the~observational preorder
coincides with the denotational preorder) in a number of cases. In~the
probabilistic cases, this requires the addition of so-called statistical
termination testers to the language.}
}
@article{haar-mvlsc15,
publisher = {Old City Publishing},
journal = {Journal of Multiple-Valued Logic and Soft Computing},
author = {Haar, Stefan},
title = {Cyclic Ordering through Partial Orders},
volume = {27},
number = {2-3},
year = 2016,
month = sep,
pages = {209-228},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/haar-mvlsc16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/haar-mvlsc16.pdf},
abstract = {The orientation problem for ternary cyclic order relations has
been attacked in the literature from combinatorial perspectives, through
rotations, and by connection with Petri nets. We propose here a two-fold
characterization of orientable cyclic orders in terms of symmetries of
partial orders as well as in terms of separating sets (cuts). The results
are inspired by properties of non-sequential discrete processeses, but
also apply to dense structures of any cardinality.}
}
@article{BFHP-fi14,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {Bernardinello, Luca and Ferigato, Carlo and
Haar, Stefan and Pomello, Lucia},
title = {Closed Sets in Occurrence Nets with Conflicts},
volume = 133,
number = 4,
year = 2014,
pages = {323-344},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFHP-fi14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFHP-fi14.pdf},
doi = {10.3233/FI-2014-1079},
abstract = {The semantics of concurrent processes can be defined in terms of
partially ordered sets. Occurrence nets, which belong to the family of
Petri nets, model concurrent processes as partially ordered sets of
occurrences of local states and local events. On the basis of the
associated concurrency relation, a closure operator can be defined, giving
rise to a lattice of closed sets. Extending previous results along this
line, the present paper studies occurrence nets with forward conflicts,
modelling families of processes. It is shown that the lattice of closed
sets is orthomodular, and the relations between closed sets and some
particular substructures of an occurrence net are studied. In particular,
the paper deals with runs, modelling concurrent histories, and trails,
corresponding to possible histories of sequential components. A~second
closure operator is then defined by means of an iterative procedure.
The~corresponding closed sets, here called 'dynamically closed', are shown
to form a complete lattice, which in general is not orthocomplemented.
Finally, it is shown that, if an occurrence net satisfies a property
called B-density, which essentially says that any antichain meets any
trail, then the two notions of closed set coincide, and they form a
complete, algebraic orthomodular lattice.}
}
@inproceedings{BHL-fsttcs14,
address = {New~Dehli, India},
month = dec,
year = 2014,
volume = {29},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Raman, Venkatesh and Suresh, S.~P.},
acronym = {{FSTTCS}'14},
booktitle = {{P}roceedings of the 34th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'14)},
author = {Bertrand, Nathalie and Haddad, Serge and Lefaucheux, Engel},
title = {Foundation of Diagnosis and Predictability in Probabilistic
Systems},
pages = {417-429},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHL-fsttcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHL-fsttcs14.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2014.417},
abstract = {In discrete event systems prone to unobservable faults, a
diagnoser must eventually detect fault occurrences. The diagnosability
problem consists in deciding whether such a diagnoser exists. Here we
investigate diagnosis for probabilistic systems modelled by partially
observed Markov chains also called probabilistic labeled transition
systems (pLTS). First we study different specifications of diagnosability
and establish their relations both in finite and infinite pLTS. Then we
analyze the complexity of the diagnosability problem for finite pLTS: we
show that the polynomial time procedure earlier proposed is erroneous and
that in fact for all considered specifications, the problem is
PSPACE-complete. We also establish tight bounds for the size of
diagnosers. Afterwards we consider the dual notion of predictability which
consists in predicting that in a safe run, a fault will eventually occur.
Predictability is an easier problem than diagnosability: it is
NLOGSPACE-complete. Yet the predictor synthesis is as hard as the
diagnoser synthesis. Finally we introduce and study the more flexible
notion of prediagnosability that generalizes predictability and
diagnosability.}
}
@inproceedings{BGK-fsttcs14,
address = {New~Dehli, India},
month = dec,
year = 2014,
volume = {29},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Raman, Venkatesh and Suresh, S.~P.},
acronym = {{FSTTCS}'14},
booktitle = {{P}roceedings of the 34th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'14)},
author = {Bollig, Benedikt and Gastin, Paul and Kumar, Akshay},
title = {Parameterized Communicating Automata: Complementation and
Model Checking},
pages = {625-637},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGK-fsttcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGK-fsttcs14.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2014.625},
abstract = {We study the language-theoretical aspects of parameterized
communicating automata (PCAs), in which processes communicate via
rendez-vous. A given PCA can be run on any topology of bounded degree such
as pipelines, rings, ranked trees, and grids. We show that, under a
context bound, which restricts the local behavior of each process, PCAs
are effectively complementable. Complementability is considered a key
aspect of robust automata models and can, in particular, be exploited for
verification. In this paper, we use it to obtain a characterization of
context-bounded PCAs in terms of monadic second-order (MSO) logic. As the
emptiness problem for context-bounded PCAs is decidable for the classes of
pipelines, rings, and trees, their model-checking problem wrt. MSO
properties also becomes decidable. While previous work on model checking
parameterized systems typically uses temporal logics without next
operator, our MSO logic allows one to express several natural next
modalities.}
}
@inproceedings{CMS-fsttcs14,
address = {New~Dehli, India},
month = dec,
year = 2014,
volume = {29},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Raman, Venkatesh and Suresh, S.~P.},
acronym = {{FSTTCS}'14},
booktitle = {{P}roceedings of the 34th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'14)},
author = {Chadha, Rohit and Mathur, Umang and Schwoon, Stefan},
title = {Computing Information Flow Using Symbolic Model-Checking},
pages = {505-516},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CMS-fsttcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CMS-fsttcs14.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2014.505},
abstract = {Several measures have been proposed in literature for
quantifying the information leaked by the public outputs of a program with
secret inputs. We consider the problem of computing information leaked by
a deterministic or probabilistic program when the measure of information
is based on (a)~min-entropy and (b)~Shannon entropy. The key challenge in
computing these measures is that we need the total number of possible
outputs and, for each possible output, the number of inputs that lead to
it. A direct computation of these quantities is infeasible because of the
state-explosion problem. We therefore propose symbolic algorithms based on
binary decision diagrams (BDDs). The advantage of our approach is that
these symbolic algorithms can be easily implemented in any BDD-based
model-checking tool that checks for reachability in deterministic
non-recursive programs by computing program summaries. We demonstrate the
validity of our approach by implementing these algorithms in a tool
Moped-QLeak, which is built upon Moped, a model checker for Boolean
programs. Finally, we show how this symbolic approach extends to
probabilistic programs.}
}
@inproceedings{DFM-fsttcs14,
address = {New~Dehli, India},
month = dec,
year = 2014,
volume = {29},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Raman, Venkatesh and Suresh, S.~P.},
acronym = {{FSTTCS}'14},
booktitle = {{P}roceedings of the 34th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'14)},
author = {David, Claire and Francis, Nadime and Murlak, Filip},
title = {Consistency of injective tree patterns},
pages = {279-290},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DFM-fsttcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DFM-fsttcs14.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2014.279},
abstract = {Testing if an incomplete description of an XML document is
consistent, that is, if it describes a real document conforming to the
imposed schema, amounts to deciding if a given tree pattern can be matched
injectively into a tree accepted by a fixed automaton. This problem can be
solved in polynomial time for patterns that use the child relation and the
sibling order, but do not use the descendant relation. For general
patterns the problem is in NP, but no lower bound has been known so far.
We show that the problem is NP-complete already for patterns using only
child and descendant relations. The source of hardness turns out to be the
interplay between these relations: for patterns using only descendant we
give a polynomial algorithm. We also show that the algorithm can be
adapted to patterns using descendant and following-sibling, but combining
descendant and next-sibling leads to intractability.}
}
@inproceedings{DJLMS-fsttcs14,
address = {New~Dehli, India},
month = dec,
year = 2014,
volume = {29},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Raman, Venkatesh and Suresh, S.~P.},
acronym = {{FSTTCS}'14},
booktitle = {{P}roceedings of the 34th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'14)},
author = {Doyen, Laurent and Juhl, Line and Larsen, Kim G. and
Markey, Nicolas and Shirmohammadi, Mahsa},
title = {Synchronizing words for weighted and timed automata},
pages = {121-132},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DJLMS-fsttcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DJLMS-fsttcs14.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2014.121},
abstract = {The problem of synchronizing automata is concerned with the
existence of a word that sends all states of the automaton to one and the
same state. This problem has classically been studied for complete
deterministic finite automata, with the existence problem being
NLOGSPACE-complete.\par
In this paper we consider synchronizing-word problems for weighted and
timed automata. We consider the synchronization problem in several
variants and combinations of these, including deterministic and
non-deterministic timed and weighted automata, synchronization to unique
location with possibly different clock valuations or accumulated weights,
as well as synchronization with a safety condition forbidding the
automaton to visit states outside a safety-set during synchronization
(e.g. energy constraints). For deterministic weighted automata, the
synchronization problem is proven PSPACE-complete under energy
constraints, and in 3-EXPSPACE under general safety constraints. For timed
automata the synchronization problems are shown to be PSPACE-complete in
the deterministic case, and undecidable in the non-deterministic case.}
}
@inproceedings{BMS-fsttcs14,
address = {New~Dehli, India},
month = dec,
year = 2014,
volume = {29},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Raman, Venkatesh and Suresh, S.~P.},
acronym = {{FSTTCS}'14},
booktitle = {{P}roceedings of the 34th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'14)},
author = {Bouyer, Patricia and Markey, Nicolas and Stan, Daniel},
title = {Mixed {N}ash Equilibria in Concurrent Games},
pages = {351-363},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-fsttcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-fsttcs14.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2014.351},
abstract = {We study mixed-strategy Nash equilibria in multiplayer
deterministic concurrent games played on graphs, with terminal-reward
payoffs (that is, absorbing states with a value for each player). We show
undecidability of the existence of a constrained Nash equilibrium (the
constraint requiring that one player should have maximal payoff), with
only three players and 0/1-rewards (i.e., reachability objectives). This
has to be compared with the undecidability result by Ummels and Wojtczak
for turn-based games which requires 14 players and general rewards. Our
proof has various interesting consequences: (i)~the~undecidability of the
existence of a Nash equilibrium with a constraint on the social welfare;
(ii)~the~undecidability of the existence of an (unconstrained) Nash
equilibrium in concurrent games with terminal-reward payoffs.}
}
@article{BBBMBGJ-lmcs14,
journal = {Logical Methods in Computer Science},
author = {Bertrand, Nathalie and Bouyer, Patricia and Brihaye,
{\relax Th}omas and Menet, Quentin and Baier, Christel and
Gr{\"o}{\ss}er, Marcus and Jurdzi{\'n}ski, Marcin},
title = {Stochastic Timed Automata},
volume = 10,
number = {4:6},
nopages = {},
month = dec,
year = 2014,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBBMBGJ-mfcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBBMBGJ-mfcs14.pdf},
doi = {10.2168/LMCS-10(4:6)2014},
abstract = {A~stochastic timed automaton is a purely stochastic process
defined on a timed automaton, in which both delays and discrete choices
are made randomly. We study the almost-sure model-checking problem for
this model, that is, given a stochastic timed automaton~\(\mathcal{A}\)
and a property~\(\varphi\), we want to decide whether \(\mathcal{A}\)
satisfies~\(\varphi\) with probability~\(1\). In this paper, we identify
several classes of automata and of properties for which this can be
decided. The proof relies on the construction of a finite abstraction,
called the thick graph, that we interpret as a finite Markov chain, and
for which we can decide the almost-sure model-checking problem.
Correctness of the abstraction holds when automata are almost-surely fair,
which we show, is the case for two large classes of systems, single-clock
automata and so-called weak-reactive automata. Techniques employed in this
article gather tools from real-time verification and probabilistic
verification, as well as topological games played on timed automata.}
}
@article{BCGZ-jal14,
publisher = {Elsevier Science Publishers},
journal = {Journal of Applied Logic},
author = {Bollig, Benedikt and Cyriac, Aiswarya and Gastin, Paul and
Zeitoun, Marc},
title = {Temporal logics for concurrent recursive programs:
Satisfiability and model checking},
volume = 12,
number = 4,
pages = {395-416},
month = dec,
year = 2014,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCGZ-jal14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCGZ-jal14.pdf},
doi = {10.1016/j.jal.2014.05.001},
abstract = {We develop a general framework for the design of temporal logics
for concurrent recursive programs. A program execution is modeled as a
partial order with multiple nesting relations. To specify properties of
executions, we consider any temporal logic whose modalities are definable
in monadic second-order logic and which, in addition, allows PDL-like path
expressions. This captures, in a unifying framework, a wide range of
logics defined for ranked and unranked trees, nested words, and
Mazurkiewicz traces that have been studied separately. We show that
satisfiability and model checking are decidable in EXPTIME and 2EXPTIME,
depending on the precise path modalities.}
}
@proceedings{KHY-topnoc2014,
editor = {Koutny, Maciej and Haddad, Serge and Yakovlev, Alex},
title = {Transactions on {P}etri Nets and Other Models of Concurrency~{IX}},
booktitle = {Transactions on {P}etri Nets and Other Models of Concurrency~{IX}},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = 8910,
year = {2014},
noaddress = {},
url = {http://www.springer.com/978-3-662-45729-0}
}
@incollection{topnoc14-CH,
year = 2014,
volume = {8910},
series = {Lecture Notes in Computer Science},
editor = {Koutny, Maciej and Haddad, Serge and Yakovlev, Alex},
publisher = {Springer},
booktitle = {Transactions on {P}etri Nets and Other Models of Concurrency~{IX}},
author = {Chatain, {\relax Th}omas and Haar, Stefan},
title = {A Canonical Contraction for Safe {P}etri Nets},
pages = {83-98},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/topnoc14-CH.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/topnoc14-CH.pdf},
doi = {10.1007/978-3-662-45730-6_5},
abstract = {Under maximal semantics, the occurrence of an event~\(a\) in a
concurrent run of an occurrence net may imply the occurrence of other
events, not causally related to~\(a\), in the same run. In recent works,
we have formalized this phenomenon as the reveals relation, and used it to
obtain a contraction of sets of events called facets in the context of
occurrence nets. Here, we extend this idea to propose a canonical
contraction of general safe Petri nets into pieces of partial-order
behaviour which can be seen as {"}macro-transitions{"} since all their
events must occur together in maximal semantics. On occurrence nets, our
construction coincides with the facets abstraction. Our contraction
preserves the maximal semantics in the sense that the maximal processes of
the contracted net are in bijection with those of the original net.}
}
@inproceedings{CHJPS-cmsb14,
address = {Manchester, UK},
month = nov,
year = 2014,
volume = {8859},
series = {Lecture Notes in Bioinformatics},
publisher = {Springer-Verlag},
editor = {Mendes, Pedro},
acronym = {{CMSB}'14},
booktitle = {{P}roceedings of the 12th
{C}onference on
{C}omputational {M}ethods in {S}ystem {B}iology
({CMSB}'14)},
author = {Chatain, {\relax Th}omas and Haar, Stefan and Jezequel,
Lo{\"\i}g and Paulev{\'e}, Lo{\"\i}c and Schwoon, Stefan},
title = {Characterization of Reachable Attractors Using {P}etri Net
Unfoldings},
pages = {129-142},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CHJPS-cmsb14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CHJPS-cmsb14.pdf},
doi = {10.1007/978-3-319-12982-2_10},
abstract = {Attractors of network dynamics represent the long-term
behaviours of the modelled system. Their characterization is therefore
crucial for understanding the response and differentiation capabilities of
a dynamical system. In the scope of qualitative models of interaction
networks, the computation of attractors reachable from a given state of
the network faces combinatorial issues due to the state space explosion.
In this paper, we present a new algorithm that exploits the concurrency
between transitions of parallel acting components in order to reduce the
search space. The algorithm relies on Petri net unfoldings that can be
used to compute a compact representation of the dynamics. We illustrate
the applicability of the algorithm with Petri net models of cell
signalling and regulation networks, Boolean and multi-valued. The proposed
approach aims at being complementary to existing methods for deriving the
attractors of Boolean models, while being generic since they apply to any
safe Petri net.}
}
@inproceedings{BHHP-simul14,
address = {Nice, France},
month = oct,
year = 2014,
publisher = {XPS},
editor = {Arisha, Amr and Bobashev, Georgiy},
acronym = {{SIMUL}'14},
booktitle = {{P}roceedings of the 6th {I}nternational {C}onference on {A}dvances in
{S}ystem {S}imulation ({SIMUL}'14)},
author = {Barbot, Beno{\^\i}t and Haddad, Serge and Heiner, Monika
and Picaronny, Claudine},
title = {Rare Event Handling in Signalling Cascades},
pages = {126-131},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHHP-simul14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHHP-simul14.pdf},
abstract = {Signalling cascades are a recurrent pattern of biological
regulatory systems whose analysis has deserved a lot of attention. It has
been shown that stochastic Petri nets are appropriate to model such
systems and evaluate the probabilities of specific properties. Such an
evaluation can be done numerically when the combinatorial state space
explosion is manageable or statistically otherwise. However, when the
probabilities to be evaluated are too small, random simulation requires
more sophisticated techniques for the handling of rare events. In this
paper, we show how such involved methods can be successfully applied for
signalling cascades. More precisely, we study three relevant properties of
a signalling cascade with the help of the Cosmos tool. Our experiments
point out interesting dependencies between quantitative parameters of the
regulatory system and its transient behaviour. In addition, they
demonstrate that we can go beyond the capabilities of Marcie which
provides one of the most efficient numerical solvers.}
}
@article{BMS-tcs14,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Bouyer, Patricia and Markey, Nicolas and Sankur, Ocan},
title = {Robust Reachability in Timed Automata and Games: A~Game-based Approach},
volume = 563,
year = {2015},
month = jan,
pages = {43-74},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-tcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-tcs14.pdf},
doi = {10.1016/j.tcs.2014.08.014 },
abstract = {Reachability checking is one of the most basic problems in
verification. By solving this problem in a game, one can synthesize a
strategy that dictates the actions to be performed for ensuring that the
target location is reached. In this work, we are interested in
synthesizing {"}robust{"} strategies for ensuring reachability of a location
in timed automata. By robust, we mean that it must still ensure
reachability even when the delays are perturbed by the environment. We
model this perturbed semantics as a game between the controller and its
environment, and solve the parameterized robust reachability problem: we
show that the existence of an upper bound on the perturbations under which
there is a strategy reaching a target location is EXPTIME-complete. We
also extend our algorithm, with the same complexity, to turn-based timed
games, where the successor state is entirely determined by the environment
in some locations.}
}
@inproceedings{DDS-rp14,
address = {Oxford, UK},
month = sep,
year = 2014,
volume = {8762},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ouaknine, Jo{\"e}l and Potapov, Igor and Worrell, James},
acronym = {{RP}'14},
booktitle = {{P}roceedings of the 8th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'14)},
author = {Demri, St{\'e}phane and Dhar, Amit Kumar and Sangnier, Arnaud},
title = {Equivalence Between Model-Checking Flat Counter Systems and
{P}resburger Arithmetic},
pages = {85-97},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-rp14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-rp14.pdf},
doi = {10.1007/978-3-319-11439-2_7},
abstract = {We show that model-checking flat counter systems over
CTL\textsuperscript{*} (with arithmetical constraints on counter values)
has the same complexity as the satisfiability problem for Presburger
arithmetic. The lower bound already holds with the temporal operator EF
only, no~arithmetical constraints in the logical language and with guards
on transitions made of simple linear constraints. This complements our
understanding of model-checking flat counter systems with linear-time
temporal logics, such as LTL for which the problem is already known to be
(only) NP-complete with guards restricted to the linear fragment.}
}
@proceedings{DKW-ijcar2014,
editor = {Demri, St{\'e}phane and Kapur, Deepak and Weidenbach, Christoph},
title = {{P}roceedings of the 7th
{I}nternational {J}oint {C}onference on {A}utomated {R}easoning
({IJCAR}'14)},
booktitle = {{P}roceedings of the 7th
{I}nternational {J}oint {C}onference on {A}utomated {R}easoning
({IJCAR}'14)},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = 8562,
year = {2014},
month = jul,
address = {Vienna, Austria},
url = {http://www.springer.com/978-3-319-08586-9}
}
@article{CD-interstices14,
publisher = {INRIA},
journal = {Interstices},
author = {Chr{\'e}tien, R{\'e}my and Delaune, St{\'e}phanie},
title = {Le~bitcoin, une monnaie \(100\%\) num{\'e}rique},
month = sep,
year = {2014},
url = {https://interstices.info/jcms/ni_78681/le-bitcoin-une-monnaie-100-numerique},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-interstices14.pdf}
}
@inproceedings{CDR-tgc14,
address = {Rome, Italy},
month = dec,
year = 2014,
volume = {8902},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Maffei, Matteo and Tuosto, Emilio},
acronym = {{TGC}'14},
booktitle = {{R}evised {S}elected {P}apers of the 9th {S}ymposium on {T}rustworthy {G}lobal
{C}omputing ({TGC}'14)},
author = {Cheval, Vincent and Delaune, St{\'e}phanie and Ryan, Mark
D.},
title = {Tests for establishing security properties},
pages = {82-96},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDR-tgc14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDR-tgc14.pdf},
doi = {10.1007/978-3-662-45917-1_6},
abstract = {Ensuring strong security properties in some cases requires
participants to carry out tests during the execution of a protocol.
A~classical example is electronic voting: participants are required to
verify the presence of their ballots on a bulletin board, and to verify
the computation of the election outcome. The notion of certificate
transparency is another example, in which participants in the protocol are
required to perform tests to verify the integrity of a certificate log.\par
We present a framework for modelling systems with such `testable
properties', using the applied pi calculus. We model the tests that are
made by participants in order to obtain the security properties.
Underlying our work is an attacker model called {"}malicious but cautious{"},
which lies in between the Dolev-Yao model and the {"}honest but curious{"}
model. The malicious-but-cautious model is appropriate for cloud computing
providers that are potentially malicious but are assumed to be cautious
about launching attacks that might cause user tests to fail.}
}
@inproceedings{schmitz-rp14,
address = {Oxford, UK},
month = sep,
year = 2014,
volume = {8762},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ouaknine, Jo{\"e}l and Potapov, Igor and Worrell, James},
acronym = {{RP}'14},
booktitle = {{P}roceedings of the 8th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'14)},
author = {Schmitz, Sylvain},
title = {Complexity Bounds for Ordinal-Based Termination},
pages = {1-19},
url = {http://arxiv.org/abs/1407.5896},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/schmitz-rp14.pdf},
doi = {10.1007/978-3-319-11439-2_1},
abstract = {`What more than its truth do we know if we have a proof of a
theorem in a given formal system?' We examine Kreisel's question in the
particular context of program termination proofs, with an eye to deriving
complexity bounds on program running times.\par
Our main tool for this are length function theorems, which provide
complexity bounds on the use of well quasi orders. We illustrate how to
prove such theorems in the simple yet until now untreated case of
ordinals. We show how to apply this new theorem to derive complexity
bounds on programs when they are proven to terminate thanks to a ranking
function into some ordinal.}
}
@inproceedings{GLS-pp14,
year = 2014,
volume = 8464,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {van Breugel, Franck and Kashefi, Elham and Palamidessi,
Catuscia and Rutten, Jan},
booktitle = {Horizons of the Mind. A~Tribute to Prakash Panangaden},
author = {Goubault{-}Larrecq, Jean and Segala, Roberto},
title = {Random Measurable Selections},
pages = {343-362},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GLS-pp14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GLS-pp14.pdf},
doi = {10.1007/978-3-319-06880-0_18},
abstract = {We make the first steps towards showing a general {"}randomness
for free{"} theorem for stochastic automata. The goal of such theorems is
to replace randomized schedulers by averages of pure schedulers. Here, we
explore the case of measurable multifunctions and their measurable
selections. This involves constructing probability measures on the
measurable space of measurable selections of a given measurable
multifunction, which seems to be a fairly novel problem. We then extend
this to the case of IT automata, namely, non-deterministic (infinite)
automata with a history-dependent transition relation. Throughout, we
strive to make our assumptions minimal.}
}
@inproceedings{BGS-rp14,
address = {Oxford, UK},
month = sep,
year = 2014,
volume = {8762},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ouaknine, Jo{\"e}l and Potapov, Igor and Worrell, James},
acronym = {{RP}'14},
booktitle = {{P}roceedings of the 8th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'14)},
author = {Bollig, Benedikt and Gastin, Paul and Schubert, Jana},
title = {Parameterized Verification of Communicating Automata under Context Bounds},
pages = {45-57},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGS-rp14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGS-rp14.pdf},
doi = {10.1007/978-3-319-11439-2_4},
abstract = {We study the verification problem for parameterized
communicating automata~(PCA), in which processes synchronize via message
passing. A~given PCA can be run on any topology of bounded degree (such as
pipelines, rings, or ranked trees), and communication may take place
between any two processes that are adjacent in the topology. Parameterized
verification asks if there is a topology from a given topology class that
allows for an accepting run of the given PCA. In general, this problem is
undecidable even for synchronous communication and simple pipeline
topologies. We therefore consider context-bounded verification, which
restricts the behavior of each single process. For several variants of
context bounds, we show that parameterized verification over pipelines,
rings, and ranked trees is decidable. Our approach is automata-theoretic
and uniform. We introduce a notion of graph acceptor that identifies those
topologies allowing for an accepting run. Depending on the given topology
class, the topology acceptor can then be restricted, or adjusted, so that
the verification problem reduces to checking emptiness of finite automata
or tree automata.}
}
@inproceedings{HM-rp14,
address = {Oxford, UK},
month = sep,
year = 2014,
volume = {8762},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ouaknine, Jo{\"e}l and Potapov, Igor and Worrell, James},
acronym = {{RP}'14},
booktitle = {{P}roceedings of the 8th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'14)},
author = {Haddad, Serge and Monmege, Benjamin},
title = {Reachability in {MDP}s: Refining Convergence of Value Iteration},
pages = {125-137},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2014-07.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2014-07.pdf},
doi = {10.1007/978-3-319-11439-2_10},
abstract = {Markov Decision Processes (MDP) are a widely used model
including both non-deterministic and probabilistic choices. Minimal and
maximal probabilities to reach a target set of states, with respect to a
policy resolving non-determinism, may be computed by several methods
including value iteration. This algorithm, easy to implement and efficient
in terms of space complexity, consists in iteratively finding the
probabilities of paths of increasing length. However, it raises three
issues: (1)~defining a stopping criterion ensuring a bound on the
approximation, (2)~analyzing the rate of convergence, and (3)~specifying
an additional procedure to obtain the exact values once a sufficient
number of iterations has been performed. The first two issues are still
open and for the third one a {"}crude{"} upper bound on the number of
iterations has been proposed. Based on a graph analysis and transformation
of MDPs, we address these problems. First we introduce an interval
iteration algorithm, for which the stopping criterion is straightforward.
Then we exhibit convergence rate. Finally we significantly improve the
bound on the number of iterations required to get the exact values.}
}
@inproceedings{LS-rp14,
address = {Oxford, UK},
month = sep,
year = 2014,
volume = {8762},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ouaknine, Jo{\"e}l and Potapov, Igor and Worrell, James},
acronym = {{RP}'14},
booktitle = {{P}roceedings of the 8th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'14)},
author = {Leroux, J{\'e}r{\^o}me and Schnoebelen, {\relax Ph}ilippe},
title = {On Functions Weakly Computable by {P}etri Nets and Vector
Addition Systems},
pages = {190-202},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-rp14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-rp14.pdf},
doi = { 10.1007/978-3-319-11439-2_15},
abstract = {We show that any unbounded function weakly computable by a Petri
net or a VASS cannot be sublinear. This answers a long-standing folklore
conjecture about weakly computing the inverses of some fast-growing
functions. The proof relies on a pumping lemma for sets of runs in Petri
nets or VASSes.}
}
@inproceedings{HH-rp14,
address = {Oxford, UK},
month = sep,
year = 2014,
volume = {8762},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ouaknine, Jo{\"e}l and Potapov, Igor and Worrell, James},
acronym = {{RP}'14},
booktitle = {{P}roceedings of the 8th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'14)},
author = {Haase, Christoph and Halfon, Simon},
title = {Integer Vector Addition Systems with States},
pages = {112-124},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HH-rp14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HH-rp14.pdf},
doi = {10.1007/978-3-319-11439-2_9},
abstract = {This paper studies reachability, coverability and
inclusion problems for Integer Vector Addition
Systems with States (\(\mathbb{Z}\)-VASS) and
extensions and restrictions
thereof. A~\(\mathbb{Z}\)-VASS comprises a
finite-state controller with a finite number of
counters ranging over the integers. Although it is
folklore that reachability in \(\mathbb{Z}\)-VASS is
NP-complete, it turns out that despite their
naturalness, from a complexity point of view this
class has received little attention in the
literature. We fill this gap by providing an
in-depth analysis of the computational complexity of
the aforementioned decision problems. Most
interestingly, it turns out that while the addition
of reset operations to ordinary VASS leads to
undecidability and Ackermann-hardness of
reachability and coverability, respectively, they
can be added to \(\mathbb{Z}\)-VASS while retaining
NP-completeness of both coverability and
reachability.}
}
@article{PHL-stvr14,
publisher = {John Wiley \& Sons, Ltd.},
journal = {Software Testing, Verification and Reliability},
author = {Ponce{ }de{~}Le{\'o}n, Hern{\'a}n and Haar, Stefan and
Longuet, Delphine},
title = {Model-Based Testing for Concurrent Systems with Labeled Event
Structures},
volume = 24,
number = 7,
year = {2014},
month = nov,
pages = {558-590},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/PHL-stvr14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/PHL-stvr14.pdf},
doi = {10.1002/stvr.1543},
abstract = {We propose a theoretical testing framework and a test generation
algorithm for concurrent systems specified with true concurrency models,
such as Petri nets or networks of automata. The semantic model of
computation of such formalisms are labeled event structures, which allow
to represent concurrency explicitly. We introduce the notions of strong
and weak concurrency: strongly concurrent events must be concurrent in the
implementation, while weakly concurrent ones may eventually be ordered.
The ioco type conformance relations for sequential systems rely on the
observation of sequences of actions and blockings, thus they are not
capable of capturing and exploiting concurrency of non sequential
behaviors. We propose an extension of \textbf{ioco} for labeled event
structures, named \textbf{co-ioco}, allowing to deal with strong and weak
concurrency. We~extend the notions of test cases and test execution to
labeled event structures, and give a test generation algorithm building a
complete test suite for \textbf{co-ioco}.}
}
@inproceedings{BMP-dx14,
address = {Graz, Austria},
month = sep,
year = 2014,
editor = {Abreu, Rui and Pill, Ingo and Wotawa, Franz},
acronym = {{DX}'14},
booktitle = {{P}roceedings of the 25th {I}nternational {W}orkshop on
{P}rinciples of {D}iagnosis ({DX}'14)},
author = {Brand{\'a}n{ }Briones, Laura and Madalinski, Agnes and Ponce{ }de{~}Le{\'o}n, Hern{\'a}n},
title = {Distributed Diagnosability Analysis with {P}etri Nets},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMP-dx14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMP-dx14.pdf},
abstract = {We propose a framework to distributed diagnosability analysis of
concurrent systems modeled with Petri nets as a collection of components
synchronizing on common observable transitions, where faults can occur in
several components. The diagnosability analysis of the entire system is
done in parallel by verifying the interaction of each component with the
fault free versions of the other components. Furthermore, we use existing
efficient methods and tools, in particular parallel LTL-X model checking
based on unfoldings, for diagnosability verification.}
}
@article{FL-sosym14,
publisher = {Springer},
journal = {Software~\& System Modeling},
author = {Finkel, Alain and Leroux, J{\'e}r{\^o}me},
title = {Recent and simple algorithms for {P}etri nets},
volume = 14,
number = 2,
year = {2015},
month = may,
pages = {719-725},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FL-sosym14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FL-sosym14.pdf},
doi = {10.1007/s10270-014-0426-0},
abstract = {We show how inductive invariants can be used to solve
coverability, boundedness and reachability problems for Petri nets. This
approach provides algorithms that are conceptually simpler than previously
pblished ones.}
}
@article{EM-integers14,
journal = {INTEGERS -- Electronic Journal of Combinatorial Number Theory},
author = {Elias, Yara and McKenzie, Pierre},
title = {On Generalized Addition Chains},
volume = 14,
number = {A16},
nopages = {},
year = 2014,
month = mar,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/EM-integers14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/EM-integers14.pdf},
abstract = {Given integers \(d \geq 1\), and \(g \geq 2\),
a~\(g\)-addition chain for~\(d\) is a sequence of
integers \(a_0 = 1\), \(a_1\), \(a_2\), ... ,
\(a_{r-1}\), \(a_r = d\) where \(a_i = a_{j_{1}} +
a_{j_{2}} + \cdots + a_{j_{k}}\), with \(2 \leq k
\leq g\), and \(0 \leq j_1 \leq j_2 \cdots j_k \leq
i-1\). The length of a \(g\)-addition chain
is~\(r\), the number of terms following~\(1\) in the
sequence. We denote by~\(l_{g}(d)\) the length of a
shortest addition chain for~\(d\). Many results have
been established in the case \(g = 2\). Our aim is
to establish the same sort of results for arbitrary
fixed~\(g\). In~particular, we adapt methods for
constructing \(g\)-addition chains when \(g = 2\) to
the case \(g > 2\) and we study the asymptotic
behavior of~\(l_g\).}
}
@inproceedings{CKM-ncma14,
address = {Kassel, Germany},
month = jul,
year = 2014,
volume = 304,
series = {books@ocg.at},
publisher = {Austrian Computer Society},
editor = {Bensch, Suna and Freund, Rudolf and Otto, Friedrich},
acronym = {{NCMA}'14},
booktitle = {{P}roceedings of the 6th {W}orkshop on {N}on-{C}lassical {M}odels
of {A}utomata and {A}pplications ({NCMA}'14)},
author = {Cadilhac, Micha{\"e}l and Krebs, Andreas and McKenzie, Pierre},
title = {Extremely uniform branching programs},
pages = {73-83},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CKM-ncma14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CKM-ncma14.pdf},
abstract = {We propose a new descriptive complexity notion of
uniformity for branching programs solving problems
defined on structured data. We observe that
FO[=]-uniform (\(n\)-way) branching programs are
unable to solve the tree evaluation problem studied
by Cook, McKenzie, Wehr, Braverman and Santhanam
because such programs possess a variant of their
thriftiness property. Similarly, FO[=]-uniform
(\(n\)-way) branching programs are unable to solve
the P-complete GEN problem because such programs
possess the incremental property studied by G{\'a}l,
Kouck{\'y} and McKenzie.}
}
@inproceedings{AGN-atva14,
address = {Sydney, Australia},
month = nov,
year = {2014},
volume = 8837,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Cassez, Franck and Raskin, Jean-Fran{\c{c}}ois},
acronym = {{ATVA}'14},
booktitle = {{P}roceedings of the 12th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'14)},
author = {Aiswarya, C. and Gastin, Paul and Narayan Kumar, K.},
title = {Verifying Communicating Multi-pushdown Systems via Split-width},
pages = {1-17},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AGN-atva14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGN-atva14.pdf},
doi = {10.1007/978-3-319-11936-6_1},
abstract = {Communicating multi-pushdown systems model networks of
multi-threaded recursive programs communicating via reliable FIFO
channels. We extend the notion of split-width to this setting, improving
and simplifying the earlier definition. Split-width, while having the same
power of clique-{{\slash}}tree-width, gives a divide-and-conquer technique
to prove the bound of a class, thanks to the two basic operations, shuffle
and merge, of the split-width algebra. We illustrate this technique on
examples. We also obtain simple, uniform and optimal decision procedures
for various verification problems parametrised by split-width.}
}
@article{FKS-fmsd14,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Fribourg, Laurent and K{\"u}hne, Ulrich and Soulat, Romain},
title = {Finite Controlled Invariants for Sampled Switched Systems},
year = 2014,
month = dec,
volume = 45,
number = 3,
pages = {303-329},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FKS-fmsd14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FKS-fmsd14.pdf},
doi = {10.1007/s10703-014-0211-2},
abstract = {We consider in this paper switched systems, a class of hybrid
systems recently used with success in various domains such as automotive
industry and power electronics. We propose a state-dependent control
strategy which makes the trajectories of the analyzed system converge to
finite cyclic sequences of points. Our method relies on a technique of
decomposition of the state space into local regions where the control is
uniform. We have implemented the procedure using zonotopes, and applied it
successfully to several examples of the literature and industrial case
studies in power electronics.}
}
@inproceedings{SLAF-syncop14,
address = {Grenoble, France},
volume = 145,
series = {Electronic Proceedings in Theoretical Computer Science},
month = apr,
year = 2014,
editor = {Andr{\'e}, {\'E}tienne and Frehse, Goran},
acronym = {{SYNCOP}'14},
booktitle = {{P}roceedings of the 1st {I}nternational {W}orkshop on {S}ynthesis
of {C}ontinuous {P}arameters ({SYNCOP}'14)},
author = {Sun, Youcheng and Lipari, Giuseppe and
Andr{\'e}, {\'E}tienne and Fribourg, Laurent},
title = {Toward Parametric Timed Interfaces for Real-Time Components},
pages = {49-64},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SLAF-syncop14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SLAF-syncop14.pdf},
doi = {10.4204/EPTCS.145.6},
abstract = {We propose here a framework to model real-time components
consisting of concurrent real-time tasks running on a single processor,
using parametric timed automata. Our framework is generic and modular, so
as to be easily adapted to different schedulers and more complex task
models. We first perform a parametric schedulability analysis of the
components using the inverse method. We show that the method unfortunately
does not provide satisfactory results when the task periods are considered
as parameters. After identifying and explaining the problem, we present a
solution adapting the model by making use of the worst-case scenario in
schedulability analysis. We show that the analysis with the inverse method
always converges on the modified model when the system load is strictly
less than~\(100\%\). Finally, we show how to use our parametric analysis for
the generation of timed interfaces in compositional system design.}
}
@inproceedings{BGM-atva14,
address = {Sydney, Australia},
month = nov,
year = {2014},
volume = 8837,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Cassez, Franck and Raskin, Jean-Fran{\c{c}}ois},
acronym = {{ATVA}'14},
booktitle = {{P}roceedings of the 12th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'14)},
author = {Bouyer, Patricia and Gardy, Patrick and Markey, Nicolas},
title = {Quantitative verification of weighted {K}ripke structures},
pages = {64-80},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGM-atva14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGM-atva14.pdf},
doi = {10.1007/978-3-319-11936-6_6},
abstract = {Extending formal verification techniques to handle quantitative
aspects, both for the models and for the properties to be checked, has
become a central research topic over the last twenty years. Following
several recent works, we study model checking for (one-dimensional)
weighted Kripke structures with positive and negative weights, and
temporal logics constraining the total and/or average weight. We prove
decidability when only accumulated weight is constrained, while allowing
average-weight constraints alone already is undecidable.}
}
@inproceedings{MV-atva14,
address = {Sydney, Australia},
month = nov,
year = {2014},
volume = 8837,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Cassez, Franck and Raskin, Jean-Fran{\c{c}}ois},
acronym = {{ATVA}'14},
booktitle = {{P}roceedings of the 12th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'14)},
author = {Markey, Nicolas and Vester, Steen},
title = {Symmetry Reduction in Infinite Games with Finite Branching},
pages = {281-296},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/MV-atva14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/MV-atva14.pdf},
doi = {10.1007/978-3-319-11936-6_21},
abstract = {Symmetry reductions have been applied extensively for the
verification of finite-state concurrent systems and hardware designs using
model-checking of temporal logics such as LTL, CTL and
CTL\textsuperscript{*}, as well as real-time and probabilistic-system
model-checking. In this paper we extend the technique to handle
infinite-state games on graphs with finite branching where the objectives
of the players can be very general. As particular applications, it is
shown that the technique can be applied to reduce the state space in
parity games as well as when doing model-checking of the temporal logic
ATL\textsuperscript{*}.}
}
@article{ADK-lmcs14,
journal = {Logical Methods in Computer Science},
author = {Arapinis, Myrto and Delaune, St{\'e}phanie and Kremer, Steve},
title = {Dynamic Tags for Security Protocols},
volume = 10,
number = {2:11},
nopages = {},
month = jun,
year = 2014,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ADK-lmcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ADK-lmcs14.pdf},
doi = {10.2168/LMCS-10(2:11)2014},
abstract = {The design and verification of cryptographic protocols is a
notoriously difficult task, even in symbolic models which take an abstract
view of cryptography. This is mainly due to the fact that protocols may
interact with an arbitrary attacker which yields a verification problem
that has several sources of unboundedness (size of messages, number of
sessions, etc. In this paper, we characterize a class of protocols for
which deciding security for an unbounded number of sessions is decidable.
More precisely, we present a simple transformation which maps a protocol
that is secure for a bounded number of protocol sessions (a~decidable
problem) to a protocol that is secure for an unbounded number of sessions.
The precise number of sessions that need to be considered is a function of
the security property and we show that for several classical security
properties a single session is sufficient. Therefore, in many cases our
results yields a design strategy for security protocols: (i)~design a
protocol intended to be secure for a {single session}; and (ii)~apply our
transformation to obtain a protocol which is secure for an unbounded
number of sessions.}
}
@article{FL-is14,
publisher = {Springer},
journal = {Informatik Spektrum},
author = {Finkel, Alain and Leroux, J{\'e}r{\^o}me},
title = {Neue, einfache {A}lgorithmen f{\"u}r {P}etrinetze},
volume = 37,
number = {3},
month = jun,
year = 2014,
pages = {229-236},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FL-is14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FL-is14.pdf},
doi = {10.1007/s00287-013-0753-5},
abstract = {Wir zeigen, wie die Entscheidungsprobleme der {\"U}berdeckung,
der Beschr{\"a}nktheit und der Erreichbarkeit mithilfe induktiver
Invarianten einfacher l{\"o}sbar sind als mit herk{\"o}mmlichen
Methoden}
}
@article{CD-tocl14,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Chatterjee, Krishnendu and Doyen, Laurent},
title = {Partial-Observation Stochastic Games: How to Win when Belief Fails},
volume = 15,
number = {2:16},
month = apr,
year = 2014,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-tocl14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-tocl14.pdf},
doi = {10.1145/2579819},
abstract = {In two-player finite-state stochastic games of partial
observation on graphs, in every state of the graph,
the players simultaneously choose an action, and
their joint actions determine a probability
distribution over the successor states. The game is
played for infinitely many rounds and thus the
players construct an infinite path in the graph. We
consider reachability objectives where the first
player tries to ensure a target state to be visited
almost-surely (i.e., with probability~1) or
positively (i.e., with positive probability), no
matter the strategy of the second player.\par
We classify such games according to the information and to the
power of randomization available to the players. On
the basis of information, the game can be one-sided
with either (a)~player~1, or (b)~player 2 having
partial observation (and the other player has
perfect observation), or two-sided with (c)~both
players having partial observation. On the basis of
randomization, (a)~the players may not be allowed to
use randomization (pure strategies), or (b)~they may
choose a probability distribution over actions but
the actual random choice is external and not visible
to the player (actions invisible), or (c)~they may
use full randomization.\par
Our main results for pure strategies are as follows:
(1)~For one-sided games with player~2 having perfect
observation we show that (in contrast to full
randomized strategies) belief-based
(subset-construction based) strategies are not
sufficient, and we present an exponential upper
bound on memory both for almost-sure and positive
winning strategies; we show that the problem of
deciding the existence of almost-sure and positive
winning strategies for player~1 is EXPTIME-complete
and present symbolic algorithms that avoid the
explicit exponential construction. (2)~For one-sided
games with player~1 having perfect observation we
show that non-elementary memory is both necessary
and sufficient for both almost-sure and positive
win- ning strategies. (3)~We~show that for the
general (two-sided) case finite-memory strategies
are sufficient for both positive and almost-sure
winning, and at least non-elementary memory is
required. We establish the equivalence of the
almost-sure winning problems for pure strategies and
for randomized strategies with actions
invisible. Our equivalence result exhibit serious
flaws in previous results of the literature: we show
a non-elementary memory lower bound for almost-sure
winning whereas an exponential upper bound was
previously claimed.}
}
@inproceedings{CS-mfcs14,
address = {Budapest, Hungary},
month = aug,
year = 2014,
volume = {8634},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {{\'E}sik, Zolt{\'a}n and Csuhaj{-}Varj{\'u}, Erzs{\'e}bet and
Dietzfelbinger, Martin},
acronym = {{MFCS}'14},
booktitle = {{P}roceedings of the 39th
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'14)~-- {P}art~{I}},
author = {Courtois, Jean-Baptiste and Schmitz, Sylvain},
title = {Alternating Vector Addition Systems with States},
pages = {220-231},
url = {http://hal.inria.fr/hal-00980878},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CS-mfcs14.pdf},
doi = {10.1007/978-3-662-44522-8_19},
abstract = {Alternating vector addition systems are obtained by equipping
vector addition systems with states (VASS) with 'fork' rules, and provide
a natural setting for infinite-arena games played over a VASS. Initially
introduced in the study of propositional linear logic, they have more
recently gathered attention in the guise of \emph{multi-dimensional
energy} games for quantitative verification and synthesis.\par
We show that establishing who is the winner in such a game with a state
reachability objective is 2-ExpTime-complete. As a further application, we
show that the same complexity result applies to the problem of whether a
VASS is simulated by a finite-state system.}
}
@inproceedings{CGK-concur14,
address = {Rome, Italy},
month = sep,
year = 2014,
volume = 8704,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Baldan, Paolo and Gorla, Daniele},
acronym = {{CONCUR}'14},
booktitle = {{P}roceedings of the 25th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'14)},
author = {Cyriac, Aiswarya and Gastin, Paul and Narayan Kumar, K.},
title = {Controllers for the Verification of Communicating Multi-Pushdown Systems},
pages = {297-311},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CGK-concur14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CGK-concur14.pdf},
doi = {10.1007/978-3-662-44584-6_21},
abstract = {Multi-pushdowns communicating via queues are formal models of
multi-threaded programs communicating via channels. They are turing
powerful and much of the work on their verification has focussed on
under-approximation techniques. Any error detected in the
under-approximation implies an error in the system. However the successful
verification of the under-approximation is not as useful if the system
exhibits unverified behaviours. Our aim is to design controllers that
observe/restrict the system so that it stays within the verified
under-approximation. We identify some important properties that a good
controller should satisfy. We consider an extensive under-approximation
class, construct a distributed controller with the desired properties and
also establish the decidability of verification problems for this class.}
}
@inproceedings{CCD-concur14,
address = {Rome, Italy},
month = sep,
year = 2014,
volume = 8704,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Baldan, Paolo and Gorla, Daniele},
acronym = {{CONCUR}'14},
booktitle = {{P}roceedings of the 25th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'14)},
author = {Chr{\'e}tien, R{\'e}my and Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
title = {Typing messages for free in security protocols:
the~case of equivalence properties},
pages = {372-386},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-concur14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-concur14.pdf},
doi = {10.1007/978-3-662-44584-6_26},
abstract = {Privacy properties such as untraceability, vote secrecy, or
anonymity are typically expressed as behavioural equivalence in a process
algebra that models security protocols. In this paper, we study how to
decide one particular relation, namely trace equivalence, for an unbounded
number of sessions.\par
Our first main contribution is to reduce the search space for attacks.
Specifically, we show that if there is an attack then there is one that is
well-typed. Our result holds for a large class of typing systems and a
large class of determinate security protocols. Assuming finitely many
nonces and keys, we can derive from this result that trace equivalence is
decidable for an unbounded number of sessions for a class of tagged
protocols, yielding one of the first decidability results for the
unbounded case. As an intermediate result, we also provide a novel
decision procedure in the case of a bounded number of sessions.}
}
@inproceedings{DMS-concur14,
address = {Rome, Italy},
month = sep,
year = 2014,
volume = 8704,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Baldan, Paolo and Gorla, Daniele},
acronym = {{CONCUR}'14},
booktitle = {{P}roceedings of the 25th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'14)},
author = {Doyen, Laurent and Massart, {\relax Th}ierry and Shirmohammadi, Mahsa},
title = {Robust Synchronization in {M}arkov Decision Processes},
pages = {234-248},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DMS-concur14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DMS-concur14.pdf},
doi = {10.1007/978-3-662-44584-6_17},
abstract = {We consider synchronizing properties of Markov decision
processes (MDP), viewed as generators of sequences of probability
distributions over states. A~probability distribution is \(p\)-synchronizing
if the probability mass is at least~\(p\) in some state, and a sequence of
probability distributions is weakly \(p\)-synchronizing, or strongly
\(p\)-synchronizing if respectively infinitely many, or all but finitely many
distributions in the sequence are \(p\)-synchronizing.\par
For each synchronizing mode, an MDP can be \textit{(i)}~sure winning if
there is a strategy that produces a \(1\)-synchronizing sequence;
\textit{(ii)}~almost-sure winning if there is a strategy that produces a
sequence that is, for all \(\epsilon>0\), a \((1-\epsilon)\)-synchronizing
sequence; \textit{(iii)}~limit-sure winning if for all \(\epsilon>0\),
there is a strategy that produces a \((1-\epsilon)\)-synchronizing
sequence.\par
For each synchronizing and winning mode, we consider the problem of
deciding whether an MDP is winning, and we establish matching upper and
lower complexity bounds of the problems, as well as the optimal memory
requirement for winning strategies: \textit{(a)}~for all winning modes, we
show that the problems are PSPACE-complete for weakly synchronizing, and
PTIME-complete for strongly synchronizing; \textit{(b)}~we~show that for
weakly synchronizing, exponential memory is sufficient and may be
necessary for sure winning, and infinite memory is necessary for
almost-sure winning; for strongly synchronizing, linear-size memory is
sufficient and may be necessary in all modes; \textit{(c)}~we~show a
robustness result that the almost-sure and limit-sure winning modes
coincide for both weakly and strongly synchronizing.}
}
@inproceedings{BMM-concur14,
address = {Rome, Italy},
month = sep,
year = 2014,
volume = 8704,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Baldan, Paolo and Gorla, Daniele},
acronym = {{CONCUR}'14},
booktitle = {{P}roceedings of the 25th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'14)},
author = {Bouyer, Patricia and Markey, Nicolas and Matteplackel,
Raj~Mohan},
title = {Averaging in~{LTL}},
pages = {266-280},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMM-concur14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMM-concur14.pdf},
doi = {10.1007/978-3-662-44584-6_19},
abstract = {For the accurate analysis of computerized systems, powerful
quantitative formalisms have been designed, together with efficient
verification algorithms. However, verification has mostly remained
boolean---either a property is~true, or it~is false. We~believe that this
is too crude in a context where quantitative information and constraints
are crucial: correctness should be quantified!\par In a recent line of
works, several authors have proposed quantitative semantics for temporal
logics, using e.g. \emph{discounting} modalities (which give less
importance to distant events). In~the present paper, we define and study a
quantitative semantics of~LTL with \emph{averaging} modalities, either on
the long run or within an until modality. This, in a way, relaxes the
classical Boolean semantics of~LTL, and provides a measure of certain
properties of a model. We~prove that computing and even approximating the
value of a formula in this logic is undecidable.}
}
@inproceedings{PHL-ictac14,
address = {Bucharest, Romania},
month = sep,
year = 2014,
volume = 8687,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ciobanu, Gabriel and M{\'e}ry, Dominique},
acronym = {{ICTAC}'14},
booktitle = {{P}roceedings of the 11th {I}nternational {C}olloquium on
{T}heoretical {A}spects of {C}omputing ({ICTAC}'14)},
author = {Ponce{ }de{~}Le{\'o}n, Hern{\'a}n and Haar, Stefan and
Longuet, Delphine},
title = {Distributed testing of concurrent systems: vector clocks to
the rescue},
pages = {369-387},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/PHL-ictac14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/PHL-ictac14.pdf},
doi = {10.1007/978-3-319-10882-7_22},
abstract = {The ioco relation has become a standard in model-based
conformance testing. The co-ioco conformance relation is an extension of
this relation to concurrent systems specified with true-concurrency
models. This relation assumes a global control and observation of the
system under test, which is not usually realistic in the case of
physically distributed systems. Such systems can be partially observed at
each of their points of control and observation by the sequences of inputs
and outputs exchanged with their environment. Unfortunately, in general,
global observation cannot be reconstructed from local ones, so global
conformance cannot be decided with local tests. We propose to append time
stamps to the observable actions of the system under test in order to
regain global conformance from local testing.}
}
@inproceedings{KS-dcfs2014,
address = {Turku, Finland},
month = aug,
year = 2014,
volume = {8614},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
editor = {J{\"u}rgensen, Helmut and Karhum{\"a}ki, Juhani and Okhotin, Alexander},
acronym = {{DCFS}'14},
booktitle = {{P}roceedings of the 16th {W}orkshop on {D}escriptional
{C}omplexity of {F}ormal {S}ystems ({DCFS}'14)},
author = {Karandikar, Prateek and Schnoebelen, {\relax Ph}ilippe},
title = {On the state complexity of closures and interiors of regular
languages with subwords},
pages = {234-245},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-dcfs2014.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-dcfs2014.pdf},
doi = {10.1007/978-3-319-09704-6_21},
abstract = {We study the state complexity of the set of subwords and
superwords of regular languages, and provide new lower bounds in the case
of languages over a two-letter alphabet. We also consider the dual
interior sets, for which the nondeterministic state complexity has a
doubly-exponential upper bound. We prove a matching doubly-exponential
lower bound for downward interiors in the case of an unbounded alphabet.}
}
@incollection{CD-nato12,
author = {Comon{-}Lundh, Hubert and Delaune, St{\'e}phanie},
title = {Formal Security Proofs},
booktitle = {Software Safety and Security},
pages = {26-63},
editor = {Nipkow, Tobias and Grumberg, Orna and Hauptmann, Benedikt},
series = {NATO Science for Peace and Security Series~-- D:~Information and
Communication Security},
volume = {33},
publisher = {{IOS} Press},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-nato12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-nato12.pdf},
year = 2012,
month = may
}
@inproceedings{CLHKS-ispec12,
address = {Hangzhou, China},
year = 2012,
month = apr,
volume = 7232,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ryan, Mark D. and Smyth, Ben and Wang, Guilin},
acronym = {{ISPEC}'12},
booktitle = {{P}roceedings of the 8th {I}nternational {C}onference on
{I}nformation {S}ecurity {P}ractice and {E}xperience
({ISPEC}'12)},
author = {Comon{-}Lundh, Hubert and Hagiya, Masami and Kawamoto, Yusuke
and Sakurada, Hideki},
title = {Computational Soundness of Indistinguishability
Properties without Computable Parsing},
pages = {63-79},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CHKS-ispec12.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CHKS-ispec12.pdf},
doi = {10.1007/978-3-642-29101-2_5},
abstract = {We provide a symbolic model for protocols using public-key
encryption and hash function, and prove that this model is computationally
sound: if there is an attack in the computational world, then there is an
attack in the symbolic (abstract) model. Our original contribution is that
we deal with the security properties, such as anonymity, which cannot be
described using a single execution trace, while considering an unbounded
number of sessions of the protocols in the presence of active and adaptive
adversaries. Our soundness proof is different from all existing studies in
that it does not require a computable parsing function from bit strings to
terms. This allows us to deal with more cryptographic primitives, such as
a preimage-resistant and collision-resistant hash function whose input may
have different lengths.}
}
@article{KS-msttocs14,
publisher = {Springer},
journal = {Theory of Computing Systems},
author = {Karandikar, Prateek and Schnoebelen, {\relax Ph}ilippe},
title = {Generalized {P}ost Embedding Problems},
year = {2015},
volume = 56,
number = 4,
pages = {697-716},
month = may,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-msttocs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-msttocs14.pdf},
doi = {10.1007/s00224-014-9561-9},
abstract = {The Regular Post Embedding Problem extended with partial
(co)directness is shown decidable. This extends to universal and\slash or
counting versions. It is also shown that combining directness and
codirectness in Post Embedding problems leads to undecidability.}
}
@inproceedings{KH-acsd14,
address = {Tunis, Tunisia},
month = jun,
year = 2014,
publisher = {{IEEE} Computer Society Press},
acronym = {{ACSD}'14},
booktitle = {{P}roceedings of the 14th {I}nternational
{C}onference on {A}pplication of {C}oncurrency
to {S}ystem {D}esign
({ACSD}'14)},
author = {Kordon, Fabrice and Hulin{-}Hubard, Francis},
title = {BenchKit, a Tool for Massive Concurrent Benchmarking},
pages = {159-165},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KH-acsd14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KH-acsd14.pdf},
doi = {10.1109/ACSD.2014.12},
abstract = {Benchmarking numerous programs in a reasonable time requires the
use of several (potentially multicore) computers. We experimented such a
situation in the context of the MCC (Model Checking Contest @ Petri net)
where we had to operate more than 52000 runs for the 2013 edition. This
paper presents BenchKit, a tool to operate programs on sets of potentially
parallel machines and to gather monitoring information like CPU or memory
usage. It also samples such data over the execution time. BenchKit has
been elaborated in the context of the MCC and will be used for the 2014
edition.}
}
@inproceedings{GHKS-acsd14,
address = {Tunis, Tunisia},
month = jun,
year = 2014,
publisher = {{IEEE} Computer Society Press},
acronym = {{ACSD}'14},
booktitle = {{P}roceedings of the 14th {I}nternational
{C}onference on {A}pplication of {C}oncurrency
to {S}ystem {D}esign
({ACSD}'14)},
author = {Germanos, Vasileios and Haar, Stefan
and Khomenko, Victor and Schwoon, Stefan},
title = {Diagnosability under Weak Fairness},
pages = {132-141},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GHKS-acsd14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GHKS-acsd14.pdf},
doi = {10.1109/ACSD.2014.9},
abstract = {In partially observed Petri nets, diagnosis is the
task of detecting whether or not the given sequence of
observed labels indicates that some unobservable fault
has occurred. Diagnosability is an associated property of
the Petri net, stating that in any possible execution an
occurrence of a fault can eventually be diagnosed.\par In this
paper we consider diagnosability under the weak fairness (WF)
assumption, which intuitively states that no transition from
a given set can stay enabled forever---it~must eventually
either fire or be disabled. We show that a previous approach
to WF-diagnosability in the literature has a major flaw, and
present a corrected notion. Moreover, we present an efficient
method for verifying WF-diagnosability based on a reduction
to LTL-X model checking. An important advantage of this
method is that the LTL-X formula is fixed---in~particular,
the WF assumption does not have to be expressed as a part of
it (which would make the formula length proportional to the
size of the specification), but rather the ability of existing
model checkers to handle weak fairness directly is exploited.}
}
@inproceedings{SLSFM-rtcsa14,
address = {Chongqing, China},
month = aug,
year = 2014,
publisher = {{IEEE} Computer Society Press},
acronym = {{RTCSA}'14},
booktitle = {{P}roceedings of the 20th {IEEE} {I}nternational {C}onference on {E}mbedded
and {R}eal-{T}ime {C}omputing {S}ystems and {A}pplications
({RTCSA}'14)},
author = {Sun, Youcheng and Lipari, Giuseppe and
Soulat, Romain and Fribourg, Laurent and
Markey, Nicolas},
title = {Component-Based Analysis of Hierarchical Scheduling using Linear Hybrid Automata},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SLSFM-rtcsa14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SLSFM-rtcsa14.pdf},
doi = {10.1109/RTCSA.2014.6910502},
abstract = {Formal methods (e.g. Timed Automata or Linear Hybrid Automata)
can be used to analyse a real-time system by performing a reachability
analysis on the model. The advantage of using formal methods is that they
are more expressive than classical analytic models used in schedulability
analysis. For example, it is possible to express state-dependent
behaviour, arbitrary activation patterns,~etc.\par
In this paper we use the formalism of Linear Hybrid Automata to encode a
hierarchical scheduling system. In particular, we model a dynamic server
algorithm and the tasks contained within, abstracting away the rest of the
system, thus enabling component-based scheduling analysis. We prove the
correctness of the model and the decidability of the reachability analysis
for the case of periodic tasks. Then, we compare the results of our model
against classical schedulability analysis techniques, showing that our
analysis performs better than analytic methods in terms of resource
utilisation. We further present two case studies: a~component with
state-dependent tasks, and a simplified model of a real avionics system.
Finally, through extensive tests with various configurations, we
demonstrate that this approach is usable for medium size components.}
}
@article{BFSP-tcs14,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Bouchy, Florent and Finkel, Alain and San{ }Pietro, Pierluigi},
title = {Dense-choice Counter Machines Revisited},
volume = {542},
month = jul,
year = 2014,
pages = {17-31},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFSP-tcs14.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFSP-tcs14.pdf},
doi = {10.1016/j.tcs.2014.04.029},
abstract = {This paper clarifies the picture about Dense-choice
Counter Machines (DCM), a less studied version of
Counter Machines where counters range on a dense,
rather than discrete, domain. The definition of DCM
is revisited to make it extend (discrete) Counter
Machines, and new undecidability and decidability
results are proved. Using the first-order additive
mixed theory of reals and integers, the paper
presents a logical characterization of the sets of
configurations reachable by reversal-bounded DCM. We
also relate the DCM model to more common models of
systems.}
}
@techreport{rr-lsv-14-06,
author = {Sun, Youcheng and Lipari, Giuseppe},
title = {A Weak Simulation Relation for Real-Time
Schedulability Analysis of Global Fixed
Priority Scheduling Using Linear Hybrid
Automata},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2014},
month = apr,
type = {Research Report},
number = {LSV-14-06},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2014-06.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2014-06.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2014-06-v1.pdf, 20140428},
note = {17~pages},
abstract = {In this paper we present an exact schedulability test for
sporadic real-time tasks scheduled by the Global Fixed Priority Fully
Preemptive Scheduler on a multiprocessor system. The analysis consists in
modelling the system as a Linear Hybrid Automaton, and in performing a
reachability analysis for states representing deadline miss conditions. To
mitigate the problem of state space explosion, we propose a partial order
relationship over the symbolic states of the model and we prove that this
is a weak simulation relation. We then present an implementation of the
analysis in a software tool, and we show that the use of the proposed
model permits to analyse larger systems than other exact algorithms in the
literature.}
}
@inproceedings{CD-icalp14,
address = {Copenhagen, Denmark},
month = jul,
year = 2014,
volume = 8573,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Esparza, Javier and Fraigniaud, Pierre and Koutsoupias, Elias},
acronym = {{ICALP}'14},
booktitle = {{P}roceedings of the 41st {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'14)~-- {P}art~{II}},
author = {Chatterjee, Krishnendu and Doyen, Laurent},
title = {Games with a Weak Adversary},
pages = {110-121},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-icalp14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-icalp14.pdf},
doi = {10.1007/978-3-662-43951-7_10},
abstract = {We consider multi-player graph games with partial-observation
and parity objective. While the decision problem for three-player games
with a coalition of the first and second players against the third player
is undecidable in general, we present a decidability result for
partial-observation games where the first and third player are in a
coalition against the second player, thus where the second player is
adversarial but weaker due to partial-observation. We establish tight
complexity bounds in the case where player~1 is less informed than
player~2, namely 2-EXPTIME-completeness for parity objectives. The
symmetric case of player~1 more informed than player~2 is much more
complicated, and we show that already in the case where player~1 has
perfect observation, memory of size non-elementary is necessary in general
for reachability objectives, and the problem is decidable for safety and
reachability objectives. Our results have tight connections with
partial-observation stochastic games for which we derive new complexity
results.}
}
@inproceedings{BFM-icalp14,
address = {Copenhagen, Denmark},
month = jul,
year = 2014,
volume = 8573,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Esparza, Javier and Fraigniaud, Pierre and Koutsoupias, Elias},
acronym = {{ICALP}'14},
booktitle = {{P}roceedings of the 41st {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'14)~-- {P}art~{II}},
author = {Blondin, Michael and Finkel, Alain and McKenzie, Pierre},
title = {Handling Infinitely Branching {WSTS}},
pages = {13-25},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFM-icalp14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFM-icalp14.pdf},
doi = {10.1007/978-3-662-43951-7_2},
abstract = {Most decidability results concerning well-structured
transition systems apply to the \emph{finitely branching}
variant. Yet some models (inserting automata, \(\omega\)-Petri
nets,~...) are naturally infinitely branching. Here
we develop tools to handle infinitely branching WSTS
by exploiting the crucial property that in the
(ideal) completion of a well-quasi-ordered set,
downward-closed sets are finite unions of
ideals. Then, using these tools, we derive
decidability results and we delineate the
undecidability frontier in the case of the
termination, the control-state maintainability and
the coverability problems. Coverability and
boundedness under new effectivity conditions are
shown decidable.}
}
@inproceedings{DD-aiml14,
address = {Groningen, The Netherlands},
month = aug,
year = 2014,
publisher = {College Publications},
editor = {Gor{\'e}, Rajeev and Kooi, Barteld P. and Kurucz, Agi},
acronym = {{AiML}'14},
booktitle = {{P}roceedings of the 10th
{C}onference on {A}dvances in {M}odal {L}ogics
({AiML}'14)},
author = {Demri, St{\'e}phane and Deters, Morgan},
title = {The effects of modalities in separation logics (extended abstract)},
pages = {134-138},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-aiml14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-aiml14.pdf},
abstract = {Like modal logic, temporal logic, or description logic,
separation logic has become a popular class of logical formalisms in
computer science, conceived as assertion languages for Hoare-style proof
systems with the goal to perform automatic program analysis. We present
similarities with modal and temporal logics, and we present landmark
results about decidability, complexity and expressive power.}
}
@inproceedings{DD-csllics14,
address = {Vienna, Austria},
month = jul,
year = 2014,
publisher = {ACM Press},
acronym = {{CSL\slash LICS}'14},
booktitle = {{P}roceedings of the Joint Meeting of the 23rd {EACSL} {A}nnual {C}onference on
{C}omputer {S}cience {L}ogic and the 29th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({CSL\slash LICS}'14)},
author = {Demri, St{\'e}phane and Deters, Morgan},
title = {Expressive Completeness of Separation Logic With Two
Variables and No Separating Conjunction},
nopages = {},
chapter = {37},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-csllics14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-csllics14.pdf},
doi = {10.1145/2603088.2603142},
abstract = {We show that first-order separation logic with one record field
restricted to two variables and the separating implication (no separating
conjunction) is as expressive as weak second-order logic, substantially
sharpening a previous result. Capturing weak second-order logic with such
a restricted form of separation logic requires substantial updates to
known proof techniques. We develop these, and as a by-product identify the
smallest fragment of separation logic known to be undecidable: first-order
separation logic with one record field, two variables, and no separating
conjunction.}
}
@inproceedings{BGMZ-csllics14,
address = {Vienna, Austria},
month = jul,
year = 2014,
publisher = {ACM Press},
acronym = {{CSL\slash LICS}'14},
booktitle = {{P}roceedings of the Joint Meeting of the 23rd {EACSL} {A}nnual {C}onference on
{C}omputer {S}cience {L}ogic and the 29th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({CSL\slash LICS}'14)},
author = {Bollig, Benedikt and Gastin, Paul and Monmege, Benjamin and
Zeitoun, Marc},
title = {Logical Characterization of Weighted Pebble Walking Automata},
nopages = {},
chapter = 19,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGMZ-csllics14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGMZ-csllics14.pdf},
doi = {10.1145/2603088.2603118},
abstract = {Weighted automata are a conservative quantitative extension of
finite automata that enjoys applications, e.g., in language processing and
speech recognition. Their expressive power, however, appears to be
limited, especially when they are applied to more general structures than
words, such as graphs. To address this drawback, weighted automata have
recently been generalized to weighted pebble walking automata, which
proved useful as a tool for the specification and evaluation of
quantitative properties over words and nested words. In this paper, we
establish the expressive power of weighted pebble walking automata in
terms of transitive closure logic, lifting a similar result by Engelfriet
and Hoogeboom from the Boolean case to a quantitative setting. This result
applies to general classes of graphs, including all the aforementioned
classes.}
}
@inproceedings{Haase-csllics14,
address = {Vienna, Austria},
month = jul,
year = 2014,
publisher = {ACM Press},
acronym = {{CSL\slash LICS}'14},
booktitle = {{P}roceedings of the Joint Meeting of the 23rd {EACSL} {A}nnual {C}onference on
{C}omputer {S}cience {L}ogic and the 29th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({CSL\slash LICS}'14)},
author = {Haase, Christoph},
title = {Subclasses of {P}resburger Arithmetic and the Weak {EXP} Hierarchy},
nopages = {},
chapter = 47,
url = {http://arxiv.org/abs/1401.5266},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Haase-csllics14.pdf},
doi = {10.1145/2603088.2603092},
abstract = {It is shown that for any fixed \(i>0\), the
\(\Sigma_{i+1}\)-fragment of Presburger arithmetic, i.e., its restriction
to \(i+1\) quantifier alternations beginning with an existential
quantifier, is complete for \(\Sigma^{\textsc{EXP}}_{i}\), the \(i\)-th
level of the weak EXP hierarchy, an~analogue to the polynomial-time
hierarchy residing between \textsc{NEXP} and \textsc{EXPSPACE}. This
result completes the computational complexity landscape for Presburger
arithmetic, a~line of research which dates back to the seminal work by
Fischer~\& Rabin in~1974. Moreover, we~apply some of the techniques
developed in the proof of the lower bound in order to establish bounds on
sets of naturals definable in the \(\Sigma_1\)-fragment of Presburger
arithmetic: given a \(\Sigma_1\)-formula \(\Phi(x)\), it~is shown that the
set of non-negative solutions is an ultimately periodic set whose period
is at most doubly-exponentially and that this bound is tight.}
}
@inproceedings{BB-csllics14,
address = {Vienna, Austria},
month = jul,
year = 2014,
publisher = {ACM Press},
acronym = {{CSL\slash LICS}'14},
booktitle = {{P}roceedings of the Joint Meeting of the 23rd {EACSL} {A}nnual {C}onference on
{C}omputer {S}cience {L}ogic and the 29th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({CSL\slash LICS}'14)},
author = {Bollig, Benedikt},
title = {Logic for Communicating Automata with Parameterized Topology},
nopages = {},
chapter = 18,
exturl = {http://hal.inria.fr/hal-00872807/},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BB-csllics14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BB-csllics14.pdf},
doi = {10.1145/2603088.2603093},
abstract = {We introduce parameterized communicating automata~(PCA) as a
model of systems where finite-state processes communicate through FIFO
channels. Unlike classical communicating automata, a given PCA can be run
on any network topology of bounded degree. The topology is thus a
parameter of the system. We provide various B{\"u}chi-Elgot-Trakhtenbrot
theorems for~PCA, which roughly read as follows: Given a logical
specification~\(\phi\) and a class of topologies~\(T\), there is a~PCA that is
equivalent to~\(\phi\) on all topologies from~\(T\). We~give uniform constructions
which allow us to instantiate~\(T\) with concrete classes such as pipelines,
ranked trees, grids, rings,~etc. The proofs build on a locality theorem
for first-order logic due to Schwentick and Barthelmann, and they exploit
concepts from the non-parameterized case, notably a result by Genest,
Kuske, and Muscholl.}
}
@inproceedings{CDNV-fossacs14,
address = {Grenoble, France},
month = apr,
year = 2014,
volume = {8412},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Muscholl, Anca},
acronym = {{FoSSaCS}'14},
booktitle = {{P}roceedings of the 17th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'14)},
author = {Chatterjee, Krishnendu and Doyen, Laurent and
Nain, Sumit and Vardi, Moshe Y.},
title = {The Complexity of Partial-Observation Stochastic Parity Games
with Finite-Memory Strategies},
pages = {242-257},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDNV-fossacs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDNV-fossacs14.pdf},
doi = {10.1007/978-3-642-54830-7_16},
abstract = { We consider two-player partial-observation stochastic games on
finite-state graphs where player~1 has partial observation and player~2
has perfect observation. The winning condition we study are \(\omega\)-regular
conditions specified as parity objectives. The qualitative-analysis
problem given a partial-observation stochastic game and a parity objective
asks whether there is a strategy to ensure that the objective is satisfied
with probability~1 (resp.~positive probability). These
qualitative-analysis problems are known to be undecidable. However in many
applications the relevant question is the existence of finite-memory
strategies, and the qualitative-analysis problems under finite-memory
strategies was recently shown to be decidable in 2EXPTIME. We improve the
complexity and show that the qualitative-analysis problems for
partial-observation stochastic parity games under finite-memory strategies
are EXPTIME-complete; and also establish optimal (exponential) memory
bounds for finite-memory strategies required for qualitative analysis. }
}
@inproceedings{CDGO-fossacs14,
address = {Grenoble, France},
month = apr,
year = 2014,
volume = {8412},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Muscholl, Anca},
acronym = {{FoSSaCS}'14},
booktitle = {{P}roceedings of the 17th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'14)},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Gimbert, Hugo
and Oualhadj, Youssouf},
title = {Perfect-Information Stochastic Mean-Payoff Parity Games},
pages = {210-225},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDGO-fossacs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDGO-fossacs14.pdf},
doi = {10.1007/978-3-642-54830-7_4},
abstract = {The theory of graph games is the foundation for modeling and
synthesizing reactive processes. In the synthesis of stochastic processes,
we use \(2\frac{1}{2}\)-player games where some transitions of the game
graph are controlled by two adversarial players, the System and the
Environment, and the other transitions are determined probabilistically.
We consider \(2\frac{1}{2}\)-player games where the objective of the
System is the conjunction of a qualitative objective (specified as a
parity condition) and a quantitative objective (specified as a mean-payoff
condition). We establish that the problem of deciding whether the System
can ensure that the probability to satisfy the mean-payoff parity
objective is at least a given threshold is in
\(\textsf{NP}\cap\textsf{coNP}\), matching the best known bound in the
special case of 2-player games (where all transitions are deterministic)
with only parity objectives, or with only mean-payoff objectives. We
present an algorithm running in time~\(O(d \cdot n^{2d} \cdot
\textsf{MeanGame}) to compute the set of almost-sure winning states from
which the objective can be ensured with probability~1, where n is the
number of states of the game, d the number of priorities of the parity
objective, and MeanGame is the complexity to compute the set of
almost-sure winning states in \(2\frac{1}{2}\)-player mean-payoff games.
Our results are useful in the synthesis of stochastic reactive systems
with both functional requirement (given as a qualitative objective) and
performance requirement (given as a quantitative objective).}
}
@inproceedings{DMS-fossacs14,
address = {Grenoble, France},
month = apr,
year = 2014,
volume = {8412},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Muscholl, Anca},
acronym = {{FoSSaCS}'14},
booktitle = {{P}roceedings of the 17th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'14)},
author = {Doyen, Laurent and Massart, {\relax Th}ierry and Shirmohammadi, Mahsa},
title = {Limit Synchronization in Markov Decision Processes},
pages = {58-72},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DMS-fossacs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DMS-fossacs14.pdf},
doi = {10.1007/978-3-642-54830-7_4},
abstract = {Markov decision processes (MDP) are finite-state systems with
both strategic and probabilistic choices. After fixing a strategy, an MDP
produces a sequence of probability distributions over states. The sequence
is eventually synchronizing if the probability mass accumulates in a
single state, possibly in the limit. Precisely, for \(0 \leq p \leq 1\)
the sequence is \(p\)-synchronizing if a probability distribution in the
sequence assigns probability at least~\(p\) to some state, and we
distinguish three synchronization modes: \textit{(i)}~sure winning if
there exists a strategy that produces a 1-synchronizing sequence;
\textit{(ii)}~almost-sure winning if there exists a strategy that produces
a sequence that is, for all \(\varepsilon>0\), a
\((1-\varepsilon)\)-synchronizing sequence; \textit{(iii)}~limit-sure
winning if for all \(\varepsilon>0\), there exists a strategy that
produces a \((1-\varepsilon)\)-synchronizing sequence. We~consider the
problem of deciding whether an MDP is sure, almost-sure, or limit-sure
winning, and we establish the decidability and optimal complexity for all
modes, as well as the memory requirements for winning strategies. Our main
contributions are as follows: \textit{(a)}~for~each winning modes
we~present characterizations that give a PSPACE complexity for the
decision problems, and we establish matching PSPACE lower bounds;
\textit{(b)}~we~show that for sure winning strategies, exponential memory
is sufficient and may be necessary, and that in general infinite memory is
necessary for almost-sure winning, and unbounded memory is necessary for
limit-sure winning; \textit{(c)}~along with our results, we establish new
complexity results for alternating finite automata over a one-letter
alphabet.}
}
@inproceedings{FSS-icdt14,
address = {Athens, Greece},
month = mar,
year = 2014,
editor = {Schweikardt, Nicole and Christophides, Vassilis and Leroy, Vincent},
acronym = {{ICDT}'14},
booktitle = {{P}roceedings of the 17th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'14)},
author = {Francis, Nadime and Segoufin, Luc and Sirangelo, Cristina},
title = {Datalog Rewritings of Regular Path Queries using Views},
pages = {107-118},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FSS-icdt14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FSS-icdt14.pdf},
doi = {10.5441/002/icdt.2014.14},
abstract = {We consider query answering using views on graph databases, i.e.
databases structured as edge-labeled graphs. We consider views and queries
specified by Regular Path Queries. These are queries selecting pairs of
nodes in a graph database that are connected via a path whose sequence of
edge labels belongs to some regular language.\par
A~view~\(\mathbf{V}\) determines a query~\(Q\) if for all graph
databases~\(D\), the view image~\(\mathbf{V}(D)\) always contains enough
information to answer~\(Q\) on~\(D\). In other words, there is a well defined
function from~\(\mathbf{V}(D)\) to~\(Q(D)\).\par
Our main result shows that when this function is monotone, there exists a
rewriting of~\(Q\) as a Datalog query over the view
instance~\(\mathbf{V}(D)\). In~particular the query can be evaluated in
time polynomial in the size of~\(\mathbf{V}(D)\).\par
As a side result we also prove that it is decidable whether an RPQ query
can be rewritten in Datalog using RPQ views.}
}
@techreport{BB-arxiv14,
author = {Brault{-}Baron, Johann},
title = {Hypergraph Acyclicity Revisited},
institution = {Computing Research Repository},
number = {1403.7076},
year = {2014},
month = feb,
type = {Research Report},
url = {http://arxiv.org/abs/1403.7076},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BB-arxiv14.pdf},
note = {32~pages},
abstract = {The notion of graph acyclicity has been extended to several
different notions of hypergraph acyclicity, in increasing order of generality:
\emph{gamma} acyclicity, \emph{beta} acyclicity, and \emph{alpha} acyclicity, that
have met a great
interest in many fields. \parWe prove the equivalence between the numerous
characterizations of each notion with a new, simpler proof, in a self-contained
manner. For that purpose, we introduce new notions of alpha, beta and gamma leaf
that allow to define new {"}rule-based{"} characterizations of each notion.\par
The~combined presentation of the notions is completed with a study of their
respective closure properties. New closure results are established, and alpha,
beta and gamma acyclicity are proved optimal w.r.t. their closure properties.}
}
@article{BBMU-lmcs14,
journal = {Logical Methods in Computer Science},
author = {Bouyer, Patricia and Brenguier, Romain and Markey, Nicolas
and Ummels, Michael},
title = {Pure {N}ash Equilibria in Concurrent Games},
volume = {11},
number = {2:9},
nopages = {},
month = jun,
year = 2015,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBMU-lmcs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBMU-lmcs15.pdf},
doi = {10.2168/LMCS-11(2:9)2015},
abstract = {We study pure-strategy Nash equilibria in multiplayer concurrent
games, for a variety of omega-regular objectives. For simple objectives
(e.g. reachability, B{\"u}chi objectives), we transform the problem of
deciding the existence of a Nash equilibrium in a given concurrent game
into that of deciding the existence of a winning strategy in a turn-based
two-player game (with a refined objective). We use that transformation to
design algorithms for computing Nash equilibria, which in most cases have
optimal worst-case complexity. For automata-defined objectives, we extend
the above algorithms using a simulation relation which allows us to
consider the product of the game with the automata defining the
objectives. Building on previous algorithms for simple qualitative
objectives, we define and study a semi-quantitative framework, where all
players have several boolean objectives equipped with a preorder; a player
may for instance want to satisfy all her objectives, or to maximise the
number of objectives that she achieves. In most cases, we prove that the
algorithms we obtain match the complexity of the problem they address.}
}
@article{LM-lmcs14,
journal = {Logical Methods in Computer Science},
author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas},
title = {Quantified {CTL}: Expressiveness and Complexity},
volume = 10,
number = {4:17},
nopages = {},
month = dec,
year = 2014,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LM-lmcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LM-lmcs14.pdf},
doi = {10.2168/LMCS-10(4:17)2014},
abstract = {While it was defined long ago, the extension of CTL with
quantification over atomic propositions has never been studied
extensively. Considering two different semantics (depending whether
propositional quantification refers to the Kripke structure or to its
unwinding tree), we~study its expressiveness (showing in particular that
QCTL coincides with Monadic Second-Order Logic for both semantics) and
characterise the complexity of its model-checking and satisfiability
problems, depending on the number of nested propositional quantifiers
(showing that the structure semantics populates the polynomial hierarchy
while the tree semantics populates the exponential hierarchy).}
}
@article{NM-ercim14,
publisher = {European Research Consortium for Informatics and Mathematics},
journal = {ERCIM News},
author = {Markey, Nicolas},
title = {Cassting: Synthesizing Complex Systems Using Non-Zero-Sum Games},
volume = 97,
pages = {25-26},
year = 2014,
month = apr,
url = {http://ercim-news.ercim.eu/en97/special/cassting-synthesizing-complex-systems-using-non-zero-sum-games},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/NM-ercim14.pdf}
}
@inproceedings{DGLM-csr14,
address = {Moscow, Russia},
month = jun,
year = 2014,
volume = {8476},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Pin, Jean-{\'E}ric},
acronym = {{CSR}'14},
booktitle = {{P}roceedings of the 9th {I}nternational {C}omputer {S}cience
{S}ymposium in {R}ussia ({CSR}'14)},
author = {Demri, St{\'e}phane and Galmiche, Didier and
Larchey-Wendling, Dominique and M{\'e}ry, Daniel},
title = {Separation Logic with One Quantified Variable},
pages = {125-138},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DGLM-csr14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DGLM-csr14.pdf},
doi = {10.1007/978-3-319-06686-8_10},
abstract = {We investigate first-order separation logic with one record
field restricted to a unique quantified variable (1SL1). Undecidability is
known when the number of quantified variables is unbounded and the
satisfiability problem is PSPACE-complete for the propositional fragment.
We show that the satisfiability problem for 1SL1 is PSPACE-complete and we
characterize its expressive power by showing that every formula is
equivalent to a Boolean combination of atomic properties. This contributes
to our understanding of fragments of first-order separation logic that can
specify properties about the memory heap of programs with singly-linked
lists. When the number of program variables is fixed, the complexity drops
to polynomial time. All the fragments we consider contain the magic wand
operator and first-order quantification over a single variable.}
}
@phdthesis{mahsa-phd2014,
author = {Shirmohammadi, Mahsa},
title = {Qualitative Analysis of Synchronizing Probabilistic Systems},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France and Universit\'e Libre de Bruxelles, Belgium},
type = {Th{\`e}se de doctorat},
year = 2014,
month = dec,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/mahsa-phd14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/mahsa-phd14.pdf}
}
@phdthesis{soulat-phd2014,
author = {Soulat, Romain},
title = {Synthesis of Correct-by-Design Schedulers for Hybrid Systems},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2014,
month = feb,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/soulat-phd14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/soulat-phd14.pdf}
}
@article{CFM-ijfcs13,
publisher = {World Scientific},
journal = {International Journal of Foundations of Computer Science},
author = {Cadilhac, Micha{\"e}l and Finkel, Alain and McKenzie, Pierre},
title = {Unambiguous Contrained Automata},
volume = 24,
number = 7,
month = nov,
year = 2013,
pages = {1099-1116},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-ijfcs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CFM-ijfcs13.pdf},
doi = {10.1142/S0129054113400339},
abstract = {The class of languages captured by Constrained Automata~(CA)
that are unambiguous is shown to possess more closure properties than the
provably weaker class captured by deterministic~CA. Problems decidable for
deterministic CA are nonetheless shown to remain decidable for
unambiguous~CA, and testing for regularity is added to this set of
decidable problems. Unambiguous CA~are then shown incomparable with
deterministic reversal-bounded machines in terms of expressivity, and a
deterministic model equivalent to unambiguous~CA is identified.}
}
@techreport{rr-lsv-14-03,
author = {Fribourg, Laurent and Goubault, {\'E}ric and Mohamed, Sameh
and Putot, Sylvie and Soulat, Romain},
title = {Synthesis of robust boundary control for systems
governed by semi-discrete differential equations},
institution = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
year = {2014},
month = feb,
type = {Research Report},
number = {LSV-14-03},
url = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2014-03.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2014-03.pdf},
versions = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2014-03-v1.pdf, 20140228},
note = {8~pages},
abstract = {The topic of boundary control of PDEs has been the subject of a
considerable literature since the seminal works of J.-L. Lions in the 90s.
In this paper, we consider the boundary control of systems represented by
spatial discretizations of~PDEs (i.e.,~semi-discrete equations). We~focus
on control laws which are sampled and piecewise constant: periodically, at
every sampling time, a fixed control amplitude is applied to the system
until the next sampling instant. We show that, under some conditions,
sampled piecewise-constant boundary control allows to achieve
{"}approximate controllability{"}: Given a time \(T>0\), the controlled system
evolves to a neighborhood of a given final state. The result is
illustrated on the boundary control of the semi-discrete version of the
heat equation.}
}
@inproceedings{BDD-frocos13,
address = {Nancy, France},
month = sep,
year = 2013,
volume = 8152,
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer},
editor = {Fontaine, Pascal and Ringeissen, Christophe and Schmidt, Renate A.},
acronym = {{FroCoS}'13},
booktitle = {{P}roceedings of the 9th {I}nternational {S}ymposium on {F}rontiers of
{C}ombining {S}ystems ({FroCoS}'13)},
author = {Barrett, Clark and Demri, St{\'e}phane and Deters, Morgan},
title = {Witness runs for counter machines},
pages = {120-150},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDD-frocos13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDD-frocos13.pdf},
doi = {10.1007/978-3-642-40885-4_9},
abstract = {In this paper, we present recent results about the verification
of counter machines by using decision procedures for Presburger
arithmetic. We recall several known classes of counter machines for which
the reachability sets are Presburger-definable as well as temporal logics
with arithmetical constraints. We discuss issues related to flat counter
machines, path schema enumeration, and the use of SMT solvers.}
}
@inproceedings{CDFR-vmcai14,
address = {San~Diego, California, USA},
month = jan,
year = 2014,
volume = 8318,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {McMillan, Kenneth and Rival, Xavier},
acronym = {{VMCAI}'14},
booktitle = {{P}roceedings of the 15th {I}nternational {C}onference on
{V}erification, {M}odel {C}hecking and {A}bstract {I}nterpretation
({VMCAI}'14)},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Filiot,
Emmanuel and Raskin, Jean-Fran{\c{c}}ois},
title = {Doomsday Equilibria for Omega-Regular Games},
pages = {78-97},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDFR-vmcai14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDFR-vmcai14.pdf},
doi = {10.1007/978-3-642-54013-4_5},
abstract = {Two-player games on graphs provide the theoretical framework for
many important problems such as reactive synthesis. While the traditional
study of two-player zero-sum games has been extended to multi-player games
with several notions of equilibria, they are decidable only for
perfect-information games, whereas several applications require
imperfect-information games.\par
In this paper we propose a new notion of equilibria, called doomsday
equilibria, which is a strategy profile such that all players satisfy
their own objective, and if any coalition of players deviates and violates
even one of the players objective, then the objective of every player is
violated.\par
We present algorithms and complexity results for deciding the existence of
doomsday equilibria for various classes of \(\omega\)-regular objectives,
both for imperfect-information games, and for perfect-information games.We
provide optimal complexity bounds for imperfect-information games, and in
most cases for perfect-information games.}
}
@inproceedings{Schmitz-rta14,
address = {Vienna, Austria},
month = jul,
year = 2014,
volume = {8560},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Dowek, Gilles},
acronym = {{RTA\slash TLCA}'14},
booktitle = {{P}roceedings of the {J}oint 25th {I}nternational {C}onference on
{R}ewriting {T}echniques and {A}pplications and 12th
{I}nternational {C}onference on {T}yped {L}ambda-{C}alculi
and {A}pplications ({RTA\slash TLCA}'14)},
author = {Schmitz, Sylvain},
title = {Implicational Relevance Logic is 2-{E}xp{T}ime-Complete},
pages = {395-409},
url = {http://arxiv.org/abs/1402.0705},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Schmitz-rta14.pdf},
doi = {10.1007/978-3-319-08918-8_27},
abstract = {We show that provability in the implicational fragment of
relevance logic is complete for doubly exponential time,
using reductions to and from coverability in branching
vector addition systems.}
}
@inproceedings{LS-csllics14,
address = {Vienna, Austria},
month = jul,
year = 2014,
publisher = {ACM Press},
acronym = {{CSL\slash LICS}'14},
booktitle = {{P}roceedings of the Joint Meeting of the 23rd {EACSL} {A}nnual {C}onference on
{C}omputer {S}cience {L}ogic and the 29th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({CSL\slash LICS}'14)},
author = {Lazi{\'c}, Ranko and Schmitz, Sylvain},
title = {Non-Elementary Complexities for Branching {VASS},
{MELL}, and Extensions},
nopages = {},
chapter = 61,
url = {http://arxiv.org/abs/1401.6785},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-csllics14.pdf},
doi = {10.1145/2603088.2603129},
abstract = {We study the complexity of reachability problems on branching
extensions of vector addition systems, which allows us to
derive new non-elementary complexity bounds for fragments
and variants of propositional linear logic. We show that
provability in the multiplicative exponential fragment is
Tower-hard already in the affine case---and hence
non-elementary. We match this lower bound for the full
propositional affine linear logic, proving its
Tower-completeness. We also show that provability in
propositional contractive linear logic is
Ackermann-complete.}
}
@inproceedings{BDH-post14,
address = {Grenoble, France},
month = apr,
year = 2014,
volume = {8414},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abadi, Mart{\'\i}n and Kremer, Steve},
acronym = {{POST}'14},
booktitle = {{P}roceedings of the 3rd {I}nternational {C}onference on
{P}rinciples of {S}ecurity and {T}rust
({POST}'14)},
author = {Baelde, David and Delaune, St{\'e}phanie and Hirschi, Lucca},
title = {A~reduced semantics for deciding trace equivalence using constraint systems},
pages = {1-21},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDH-post14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDH-post14.pdf},
doi = {10.1007/978-3-642-54792-8_1},
abstract = {Many privacy-type properties of security protocols can be
modelled using trace equivalence properties in suitable process algebras.
It has been shown that such properties can be decided for interesting
classes of finite processes (i.e.,~without replication) by means of symbolic
execution and constraint solving. However, this does not suffice to obtain
practical tools. Current prototypes suffer from a classical combinatorial
explosion problem caused by the exploration of many interleavings in the
behaviour of processes. Modersheim et~al. have tackled this problem for
reachability properties using partial order reduction techniques. We
revisit their work, generalize it and adapt it for equivalence checking.
We obtain an optimization in the form of a reduced symbolic semantics that
eliminates redundant interleavings on the fly.}
}
@inproceedings{BM-sr14,
address = {Grenoble, France},
month = apr,
year = 2014,
volume = 146,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Mogavero, Fabio and Murano, Aniello},
acronym = {{SR}'14},
booktitle = {{P}roceedings of the 2nd {I}nternational {W}orkshop on {S}trategic
{R}easoning ({SR}'14)},
author = {Berwanger, Dietmar and Mathew, Anup Basil},
title = {Games with Recurring Certainty},
pages = {91-96},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BM-sr14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BM-sr14.pdf},
doi = {10.4204/EPTCS.146.12},
abstract = {Infinite games where several players seek to coordinate under
imperfect information are known to be intractable, unless the information
flow is severely restricted. Examples of undecidable cases typically
feature a situation where players become uncertain about the current state
of the game, and this uncertainty lasts forever.\par
Here we consider games where the players attain certainty about the
current state over and over again along any play. For finite-state games,
we note that this kind of \emph{recurring} certainty implies a stronger condition
of \emph{periodic} certainty, that is, the events of state certainty ultimately
occur at uniform, regular intervals. We show that it is decidable whether
a given game presents recurring certainty, and that, if so, the problem of
synthesising coordination strategies under \(\omega\)-regular winning conditions is
solvable.}
}
@inproceedings{CDFR-sr14,
address = {Grenoble, France},
month = apr,
year = 2014,
volume = 146,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Mogavero, Fabio and Murano, Aniello},
acronym = {{SR}'14},
booktitle = {{P}roceedings of the 2nd {I}nternational {W}orkshop on {S}trategic
{R}easoning ({SR}'14)},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Filiot, Emmanuel and
Raskin, Jean-Fran{\c{c}}ois},
title = {Doomsday Equilibria for Omega-Regular Games},
pages = {43-48},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDFR-sr14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDFR-sr14.pdf},
doi = {10.4204/EPTCS.146.6},
abstract = {Two-player games on graphs provide the theoretical framework for
many important problems such as reactive synthesis. While the traditional
study of two-player zero-sum games has been extended to multi-player games
with several notions of equilibria, they are decidable only for
perfect-information games, whereas several applications require
imperfect-information games.\par
In this paper we propose a new notion of equilibria, called doomsday
equilibria, which is a strategy profile such that all players satisfy
their own objective, and if any coalition of players deviates and violates
even one of the players objective, then the objective of every player is
violated.\par
We present algorithms and complexity results for deciding the existence of
doomsday equilibria for various classes of \(\omega\)-regular objectives,
both for imperfect-information games, and for perfect-information games.
We provide optimal complexity bounds for imperfect-information games, and
in most cases for perfect-information games.}
}
@inproceedings{BMV-sr14,
address = {Grenoble, France},
month = apr,
year = 2014,
volume = 146,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Mogavero, Fabio and Murano, Aniello},
acronym = {{SR}'14},
booktitle = {{P}roceedings of the 2nd {I}nternational {W}orkshop on {S}trategic
{R}easoning ({SR}'14)},
author = {Bouyer, Patricia and Markey, Nicolas and Vester, Steen},
title = {Nash Equilibria in Symmetric Games with Partial Observation},
pages = {49-55},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMV-sr14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMV-sr14.pdf},
doi = {10.4204/EPTCS.146.7},
abstract = {We investigate a model for representing large multiplayer games,
which satisfy strong symmetry properties. This model is made of multiple
copies of an arena; each player plays in his own arena, and can partially
observe what the other players do. Therefore, this game has partial
information and symmetry constraints, which make the computation of Nash
equilibria difficult. We show several undecidability results, and for
bounded-memory strategies, we precisely characterize the complexity of
computing pure Nash equilibria (for qualitative objectives) in this game
model.}
}
@mastersthesis{m2-stan13,
author = {Stan, Daniel},
title = {{\'E}quilibres mixtes dans les jeux concurrents},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2013},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-stan13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-stan13.pdf},
note = {29~pages}
}
@phdthesis{cyriac-phd2014,
author = {Cyriac, Aiswarya},
title = {Verification of Communicating Recursive Programs via Split-width},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2014,
month = jan,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/cyriac-phd14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/cyriac-phd14.pdf}
}
@inproceedings{AGHKO-fossacs14,
address = {Grenoble, France},
month = apr,
year = 2014,
volume = {8412},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Muscholl, Anca},
acronym = {{FoSSaCS}'14},
booktitle = {{P}roceedings of the 17th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'14)},
author = {Antonopoulos, Timos and Gorogiannis, Nikos and Haase, Christoph
and Kanovich, Max and Ouaknine, Jo{\"e}l},
title = {Foundations for Decision Problems in Separation Logic with
General Inductive Predicates},
pages = {411-425},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AGHKO-fossacs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGHKO-fossacs14.pdf},
doi = {10.1007/978-3-642-54830-7_27},
abstract = {We establish foundational results on the computational
complexity of deciding entailment in Separation Logic with general
inductive predicates whose underlying base language allows for pure
formulas, pointers and existentially quantified variables. We show that
entailment is in general undecidable, and \textsc{ExpTime}-hard in a
fragment recently shown to be decidable by Iosif~\emph{et~al.} Moreover,
entailment in the base language is \(\Pi_2^{\text{P}}\)-complete, the
upper bound even holds in the presence of list predicates. We additionally
show that entailment in essentially any fragment of Separation Logic
allowing for general inductive predicates is intractable even when strong
syntactic restrictions are imposed.}
}
@article{BS13-TSI-games,
publisher = {Herm{\`e}s},
journal = {Technique et Science Informatiques},
author = {Berwanger, Dietmar and Serre, Olivier},
editor = {Berwanger, Dietmar and Serre, Olivier},
title = {Th{\'e}orie des jeux en informatique},
booktitle = {Th{\'e}orie des jeux en informatique},
volume = 32,
number = {9-10},
year = 2013,
month = dec,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BS13-TSI-games.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BS13-TSI-games.pdf}
}
@inproceedings{BFHHH-fossacs14,
address = {Grenoble, France},
month = apr,
year = 2014,
volume = {8412},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Muscholl, Anca},
acronym = {{FoSSaCS}'14},
booktitle = {{P}roceedings of the 17th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'14)},
author = {Bertrand, Nathalie and Fabre, {\'E}ric and Haar, Stefan and
Haddad, Serge and H{\'e}lou{\"e}t, Lo{\"\i}c},
title = {Active diagnosis for probabilistic systems},
pages = {29-42},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFHHH-fossacs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFHHH-fossacs14.pdf},
doi = {10.1007/978-3-642-54830-7_4},
abstract = {The diagnosis problem amounts to deciding whether some specific
{"}fault{"} event occurred or not in a system, given the observations
collected on a run of this system. This system is then diagnosable if the
fault can always be detected, and the active diagnosis problem consists in
controlling the system in order to ensure its diagnosability. We consider
here a stochastic framework for this problem: once a control is selected,
the system becomes a stochastic process. In this setting, the active
diagnosis problem consists in deciding whether there exists some
observation-based strategy that makes the system diagnosable with
probability one. We prove that this problem is EXPTIME-complete, and that
the active diagnosis strategies are belief-based. The safe active
diagnosis problem is similar, but aims at enforcing diagnosability while
preserving a positive probability to non faulty runs, i.e. without
enforcing the occurrence of a fault. We prove that this problem requires
non belief-based strategies, and that it is undecidable. However, it
belongs to NEXPTIME when restricted to belief-based strategies. Our work
also refines the decidability/undecidability frontier for verification
problems on partially observed Markov decision processes.}
}
@article{ABGMN-fi13,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {Akshay, S. and Bollig, Benedikt and Gastin, Paul and
Mukund, Madhavan and Narayan Kumar, K.},
title = {Distributed Timed Automata with Independently Evolving Clocks},
volume = {130},
number = {4},
month = apr,
year = 2014,
pages = {377-407},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABGMN-fi13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABGMN-fi13.pdf},
doi = {10.3233/FI-2014-996},
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. 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
or universality 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.}
}
@article{BGMZ-tocl13,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Bollig, Benedikt and Gastin, Paul and Monmege, Benjamin and Zeitoun, Marc},
title = {Pebble Weighted Automata and Weighted Logics},
volume = 15,
number = {2:15},
month = apr,
year = 2014,
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGMZ-tocl13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGMZ-tocl13.pdf},
doi = {10.1145/2579819},
abstract = {We introduce new classes of weighted automata on words. Equipped
with pebbles, they go beyond the class of recognizable formal power
series: they capture weighted first-order logic enriched with a
quantitative version of transitive closure. In contrast to previous work,
this calculus allows for unrestricted use of existential and universal
quantifications over positions of the input word. We actually consider
both two-way and one-way pebble weighted automata. The latter class
constrains the head of the automaton to walk left-to-right, resetting it
each time a pebble is dropped. Such automata have already been considered
in the Boolean setting, in the context of data words. Our main result
states that two-way pebble weighted automata, one-way pebble weighted
automata, and our weighted logic are expressively equivalent. We also give
new logical characterizations of standard recognizable series.}
}
@article{SBM-ic14,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Sankur, Ocan and Bouyer, Patricia and Markey, Nicolas},
title = {Shrinking Timed Automata},
volume = 234,
month = feb,
year = 2014,
pages = {107-132},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SBM-ic14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SBM-ic14.pdf},
doi = {10.1016/j.ic.2014.01.002},
abstract = {We define and study a new approach to the implementability of
timed automata, where the semantics is perturbed by imprecisions and
finite frequency of the hardware. In order to circumvent these effects, we
introduce \emph{parametric shrinking} of clock constraints, which
corresponds to tightening the guards. We propose symbolic procedures to
decide the existence of (and then compute) parameters under which the
shrunk version of a given timed automaton is non-blocking and can
time-abstract simulate the exact semantics. We then define an
implementation semantics for timed automata with a digital clock and
positive reaction times, and show that for shrinkable timed automata,
non-blockingness and time-abstract simulation are preserved in
implementation.}
}
@article{GM-tcs14,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Gastin, Paul and Monmege, Benjamin},
title = {Adding Pebbles to Weighted Automata~-- Easy Specification
{\&} Efficient Evaluation},
volume = {534},
month = may,
year = 2014,
pages = {24-44},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GM-tcs14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GM-tcs14.pdf},
doi = {10.1016/j.tcs.2014.02.034},
abstract = {We extend weighted automata and weighted rational expressions
with 2-way moves and reusable pebbles. We show with examples from natural
language modeling and quantitative model-checking that weighted
expressions and automata with pebbles are more expressive and allow much
more natural and intuitive specifications than classical ones. We extend
Kleene-Sch{\"u}tzenberger theorem showing that weighted expressions and
automata with pebbles have the same expressive power. We focus on an
efficient translation from expressions to automata. We also prove that the
evaluation problem for weighted automata can be done very efficiently if
the number of reusable pebbles is low.}
}
@article{BLM-peva13,
publisher = {Elsevier Science Publishers},
journal = {Performance Evaluation},
author = {Bouyer, Patricia and Larsen, Kim G. and Markey, Nicolas},
title = {Lower-Bound Constrained Runs in Weighted Timed Automata},
volume = 73,
month = mar,
year = 2014,
pages = {91-109},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BLM-peva13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BLM-peva13.pdf},
doi = { 10.1016/j.peva.2013.11.002},
abstract = {We investigate a number of problems related to infinite runs of
weighted timed automata (with a single weight variable), subject to
lower-bound constraints on the accumulated weight. Closing an open problem
from an earlier paper, we show that the existence of an infinite
lower-bound-constrained run is--for us somewhat unexpectedly--undecidable
for weighted timed automata with four or more clocks.\par
This undecidability result assumes a fixed and known initial credit. We
show that the related problem of existence of an initial credit for which
there exists a feasible run is decidable in PSPACE. We also investigate
the variant of these problems where only bounded-duration runs are
considered, showing that this restriction makes our original problem
decidable in NEXPTIME. We prove that the universal versions of all those
problems (i.e, checking that all the considered runs satisfy the
lower-bound constraint) are decidable in PSPACE.\par
Finally, we extend this study to multi-weighted timed automata: the
existence of a feasible run becomes undecidable even for bounded duration,
but the existence of initial credits remains decidable (in~PSPACE).}
}
@inproceedings{KL-pdp14,
address = {Turin, Italy},
month = feb,
year = 2014,
publisher = {{IEEE} Computer Society Press},
editor = {Aldinucci, Marco and D'Agostino, Daniele and Kilpatrick, Peter},
acronym = {{PDP}'14},
booktitle = {{P}roceedings of the 22nd {E}uromicro {I}nternational {C}onference
on {P}arallel, {D}istributed, and {N}etwork-{B}ased
{P}rocessing ({PDP}'14)},
author = {Kumar, Sunil and Lipari, Giuseppe},
title = {Latency Analysis of Network-On-Chip-based Many-Core Processors},
pages = {432-439},
doi = {10.1109/PDP.2014.107},
abstract = {The next generation of processor will contain an increasing
number of cores, connected to the main memory and to each other using fast
Network-on-Chip (NoC) organised in complex mesh structures. In order to
analyse real-time programs running on such architectures, it is necessary
to estimate the communication latency between processes running on
different cores. The goal of this paper is to propose an analytic model
for bounding the communication latency on NoC for many-core architectures.
In particular, we introduce a new approach to analyse the communication
latency on NoC with wormhole switching and credit-based virtual channel
flow control. The proposed model is evaluated by comparing the results
predicted by the model with real measurements obtained running a set of
experiments on an Intel SCC platform.}
}
@article{ACD-icomp13,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Arnaud, Mathilde and Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
title = {Modeling and Verifying Ad~Hoc Routing Protocols},
volume = 238,
pages = {30-67},
month = nov,
year = 2014,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ACD-icomp13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACD-icomp13.pdf},
doi = {10.1016/j.ic.2014.07.004},
abstract = {Mobile ad hoc networks consist of mobile wireless devices which
autonomously organize their infrastructure. In such networks, a central
issue, ensured by routing protocols, is to find a route from one device to
another. Those protocols use cryptographic mechanisms in order to prevent
malicious nodes from compromising the discovered route.\par
Our contribution is twofold. We first propose a calculus for modeling and
reasoning about security protocols, including in particular secured
routing protocols. Our calculus extends standard symbolic models to take
into account the characteristics of routing protocols and to model
wireless communication in a more accurate way. Our second main
contribution is a decision procedure for analyzing routing protocols for
any network topology. By using constraint solving techniques, we show that
it is possible to automatically discover (in~NPTIME) whether there exists
a network topology that would allow malicious nodes to mount an attack
against the protocol, for a bounded number of sessions. We also provide a
decision procedure for detecting attacks in case the network topology is
given a priori. We demonstrate the usage and usefulness of our approach by
analyzing protocols of the literature, such as SRP applied to DSR and
SDMSR.}
}
@inproceedings{HHM-tgc13,
address = {Buenos Aires, Argentina},
month = mar,
year = 2014,
volume = {8358},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abadi, Mart{\'\i}n and Lluch{ }Lafuente, Alberto},
acronym = {{TGC}'13},
booktitle = {{R}evised {S}elected {P}apers of the 8th {S}ymposium on {T}rustworthy {G}lobal
{C}omputing ({TGC}'13)},
author = {Haddad, Serge and Hennicker, Rolf and M{\o}ller, Mikael H.},
title = {Specification of Asynchronous Component Systems with
Modal {I}{{\slash}}{O}-{P}etri Nets},
pages = {219-234},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HHM-tgc13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HHM-tgc13.pdf},
doi = {10.1007/978-3-319-05119-2_13},
abstract = {We consider Petri nets with distinguished labels for
inputs, outputs, internal communications and silent actions and
with {"}must{"} and {"}may{"} modalities for transitions. The
input\slash output labels show the interaction capabilities of a
net to the outside used to build larger nets by asynchronous
composition via communication channels. The modalities express
constraints for Petri net refinement taking into account
observational abstraction from silent transitions. Modal
I\slash O-Petri nets are equipped with a modal transition system
semantics. We show that refinement is preserved by asynchronous
composition and by hiding of communication channels. We study
conformance properties which express communication requirements
for composed systems and we show that those properties are
preserved by refinement. On this basis we propose a methodology
for the specification of distributed systems in terms of modal
I\slash O-Petri nets which supports incremental design, encapsulation of
components and stepwise refinement. Finally we show that our
communication properties are decidable.}
}
@article{GL-acs13,
publisher = {Springer},
journal = {Applied Categorical Structures},
author = {Goubault{-}Larrecq, Jean},
title = {Exponentiable streams and prestreams},
volume = {22},
number = {3},
year = 2014,
month = jun,
pages = {515-549},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GL-acs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GL-acs13.pdf},
corrigendumpdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GL-acs13-erratum.pdf},
doi = { 10.1007/s10485-013-9315-x},
note = {Errata 1: \url{http://www.lsv.fr/Publis/PAPERS/PDF/GL-acs13-erratum.pdf};
Errata 2: \url{http://www.lsv.fr/Publis/PAPERS/PDF/GL-acs13-erratum2.pdf}},
abstract = {Inspired by a construction of Escard{\'o}, Lawson, and Simpson,
we give a general construction of \(\mathcal C\)-generated objects in a
topological construct. When \(\mathcal C\) consists of exponentiable
objects, the resulting category is Cartesian-closed. This generalizes the
familiar construction of compactly-generated spaces, and we apply this to
Krishnan's categories of streams and prestreams, as well as to Haucourt
streams. For that, we need to identify the exponentiable objects in these
categories: for prestreams, we show that these are the preordered
core-compact topological spaces, and for streams, these are the
core-compact streams.}
}
@article{GL-mscs13,
publisher = {Cambridge University Press},
journal = {Mathematical Structures in Computer Science},
author = {Goubault{-}Larrecq, Jean},
title = {A~short proof of the {S}chr{\"o}der-{S}impson theorem},
volume = 25,
number = 1,
year = 2015,
month = jan,
pages = {1-5},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GL-mscs13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GL-mscs13.pdf},
doi = {10.1017/S0960129513000467},
abstract = {We give a short and elementary proof of the
Schr{\"o}der-Simpson Theorem, which states that the space of all
continuous maps from a given space~\(X\) to the non-negative reals with their
Scott topology is the cone-theoretic dual of the probabilistic powerdomain
on~\(X\).}
}
@article{BCD-icomp13,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Bursuc, Sergiu and Comon{-}Lundh, Hubert and Delaune,
St{\'e}phanie},
title = {Deducibility constraints and blind signatures},
year = {2014},
month = nov,
volume = 238,
pages = {106-127},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCD-icomp13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCD-icomp13.pdf},
nonote = {32~pages},
doi = {10.1016/j.ic.2014.07.006},
abstract = {Deducibility constraints represent in a symbolic way the
infinite set of possible executions of a finite protocol. Solving a
deducibility constraint amounts to finding all possible ways of filling
the gaps in a proof. For finite local inference systems, there is an
algorithm that reduces any deducibility constraint to a finite set of
solved forms. This allows one to decide any trace security property of
cryptographic protocols.\par
We investigate here the case of infinite local inference systems, through
the case study of blind signatures. We show that, in this case again, any
deducibility constraint can be reduced to finitely many solved forms
(hence we can decide trace security properties). We sketch also another
example to which the same method can be applied.}
}
@inproceedings{Lozes-fics15,
address = {Berlin, Germany},
month = sep,
year = 2015,
volume = 191,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Matthes, Ralph and Mio, Matteo},
acronym = {{FICS}'15},
booktitle = {{P}roceedings of the 10th {W}orkshop on {F}ixed {P}oints in
{C}omputer {S}cience ({FICS}'15)},
author = {Lozes, {\'{E}}tienne},
title = {A Type-Directed Negation Elimination},
pages = {132-142},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/Lozes-fics15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Lozes-fics15.pdf},
doi = {10.4204/EPTCS.191.12},
abstract = {In the modal mu-calculus, a formula is well-formed if each recursive variable occurs
underneath an even number of negations. By means of De Morgan's laws, it is easy to transform any
well-formed formula into an equivalent formula without negations - its negation normal form. Moreover,
if the formula is of size n, its negation normal form of is of the same size O(n). The full modal
mu-calculus and the negation normal form fragment are thus equally expressive and concise. In this paper
we extend this result to the higher-order modal fixed point logic (HFL), an extension of the modal
mu-calculus with higher-order recursive predicate transformers. We present a procedure that converts a
formula into an equivalent formula without negations of quadratic size in the worst case and of linear
size when the number of variables of the formula is fixed.}
}
@article{LV-scp15,
publisher = {Elsevier Science Publishers},
journal = {Science of Computer Programming},
author = {Lozes, {\'{E}}tienne and
Villard, Jules},
title = {Shared contract-obedient channels},
year = 2015,
month = mar,
volume = {100},
pages = {28-60},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LV-scp15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LV-scp15.pdf},
doi = {10.1016/j.scico.2014.09.008},
abstract = {Recent advances in the formal verification of message-passing programs are based on proving
that programs correctly implement a given protocol. Many existing verification techniques for
message-passing programs assume that at most one thread may attempt to send or receive on a channel
endpoint at any given point in time, and expressly forbid endpoint sharing. Approaches that do allow such
sharing often do not prove that channels obey their protocols. In this paper, we identify two principles
that can guarantee obedience to a communication protocol even in the presence of endpoint sharing. Firstly,
threads may concurrently use an endpoint in any way that does not advance the state of the protocol.
Secondly, threads may compete for receiving on an endpoint provided that the successful reception
of the message grants them ownership of that endpoint retrospectively. We develop a program logic
based on separation logic that unifies these principles and allows fine-grained reasoning about
endpoint-sharing programs. We demonstrate its applicability on a number of examples.
The program logic is shown sound against an operational semantics of programs, and
proved programs are guaranteed to follow the given protocols and to be free of data races, memory leaks,
and communication errors.}
}
@inproceedings{LL-fct15,
address = {Gda{\'{n}}sk, Poland},
month = aug,
year = 2015,
volume = 9210,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Kosowski, Adrian and Walukiewicz, Igor},
acronym = {{FCT}'15},
booktitle = {{P}roceedings of the 20th {I}nternational {S}ymposium
on {F}undamentals of {C}omputation {T}heory
({FCT}'15)},
author = {Lange, Martin and
Lozes, {\'{E}}tienne},
title = {Conjunctive Visibly-Pushdown Path Queries},
pages = {327-338},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LL-fct15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LL-fct15.pdf},
doi = {10.1007/978-3-319-22177-9_25},
abstract = {Weinvestigateanextensionofconjunctiveregularpathqueries in which path properties and path
relations are defined by visibly push- down automata. We study the problem of query evaluation for
extended conjunctive visibly pushdown path queries and their subclasses, and give a complete picture
of their combined and data complexity. In particular, we introduce a weaker notion called extended
conjunctive reachability queries for which query evaluation has a polynomial data complexity.
We also show that query containment is decidable in 2-EXPTIME for (non-extended) conjunctive visibly
pushdown path queries.}
}
@mastersthesis{m2-dallon,
author = {Dallon, Antoine},
title = {Verification of Cryptographic Protocols : a bound on the number
of agents},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2015},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-dallon.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-dallon.pdf},
note = {38~pages}
}
@proceedings{KDH-topnoc2015,
editor = {Koutny, Maciej and Desel, J{\"o}rg and Haddad, Serge},
title = {Transactions on {P}etri Nets and Other Models of Concurrency~{X}},
booktitle = {Transactions on {P}etri Nets and Other Models of Concurrency~{X}},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = 9410,
year = {2015},
noaddress = {},
url = {http://www.springer.com/978-3-662-48649-8}
}
@article{KNS-tcs2015,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Karandikar, Prateek and Niewerth, Matthias and Schnoebelen,
{\relax Ph}ilippe},
title = {On the state complexity of closures and interiors of regular
languages with subwords and superwords},
volume = {610},
number = {A},
pages = { 91-107},
year = {2016},
month = jan,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KNS-tcs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KNS-tcs15.pdf},
doi = {10.1016/j.tcs.2015.09.028},
abstract = {The downward and upward closures of a regular language~\(L\) are
obtained by collecting all the subwords and superwords of its elements,
respectively. The downward and upward interiors of~\(L\) are obtained dually
by collecting words having all their subwords and superwords in~\(L\),
respectively.\par
We provide lower and upper bounds on the size of the smallest automata
recognizing these closures and interiors. We also consider the
computational complexity of decision problems for closures of regular
languages.}
}
@misc{cassting-D13,
author = {Markey, Nicolas and Doyen, Laurent and Berwanger, Dietmar},
title = {Models for large-scale systems},
howpublished = {Cassting deliverable~D1.3 (FP7-ICT-601148)},
month = sep,
year = {2015},
note = {17~pages},
type = {Contract Report},
url = {http://www.cassting-project.eu/wp-content/uploads/deliv-13.pdf},
pdf = {http://www.cassting-project.eu/wp-content/uploads/deliv-13.pdf}
}
@misc{cassting-D21,
author = {Geeraerts, Gilles and Dehouck, Samuel and Markey, Nicolas and Larsen, Kim G.},
title = {Efficient algorithms for multi-player games with quantitative aspects},
howpublished = {Cassting deliverable~D2.1 (FP7-ICT-601148)},
month = mar,
year = {2015},
note = {22~pages},
type = {Contract Report},
url = {http://www.cassting-project.eu/wp-content/uploads/deliv-21.pdf},
pdf = {http://www.cassting-project.eu/wp-content/uploads/deliv-21.pdf}
}
@misc{cassting-D63,
author = {Markey, Nicolas and Delaborde, Arthur},
title = {Annual report for Year~2},
howpublished = {Cassting deliverable~D6.3 (FP7-ICT-601148)},
month = may,
year = {2015},
note = {34~pages},
type = {Contract Report},
nourlnote = {confidentiel}
}
@article{BHJL-fi15,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {B{\'e}rard, B{\'e}atrice and Haddad, Serge and Jovanovi{\'c},
Aleksandra and Lime, Didier},
title = {Interrupt Timed Automata with Auxiliary Clocks and Parameters},
volume = {143},
number = {3-4},
pages = {235-259},
month = mar,
year = 2016,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHJL-fi15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHJL-fi15.pdf},
doi = {10.3233/FI-2016-1313},
abstract = {Interrupt Timed Automata (ITA) are an expressive timed model,
introduced to take into account interruptions according to levels. Due to
this feature, this formalism is incomparable with Timed Automata.\par
However several decidability results related to reachability and model
checking have been obtained. We add auxiliary clocks to ITA, thereby
extending its expressive power while preserving decidability of
reachability. Moreover, we define a parametrized version of ITA, with
polynomials of parameters appearing in guards and updates. While
parametric reasoning is particularly relevant for timed models, it very
often leads to undecidability results. We prove that various reachability
problems, including robust reachability, are decidable for this model, and
we give complexity upper bounds for a fixed or variable number of clocks,
levels and parameters.}
}
@article{GHKS-tecs15,
publisher = {ACM Press},
journal = {ACM Transactions in Embedded Computing Systems},
author = {Germanos, Vasileios and Haar, Stefan
and Khomenko, Victor and Schwoon, Stefan},
title = {Diagnosability under Weak Fairness},
volume = 14,
number = {4:69},
nopages = {},
month = dec,
year = 2015,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GHKS-tecs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GHKS-tecs15.pdf},
doi = {10.1145/2832910},
abstract = {In partially observed Petri nets, diagnosis is the task of
detecting whether or not the given sequence of observed labels indicates
that some unobservable fault has occurred. Diagnosability is an associated
property of the Petri net, stating that in any possible execution an
occurrence of a fault can eventually be diagnosed.\par
In this paper we consider diagnosability under the weak fairness (WF)
assumption, which intuitively states that no transition from a given set
can stay enabled forever---it~must eventually either fire or be disabled.
We show that a previous approach to WF-diagnosability in the literature
has a major flaw, and present a corrected notion. Moreover, we present an
efficient method for verifying WF-diagnosability based on a reduction to
LTL-X model checking. An~important advantage of this method is that the
LTL-X formula is fixed---in~particular, the WF assumption does not have to
be expressed as a part of it (which would make the formula length
proportional to the size of the specification), but rather the ability of
existing model checkers to handle weak fairness directly is exploited.}
}
@article{BGM-ipl15,
publisher = {Elsevier Science Publishers},
journal = {Information Processing Letters},
author = {Bouyer, Patricia and Gardy, Patrick and Markey, Nicolas},
title = {On~the semantics of Strategy Logic},
volume = {116},
number = {2},
pages = {75-79},
month = feb,
year = {2016},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGM-ipl15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGM-ipl15.pdf},
doi = {10.1016/j.ipl.2015.10.004},
abstract = {We define and study a slight variation on the semantics of
Strategy Logic: while in the classical semantics, all strategies are
shifted during the evaluation of temporal modalities, we propose to only
shift the strategies that have been assigned to a player, thus matching
the intuition that we can assign the very same strategy to the players at
different points in time. We prove that surprisingly, this renders the
model-checking problem undecidable.}
}
@article{HK-ipl15,
publisher = {Elsevier Science Publishers},
journal = {Information Processing Letters},
author = {Haase, Christoph and Kiefer, Stefan},
title = {The Complexity of the \(K\)th Largest Subset Problem and Related Problems},
volume = {116},
number = {2},
pages = {111-115},
month = feb,
year = {2016},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HK-ipl15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HK-ipl15.pdf},
doi = {10.1016/j.ipl.2015.09.015},
abstract = {We show that the \textsc{\(K\)th largest subset} problem and the
\textsc{\(K\)th largest \(m\)-tuple} problem are in PP and hard for PP
under polynomial-time Turing reductions. Several problems from the
literature were previously shown NP-hard via reductions from those two
problems, and by our main result they become PP-hard as well. We also
provide complementary PP-upper bounds for some of them.}
}
@inproceedings{BGHLM-fsttcs15,
address = {Bangalore, India},
month = dec,
year = 2015,
volume = {45},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Harsha, Prahladh and Ramalingam, G.},
acronym = {{FSTTCS}'15},
booktitle = {{P}roceedings of the 35th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'15)},
author = {Brihaye, {\relax Th}omas and Geeraerts, Gilles and Haddad,
Axel and Lefaucheux, Engel and Monmege, Benjamin},
title = {Simple Priced Timed Games Are Not That Simple},
pages = {278-292},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGHLM-fsttcs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGHLM-fsttcs15.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2015.278},
abstract = {Priced timed games are two-player zero-sum games played on
priced timed automata (whose locations and transitions are labeled by
weights modeling the costs of spending time in a state and executing an
action, respectively). The goals of the players are to minimise and
maximise the cost to reach a target location, respectively. We consider
priced timed games with one clock and arbitrary (positive and negative)
weights and show that, for an important subclass of theirs (the so-called
simple priced timed games), one can compute, in exponential time, the
optimal values that the players can achieve, with their associated optimal
strategies. As side results, we also show that one-clock priced timed
games are determined and that we can use our result on simple priced timed
games to solve the more general class of so-called reset-acyclic priced
timed games (with arbitrary weights and one-clock).}
}
@inproceedings{MLBHB-vecos15,
address = {Bucharest, Romania},
month = sep,
year = 2015,
volume = {1431},
series = {CEUR Workshop Proceedings},
publisher = {RWTH Aachen, Germany},
editor = {Ben{~}Hedia, Belgacem and Popentiu{ }Vladicescu, Florin},
acronym = {{VECoS}'15},
booktitle = {{P}roceedings of the 9th {W}orkshop on {V}erification and
{E}valuation of {C}omputer and {C}ommunication
{S}ystems({VECoS}'15)},
author = {Methni, Amira and Lemerre, Matthieu and Ben{~}Hedia,
Belgacem and Haddad, Serge and Barkaoui, Kamel},
title = {State Space Reduction Strategie for Model Checking
Concurrent {C}~Programs},
pages = {65-76},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/MLBHB-vecos15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/MLBHB-vecos15.pdf},
abstract = {Model checking is an effective technique for uncovering subtle
errors in concurrent systems. Unfortunately, the state space explosion is
the main bottleneck in model checking tools. Here we propose a state space
reduction technique for model checking concurrent programs written in~C.
The reduction technique consists in an analysis phase, which defines an
approximate agglomeration predicate. This latter states whether a
statement can be agglomerated or~not. We~implement this predicate using a
syntactic analysis, as well as a semantic analysis based on abstract
interpretation. We show the usefulness of using agglomeration technique to
reduce the state space, as well as to generate an abstract TLA+
specification from a~C~program.}
}
@inproceedings{BHHHS-cdc15,
address = {Osaka, Japan},
month = dec,
year = 2015,
publisher = {{IEEE} Control System Society},
noeditor = {},
acronym = {{CDC}'15},
booktitle = {{P}roceedings of the 54th {IEEE} {C}onference on
{D}ecision and {C}ontrol ({CDC}'15)},
author = {B{\"o}hm, Stanislav and Haar, Stefan and Haddad, Serge and
Hofman, Piotr and Schwoon, Stefan},
title = {Active Diagnosis with Observable Quiescence},
pages = {1663-1668},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHHHS-cdc15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHHHS-cdc15.pdf},
doi = {10.1109/CDC.2015.7402449},
abstract = {Active diagnosis of a discrete-event system consists in
controlling the system such that faults can be detected. Here we extend
the framework of active diagnosis by introducing modalities for actions
and states and a new capability for the controller, namely observing that
the system is quiescent. We design a game-based construction for both the
decision and the synthesis problems that is computationally optimal.
Furthermore we prove that the size and the delay provided by the active
diagnoser (when it exists) are almost optimal.}
}
@article{AGMN-tcs15,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Akshay, S. and Gastin, Paul and Mukund,
Madhavan and Kumar, K. Narayan},
title = {Checking conformance for time-constrained scenario-based specifications},
volume = {594},
pages = {24-43},
month = aug,
year = {2015},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AGMN-tcs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGMN-tcs15.pdf},
doi = {10.1016/j.tcs.2015.03.030},
abstract = {We consider the problem of model checking message-passing
systems with real-time requirements. As behavioral specifications, we use
message sequence charts (MSCs) annotated with timing constraints. Our
system model is a network of communicating finite state machines with
local clocks, whose global behavior can be regarded as a timed automaton.
Our goal is to verify that all timed behaviors exhibited by the system
conform to the timing constraints imposed by the specification. In
general, this corresponds to checking inclusion for timed languages, which
is an undecidable problem even for timed regular languages. However, we
show that we can translate regular collections of time-constrained MSCs
into a special class of event-clock automata that can be determinized and
complemented, thus permitting an algorithmic solution to the model
checking/conformance problem.}
}
@inproceedings{BV-fsttcs15,
address = {Bangalore, India},
month = dec,
year = 2015,
volume = {45},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Harsha, Prahladh and Ramalingam, G.},
acronym = {{FSTTCS}'15},
booktitle = {{P}roceedings of the 35th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'15)},
author = {Berwanger, Dietmar and Van{ }den{ }Bogaard, Marie},
title = {Games with Delays. A~{F}rankenstein Approach},
pages = {307-319},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BV-fsttcs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BV-fsttcs15.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2015.307},
abstract = {We investigate infinite games on finite graphs where the
information flow is perturbed by non-deterministic signalling delays. It
is known that such perturbations make synthesis problems virtually
unsolvable, in the general case. On the classical model where signals are
attached to states, tractable cases are rare and difficult to identify. In
this paper, we propose a model where signals are detached from control
states, and we identify a subclass on which equilibrium outcomes can be
preserved, even if signals are delivered with a delay that is finitely
bounded. To offset the perturbation, our solution procedure combines
responses from a collection of virtual plays following an equilibrium
strategy in the instant-signalling game to synthesise, in a
Dr.~Frankenstein manner, an equivalent equilibrium strategy for the
delayed-signalling game.}
}
@inproceedings{KS-fsttcs15,
address = {Bangalore, India},
month = dec,
year = 2015,
volume = {45},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Harsha, Prahladh and Ramalingam, G.},
acronym = {{FSTTCS}'15},
booktitle = {{P}roceedings of the 35th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'15)},
author = {Karandikar, Prateek and Schnoebelen, {\relax Ph}ilippe},
title = {Decidability in the logic of subsequences and supersequences},
pages = {84-97},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-fsttcs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-fsttcs15.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2015.84},
abstract = {We consider first-order logics of sequences ordered by the
subsequence ordering, aka sequence embedding. We show that the
\(\Sigma_{2}\)-theory is undecidable, answering a question left open by
Kuske. Regarding fragments with a bounded number of variables, we show
that the \(\textsf{FO}^{2}\)-theory is decidable while the
\(\textsf{FO}^{3}\)-theory is undecidable.}
}
@inproceedings{BGM-fsttcs15,
address = {Bangalore, India},
month = dec,
year = 2015,
volume = {45},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Harsha, Prahladh and Ramalingam, G.},
acronym = {{FSTTCS}'15},
booktitle = {{P}roceedings of the 35th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'15)},
author = {Bouyer, Patricia and Gardy, Patrick and Markey, Nicolas},
title = {Weighted strategy logic with boolean goals over one-counter games},
pages = {69-83},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BGM-fsttcs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGM-fsttcs15.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2015.69},
abstract = {Strategy Logic is a powerful specification language for
expressing non-zero-sum properties of multi-player games. SL conveniently
extends the logic ATL with explicit quantification and assignment of
strategies. In this paper, we consider games over one-counter automata,
and a quantitative extension 1cSL of SL with assertions over the value of
the counter. We prove two results: we first show that, if decidable, model
checking the so-called Boolean-goal fragment of 1cSL has non-elementary
complexity; we actually prove the result for the Boolean-goal fragment of
SL over finite-state games, which was an open question in (Mogavero
\emph{et~al.} Reasoning about strategies: On the model-checking problem.
2014). As a first step towards proving decidability, we then show that the
Boolean-goal fragment of 1cSL over one-counter games enjoys a nice
periodicity property.}
}
@inproceedings{adhs15-HT,
address = {Atlanta, Georgia, USA},
month = oct,
year = 2015,
number = 27,
volume = 48,
series = {IFAC-PapersOnLine},
publisher = {Elsevier Science Publishers},
editor = {Lennartson, Bengt and Tabuada, Paulo},
acronym = {{ADHS}'15},
booktitle = {{P}roceedings of the 5th {IFAC} {C}onference on {A}nalysis and
{D}esign of {H}ybrid {S}ystems ({ADHS}'15)},
author = {Haar, Stefan and Theissing, Simon},
title = {A~Hybrid-Dynamical Model for Passenger-flow in Transportation
Systems},
pages = {236-241},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/adhs15-HT.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/adhs15-HT.pdf},
doi = {10.1016/j.ifacol.2015.11.181},
abstract = {In a network with different transportation modes, or multimodal
public transportation system (MPTS), modes are linked among one another
not by resources or infrastructure elements---which are not shared, e.g.,
between different metro lines---but by the flow of passengers between
them. Now, the movements of passengers are steered by the destinations
that individual passengers have, and by which they can be grouped into
trip profiles. To use the strength of fluid dynamics, we therefore
introduce a multiphase hybrid Petri net model, in which the vehicle
dynamics is rendered by individual tokens moving in an infrastructure net,
while passenger quantities are given as vectors---whose components
correspond to trip profiles---and evolve at stations according to fluid
dynamics. This model is intended as a building block for obtaining
supervisory control, via transport operator actions, to mitigate
congestion.}
}
@inproceedings{ncma2015-bou,
address = {Porto, Portugal},
month = aug,
year = 2015,
volume = 318,
series = {books@ocg.at},
publisher = {Austrian Computer Society},
editor = {Freund, Rudolf and Holzer, Markus and Moreira, Nelma and Reis, Rog{\'e}rio},
acronym = {{NCMA}'15},
booktitle = {{P}roceedings of the 7th {W}orkshop on {N}on-{C}lassical {M}odels
of {A}utomata and {A}pplications ({NCMA}'15)},
author = {Bouyer, Patricia},
title = {On the optimal reachability problem in weighted timed automata and
games},
pages = {11-36},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ncma15-bou.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ncma15-bou.pdf},
abstract = {In these notes, we survey works made on the models of weighted
timed automata and games, and more specifically on the optimal
reachability problem.}
}
@inproceedings{MAS-sigspatial15,
address = {Seattle, Washington, USA},
month = nov,
year = 2015,
editor = {Ali, Mohamed and Huang Yan and Gertz, Michael and Renz,
Matthias and Sankaranarayanan, Jagan},
acronym = {{GIS}'15},
booktitle = {{P}roceedings of the 23rd {ACM} {SIGSPATIAL}
{I}nternational {C}onference on {A}dvances
in {G}eographic {I}nformation {S}ystems
({GIS}'15)},
author = {Montoya, David and Abiteboul, Serge and Senellart, Pierre},
title = {Hup-Me: Inferring and Reconciling a Timeline of User Activity
with Smartphone and Personal Data},
pages = {62:1-4},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/MAS-sigspatial15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/MAS-sigspatial15.pdf},
doi = {10.1145/2820783.2820852},
abstract = {We designed a system to infer multimodal itineraries traveled by
a user from a combination of smartphone sensor data (e.g., GPS, Wi-Fi,
accelerometer) and knowledge of the transport network infrastructure
(e.g., road and rail maps, public transportation timetables). The system
uses a Transportation network that captures the set of possible paths of
this network for the modes, e.g., foot, bicycle, road_vehicle, and rail.
This Transportation network is constructed from OpenStreetMap data and
public transportation routes published online by transportation agencies
in GTFS format. The system infers itineraries from a sequence of
smartphone observations in two phases. The first phase uses a dynamic
Bayesian network that models the probabilistic relationship between paths
in Transportation network and sensor data. The second phase attempts to
match portions recognized as road_vehicle or rail with possible public
transportation routes of type bus, train, metro, or tram extracted from
the GTFS source. We evaluated the performance of our system with data from
users traveling over the Paris area who were asked to record data for
different trips via an Android application. Itineraries were annotated
with modes and public transportation routes taken and we report on the
results of the recognition.}
}
@article{CCD-tocl15,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Chr{\'e}tien, R{\'e}my and Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
title = {From security protocols to pushdown automata},
volume = {17},
number = {1:3},
nopages = {},
year = 2015,
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-tocl15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-tocl15.pdf},
doi = {10.1145/2811262},
abstract = {Formal methods have been very successful in analyzing security
protocols for reachability properties such as secrecy or authentication.
In contrast, there are very few results for equivalence-based properties,
crucial for studying e.g. privacy-like properties such as anonymity or
vote secrecy.\par
We study the problem of checking equivalence of security protocols for an
unbounded number of sessions. Since replication leads very quickly to
undecidability (even in the simple case of secrecy), we focus on a limited
fragment of protocols (standard primitives but pairs, one variable per
protocol's rules) for which the secrecy preservation problem is known to
be decidable. Surprisingly, this fragment turns out to be undecidable for
equivalence. Then, restricting our attention to deterministic protocols,
we propose the first decidability result for checking equivalence of
protocols for an unbounded number of sessions. This result is obtained
through a characterization of equivalence of protocols in terms of
equality of languages of (generalized, real-time) deterministic pushdown
automata. We further show that checking for equivalence of protocols is
actually equivalent to checking for equivalence of generalized, real-time
deterministic pushdown automata.\par
Very recently, the algorithm for checking for equivalence of deterministic
pushdown automata has been implemented. We have implemented our
translation from protocols to pushdown automata, yielding the first tool
that decides equivalence of (some class of) protocols, for an unbounded
number of sessions. As an application, we have analyzed some protocols of
the literature including a simplified version of the basic access control
(BAC) protocol used in biometric passports.}
}
@inproceedings{CCD-esorics15,
address = {Vienna, Austria},
month = sep,
year = 2015,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ryan, Peter and Weippl, Edgar},
acronym = {{ESORICS}'15},
booktitle = {{P}roceedings of the 20th {E}uropean {S}ymposium on
{R}esearch in {C}omputer {S}ecurity ({ESORICS}'15)},
author = {Chr{\'e}tien, R{\'e}my and Cortier, V{\'e}ronique and Delaune, St{\'e}phanie},
title = {Checking trace equivalence: How to get rid of nonces?},
pages = {230-251},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-esorics15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-esorics15.pdf},
doi = {10.1007/978-3-319-24177-7_12},
abstract = {Security protocols can be successfully analysed using formal
methods. When proving security in symbolic settings for an unbounded
number of sessions, a typical technique consists in abstracting away fresh
nonces and keys by a bounded set of constants. While this abstraction is
clearly sound in the context of secrecy properties (for protocols without
else branches), this is no longer the case for equivalence properties.\par
In this paper, we study how to soundly get rid of nonces in the context of
equivalence properties. We show that nonces can be replaced by constants
provided that each nonce is associated to two constants (instead of
typically one constant for secrecy properties). Our result holds for
deterministic (simple) protocols and a large class of primitives that
includes e.g. standard primitives, blind signatures, and zero-knowledge
proofs.}
}
@phdthesis{karandikar-phd15,
author = {Karandikar, Prateek},
title = {Subwords: automata, embedding problems, and verification},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France and Chennai Mathematical Institute, India},
type = {Th{\`e}se de doctorat},
year = 2015,
month = feb,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/karandikar-phd15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/karandikar-phd15.pdf}
}
@phdthesis{francis-phd15,
author = {Francis, Nadime},
title = {View-based Query Determinacy and Rewritings over Graph Databases},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2015,
month = dec,
url = {https://tel.archives-ouvertes.fr/tel-01247115}
}
@phdthesis{reichert-phd15,
author = {Reichert, Julien},
title = {D{\'e}cidabilit{\'e} et complexit{\'e} de jeux
d'accessibilit{\'e} sur des syst{\`e}mes {\`a} compteurs},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2015,
month = jul,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/reichert-phd15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/reichert-phd15.pdf}
}
@inproceedings{FGMMP-rp15,
address = {Warsaw, Poland},
month = sep,
year = 2015,
volume = {9328},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Boja{\'n}czyk, Miko{\l}aj and Lasota, S{\l}awomir and Potapov, Igor},
acronym = {{RP}'15},
booktitle = {{P}roceedings of the 9th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'15)},
author = {Fribourg, Laurent and Goubault, {\'E}ric and Mohamed, Sameh
and Mrozek, Marian and Putot, Sylvie},
title = {A~Topological Method for Finding Invariants of
Continuous Systems},
pages = {63-75},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FGMMP-rp15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FGMMP-rp15.pdf},
doi = {10.1007/978-3-319-24537-9_7},
abstract = {A~usual way to find positive invariant sets of ordinary
differential equations is to restrict the search to predefined finitely
generated shapes, such as linear templates, or ellipsoids as in classical
quadratic Lyapunov function based approaches. One then looks for
generators or parameters for which the corresponding shape has the
property that the flow of the ODE goes inwards on its border. But for
non-linear systems, where the structure of invariant sets may be very
complicated, such simple predefined shapes are generally not well suited.
The present work proposes a more general approach based on a topological
property, namely Wa\.{z}ewski's property. Even for complicated non-linear
dynamics, it is possible to successfully restrict the search for isolating
blocks of simple shapes, that are bound to contain non-empty invariant
sets. This approach generalizes the Lyapunov-like approaches, by allowing
for inwards and outwards flow on the boundary of these shapes, with extra
topological conditions. We developed and implemented an algorithm based on
Wa\.{z}ewski's property, SOS optimization and some extra combinatorial and
algebraic properties, that shows very nice results on a number of
classical polynomial dynamical systems.}
}
@inproceedings{LS-rp15,
address = {Warsaw, Poland},
month = sep,
year = 2015,
volume = {9328},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Boja{\'n}czyk, Miko{\l}aj and Lasota, S{\l}awomir and Potapov, Igor},
acronym = {{RP}'15},
booktitle = {{P}roceedings of the 9th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'15)},
author = {Lazi{\'c}, Ranko and Schmitz, Sylvain},
title = {The Ideal View on {R}ackoff's Coverability Technique},
pages = {76-88},
url = {https://hal.inria.fr/hal-01176755},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-rp15.pdf},
doi = {10.1007/978-3-319-24537-9_8},
abstract = {Rackoff's small witness property for the coverability problem
is the standard means to prove tight upper bounds in vector addition
systems (VAS) and many extensions. We show how to derive the same bounds
directly on the computations of the VAS instantiation of the generic
backward coverability algorithm. This relies on a dual view of the
algorithm using ideal decompositions of downwards-closed sets, which
exhibits a key structural invariant in the VAS case. The same reasoning
readily generalises to several VAS extensions.}
}
@inproceedings{BHPSS-rp15,
address = {Warsaw, Poland},
month = sep,
year = 2015,
volume = {9328},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Boja{\'n}czyk, Miko{\l}aj and Lasota, S{\l}awomir and Potapov, Igor},
acronym = {{RP}'15},
booktitle = {{P}roceedings of the 9th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'15)},
author = {B{\'e}rard, B{\'e}atrice and Haddad, Serge and Picaronny,
Claudine and Safey{ }El{~}Din, Mohab and Sassolas, Mathieu},
title = {Polynomial Interrupt Timed Automata},
pages = {20-32},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHPSS-rp15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHPSS-rp15.pdf},
doi = {10.1007/978-3-319-24537-9_3},
abstract = {Interrupt Timed Automata (ITA) form a subclass of stopwatch
automata where reachability and some variants of timed model checking are
decidable even in presence of parameters. They are well suited to model
and analyze real-time operating systems. Here we extend ITA with
polynomial guards and updates, leading to the class of polynomial ITA
(PolITA). We prove that reachability is decidable in 2EXPTIME on PolITA,
using an adaptation of the cylindrical decomposition method for the
first-order theory of reals. Compared to previous approaches, our
procedure handles parameters and clocks in a unified way. We also obtain
decidability for the model checking of a timed version of CTL and for
reachability in several extensions of PolITA.}
}
@inproceedings{BFM-avocs15,
address = {Edinburgh, UK},
month = sep,
year = {2015},
volume = 72,
series = {Electronic Communications of the EASST},
publisher = {European Association of Software Science and Technology},
editor = {Grov, Gudmund and Ireland, Andrew},
acronym = {{AVoCS}'15},
booktitle = {{P}roceedings of the 15th {I}nternational
{W}orkshop on {A}utomated {V}erification
of {C}ritical {S}ystems
({AVoCS}'15)},
author = {Bouyer, Patricia and Fang, Erwin and Markey, Nicolas},
title = {Permissive strategies in timed automata and games},
nopages = {263-277},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFM-avocs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFM-avocs15.pdf},
doi = {10.14279/tuj.eceasst.72.1015},
abstract = {Timed automata are a convenient framework for modelling and
reasoning about real-time systems. While these models are now very
well-understood, they do not offer a convenient way of taking timing
imprecisions into account. Several solutions (e.g. parametric guard
enlargement) have recently been proposed over the last ten years to take
such imprecisions into account. In this paper, we propose a new approach
for handling robust reachability, based on permissive strategies. While
classical strategies propose to play an action at an exact point in time,
permissive strategies return an interval of possible dates when to play
the selected action. With such a permissive strategy, we associate a
penalty, which is the inverse of the length of the proposed interval, and
accumulates along the run. We show that in that setting, optimal
strategies can be computed in polynomial time for one-clock timed
automata.}
}
@inproceedings{B-time15,
address = {Kassel, Germany},
month = sep,
year = 2015,
publisher = {{IEEE} Computer Society Press},
editor = {Grandi, Fabio and Lange, Martin and Lomuscio, Alessio},
acronym = {{TIME}'15},
booktitle = {{P}roceedings of the 22nd {I}nternational {S}ymposium on
{T}emporal {R}epresentation and {R}easoning
({TIME}'15)},
author = {Bollig, Benedikt},
title = {Towards Formal Verification of Distributed Algorithms},
pages = {3},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/B-time15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/B-time15.pdf},
doi = {10.1109/TIME.2015.23}
}
@inproceedings{B-ciaa15,
address = {Ume{\aa}, Sweden},
month = aug,
year = 2015,
volume = {9223},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
editor = {Drewes, Frank},
acronym = {{CIAA}'15},
booktitle = {{P}roceedings of the 20th {I}nternational
{C}onference on {I}mplementation and
{A}pplication of {A}utomata
({CIAA}'15)},
author = {Bollig, Benedikt},
title = {Automata and Logics for Concurrent Systems: Five Models in Five
Pages},
pages = {3-12},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/B-ciaa15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/B-ciaa15.pdf},
doi = {10.1007/978-3-319-22360-5_1},
abstract = {We~survey various automata models of concurrent systems and
their connection with monadic second-order logic: finite automata, class
memory automata, nested-word automata, asynchronous automata, and
message-passing automata.}
}
@inproceedings{RG-bda15,
address = {{\^I}le de Porquerolles, France},
month = sep,
year = 2015,
noeditor = {},
acronym = {{BDA}'15},
booktitle = {{A}ctes de la 31{\`e}me {C}onf{\'e}rence sur la {G}estion de
{D}onn{\'e}es~-- {P}rincipes, {T}echnologies et
{A}pplications ({BDA}'15)},
author = {Rafes, Karima and Germain, C{\'e}cile},
title = {A~platform for scientific data sharing},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/RG-bda15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/RG-bda15.pdf},
abstract = {In this paper, we use the semantic web technology, notably RDF,
SPARQL and Linked Open Data in the context of scientific data sharing.
More precisely, we present the LinkedWiki platform that is being developed
at the Center for Data Science of Paris-Saclay University for scientific
data integration. The~goal is to facilitate the discovery and exploitation
of scientists' datasets by their colleagues. For this, we notably rely on
the use by scientists of Wikipedia for specifying the semantics of
datasets, and the use of Wikidata (the~Wikipedia's knowledge base)
identifiers for annotating these datasets and thereby facilitating their
discovery.}
}
@inproceedings{BMRLL-gandalf15,
address = {Genova, Italy},
month = sep,
year = 2015,
volume = {193},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Esparza, Javier and Tronci, Enrico},
acronym = {{GandALF}'15},
booktitle = {{P}roceedings of the 6th {I}nternational {S}ymposium
on {G}ames, {A}utomata, {L}ogics, and {F}ormal {V}erification
({GandALF}'15)},
author = {Bouyer, Patricia and Markey, Nicolas and Randour, Mickael
and Larsen, Kim G. and Laursen, Simon},
title = {Average-energy games},
pages = {1-15},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMRLL-gandalf15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMRLL-gandalf15.pdf},
doi = {10.4204/EPTCS.193.1},
abstract = {Two-player quantitative zero-sum games provide a natural
framework to synthesize controllers with performance guarantees for
reactive systems within an uncontrollable environment. Classical settings
include mean-payoff games, where the objective is to optimize the long-run
average gain per action, and energy games, where the system has to avoid
running out of energy.\par
We study \emph{average-energy} games, where the goal is to optimize the
long-run average of the accumulated energy. We show that this objective
arises naturally in several applications, and that it yields interesting
connections with previous concepts in the literature. We prove that
deciding the winner in such games is in
\textsf{NP}{{\(\cap\)}}\textsf{coNP} and at least as hard as solving
mean-payoff games, and we establish that memoryless strategies suffice to
win. We also consider the case where the system has to minimize the
average-energy while maintaining the accumulated energy within predefined
bounds at all times: this corresponds to operating with a finite-capacity
storage for energy. We give results for one-player and two-player games,
and establish complexity bounds and memory requirements.}
}
@inproceedings{LMS-gandalf15,
address = {Genova, Italy},
month = sep,
year = 2015,
volume = {193},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Esparza, Javier and Tronci, Enrico},
acronym = {{GandALF}'15},
booktitle = {{P}roceedings of the 6th {I}nternational {S}ymposium
on {G}ames, {A}utomata, {L}ogics, and {F}ormal {V}erification
({GandALF}'15)},
author = {Laroussinie, Fran{\c{c}}ois and Markey, Nicolas and
Sangnier, Arnaud},
title = {{{\(\textsf{ATL}_{\textsf{sc}}\)}} with partial observation},
pages = {43-57},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LMS-gandalf15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LMS-gandalf15.pdf},
doi = {10.4204/EPTCS.193.4},
abstract = {Alternating-time temporal logic with strategy contexts
({{\(\textsf{ATL}_{\textsf{sc}}\)}}) is a powerful formalism for
expressing properties of multi-agent systems: it~extends \textsf{CTL} with
\emph{strategy quantifiers}, offering a convenient way of expressing both
collaboration and antagonism between several agents. Incomplete
observation of the state space is a desirable feature in such a framework,
but it quickly leads to undecidable verification problems. In this paper,
we prove that \emph{uniform} incomplete observation (where all players
have the same observation) preserves decidability of the model checking
problem, even for very expressive logics such as
{{\(\textsf{ATL}_{\textsf{sc}}\)}}.}
}
@inproceedings{BV-dlt15,
address = {Liverpool, UK},
month = jul,
year = 2015,
volume = {9168},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Potapov, Igor},
acronym = {{DLT}'15},
booktitle = {{P}roceedings of the 19th {I}nternational
{C}onference on {D}evelopments in {L}anguage {T}heory
({DLT}'15)},
author = {Berwanger, Dietmar and Van{ }den{ }Bogaard, Marie},
title = {Consensus Game Acceptors},
pages = {108-119},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BV-dlt15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BV-dlt15.pdf},
doi = {10.1007/978-3-319-21500-6_8},
abstract = {We study a game for recognising formal languages, in which two
players with imperfect information need to coordinate on a common
decision, given private input strings correlated by a finite graph. The
players have a joint objective to avoid an inadmissible decision, in spite
of the uncertainty induced by the input.\par
We show that the acceptor model based on consensus games characterises
context-sensitive languages, and conversely, that winning strategies in
such games can be described by context-sensitive languages. We also
discuss consensus game acceptors with a restricted observation pattern
that describe nondeterministic linear-time languages.}
}
@inproceedings{BMV-atva15,
address = {Shanghai, China},
month = oct,
year = {2015},
volume = {9364},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Finkbeiner, Bernd and Pu, Geguang and Zhang, Lijun},
acronym = {{ATVA}'15},
booktitle = {{P}roceedings of the 13th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'15)},
author = {Berwanger, Dietmar and Mathew, Anup Basil and
Van{ }den{ }Bogaard, Marie},
title = {Hierarchical Information Patterns and Distributed Strategy Synthesis},
pages = {378-393},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMV-atva15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMV-atva15.pdf},
doi = {10.1007/978-3-319-24953-7_28},
abstract = {Infinite games with imperfect information tend to be
undecidable unless the information flow is severely restricted. One
fundamental decidable case occurs when there is a total ordering among
players, such that each player has access to all the information that the
following ones receive.\par
In this paper we consider variations of this hierarchy principle for
synchronous games with perfect recall, and identify new decidable classes
for which the distributed synthesis problem is solvable with finite-state
strategies. In particular, we show that decidability is maintained when
the information hierarchy may change along the play, or when transient
phases without hierarchical information are allowed.}
}
@inproceedings{PRCHH-atva15,
address = {Shanghai, China},
month = oct,
year = {2015},
volume = {9364},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Finkbeiner, Bernd and Pu, Geguang and Zhang, Lijun},
acronym = {{ATVA}'15},
booktitle = {{P}roceedings of the 13th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'15)},
author = {Ponce{ }de{~}Le{\'o}n, Hern{\'a}n and Rodr{\'\i}guez,
C{\'e}sar and Carmona, Josep and Heljanko, Keijo and Haar, Stefan},
title = {Unfolding-Based Process Discovery},
pages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/PRCHH-atva15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/PRCHH-atva15.pdf},
doi = {10.1007/978-3-319-24953-7_4},
abstract = {This paper presents a novel technique for process discovery. In
contrast to the current trend, which only considers an event log for
discovering a process model, we assume two additional inputs: an
independence relation on the set of logged activities, and a collection of
negative traces. After deriving an intermediate net unfolding from them,
we perform a controlled folding giving rise to a Petri net which contains
both the input log and all independence-equivalent traces arising from~it.
Remarkably, the derived Petri net cannot execute any trace from the
negative collection. The entire chain of transformations is fully
automated. A tool has been developed and experimental results are provided
that witness the significance of the contribution of this paper.}
}
@article{BCGMNTW-jfr14,
publisher = {University of Bologna},
journal = {Journal of Formalized Reasoning},
author = {Baelde, David and Chaudhuri, Kaustuv and Gacek, Andrew and
Miller, Dale and Nadathur, Gopalan and Tiu, Alwen and Wang,
Yuting},
title = {Abella: A~System for Reasoning about Relational Specifications},
volume = {7},
number = {2},
year = {2014},
pages = {1-89},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCGMNTW-jfr14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCGMNTW-jfr14.pdf},
doi = {10.6092/issn.1972-5787/4650},
abstract = {The Abella interactive theorem prover is based on an
intuitionistic logic that allows for inductive and co-inductive reasoning
over relations. Abella supports the \(\lambda\)-tree approach to treating
syntax containing binders: it~allows simply typed \(\lambda\)-terms to be
used to represent such syntax and it provides higher-order (pattern)
unification, the \(\nabla\) quantifier, and nominal constants for
reasoning about these representations. As such, it is a suitable vehicle
for formalizing the meta-theory of formal systems such as logics and
programming languages. This tutorial exposes Abella incrementally,
starting with its capabilities at a first-order logic level and gradually
presenting more sophisticated features, ending with the support it offers
to the \emph{two-level logic approach} to meta-theoretic reasoning. Along
the way, we show how Abella can be used prove theorems involving natural
numbers, lists, and automata, as well as involving typed and untyped
\(\lambda\)-calculi and the \(\pi\)-calculus.}
}
@inproceedings{BDS-csl15,
address = {Berlin, Germany},
month = sep,
year = 2015,
volume = {41},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Kreuzer, Stephan},
acronym = {{CSL}'15},
booktitle = {{P}roceedings of the 24th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'15)},
author = {Baelde, David and Doumane, Amina and Saurin, Alexis},
title = {Least and Greatest Fixed Points in Ludics},
pages = {549-566},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDS-csl15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDS-csl15.pdf},
doi = {10.4230/LIPIcs.CSL.2015.549},
abstract = {Various logics have been introduced in order to reason over
(co)inductive specifications and, through the Curry-Howard correspondence,
to study computation over inductive and coinductive data. The logic mu-MALL
is one of those logics, extending multiplicative and additive linear logic
with least and greatest fixed point operators.\par
In this paper, we investigate the semantics of mu-MALL proofs in
(computational) ludics. This framework is built around the notion of
design, which can be seen as an analogue of the strategies of game
semantics. The infinitary nature of designs makes them particularly well
suited for representing computations over infinite data.\par
We provide mu-MALL with a denotational semantics, interpreting proofs by
designs and formulas by particular sets of designs called behaviours. Then
we prove a completeness result for the class of {"}essentially finite
designs{"}, which are those designs performing a finite computation followed
by a copycat. On the way to completeness, we investigate semantic
inclusion, proving its decidability (given two formulas, we can decide
whether the semantics of one is included in the other's) and completeness
(if semantic inclusion holds, the corresponding implication is provable in
mu-MALL).}
}
@article{CLMT-dagstuhl15,
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
journal = {Dagstuhl Reports},
editor = {Chatterjee, Krishnendu and Lafortune, St{\'e}phane and
Markey, Nicolas and Thomas, Wolfgang},
author = {Chatterjee, Krishnendu and Lafortune, St{\'e}phane and
Markey, Nicolas and Thomas, Wolfgang},
title = {Non-Zero-Sum-Games and Control ({D}agstuhl Seminar~15061)},
pages = {1-25},
year = {2015},
volume = {5},
number = {2},
month = jun,
url = {http://drops.dagstuhl.de/opus/volltexte/2015/5042},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CLMT-dagstuhl15.pdf},
doi = {10.4230/DagRep.5.2.1},
abstract = {In this report, the program, research issues, and results of
Dagstuhl Seminar 15061 {"}Non-Zero-Sum-Games and Control{"} are described.
The area of non-zero-sum games is addressed in a wide range of topics:
multi-player games, partial-observation games, quantitative game models,
and---as~a special focus---connections with control engineering
(supervisory control).}
}
@inproceedings{HPRV-ppdp15,
address = {Siena, Italy},
month = jul,
year = 2015,
publisher = {ACM Press},
editor = {Albert, Elvira},
acronym = {{PPDP}'15},
booktitle = {{P}roceedings of the 17th {I}nternational
{C}onference on {P}rinciples and {P}ractice of {D}eclarative
{P}rogramming ({PPDP}'15)},
author = {Haar, Stefan and Perchy, Salim and Rueda, Camilo and
Valencia, Franck},
title = {An Algebraic View of Space{{\slash}}Belief and
Extrusion{{\slash}}Utterance for
Concurrency{{\slash}}Epistemic Logic},
pages = {161-172},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HPRV-ppdp15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HPRV-ppdp15.pdf},
doi = {10.1007/978-3-319-19488-2_6},
abstract = {We enrich spatial constraint systems with operators to specify
information and processes moving from a space to another. We shall refer
to these news structures as spatial constraint systems with extrusion. We
shall investigate the properties of this new family of constraint systems
and illustrate their applications. From a computational point of view the
new operators provide for process\slash information extrusion, a central
concept in formalisms for mobile communication. From an epistemic point of
view extrusion corresponds to a notion we shall call utterance; a~piece of
information that an agent communicates to others but that may be
inconsistent with the agent's beliefs. Utterances can then be used to
express instances of epistemic notions, which are common place in social
media, such as hoaxes or intentional lies. Spatial constraint systems with
extrusion can be seen as complete Heyting algebras equipped with maps to
account for spatial and epistemic specifications.}
}
@inproceedings{BMPS-formats15,
address = {Madrid, Spain},
month = sep,
year = 2015,
volume = {9268},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Sankaranarayanan, Sriram and Vicario, Enrico},
acronym = {{FORMATS}'15},
booktitle = {{P}roceedings of the 13th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'15)},
author = {Bouyer, Patricia and Markey, Nicolas and Perrin, Nicolas
and Schlehuber, Philipp},
title = {Timed automata abstraction of switched dynamical systems
using control funnels},
pages = {60-75},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMPS-formats15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMPS-formats15.pdf},
doi = {10.1007/978-3-319-22975-1_5},
abstract = {The~development of formal methods for control design is an
important challenge with potential applications in a wide range of
safety-critical cyber-physical systems. Focusing on switched dynamical
systems, we~propose a new abstraction, based on time-varying regions of
invariance (the~\emph{control funnels}), that models behaviors of systems as
timed automata. The main advantage of this method is that it allows
automated verification of formal specifications and reactive controller
synthesis without discretizing the evolution of the state of the system.
Efficient constructions are possible in the case of linear dynamics.
We~demonstrate the potential of our approach with two examples.}
}
@inproceedings{AM-formats15,
address = {Madrid, Spain},
month = sep,
year = 2015,
volume = {9268},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Sankaranarayanan, Sriram and Vicario, Enrico},
acronym = {{FORMATS}'15},
booktitle = {{P}roceedings of the 13th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'15)},
author = {Andr{\'e}, {\'E}tienne and Markey, Nicolas},
title = {Language Preservation Problems in Parametric Timed Automata},
pages = {27-43},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AM-formats15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AM-formats15.pdf},
doi = {10.1007/978-3-319-22975-1_3},
abstract = {Parametric timed automata (PTA) are a powerful formalism to
model and reason about concurrent systems with some unknown timing delays.
In this paper, we address the (untimed) language- and trace-preservation
problems: given a reference parameter valuation, does there exist another
parameter valuation with the same untimed language (or trace)? We show
that these problems are undecidable both for general PTA, and even for the
restricted class of L/U-PTA. On the other hand, we exhibit decidable
subclasses: 1-clock PTA, and 1-parameter deterministic L-PTA and U-PTA.}
}
@inproceedings{ABG-concur15,
address = {Madrid, Spain},
month = sep,
year = 2015,
volume = {42},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Aceto, Luca and de Frutos-Escrig, David},
acronym = {{CONCUR}'15},
booktitle = {{P}roceedings of the 26th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'15)},
author = {Aiswarya, C. and Bollig, Benedikt and Gastin, Paul},
title = {An Automata-Theoretic Approach to the Verification of Distributed Algorithms},
pages = {340-353},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABG-concur15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABG-concur15.pdf},
doi = {10.4230/LIPIcs.CONCUR.2015.340},
abstract = {We introduce an automata-theoretic method for the verification
of distributed algorithms running on ring networks. In a distributed
algorithm, an arbitrary number of processes cooperate to achieve a common
goal (e.g., elect a leader). Processes have unique identifiers (pids) from
an infinite, totally ordered domain. An algorithm proceeds in synchronous
rounds, each round allowing a process to perform a bounded sequence of
actions such as send or receive a pid, store it in some register, and
compare register contents wrt. the associated total order. An algorithm is
supposed to be correct independently of the number of processes. To
specify correctness properties, we introduce a logic that can reason about
processes and pids. Referring to leader election, it may say that, at the
end of an execution, each process stores the maximum pid in some dedicated
register. Since the verification of distributed algorithms is undecidable,
we propose an underapproximation technique, which bounds the number of
rounds. This is an appealing approach, as the number of rounds needed by a
distributed algorithm to conclude is often exponentially smaller than the
number of processes. We provide an automata-theoretic solution, reducing
model checking to emptiness for alternating two-way automata on words.
Overall, we show that round-bounded verification of distributed algorithms
over rings is PSPACE-complete.}
}
@inproceedings{BDH-concur15,
address = {Madrid, Spain},
month = sep,
year = 2015,
volume = {42},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Aceto, Luca and de Frutos-Escrig, David},
acronym = {{CONCUR}'15},
booktitle = {{P}roceedings of the 26th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'15)},
author = {Baelde, David and Delaune, St{\'e}phanie and Hirschi,
Lucca},
title = {Partial Order Reduction for Security Protocols},
pages = {497-510},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BDH-concur15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDH-concur15.pdf},
doi = {10.4230/LIPIcs.CONCUR.2015.497},
abstract = {Security protocols are concurrent processes that communicate
using cryptography with the aim of achieving various security properties.
Recent work on their formal verification has brought procedures and tools
for deciding trace equivalence properties (\textit{e.g.},~anonymity,
unlinkability, vote secrecy) for a bounded number of sessions. However,
these procedures are based on a naive symbolic exploration of all traces
of the considered processes which, unsurprisingly, greatly limits the
scalability and practical impact of the verification tools.\par
In this paper, we mitigate this difficulty by developing partial order
reduction techniques for the verification of security protocols. We
provide reduced transition systems that optimally elim- inate redundant
traces, and which are adequate for model-checking trace equivalence
properties of protocols by means of symbolic execution. We have
implemented our reductions in the tool \textsf{Apte}, and demonstrated
that it achieves the expected speedup on various protocols.}
}
@inproceedings{BJM-concur15,
address = {Madrid, Spain},
month = sep,
year = 2015,
volume = {42},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Aceto, Luca and de Frutos-Escrig, David},
acronym = {{CONCUR}'15},
booktitle = {{P}roceedings of the 26th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'15)},
author = {Bouyer, Patricia and Jaziri, Samy and Markey, Nicolas},
title = {On~the Value Problem in Weighted Timed Games},
pages = {311-324},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BJM-concur15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BJM-concur15.pdf},
doi = {10.4230/LIPIcs.CONCUR.2015.311},
abstract = {A~weighted timed game is a timed game with extra quantitative
information representing e.g. energy consumption. Optimizing the cost for
reaching a target is a natural question, which has been investigated for
ten years. Existence of optimal strategies is known to be undecidable in
general, and only very restricted classes of games have been described for
which optimal cost and almost-optimal strategies can be computed.\par
In this paper, we show that the value problem is undecidable in general
weighted timed games. The undecidability proof relies on that for the
existence of optimal strategies and on a diagonalization construction
recently designed in the context of quantitative temporal logics. We then
provide an algorithm to compute arbitrary approximations of the value in a
game, and almost-optimal strategies. The algorithm applies in a large
subclass of weighted timed games, and is the first approximation scheme
which is designed in the current context.}
}
@inproceedings{CDV-icalp15,
address = {Kyoto, Japan},
month = jul,
year = 2015,
volume = {9135},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Halld{\'o}rsson, Magnus M. and Iwama, Kazuo and Kobayashi,
Naoki and Speckmann, Bettina},
acronym = {{ICALP}'15},
booktitle = {{P}roceedings of the 42nd {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'15)~-- {P}art~{II}},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Vardi, Moshe},
title = {The Complexity of Synthesis from Probabilistic Components},
pages = {108-120},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDV-icalp15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDV-icalp15.pdf},
doi = {10.1007/978-3-662-47666-6_9},
abstract = {The synthesis problem asks for the automatic construction of a
system from its specification. In the traditional setting, the system is
{"}constructed from scratch{"} rather than composed from reusable
components. However, this is rare in practice, and almost every
non-trivial software system relies heavily on the use of libraries of
reusable components. Recently, Lustig and Vardi introduced dataflow and
controlflow synthesis from libraries of reusable components. They proved
that dataflow synthesis is undecidable, while controlflow synthesis is
decidable. The problem of controlflow synthesis from libraries of
probabilistic components was considered by Nain, Lustig and Vardi, and was
shown to be decidable for qualitative analysis (that asks that the
specification be satisfied with probability~1). Our main contribution for
controlflow synthesis from probabilistic components is to establish better
complexity bounds for the qualitative analysis problem, and to show that
the more general quantitative problem is undecidable. For the qualitative
analysis, we show that the problem (i)~is EXPTIME-complete when the
specification is given as a deterministic parity word automaton, improving
the previously known 2EXPTIME upper bound; and (ii)~belongs to
UP\(\cap\)coUP and is parity-games hard, when the specification is given
directly as a parity condition on the components, improving the previously
known EXPTIME upper bound.}
}
@inproceedings{JLS-icalp15,
address = {Kyoto, Japan},
month = jul,
year = 2015,
volume = {9135},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Halld{\'o}rsson, Magnus M. and Iwama, Kazuo and Kobayashi,
Naoki and Speckmann, Bettina},
acronym = {{ICALP}'15},
booktitle = {{P}roceedings of the 42nd {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'15)~-- {P}art~{II}},
author = {Jurdzi{\'n}ski, Marcin and Lazi{\'c}, Ranko and Schmitz, Sylvain},
title = {Fixed-Dimensional Energy Games are in Pseudo Polynomial Time},
pages = {260-272},
url = {http://arxiv.org/abs/1502.06875},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JLS-arxiv15.pdf},
doi = {10.1007/978-3-662-47666-6_21},
abstract = {We generalise the hyperplane separation technique (Chatterjee
and Velner,~2013) from multi-dimensional mean-payoff to energy games, and
achieve an algorithm for solving the latter whose running time is
exponential only in the dimension, but not in the number of vertices of
the game graph. This answers an open question whether energy games with
arbitrary initial credit can be solved in pseudo-polynomial time for fixed
dimensions~\(3\) or larger (Chaloupka,~2013). It~also improves the complexity
of solving multi-dimensional energy games with given initial credit from
non-elementary (Br\'azdil, Jan\v{c}ar, and Ku\v{c}era,~2010) to 2EXPTIME,
thus establishing their 2EXPTIME-completeness.}
}
@phdthesis{bollig-HDR15,
author = {Bollig, Benedikt},
title = {Automata and Logics for Concurrent Systems: Realizability and Verification},
year = 2015,
month = jun,
type = {M{\'e}moire d'habilitation},
school = {{\'E}cole Normale Sup{\'e}rieure de Cachan, France},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-bollig15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/hdr-bollig15.pdf}
}
@inproceedings{CCD-csf15,
address = {Verona, Italy},
month = jul,
year = 2015,
publisher = {{IEEE} Computer Society Press},
acronym = {{CSF}'15},
booktitle = {{P}roceedings of the
28th {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'15)},
author = {Chr{\'e}tien, R{\'e}my and Cortier, V{\'e}ronique and
Delaune, St{\'e}phanie},
title = {Decidability of trace equivalence for protocols with nonces},
pages = {170-184},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-csf15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCD-csf15.pdf},
doi = {10.1109/CSF.2015.19},
abstract = {Privacy properties such as anonymity, unlinkability, or vote
secrecy are typically expressed as equivalence properties.\par
In this paper, we provide the first decidability result for trace
equivalence of security protocols, for an unbounded number of sessions and
unlimited fresh nonces. Our class encompasses most symmetric key protocols
of the literature, in their tagged variant.}
}
@inproceedings{MLBHB-ftscs15,
address = {Luxembourg},
optnmonth = 11,
optmonth = nov,
year = 2015,
volume = {476},
series = {Communications in Computer and Information Science},
publisher = {Springer},
editor = {Artho, Cyrille and {\"O}lveczky, Peter Csaba},
acronym = {{FTSCS}'14},
booktitle = {{P}roceedings of the 3rd {I}nternational {W}orkshop on {F}ormal {T}echniques for
{S}afety-{C}ritical {S}ystems, Nov. 2014 ({FTSCS}'14)},
author = {Methni, Amira and Lemerre, Matthieu and Ben{~}Hedia, Belgacem and
Haddad, Serge and Barkaoui, Kamel},
title = {Specifying and Verifying Concurrent {C}~Programs with {TLA+}},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/MLBHB-ftscs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/MLBHB-ftscs15.pdf},
doi = {10.1007/978-3-319-17581-2_14},
pages = {206-222},
nonote = {17~pages},
abstract = {Verifying software systems automatically from their source code
rather than modelling them in a dedicated language gives more confidence
in establishing their properties. Here we propose a formal specification
and verification approach for concurrent C programs directly based on the
semantics of~C. We define a set of translation rules and implement it in a
tool~(C2TLA+) that automatically translates C code into a TLA+
specification. The~TLC model checker can use this specification to
generate a model, allowing to check the absence of runtime errors and dead
code in the C program in a given configuration. In addition, we show how
translated specifications interact with manually written ones~to: check
the C code against safety or liveness properties; provide concurrency
primitives or model hardware that cannot be expressed in~C; and use
abstract versions of translated C functions to address the state explosion
problem. All these verifications have been conducted on an industrial case
study, which is a part of the microkernel of the PharOS real-time
system.}
}
@article{FH-fundi15,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {Fraca, Est{\'\i}baliz and Haddad, Serge},
title = {Complexity Analysis of Continuous Petri Nets},
volume = 137,
number = {1},
pages = {1-28},
year = 2015,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FH-fundi15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FH-fundi15.pdf},
doi = {10.3233/FI-2015-1168},
abstract = {At the end of the eighties, continuous Petri nets were
introduced for: (1)~alleviating the combinatory explosion triggered by
discrete Petri nets (i.e. usual Petri nets) and, (2)~modelling the
behaviour of physical systems whose state is composed of continuous
variables. Since then several works have established that the
computational complexity of deciding some standard behavioural properties
of Petri nets is reduced in this framework. Here we first establish the
decidability of additional properties like coverability, boundedness and
reachability set inclusion. We also design new decision procedures for
reachability and lim-reachability problems with a better computational
complexity. Finally we provide lower bounds characterising the exact
complexity class of the reachability, the coverability, the boundedness,
the deadlock freeness and the liveness problems. A~small case study is
introduced and analysed with these new procedures.}
}
@article{BHHP-ijasm15,
publisher = {IARIA},
journal = {International Journal on Advances in Systems and Measurements},
author = {Barbot, Beno{\^\i}t and Haddad, Serge and Heiner, Monika and
Picaronny, Claudine},
title = {Rare Event Handling in Signalling Cascades},
volume = 8,
number = {1-2},
pages = {69-79},
year = 2015,
month = jun,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHHP-ijasm15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHHP-ijasm15.pdf},
abstract = {Signalling cascades are a recurrent pattern of biological
regulatory systems whose analysis has deserved a lot of attention. It has
been shown that stochastic Petri nets are appropriate to model such
systems and evaluate the probabilities of specific properties. Such an
evaluation can be done numerically when the combinatorial state space
explosion is manageable or statistically otherwise. However, when the
probabilities to be evaluated are too small, random simulation requires
more sophisticated techniques for the handling of rare events. In this
paper, we show how such involved methods can be successfully applied for
signalling cascades. More precisely, we study three relevant properties of
a signalling cascade with the help of the COSMOS tool. Our experiments
point out interesting dependencies between quantitative parameters of the
regulatory system and its transient behaviour. In addition, they
demonstrate that we can go beyond the capabilities of MARCIE, which
provides one of the most efficient numerical solvers.}
}
@inproceedings{RNG-ldq15,
address = {Portoro{\v z}, Slovenia},
month = jun,
year = 2015,
volume = {1376},
series = {CEUR Workshop Proceedings},
publisher = {RWTH Aachen, Germany},
editor = {Rula, Anisa and Zaveri, Amrapali and Knuth, Magnus and
Kontokostas, Dimitris},
acronym = {{LDQ}'15},
booktitle = {{P}roceedings of the 2nd {W}orkshop on {L}inked {D}ata {Q}uality
({LDQ}'15)},
author = {Rafes, Karima and Nauroy, Julien and Germain, C{\'e}cile},
title = {Certifying the interoperability of {RDF} database systems},
nopages = {},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/RNG-ldq15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/RNG-ldq15.pdf},
abstract = {In~March~2013, the W3C recommended SPARQL~1.1 to retrieve and
manipulate decentralized RDF data. Real-world usage requires advanced
features of SPARQL~1.1. recommendations As these are not consistently
implemented, we propose a test framework named TFT (Tests for Triple
stores) to test the interoperability of the SPARQL end-point of RDF
database systems. This framework can execute the W3C's SPARQL~1.1 test
suite and also its own tests of interoperability. To help the developers
and end-users of RDF databases, we perform daily tests on Jena-Fuseki,
Marmotta-KiWistore, 4Store and three other commercial databases. With
these tests, we have built a scoring system named SPARQLScore and share
our results on the website \url{http://sparqlscore.com}.}
}
@article{BFRR-ic15,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Bruy{\`e}re, V{\'e}ronique and Filiot, Emmanuel and
Randour, Mickael and Raskin, Jean-Fran{\c{c}}ois},
title = {Meet Your Expectations With Guarantees: Beyond Worst-Case
Synthesis in Quantitative Games},
volume = {254},
number = {2},
month = jun,
year = 2017,
pages = {259-295},
note = {To appear},
doi = {10.1016/j.ic.2016.10.011},
abstract = {Classical analysis of two-player quantitative games involves an adversary (modeling the environment of the system) which is purely antagonistic and asks for strict guarantees while Markov decision processes model systems facing a purely randomized environment: the aim is then to optimize the expected payoff, with no guarantee on individual outcomes. We introduce the beyond worst-case synthesis problem, which is to construct strategies that guarantee some quantitative requirement in the worst-case while providing a higher expected value against a particular stochastic model of the environment given as input.
We study the beyond worst-case synthesis problem for two important quantitative settings: the mean-payoff and the shortest path. In both cases, we show how to decide the existence of finite-memory strategies satisfying the problem and how to synthesize one if one exists. We establish algorithms and we study complexity bounds and memory requirements.}
}
@inproceedings{RRS-cav15,
address = {San Francisco, CA, USA},
month = jul,
year = 2015,
volume = 9206,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Kroening, Daniel and Pasareanu, Corina},
acronym = {{CAV}'15},
booktitle = {{P}roceedings of the 27th
{I}nternational {C}onference on
{C}omputer {A}ided {V}erification
({CAV}'15)~-- Part~{I}},
author = {Randour, Mickael and Raskin, Jean-Fran{\c{c}}ois and Sankur, Ocan},
title = {Percentile Queries in Multi-Dimensional {M}arkov Decision Processes},
pages = {123-139},
url = {http://arxiv.org/abs/1410.4801},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/RRS-arxiv14.pdf},
doi = {10.1007/978-3-319-21690-4_8},
abstract = {Multi-dimensional weighted Markov decision processes (MDPs) are
useful to analyze systems with multiple objectives that are potentially
conflicting and make necessary the analysis of trade-offs. In this paper,
we study the complexity of percentile queries in such MDPs and provide
algorithms to synthesize strategies that enforce such constraints. Given a
multi-dimensional weighted MDP and a quantitative payoff function~\(f\),
quantitative thresholds~\(v_i\) (one per dimension), and probability
thresholds~\(\alpha_{i}\), we show how to compute a single strategy that
enforces that for all dimension~\(i\), the probability that an
outcome~\(\rho\) satisfies \(f_{i}(\rho) \geq v_{i}\) is at
least~\(\alpha_{i}\). We study this problem for the classical quantitative
payoffs studied in the literature (sup, inf, lim sup, lim inf,
mean-payoff, truncated sum, discounted sum). So our work can be seen as an
extension to the quantitative case of the multi-objective model checking
problem on MDPs studied by Etessami et al. in unweighted MDPs.}
}
@article{DD-jlc15,
publisher = {Oxford University Press},
journal = {Journal of Logic and Computation},
author = {Demri, St{\'e}phane and Deters, Morgan},
title = {Temporal Logics on Strings with Prefix Relation},
year = 2016,
volume = {26},
number = {3},
pages = {989-1017},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-jlc15-v2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-jlc15-v2.pdf},
doi = {10.1093/logcom/exv028},
abstract = {We show that linear-time temporal logic over concrete domains
made of finite strings and the prefix relation admits a PSpace-complete
satisfiability problem. Actually, we extend a known result with the
concrete domain made of the set of natural numbers and the greater than
relation (corresponding to the singleton alphabet case) and we solve an
open problem mentioned in several publications. Since the prefix relation
is not a total ordering, it~is not possible to take advantage of existing
techniques dedicated to temporal logics with concrete domains that are
essentially linearly ordered structures. Instead, we introduce an adequate
encoding of string constraints into length constraints that allows us to
reduce the problem on strings to the problem on natural numbers. To~do~so,
we~also propose an extended version of the logic on strings that is able
to compare lengths of longest common prefixes and for which the
satisfiability problem is shown in PSpace. Finally, we show how to lift
the result for the branching-time case in order to get decidability when
the underlying temporal logic is~CTL\textsuperscript*.}
}
@inproceedings{HK-icalp15,
address = {Kyoto, Japan},
month = jul,
year = 2015,
volume = {9135},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Halld{\'o}rsson, Magnus M. and Iwama, Kazuo and Kobayashi,
Naoki and Speckmann, Bettina},
acronym = {{ICALP}'15},
booktitle = {{P}roceedings of the 42nd {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'15)~-- {P}art~{II}},
author = {Haase, Christoph and Kiefer, Stefan},
title = {The Odds of Staying on Budget},
pages = {234-246},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HK-icalp15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HK-icalp15.pdf},
doi = {10.1007/978-3-662-47666-6_19},
abstract = {Given Markov chains and Markov decision processes (MDPs) whose
transitions are labelled with non-negative integer costs, we study the
computational complexity of deciding whether the probability of paths
whose accumulated cost satisfies a Boolean combination of inequalities
exceeds a given threshold. For acyclic Markov chains, we show that this
problem is PP-complete, whereas it is hard for the POSSLP problem and in
PS PACE for general Markov chains. Moreover, for acyclic and general MDPs,
we prove PSPACE- and EXP-completeness, respectively. Our results have
direct implications on the complexity of computing reward quantiles in
succinctly represented stochastic systems.}
}
@inproceedings{DGGL-icalp15,
address = {Kyoto, Japan},
month = jul,
year = 2015,
volume = {9135},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Halld{\'o}rsson, Magnus M. and Iwama, Kazuo and Kobayashi,
Naoki and Speckmann, Bettina},
acronym = {{ICALP}'15},
booktitle = {{P}roceedings of the 42nd {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'15)~-- {P}art~{II}},
author = {Dubut, J{\'e}r{\'e}my and Goubault, {\'E}ric and
Goubault{-}Larrecq, Jean},
title = {Natural Homology},
pages = {171-183},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DGGL-icalp15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DGGL-icalp15.pdf},
doi = {10.1007/978-3-662-47666-6_14},
abstract = {We propose a notion of homology for directed algebraic topology,
based on so-called natural systems of abelian groups, and which we call
natural homology. Contrarily to previous proposals, and as we show,
natural homology has many desirable properties: it~is invariant under
isomorphisms of directed spaces, it is invariant under refinement
(subdivision), and it is computable on cubical complexes.}
}
@inproceedings{LS-lics15,
address = {Kyoto, Japan},
month = jul,
year = 2015,
publisher = {{IEEE} Press},
acronym = {{LICS}'15},
booktitle = {{P}roceedings of the 30th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'15)},
author = {Leroux, J{\'e}r{\^o}me and Schmitz, Sylvain},
title = {Demystifying Reachability in Vector Addition Systems},
pages = {56-67},
url = {http://arxiv.org/abs/1503.00745},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-arxiv15.pdf},
doi = {10.1109/LICS.2015.1},
abstract = {More than 30 years after their inception, the decidability
proofs for reachability in vector addition systems (VAS) still retain much
of their mystery. These proofs rely crucially on a decomposition of runs
successively refined by Mayr, Kosaraju, and Lambert, which appears rather
magical, and for which no complexity upper bound is known.\par
We first offer a justification for this decomposition technique, by
showing that it emerges naturally in the study of the ideals of a well
quasi ordering of VAS runs. In a second part, we apply recent results on
the complexity of termination thanks to well quasi orders and well orders
to obtain fast-growing complexity upper bounds for the decomposition
algorithms, thus providing the first known upper bounds for general VAS
reachability.}
}
@inproceedings{BFGHM-lics15,
address = {Kyoto, Japan},
month = jul,
year = 2015,
publisher = {{IEEE} Press},
acronym = {{LICS}'15},
booktitle = {{P}roceedings of the 30th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'15)},
author = {Blondin, Michael and Finkel, Alain and G{\"o}ller, Stefan
and Haase, Christoph and McKenzie, Pierre},
title = {Reachability in Two-Dimensional Vector Addition
Systems with States is {PSPACE}-Complete},
pages = {32-43},
url = {http://arxiv.org/abs/1412.4259},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFGHM-lics15-long.pdf},
doi = {10.1109/LICS.2015.14},
abstract = {Determining the complexity of the reachability problem for
vector addition systems with states (VASS) is a long-standing open problem
in computer science. Long known to be decidable, the problem to this day
lacks any complexity upper bound whatsoever. In this paper, reachability
for two-dimensional VASS is shown PSPACE-complete. This improves on a
previously known doubly exponential time bound established by Howell,
Rosier, Huynh and Yen in~1986. The coverability and boundedness problems
are also noted to be PSPACE-complete. In addition, some complexity results
are given for the reachability problem in two-dimensional VASS and in
integer VASS when numbers are encoded in unary.}
}
@inproceedings{ACR-acsd15,
address = {Brussels, Belgium},
month = jun,
year = 2015,
publisher = {{IEEE} Computer Society Press},
editor = {Haar, Stefan and Meyer, Roland},
acronym = {{ACSD}'15},
booktitle = {{P}roceedings of the 15th {I}nternational
{C}onference on {A}pplication of {C}oncurrency
to {S}ystem {D}esign
({ACSD}'15)},
author = {Andr{\'e}, {\'E}tienne and Chatain, {\relax Th}omas and
Rodr{\'\i}guez, C{\'e}sar},
title = {Preserving Partial Order Runs in Parametric Time {P}etri Nets},
pages = {120-129},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ACR-acsd15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACR-acsd15.pdf},
doi = {10.1109/ACSD.2015.16},
abstract = {Parameter synthesis for timed systems aims at deriving parameter
valuations satisfying a given property. In this paper we target concurrent
systems; it is well known that concurrency is a source of state-space
explosion, and partial order techniques were defined to cope with this
problem. Here we use partial order semantics for parametric time Petri
nets as a way to significantly enhance the result of an existing synthesis
algorithm. Given a reference parameter valuation, our approach synthesizes
other valuations preserving, up to interleaving, the behavior of the
reference parameter valuation. We show the applicability of our approach
using acyclic asynchronous circuits.}
}
@inproceedings{CHKS-pn15,
address = {Brussels, Belgium},
month = jun,
year = 2015,
volume = {9115},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Devillers, Raymond and Valmari, Antti},
acronym = {{PETRI~NETS}'15},
booktitle = {{P}roceedings of the 36th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'15)},
author = {Chatain, {\relax Th}omas and Haar, Stefan and Koutny,
Maciej and Schwoon, Stefan},
title = {Non-Atomic Transition Firing in Contextual Nets},
pages = {117-136},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CHKS-pn15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CHKS-pn15.pdf},
doi = {10.1007/978-3-319-19488-2_6},
abstract = {The firing rule for Petri nets assumes instantaneous and
simultaneous consumption and creation of tokens. In the context of
ordinary Petri nets, this poses no particular problem because of the
system's asynchronicity, even if token creation occurs later than token
consumption in the firing. With read arcs, the situation changes, and
several different choices of semantics are possible. The step semantics
introduced by Janicki and Koutny can be seen as imposing a two-phase
firing scheme: first, the presence of the required tokens is checked, then
consumption and production of tokens happens. Pursuing this approach
further, we develop a more general framework based on explicitly splitting
the phases of firing, allowing to synthesize coherent steps. This turns
out to define a more general non-atomic semantics, which has important
potential for safety as it allows to detect errors that were missed by the
previous semantics. Then we study the characterization of partial-order
processes feasible under one or the other semantics.}
}
@incollection{BH-im15,
year = 2015,
publisher = {CNRS \'Editions},
editor = {Ollinger, Nicolas},
booktitle = {Informatique Math{\'e}matique. Une~photographie en~2015},
author = {Bertrand, Nathalie and Haddad, Serge},
title = {Contr{\^o}le, probabilit{\'e}s et observation partielle},
chapter = 5,
pages = {177-227},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BH-im15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BH-im15.pdf}
}
@article{DDS-ic15,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Demri, St{\'e}phane and Dhar, Amit Kumar and Sangnier, Arnaud},
title = {Taming Past {LTL} and Flat Counter Systems},
volume = {242},
month = jun,
year = 2015,
pages = {306-339},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-ic15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-ic15.pdf},
doi = {10.1016/j.ic.2015.03.007},
abstract = {Reachability and LTL model-checking problems for flat counter
systems are known to be decidable but whereas the reachability problem can
be shown in NP, the best known complexity upper bound for the latter
problem is made of a tower of several exponentials. Herein, we show that
this problem is only NP-complete even if LTL admits past-time operators
and arithmetical constraints on counters. As far as past-time operators
are concerned, their addition to LTL immediately leads to complications
and hence an NP upper bound cannot be deduced by translating formulae into
LTL and studying the problem only for this latter logic. Actually, the NP
upper bound is shown by adequately combining a new stuttering theorem for
Past LTL and the property of small integer solutions for quantifier-free
Presburger formulae. This latter complexity bound extends known and recent
results on model-checking weak Kripke structures with LTL formulae as
well as reachability problems for flat counter systems. We also provide
other complexity results obtained by restricting further the class of flat
counter systems.}
}
@article{BBDHP-peva15,
publisher = {Elsevier Science Publishers},
journal = {Performance Evaluation},
author = {Ballarini, Paolo and Barbot, Beno{\^\i}t and Duflot, Marie and
Haddad, Serge and Pekergin, Nihal},
title = {{HASL}: A~New Approach for Performance Evaluation and Model
Checking from Concepts to Experimentation},
year = {2015},
month = aug,
volume = 90,
pages = {53-77},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2015-04.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/rr-lsv-2015-04.pdf},
doi = {10.1016/j.peva.2015.04.003},
abstract = {We introduce the Hybrid Automata Stochastic Language (HASL), a
new temporal logic formalism for the verification of Discrete Event
Stochastic Processes (DESP). HASL employs a Linear Hybrid Automaton (LHA)
to select prefixes of relevant execution paths of a DESP. LHA allows
rather elaborate information to be collected \emph{on-the-fly} during path
selection, providing the user with powerful means to express sophisticated
measures. A~formula of HASL consists of an LHA and an expression~\(Z\)
referring to moments of \emph{path random variables}. A~simulation-based
statistical engine is employed to obtain a confidence interval estimate
of the expected value of~\(Z\). In~essence, HASL~provides a unifying
verification framework where temporal reasoning is naturally blended with
elaborate reward-based analysis. Moreover, we have implemented a tool,
named COSMOS, for performing analysis of HASL formula for DESP modelled by
Petri nets. Using this tool we have developed two detailed case studies: a
flexible manufacturing system and a genetic oscillator.}
}
@article{LS-tocl15,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Lazi{\'c}, Ranko and Schmitz, Sylvain},
title = {Non-Elementary Complexities for Branching~{VASS}, {MELL}, and Extensions},
volume = {16},
number = {3:20},
nopages = {},
month = jul,
year = 2015,
url = {http://arxiv.org/abs/1401.6785},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-tocl15.pdf},
doi = {10.1145/2733375},
abstract = {We study the complexity of reachability problems on branching
extensions of vector addition systems, which allows us to derive new
non-elementary complexity bounds for fragments and variants of
propositional linear logic. We show that provability in the multiplicative
exponential fragment is Tower-hard already in the affine case---and hence
non-elementary. We match this lower bound for the full propositional
affine linear logic, proving its Tower-completeness. We also show that
provability in propositional contractive linear logic is
Ackermann-complete.}
}
@article{Schmitz-jsl15,
publisher = {Association for Symbolic Logic},
journal = {Journal of Symbolic Logic},
author = {Schmitz, Sylvain},
title = {Implicational Relevance Logic is \(2\)-{ExpTime}-Complete},
volume = {81},
number = {2},
pages = {641-661},
month = jun,
year = 2016,
url = {http://arxiv.org/abs/1402.0705},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Schmitz-jsl15.pdf},
doi = {10.1017/jsl.2015.7},
abstract = {We show that provability in the implicational fragment of
relevance logic is complete for doubly exponential time, using reductions
to and from coverability in branching vector addition systems.}
}
@inproceedings{FKM-syncop15,
address = {London, UK},
volume = 44,
series = {Open Access Series in Informatics},
month = apr,
year = 2015,
editor = {Andr{\'e}, {\'E}tienne and Frehse, Goran},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
acronym = {{SYNCOP}'15},
booktitle = {{P}roceedings of the 2nd {I}nternational {W}orkshop on {S}ynthesis
of {C}ontinuous {P}arameters ({SYNCOP}'15)},
author = {Fribourg, Laurent and K{\"u}hne, Ulrich and Markey, Nicolas},
title = {Game-based Synthesis of Distributed Controllers for Sampled Switched Systems},
pages = {47-61},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FKM-syncop15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FKM-syncop15.pdf},
doi = {10.4230/OASIcs.SynCoP.2015.47},
abstract = {Switched systems are a convenient formalism for modeling
physical processes interacting with a digital controller. Unfortunately,
the formalism does not capture the distributed nature encountered e.g. in
cyber-physical systems, which are organized as networks of elements
interacting with each other and with local controllers. Most current
methods for control synthesis can only produce a centralized controller,
which is assumed to have complete knowledge of all the component states
and can interact with all of them. In~this paper, we~consider a controller
synthesis method based on state space decomposition, and propose a
game-based approach in order to extend it within a distributed framework.}
}
@inproceedings{LDRCF-syncop15,
address = {London, UK},
volume = 44,
series = {Open Access Series in Informatics},
month = apr,
year = 2015,
editor = {Andr{\'e}, {\'E}tienne and Frehse, Goran},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
acronym = {{SYNCOP}'15},
booktitle = {{P}roceedings of the 2nd {I}nternational {W}orkshop on {S}ynthesis
of {C}ontinuous {P}arameters ({SYNCOP}'15)},
author = {Le{~}Co{\"e}nt, Adrien and De{~}Vuyst, Florian and Rey,
{\relax Ch}ristian and Chamoin, Ludovic and Fribourg, Laurent},
title = {Guaranteed control of switched control systems
using model order reduction and state-space bisection},
pages = {32-46},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LDCRF-syncop15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LDCRF-syncop15.pdf},
doi = {10.4230/OASIcs.SynCoP.2015.32},
abstract = {This paper considers discrete-time linear systems controlled by
a quantized law, i.e., a piecewise constant time function taking a finite
set of values. We show how to generate the control by, first, applying
model reduction to the original system, then using a {"}state-space
bisection{"} method for synthesizing a control at the reduced-order
level, and finally computing an upper bound to the deviations between the
controlled output trajectories of the reduced-order model and those of the
original model. The effectiveness of our approach is illustrated on
several examples of the literature.}
}
@inproceedings{ACD-post15,
address = {London, UK},
month = apr,
year = 2015,
volume = {9036},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Focardi, Riccardo and Myers, Andrew},
acronym = {{POST}'15},
booktitle = {{P}roceedings of the 4th {I}nternational {C}onference on
{P}rinciples of {S}ecurity and {T}rust
({POST}'15)},
author = {Arapinis, Myrto and Cheval, Vincent and Delaune, St{\'e}phanie},
title = {Composing security protocols: from confidentiality to privacy},
pages = {324-343},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ACD-post15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACD-post15.pdf},
doi = {10.1007/978-3-662-46666-7_17},
abstract = {Security protocols are used in many of our daily-life
applications, and our privacy largely depends on their design. Formal
verification techniques have proved their usefulness to analyse these
protocols, but they become so complex that modular techniques have to be
developed. We propose several results to safely compose security
protocols. We consider arbitrary primitives modeled using an equational
theory, and a rich process algebra close to the applied pi calculus.\par
Relying on these composition results, we derive some security properties
on a protocol from the security analysis performed on each of its
sub-protocols individually. We consider parallel composition and the case
of key-exchange protocols. Our results apply to deal with confidentiality
but also privacy-type properties (e.g. anonymity) expressed using a notion
of equivalence. We illustrate the usefulness of our composition results on
protocols from the 3G phone application and electronic passport.}
}
@techreport{KNS-arxiv14,
author = {Karandikar, Prateek and Niewerth, Matthias and Schnoebelen, {\relax Ph}ilippe},
title = {On the state complexity of closures and interiors of regular languages with subwords},
institution = {Computing Research Repository},
number = {1406.0690},
year = {2014},
month = nov,
type = {Research Report},
url = {http://arxiv.org/abs/1406.0690},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KNS-arxiv14.pdf},
note = {24~pages},
abstract = {We study the state complexity of the set of subwords and
superwords of regular languages, and provide new lower bounds in the case
of languages over a two-letter alphabet. We also consider the dual
interior sets, for which the nondeterministic state complexity has a
doubly-exponential upper bound. We prove a matching doubly-exponential
lower bound for downward interiors in the case of an unbounded alphabet.}
}
@phdthesis{scerri-phd15,
author = {Scerri, Guillaume},
title = {Proofs of security protocols revisited},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2015,
month = jan,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/scerri-phd15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/scerri-phd15.pdf}
}
@article{DD-jancl15,
publisher = {Taylor \& Francis},
journal = {Journal of Applied Non-Classical Logics},
author = {Demri, St{\'e}phane and Deters, Morgan},
title = {Separation Logics and Modalities: A~Survey},
volume = 25,
number = 1,
pages = {50-99},
year = 2015,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-jancl15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-jancl15.pdf},
doi = {10.1080/11663081.2015.1018801},
abstract = {Like modal logic, temporal logic, or description logic,
separation logic has become a popular class of logical formalisms in
computer science, conceived as assertion languages for Hoare-style proof
systems with the goal to perform automatic program analysis. In a broad
sense, separation logic is often understood as a programming language, an
assertion language and a family of rules involving Hoare triples. In this
survey, we present similarities between separation logic as an assertion
language and modal and temporal logics. Moreover, we propose a selection
of landmark results about decidability, complexity and expressive power.}
}
@article{DD-tocl15,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Demri, St{\'e}phane and Deters, Morgan},
title = {Two-variable separation logic and its inner circle},
volume = 16,
number = {2:15},
nopages = {},
month = mar,
year = 2015,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-tocl15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-tocl15.pdf},
doi = {10.1145/2724711},
abstract = {Separation logic is a well-known assertion language for
Hoare-style proof systems. We show that first-order separation logic with
a unique record field restricted to two quantified variables and no
program variables is undecidable. This is among the smallest fragments of
separation logic known to be undecidable, and this contrasts with
decidability of two-variable first-order logic. We also investigate its
restriction by dropping the magic wand connective, known to be decidable
with non-elementary complexity, and we show that the satisfiability
problem with only two quantified variables is not yet elementary
recursive. Furthermore, we establish insightful and concrete relationships
between two-variable separation logic and propositional in- terval
temporal logic (PITL), data logics, and modal logics, providing an inner
circle of closely-related logics.}
}
@inproceedings{KV-icdt15,
address = {Brussels, Belgium},
month = mar,
year = 2015,
volume = 31,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Arenas, Marcelo},
acronym = {{ICDT}'15},
booktitle = {{P}roceedings of the 18th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'15)},
author = {Koutsos, Adrien and Vianu, Victor},
title = {Process-Centric Views of Data-Driven Business Artifacts},
pages = {247-264},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KV-icdt15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KV-icdt15.pdf},
doi = {10.4230/LIPIcs.ICDT.2015.247},
abstract = {Declarative, data-aware workflow models are becoming
increasingly pervasive. While these have numerous benefits, classical
process-centric specifications retain certain advantages. Workflow
designers are used to development tools such as BPMN or UML diagrams, that
focus on control flow. Views describing valid sequences of tasks are also
useful to provide stake-holders with high-level descriptions of the
workflow, stripped of the accompanying data. In this paper we study the
problem of recovering process-centric views from declarative, data-aware
workflow specifications in a variant of IBM's business artifact model. We
focus on the simplest and most natural process-centric views, specified by
finite-state transition systems, and describing regular languages. The
results characterize when process-centric views of artifact systems are
regular, using both linear and branching-time semantics. We also study the
impact of data dependencies on regularity of the views.}
}
@inproceedings{NF-icdt15,
address = {Brussels, Belgium},
month = mar,
year = 2015,
volume = 31,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Arenas, Marcelo},
acronym = {{ICDT}'15},
booktitle = {{P}roceedings of the 18th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'15)},
author = {Francis, Nadime},
title = {Asymptotic Determinacy of Path Queries using Union-of-Paths Views},
pages = {44-59},
note = {Best student paper award},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/NF-icdt15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/NF-icdt15.pdf},
doi = {10.4230/LIPIcs.ICDT.2015.44},
abstract = {We consider the view determinacy problem over graph databases
for queries defined as (possibly infinite) unions of path queries. These
queries select pairs of nodes in a graph that are connected through a path
whose length falls in a given set. A~view specification is a set of such
queries. We~say that a view specification~\(\textbf{V}\) determines a
query~\(Q\) if, for all databases~\(D\), the answers to~\(\textbf{V}\)
on~\(D\) contain enough information to answer~\(Q\).\par
Our main result states that, given a view~\(\textbf{V}\), there exists an
explicit bound that depends on~\(\textbf{V}\) such that we can decide the
determinacy problem for all queries that ask for a path longer than this
bound, and provide first-order rewritings for the queries that are
determined. We call this notion asymptotic determinacy. As a corollary, we
can also compute the set of almost all path queries that are determined
by~\(\textbf{V}\).}
}
@article{AFG-sif15,
publisher = {SIF},
journal = {1024~-- Bulletin de la soci{\'e}t{\'e} informatique de France},
author = {Abiteboul, Serge and Fribourg, Laurent and
Goubault{-}Larrecq, Jean},
title = {{G}{\'e}rard {B}erry~: un~informaticien m{\'e}daille d'or du {CNRS}~2014},
volume = 4,
pages = {139-142},
month = oct,
year = 2014,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/AFG-sif15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AFG-sif15.pdf},
abstract = {C'est un chercheur en informatique qui vient de recevoir la
m{\'e}daille d'or du CNRS, la plus haute distinction scientifique fran{\c
c}aise toutes disciplines confondues. Les informaticiens sont rares {\`a}
avoir {\'e}t{\'e} ainsi honor{\'e}s : ce n'est que la seconde fois
apr{\`e}s Jacques Stern en~2006.}
}
@inproceedings{RRS-vmcai15,
address = {Mumbai, India},
month = jan,
year = 2015,
volume = 8931,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {D'Souza, Deepak and Lal, Akash and Larsen, Kim Guldstrand},
acronym = {{VMCAI}'15},
booktitle = {{P}roceedings of the 16th {I}nternational {C}onference on
{V}erification, {M}odel {C}hecking and {A}bstract {I}nterpretation
({VMCAI}'15)},
author = {Randour, Mickael and Raskin, Jean-Fran{\c{c}}ois and
Sankur, Ocan},
title = {Variations on the Stochastic Shortest Path Problem},
pages = {1-18},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/RRS-vmcai15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/RRS-vmcai15.pdf},
doi = {10.1007/978-3-662-46081-8_1},
abstract = {In this invited contribution, we revisit the stochastic shortest
path problem, and show how recent results allow one to improve over the
classical solutions: we present algorithms to synthesize strategies with
multiple guarantees on the distribution of the length of paths reaching a
given target, rather than simply minimizing its expected value. The
concepts and algorithms that we propose here are applications of more
general results that have been obtained recently for Markov decision
processes and that are described in a series of recent papers.}
}
@article{VCDHRR-icomp15,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Velner, Yaron and Chatterjee, Krishnendu and Doyen, Laurent
and Henzinger, Thomas A. and Rabinovich, Alexander Moshe and
Raskin, Jean-Fran{\c{c}}ois},
title = {The complexity of multi-mean-payoff and multi-energy games},
year = 2015,
month = apr,
volume = 241,
pages = {177-196},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDRR-icomp15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDRR-icomp15.pdf},
doi = {10.1016/j.ic.2015.03.001},
abstract = {In mean-payoff games, the objective of the protagonist is to
ensure that the limit average of an infinite sequence of numeric weights
is nonnegative. In energy games, the objective is to ensure that the
running sum of weights is always nonnegative. Multi-mean-payoff and
multi-energy games replace individual weights by tuples, and the limit
average (resp., running sum) of each coordinate must be (resp.,~remain)
nonnegative. We prove finite-memory determinacy of multi-energy games and
show inter-reducibility of multi-mean-payoff and multi-energy games for
finite-memory strategies. We improve the computational complexity for
solving both classes with finite-memory strategies: we prove
coNP-completeness improving the previous known \textsf{EXPSPACE} bound.
For memoryless strategies, we show that deciding the existence of a
winning strategy for the protagonist is NP-complete. We present the first
solution of multi-mean-payoff games with infinite-memory strategies: we
show that mean-payoff-sup objectives can be decided in
\textsf{NP}{{\(\cap\)}}\textsf{coNP}, whereas mean-payoff-inf objectives
are coNP-complete.}
}
@article{CDRR-icomp15,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Chatterjee, Krishnendu and Doyen, Laurent and Randour, Mickael and
Raskin, Jean-Fran{\c{c}}ois},
title = {Looking at Mean-Payoff and Total-Payoff through Windows},
year = 2015,
month = jun,
volume = 242,
pages = {25-52},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDRR-icomp15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDRR-icomp15.pdf},
doi = {10.1016/j.ic.2015.03.010},
abstract = {We consider two-player games played on weighted directed graphs
with mean-payoff and total-payoff objectives, two classical quantitative
objectives. While for single-dimensional games the complexity and memory
bounds for both objectives coincide, we show that in contrast to
multi-dimensional mean-payoff games that are known to be coNP-complete,
multi-dimensional total-payoff games are undecidable. We introduce
conservative approximations of these objectives, where the payoff is
considered over a local finite window sliding along a play, instead of the
whole play. For single dimension, we show that (i)~if the window size is
polynomial, deciding the winner takes polynomial time, and (ii)~the
existence of a bounded window can be decided in
\(\textsf{NP}\cap\textsf{coNP}\), and is at least as hard as solving
mean-payoff games. For multiple dimensions, we show that (i)~the problem
with fixed window size is EXPTIME-complete, and (ii)~there is no
primitive-recursive algorithm to decide the existence of a bounded
window.}
}
@inproceedings{GLO-fps13,
address = {La Rochelle, France},
month = oct,
year = 2013,
volume = 8352,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Danger, Jean-Luc and Debbabi, Mourad and Marion, Jean-Yves and
Garcia{-}Alfaro, Joaquin and Zincir{-}Heywood,Nur},
acronym = {{FPS}'13},
booktitle = {{R}evised {S}elected {P}apers of the 6th {I}nternational {S}ymposium on
{F}oundations and {P}ractice of {S}ecurity ({FPS}'13)},
author = {Goubault{-}Larrecq, Jean and Olivain, Julien},
title = {On~the Efficiency of Mathematics in Intrusion
Detection: The NetEntropy Case.},
pages = {3-16},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GLO-fps13.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GLO-fps13.pdf},
doi = {10.1007/978-3-319-05302-8_1},
abstract = {NetEntropy is a plugin to the Orchids intrusion detection tool
that is originally meant to detect some subtle attacks on implementations
of cryptographic protocols such as {SSL\slash TLS}. NetEntropy compares
the sample entropy of a data stream to a known profile, and flags any
significant variation. Our point is to stress the \emph{mathematics} behind
NetEntropy: the reason of the rather incredible precision of NetEntropy is
to be found in theorems due to Paninski and Moddemeijer.}
}
@inproceedings{MA-bda14,
address = {Autrans, France},
month = oct,
year = 2014,
editor = {Gross-Amblard, David and Collet, {\relax Ch}ristine and
Bobineau, {\relax Ch}ristophe and Jouanot, Fabrice},
acronym = {{BDA}'14},
booktitle = {{A}ctes de la 30{\`e}me {C}onf{\'e}rence sur la {G}estion de
{D}onn{\'e}es~-- {P}rincipes, {T}echnologies et
{A}pplications ({BDA}'14)},
author = {Montoya, David and Abiteboul, Serge},
title = {Inf{\'e}rence d'itin{\'e}raires multimodaux {\`a}~partir de donn{\'e}es
smartphone},
pages = {38-42},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/MA-bda14.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/MA-bda14.pdf},
abstract = {We designed a system to infer the multimodal itineraries
traveled by a user from a combination of smartphone sensor data (e.g.,
GPS, Wi-Fi, inertial sensors), personal information, and knowledge of the
transport network topology (e.g., maps, transportation timetables). The
system operates with a Multimodal Transport Network that captures the set
of admissible multimodal itineraries, i.e., paths of this network with
weights providing the statistics (expected time and variance) of the
paths. The network takes into account public transportation schedules. Our
Multimodal Transport Network is constructed from publicly available
transport data of Paris and its neighbourhoods published by different
transport agencies and map organizations. The system models sensor
uncertainty with probabilities, and the likelihood that a multimodal
itinerary was taken by the user is captured in a Dynamic Bayesian Network.
For this demonstration, we captured data from users travelling over the
Paris region who were asked to record data for different trips via an
Android application. After uploading their data into our system, a set of
most likely itineraries is computed for each trip. For each trip, the
system displays recognized multimodal itineraries and their estimated
likelihood over an interactive map.}
}
@article{GJL-tocl15,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {G{\"o}ller, Stefan and Jung, Jean Christoph and Lohrey,
Markus},
title = {The Complexity of Decomposing Modal and First-Order
Theories},
volume = 16,
number = {1:9},
nopages = {},
month = mar,
year = 2015,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GJL-tocl15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GJL-tocl15.pdf},
doi = {10.1145/2699918},
abstract = {We study the satisfiability problem of the logic
\(\textbf{K}^{2}=\textbf{K}\times\textbf{K}\), i.e., the two-dimensional
variant of unimodal logic, where models are restricted to asynchronous
products of two Kripke frames. Gabbay and Shehtman proved in 1998 that
this problem is decidable in a tower of exponentials. So far the best
known lower bound is NEXP-hardness shown by Marx and Mikul\'as in~2001.\par
Our first main result closes this complexity gap: We show that
satisfiability in~\(\textbf{K}^{2}\) is nonelementary. More precisely, we
prove that it is \(k\)-NEXP-complete, where \(k\) is the switching depth
(the~minimal modal rank among the two dimensions) of the input formula,
hereby solving a conjecture of Marx and Mikul\'as. Using our lower-bound
technique allows us to derive also nonelementary lower bounds for the
two-dimensional modal logics \(\textbf{K}^{4}\times\textbf{K}\) and
\(\textbf{S5}_{2}\times\textbf{K}\) for which only elementary
lower bounds were previously known.\par
Moreover, we apply our technique to prove nonelementary lower bounds for
the sizes of Feferman-Vaught decompositions with respect to product for
any decomposable logic that is at least as expressive as unimodal\(\textbf{K}\),
generalizing a recent result by the first author and~Lin. For the
three-variable fragment \(\textsf{FO}^3\) of first-order logic, we obtain the following
immediate corollaries: (i)~the~size of Feferman-Vaught decompositions with
respect to disjoint sum are inherently nonelementary and (ii)~equivalent
formulas in Gaifman normal form are inherently nonelementary.\par
Our second main result consists in providing effective elementary (more
precisely, doubly exponential) upper bounds for the two-variable fragment
\(\textsf{FO}^2\) of first-order logic both for Feferman-Vaught
decompositions and for equivalent formulas in Gaifman normal form.}
}
@misc{qcover16,
author = {Blondin, Michael and Finkel, Alain and Haase, Christoph and Haddad, Serge},
title = {{QCover: an efficient coverability verifier for discrete and continuous Petri nets}},
url = {https://github.com/blondimi/qcover},
year = {2016}
}
@phdthesis{theissing-PhD16,
author = {Theissing, Simon},
title = {Supervision in Multi-Modal Transportation System},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = {2016},
month = dec,
url = {https://tel.archives-ouvertes.fr/tel-01419126},
pdf = {https://hal.inria.fr/tel-01419126v3/document}
}
@article{BCEZ-dmtcs2016,
journal = {Discrete Mathematics \& Theoretical Computer Science},
author = {Brough, Tara and Ciobanu, Laura and Elder, Murray and Zetzsche, Georg},
title = {{Permutations of context-free, ET0L and indexed languages}},
volume = {17},
number = {3},
year = {2016},
month = may,
pages = {167-178},
url = {https://dmtcs.episciences.org/2164},
pdf = {https://arxiv.org/pdf/1604.05431.pdf}
}
@inproceedings{DLV-pods16,
acronym = {{PODS}'16},
publisher = {ACM Press},
month = jun,
booktitle = {{P}roceedings of the 35th {ACM} {SIGMOD-SIGACT-SIGAI} {S}ymposium on {P}rinciples of {D}atabase {S}ystems ({PODS}'16)},
title = {{P}roceedings of the 35th {ACM} {SIGMOD-SIGACT-SIGAI} {S}ymposium on {P}rinciples of {D}atabase {S}ystems ({PODS}'16)},
address = {San Francisco, California, USA},
abstract = {Data-driven workflows, of which IBM's Business
Artifacts are a prime exponent, have been
successfully deployed in practice, adopted in
industrial standards, and have spawned a rich body
of research in academia, focused primarily on static
analysis. The present work represents a significant
advance on the problem of artifact verification, by
considering a much richer and more realistic model
than in previous work, incorporating core elements
of IBM's successful Guard-Stage-Milestone model. In
particular, the model features task hierarchy,
concurrency, and richer artifact data. It also
allows database key and foreign key dependencies, as
well as arithmetic constraints. The results show
decidability of verification and establish its
complexity, making use of novel techniques including
a hierarchy of Vector Addition Systems and a variant
of quantifier elimination tailored to our context.},
author = {Deutsch, Alin and Li, Yuliang and Vianu, Victor},
pages = {179-194},
doi = {10.1145/2902251.2902275},
year = {2016}
}
@inproceedings{BJ-fossacs17,
address = {Uppsala, Sweden},
month = apr,
year = 2017,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Esparza, Javier and Murawski, Andrzej},
acronym = {{FoSSaCS}'17},
booktitle = {{P}roceedings of the 20th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'17)},
author = {Bouyer, Patricia and Jug{\'e}, Vincent},
title = {Dynamic Complexity of the {D}yck Reachability},
pages = {265-280},
url = {https://arxiv.org/abs/1610.07499},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BJ-fossacs17.pdf},
doi = {10.1007/978-3-662-54458-7_16},
abstract = {Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete edges. We show a strong dichotomy between such problems, based on the size of the Dyck alphabet. Some of them are P-complete (under a strong notion of reduction) while the others lie either in DynFO or in NL.}
}
@inproceedings{BHMRZ-fossacs17,
address = {Uppsala, Sweden},
month = apr,
year = 2017,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Esparza, Javier and Murawski, Andrzej},
acronym = {{FoSSaCS}'17},
booktitle = {{P}roceedings of the 20th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'17)},
author = {Bouyer, Patricia and Hofman, Piotr and Markey, Nicolas and Randour, Mickael and Zimmermann, Martin},
title = {Bounding Average-energy Games},
pages = {179-195},
url = {https://arxiv.org/abs/1610.07858},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHMRZ-fossacs17.pdf},
doi = {10.1007/978-3-662-54458-7_11},
abstract = {We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. Decidability of average-energy games with a lower-bound constraint on the energy level (but no upper bound) is an open problem; in particular, there is no known upper bound on the memory that is required for winning strategies.
By reducing average-energy games with lower-bounded energy to infinite-state mean-payoff games and analyzing the frequency of low-energy configurations, we show an almost tight doubly-exponential upper bound on the necessary memory, and that the winner of average-energy games with lower-bounded energy can be determined in doubly-exponential time. We also prove EXPSPACE-hardness of this problem.
Finally, we consider multi-dimensional extensions of all types of average-energy games: without bounds, with only a lower bound, and with both a lower and an upper bound on the energy. We show that the fully-bounded version is the only case to remain decidable in multiple dimensions.}
}
@article{J-ijac16,
publisher = {World Scientific},
journal = {International Journal of Algebra and Computation},
author = {Jug{\'e}, Vincent},
title = {The Relaxation Normal Form of Braids is Regular},
volume = {27},
number = {1},
year = {2017},
pages = {61-106},
month = feb,
url = {https://arxiv.org/abs/1507.03248},
doi = {10.1142/S0218196717500059},
abstract = {Braids can be represented geometrically as laminations of punctured disks. The geometric complexity of a braid is the minimal complexity of a lamination that represents it, and tight laminations are representatives of minimal complexity. These laminations give rise to a normal form of braids, via a relaxation algorithm. We study here this relaxation algorithm and the associated normal form. We prove that this normal form is regular and prefix-closed. We provide an effective construction of a deterministic automaton that recognizes this normal form.}
}
@inproceedings{BGHH-stacs17,
address = {Hannover, Germany},
month = mar,
year = 2017,
volume = {},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Vall{\'e}e, Brigitte and Vollmer, Heribert},
acronym = {{STACS}'17},
booktitle = {{P}roceedings of the 34th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'17)},
author = {B{\"o}hm, Stanislav and G{\"o}ller, Stefan and Halfon, Simon and Hofman, Piotr},
title = {On B{\"u}chi one-counter automata},
pages = {14:1-14:13},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=7019},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/7019/pdf/LIPIcs-STACS-2017-14.pdf},
doi = {10.4230/LIPIcs.STACS.2017.14},
abstract = {Equivalence of deterministic pushdown automata is a famous problem in theoretical computer science whose decidability has been shown by S{\'e}nizergues. Our first result shows that decidability no longer holds when moving from finite words to infinite words. This solves an open problem that has recently been raised by L{\"o}ding. In fact, we show that already the equivalence problem for deterministic B{\"u}chi one-counter automata is undecidable. Hence, the decidability border is rather tight when taking into account a recent result by L{\"o}ding and Repke that equivalence of deterministic weak parity pushdown automata (a subclass of deterministic B{\"u}chi pushdown automata) is decidable. Another known result on finite words is that the universality problem for vector addition systems is decidable. We show undecidability when moving to infinite words. In fact, we prove that already the universality problem for nondeterministic B{\"u}chi one-counter nets (or equivalently vector addition systems with one unbounded dimension) is undecidable.}
}
@inproceedings{CG-stacs17,
address = {Hannover, Germany},
month = mar,
year = 2017,
volume = {},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Vall{\'e}e, Brigitte and Vollmer, Heribert},
acronym = {{STACS}'17},
booktitle = {{P}roceedings of the 34th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'17)},
author = {Carayol, Arnaud and G{\"o}ller, Stefan},
title = {On long words avoiding Zimin patterns},
pages = {19:1-19:13},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=7014},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/7014/pdf/LIPIcs-STACS-2017-19.pdf},
doi = {10.4230/LIPIcs.STACS.2017.19},
abstract = {A pattern is encountered in a word if some infix of the word is the image of the pattern under some non-erasing morphism. A pattern p is unavoidable if, over every finite alphabet, every sufficiently long word encounters p. A theorem by Zimin and independently by Bean, Ehrenfeucht and McNulty states that a pattern over n distinct variables is unavoidable if, and only if, p itself is encountered in the n-th Zimin pattern. Given an alphabet size k, we study the minimal length f(n,k) such that every word of length f(n,k) encounters the n-th Zimin pattern. It is known that f is upper-bounded by a tower of exponentials. Our main result states that f(n,k) is lower-bounded by a tower of n-3 exponentials, even for k=2. To the best of our knowledge, this improves upon a previously best-known doubly-exponential lower bound. As a further result, we prove a doubly-exponential upper bound for encountering Zimin patterns in the abelian sense.}
}
@inproceedings{LZ-stacs17,
address = {Hannover, Germany},
month = mar,
year = 2017,
volume = {},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Vall{\'e}e, Brigitte and Vollmer, Heribert},
acronym = {{STACS}'17},
booktitle = {{P}roceedings of the 34th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'17)},
author = {Lohrey, Markus and Zetzsche, Georg},
title = {The Complexity of Knapsack in Graph Groups},
pages = {52:1-52:14},
doi = {10.4230/LIPIcs.STACS.2017.52},
abstract = {Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In LohreyZ16 the authors proved that for each graph group, the knapsack problem can be solved in NP. Here, we determine the exact complexity of the problem for every graph group. While the problem is TC0-complete for complete graphs, it is LogCFL-complete for each (non-complete) transitive forest. For every remaining graph, the problem is NP-complete.}
}
@phdthesis{mvdb-phd2016,
author = {Van{ }den{ }Bogaard, Marie},
title = {Motifs de Flot d'Information dans les Jeux {\`a} Information Imparfaite},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2016,
month = nov,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/mvdb-phd16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/mvdb-phd16.pdf}
}
@mastersthesis{m2-jacomme,
author = {Jacomme, Charlie},
title = {Automated applications of Cryptographic Assumptions},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2016},
month = sep,
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-jacomme.pdf}
}
@mastersthesis{m2-lehaut,
author = {Lehaut, Mathieu},
title = {PDL on infinite alphabet},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2016},
month = aug,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-lehaut.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-lehaut.pdf},
note = {19~pages}
}
@article{HHMS-jcss16,
publisher = {Elsevier Science Publishers},
journal = {Journal of Computer and System Sciences},
author = {Stefan Haar and
Serge Haddad and
Tarek Melliti and
Stefan Schwoon},
title = {Optimal constructions for active diagnosis},
pages = {101-120},
volume = {83},
number = {1},
year = {2017},
doi = {10.1016/j.jcss.2016.04.007},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HHMS-jcss16.pdf},
abstract = {Diagnosis is the task of detecting fault occurrences in a partially observed sys- tem. Depending on the possible observations, a discrete-event system may be diagnosable or not. Active diagnosis aims at controlling the system to render it diagnosable. Past research has proposed solutions for this problem, but their complexity remains to be improved. Here, we solve the decision and synthesis problems for active diagnosability, proving that (1) our procedures are optimal with respect to computational complexity, and (2) the memory required for our diagnoser is minimal. We then study the delay between a fault occurrence and its detection by the diagnoser. We construct a memory-optimal diagnoser whose delay is at most twice the minimal delay, whereas the memory required to achieve optimal delay may be highly greater. We also provide a solution for parametrized active diagnosis, where we automatically construct the most permissive controller respecting a given delay.}
}
@article{BKM-tocs17,
publisher = {Springer},
journal = {Theory of Computing Systems},
author = {Bollig, Benedikt and
Kuske, Dietrich and
Mennicke, Roy},
title = {The Complexity of Model Checking Multi-Stack Systems},
volume = {60},
number = {4},
pages = {695-736},
year = {2017},
url = {http://link.springer.com/article/10.1007/s00224-016-9700-6?wt_mc=Internal.Event.1.SEM.ArticleAuthorOnlineFirst},
doi = {10.1007/s00224-016-9700-6},
abstract = {We study the linear-time model checking problem for boolean concurrent programs with recursive procedure calls. While sequential recursive programs are usually modeled as pushdown automata, concurrent recursive programs involve several processes and can be naturally abstracted as pushdown automata with multiple stacks. Their behavior can be understood as words with multiple nesting relations, each relation connecting a procedure call with its corresponding return. To reason about multiply nested words, we consider the class of all temporal logics as defined in the book by Gabbay, Hodkinson, and Reynolds. The unifying feature of these temporal logics is that their modalities are defined in monadic second-order (MSO) logic. In particular, this captures numerous temporal logics over concurrent and/or recursive programs that have been defined so far. Since the general model checking problem is undecidable, we restrict attention to phase bounded executions as proposed by La Torre, Madhusudan, and Parlato. While the MSO model checking problem in this case is non-elementary, our main result states that the model checking (and satisfiability) problem for all MSO-definable temporal logics is decidable in elementary time. More precisely, it is solvable in time exponential in the formula and (n+2)-fold exponential in the number of phases where n is the maximal level of the MSO modalities in the monadic quantifier alternation hierarchy (which is a vast improvement over the conference version of this paper from LICS 2013 where the space was also (n+2)-fold exponential in the size of the temporal formula). We complement this result and provide, for each level n, a temporal logic whose model checking problem is n-EXPSPACE-hard.}
}
@article{DH-jlamp16,
publisher = {Elsevier Science Publishers},
journal = {Journal of Logic and Algebraic Methods in Programming},
author = {Delaune, St{\'e}phanie and Hirschi, Lucca},
title = {A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols},
volume = {87},
year = {2016},
pages = {127-144},
url = {http://www.sciencedirect.com/science/article/pii/S235222081630133X},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DH-jlamp16.pdf},
doi = {10.1016/j.jlamp.2016.10.005},
note = {To~appear},
abstract = {Cryptographic protocols aim at securing communications over insecure networks such as the Internet, where dishonest users may listen to communications and interfere with them. A secure communication has a different meaning depending on the underlying application. It ranges from the confidentiality of a data to e.g. verifiability in electronic voting systems. Another example of a security notion is privacy. Formal symbolic models have proved their usefulness for analysing the security of protocols. Until quite recently, most results focused on trace properties like confidentiality or authentication. There are however several security properties, which cannot be defined (or cannot be naturally defined) as trace properties and require a notion of behavioural equivalence. Typical examples are anonymity, and privacy related properties. During the last decade, several results and verification tools have been developed to analyse equivalence-based security properties. We propose here a synthesis of decidability and undecidability results for equivalence-based security properties. Moreover, we give an overview of existing verification tools that may be used to verify equivalence-based security properties.}
}
@techreport{BGMS-arxiv16,
author = {Beame, Paul and
Grosshans, Nathan and
McKenzie, Pierre and
Segoufin, Luc},
title = {Nondeterminism and an abstract formulation of {N}eciporuk's lower
bound method},
institution = {Computing Research Repository},
number = {1608.01932},
year = {2016},
url = {http://arxiv.org/abs/1608.01932},
pdf = {http://arxiv.org/abs/1608.01932},
month = aug,
type = {Research Report},
note = {34~pages}
}
@article{BMPS-rts16,
publisher = {Kluwer Academic Publishers},
journal = {Real-Time Systems},
author = {Bouyer, Patricia and Markey, Nicolas and Perrin,
Nicolas and Schlehuber{-}Caissier, Philipp},
title = {Timed automata abstraction of switched dynamical
systems using control funnels},
volume = {53},
number = {3},
year = {2017},
pages = {327-353},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMPS-rts16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMPS-rts16.pdf},
doi = {10.1007/s11241-016-9262-3},
abstract = {The development of formal methods for control design
is an important challenge with potential
applications in a wide range of safety-critical
cyber-physical systems. Focusing on switched
dynamical systems, we propose a new abstraction,
based on time-varying regions of invariance (control
funnels), that models behaviors of systems as timed
automata. The~main advantage of this method is that
it allows for the automated verification and
reactive controller synthesis without discretizing
the evolution of the state of the system. Efficient
and analytic constructions are possible in the case
of linear dynamics whereas bounding funnels with
conjectured properties based on numerical
simulations can be used for general nonlinear
dynamics. We~demonstrate the potential of our
approach with three examples.}
}
@inproceedings{MPAS-cikm16,
address = {Indianapolis, Indiana, USA},
month = oct,
publisher = {ACM},
acronym = {{CIKM}'16},
booktitle = {{P}roceedings of the 25th {ACM} {I}nternational {C}onference on {I}nformation and {K}nowledge {M}anagement ({CIKM}'16)},
author = {Montoya, David and
Pellissier Tanon, Thomas and
Abiteboul, Serge and
Suchanek, Fabian},
title = {{T}hymeflow, {A} {P}ersonal {K}nowledge {B}ase with {S}patio-temporal {D}ata},
pages = {2477-2480},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/MPAS-cikm16.pdf},
year = {2016},
doi = {10.1145/2983323.2983337},
abstract = {The typical Internet user has data spread over several devices
and across several online systems. We demonstrate an
open-source system for integrating user's data from di erent
sources into a single Knowledge Base. Our system integrates
data of di erent kinds into a coherent whole, starting with
email messages, calendar, contacts, and location history. It
is able to detect event periods in the user's location data and
align them with calendar events. We will demonstrate how
to query the system within and across di erent dimensions,
and perform analytics over emails, events, and locations.}
}
@mastersthesis{m2-lick,
author = {Lick, Anthony},
title = {Syst{\`e}mes de preuves pour logiques modales},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2016},
month = aug,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-lick.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/m2-lick.pdf},
note = {20~pages}
}
@phdthesis{blondin-phd2016,
author = {Blondin, Michael},
title = {Algorithmique et complexit{\'e} des syst{\`e}mes {\`a}
compteurs},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France and Universit{\'e} de Montr{\'e}al},
type = {Th{\`e}se de doctorat},
year = {2016},
month = jun,
url = {https://tel.archives-ouvertes.fr/tel-01359000/}
}
@phdthesis{mohamed-PhD16,
author = {Mohamed, Sameh},
title = {Une m{\'e}thode topologique pour la recherche d'ensembles invariants de syst{\`e}mes
continus et {\`a} commutation},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = {2016},
month = oct,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/mohamed-phd16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/mohamed-phd16.pdf}
}
@phdthesis{C-phd2016,
author = {Cauderlier, Rapha{\"e}l},
title = {{Object-Oriented Mechanisms for Interoperability between Proof Systems}},
school = {{Conservatoire National Des Arts et M{\'e}tiers, Paris}},
type = {Th{\`e}se de doctorat},
year = 2016,
month = oct,
url = {https://hal.inria.fr/tel-01415945/},
pdf = {https://hal.inria.fr/tel-01415945/file/main.pdf}
}
@book{DGL-cup2016,
author = {Demri, St{\'e}phane and Goranko, Valentin and Lange, Martin},
title = {{T}emporal {L}ogics in {C}omputer {S}cience},
publisher = {Cambridge University Press},
series = {Cambridge Tracts in Theoretical Computer Science},
volume = {58},
year = {2016},
month = oct,
url = {http://www.cambridge.org/9781107028364},
isbn = {9781107028364}
}
@inproceedings{HHKLL-syncop16,
address = {Eindhoven, The Netherlands},
month = apr,
year = 2016,
volume = 220,
series = {Electronic Proceedings in Theoretical Computer Science},
acronym = {{C}assting/{SYNCOP}'16},
booktitle = {{P}roceedings of the {C}assting {W}orkshop on {G}ames for the {S}ynthesis of {C}omplex
{S}ystems and 3rd {I}nternational {W}orkshop on {S}ynthesis of {C}omplex {P}arameters
({C}assting/{SYNCOP}'16)},
author = {Hutagalung, Milka and
Hundeshagen, Norbert and
Kuske, Dietrich and
Lange, Martin and
Lozes, {\'{E}}tienne},
title = {Two-Buffer Simulation Games},
pages = {213-227},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HHKLL-syncop16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HHKLL-syncop16.pdf},
doi = {10.4204/EPTCS.220.3},
abstract = {We consider simulation games played between Spoiler and Duplicator on two B{\"u}chi
automata in which the choices made by Spoiler can be buffered by Duplicator in two different buffers
before she executes them on her structure. Previous work on such games using a single buffer has
shown that they are useful to approximate language inclusion problems. We study the decidability and
complex- ity and show that games with two buffers can be used to approximate corresponding problems on
finite transducers, i.e. the inclusion problem for rational relations over infinite words.}
}
@inproceedings{HHKLL-gandalf16,
address = {Catania, Italy},
month = sep,
year = 2016,
volume = {226},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Cantone, Domenico and Delzanno, Giorgio},
acronym = {{GandALF}'16},
booktitle = {{P}roceedings of the 7th {I}nternational {S}ymposium
on {G}ames, {A}utomata, {L}ogics, and {F}ormal {V}erification
({GandALF}'16)},
author = {Hutagalung, Milka and
Hundeshagen, Norbert and
Kuske, Dietrich and
Lange, Martin and
Lozes, {\'{E}}tienne},
title = {Multi-Buffer Simulations for Trace Language Inclusion},
pages = {213-227},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HHKLL-gandalf16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HHKLL-gandalf16.pdf},
doi = {10.4204/EPTCS.226.15},
abstract = {We consider simulation games played between Spoiler and Duplicator on two B{\"u}chi automata in
which the choices made by Spoiler can be buffered by Duplicator in several bu ers before she executes
them on her structure. We show that the simulation games are useful to approximate the
inclusion of trace closures of languages accepted by finite-state automata, which is known to be undecidable.
We study the decidability and complexity and show that the game with bounded buffers
can be decided in polynomial time, whereas the game with one unbounded and one bounded buffer is
highly undecidable. We also show some sufficient conditions on the automata for Duplicator to win
the game (with unbounded buffers).}
}
@inproceedings{Halmagrand-ictac16,
address = {Taipei, Taiwan},
month = oct,
volume = 9965,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Alves Sampaio, Cesar and Wang, Farn},
acronym = {{ICTAC}'16},
booktitle = {{P}roceedings of the 13th {I}nternational {C}olloquium on
{T}heoretical {A}spects of {C}omputing ({ICTAC}'16)},
author = {Halmagrand, Pierre},
title = {{{Soundly Proving B Method Formulae Using Typed Sequent Calculus}}},
pages = {196-213},
year = {2016},
doi = {10.1007/978-3-319-46750-4_12},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Halmagrand-ictac2016.pdf},
url = {https://hal.archives-ouvertes.fr/hal-01342849},
abstract = {The B Method is a formal method mainly used in the railway industry to specify and develop safety-critical software.
To guarantee the consistency of a B project, one decisive challenge is to show correct a large amount of proof obligations, which are mathematical formulae
expressed in a classical set theory extended with a specific type system. To improve automated theorem proving in the B Method, we propose to use a
first-order sequent calculus extended with a polymorphic type system, which is in particular the output proof-format of the tableau-based automated
theorem prover Zenon. After stating some modifications of the B syntax and defining a sound elimination of comprehension sets, we propose a
translation of B formulae into a polymorphic first-order logic format. Then, we introduce the typed sequent calculus used by Zenon, and show
that Zenon proofs can be translated to proofs of the initial B formulae in the B proof system.}
}
@techreport{PS-arxiv16,
author = {Place, Thomas and
Segoufin, Luc},
title = {Decidable Characterization of FO2(<, +1) and locality of
{DA}},
institution = {Computing Research Repository},
number = {1606.03217},
year = {2016},
url = {http://arxiv.org/abs/1606.03217},
pdf = {http://arxiv.org/abs/1606.03217},
month = jun,
type = {Research Report},
note = {8~pages}
}
@article{JSD-lmcs16,
journal = {Logical Methods in Computer Science},
author = {Jacquemard, Florent and
Segoufin, Luc and
Dimino, Jer{\'{e}}mie},
title = {FO2(<, +1,{\textasciitilde}) on data trees, data tree automata
and branching vector addition systems},
volume = {12},
number = {2},
pages = {1-28},
year = {2016},
url = {http://www.lmcs-online.org/ojs/viewarticle.php?id=1789&layout=abstract},
doi = {10.2168/LMCS-12(2:3)2016},
pdf = {https://arxiv.org/pdf/1601.01579.pdf},
abstract = {}
}
@techreport{arxiv16-BFMK,
author = {Blondin, Michael and Finkel, Alain and McKenzie, Pierre},
title = {Well Behaved Transition Systems},
institution = {Computing Research Repository},
number = {1608.02636},
year = {2016},
month = aug,
type = {Research Report},
url = {http://arxiv.org/abs/1608.02636},
pdf = {http://arxiv.org/abs/1608.02636},
note = {18~pages},
abstract = {The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem. We show coverability decidable for monotone transition systems that only require the absence of infinite antichains and call well behaved transitions systems (WBTS) the new strict superclass of the class of WSTS that arises. By contrast, we confirm that boundedness and termination are undecidable for WBTS under the usual hypotheses, and show that stronger monotonicity conditions can enforce decidability. Proofs are similar or even identical to existing proofs but the surprising message is that a hypothesis implicitely assumed minimal for twenty years in the theory of WSTS can meaningfully be relaxed, allowing more orderings to be handled in an abstract way.}
}
@inproceedings{vDCC-EMISA16,
address = {Vienna, Austria},
month = oct,
publisher = {{CEUR-WS.org}},
volume = {1701},
series = {{CEUR} Workshop Proceedings},
editor = {Rinderle-Ma, Stefanie and Mendling, Jan},
acronym = {{EMISA}'16},
booktitle = {{P}roceedings of the 7th {I}nt. {W}orkshop on {E}nterprise {M}odelling and {I}nformation {S}ystems {A}rchitectures
({EMISA}'16)},
author = {van Dongen, Boudewijn and Carmona, Josep and Chatain, {\relax Th}omas},
title = {{Alignment-based Quality Metrics in Conformance Checking}},
pages = {87-90},
year = {2016},
doi = {},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/vanDongen-EMISA16.pdf},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/vanDongen-EMISA16.pdf},
abstract = {The holy grail in process mining is a process discovery algorithm that, given an event
log, produces fitting, precise, properly generalizing and simple process models. Within the field of
process mining, conformance checking is considered to be anything where observed behaviour, e.g.,
in the form of event logs or event streams, needs to be related to already modelled behaviour.
In the conformance checking domain, the relation between an event log and a model is typically
quantified using fitness, precision and generalization. In this paper, we present metrics for fitness,
precision and generalization, based on alignments and the newer concept named anti-alignments.}
}
@article{GLSSW-dagrep16,
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
journal = {Dagstuhl Reports},
author = {Goubault{-}Larrecq, Jean and Seisenberger, Monika and Selivanov, Victor and Weiermann, Andreas},
title = {Well {Q}uasi-{O}rders in {C}omputer {S}cience ({D}agstuhl {S}eminar
16031)},
year = 2016,
month = jan,
volume = {6},
number = {1},
pages = {69-98},
url = {http://dx.doi.org/10.4230/DagRep.6.1.69},
pdf = {http://dx.doi.org/10.4230/DagRep.6.1.69},
doi = {10.4230/DagRep.6.1.69},
abstract = {This report documents the program and the outcomes of Dagstuhl Seminar 16031 {"}Well Quasi{-}Orders in Computer
Science{"}, the first seminar devoted to the multiple and deep interactions between the theory of Well quasi{-}orders
(known as the Wqo{-}Theory) and several fields of Computer Science (Verification and Termination of Infinite-State Systems,
Automata and Formal Languages, Term Rewriting and Proof Theory, topological complexity of computational problems on continuous
functions). Wqo{-}Theory is a highly developed part of Combinatorics with ever-growing number of applications in Mathematics and
Computer Science, and Well quasi-orders are going to become an important unifying concept of Theoretical Computer Science.
In this seminar, we brought together several communities from Computer Science and Mathematics in order to facilitate the
knowledge transfer between Mathematicians and Computer Scientists as well as between established and younger researchers and thus
to push forward the interaction between Wqo{-}Theory and Computer Science.}
}
@inproceedings{MHP-HSB16,
address = {Grenoble France},
month = oct,
optvolume = 9957,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
opteditor = {Cinquemani, Eugenio and
Donz{\'{e}, Alexandre}},
acronym = {{HSB}'16},
booktitle = {{P}roceedings of the 5th
{I}nternational {W}orkshop on
{H}ybrid {S}ystems {B}iology},
author = {Mandon, Hugues and Haar, Stefan and Paulev{\'e}, Lo{\"i}c},
title = {{Relationship between the Reprogramming Determinants of Boolean Networks and their Interaction Graph}},
pages = {113-127},
year = {2016},
doi = {10.1007/978-3-319-47151-8_8},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/MHP-HSB16.pdf},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/MHP-HSB16.pdf},
abstract = {In this paper, we address the formal characterization of tar- gets triggering cellular trans-differentiation in the scope of Boolean net- works with asynchronous dynamics. Given two fixed points of a Boolean network, we are interested in all the combinations of mutations which allow to switch from one fixed point to the other, either possibly, or in- evitably. In the case of existential reachability, we prove that the set of nodes to (permanently) flip are only and necessarily in certain connected components of the interaction graph. In the case of inevitable reachabil- ity, we provide an algorithm to identify a subset of possible solutions.}
}
@inproceedings{GLL-rv16,
address = {Madrid, Spain},
volume = 10012,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Madrid, Spain},
acronym = {{RV}'16},
booktitle = {{P}roceedings of the 16th {C}onference on {R}untime {V}erification ({RV}'16)},
author = {Goubault{-}Larrecq, Jean and Lachance, Jean{-}Philippe},
title = {On the {C}omplexity of {M}onitoring {O}rchids {S}ignatures},
year = 2016,
month = sep,
pages = {169-164},
opturl = {http://link.springer.com/chapter/10.1007%2F978-3-319-46982-9_11},
optpdf = {http://link.springer.com/chapter/10.1007%2F978-3-319-46982-9_11},
doi = {10.1007/978-3-319-46982-9_11},
abstract = {Modern monitoring tools such as our intrusion detection tool Orchids work by firing new monitor instances dynamically. Given an Orchids signature (a.k.a. a rule, a specification), what is the complexity of checking that specification, that signature? In other words, let f(n) be the maximum number of monitor instances that can be fired on a sequence of n events: we design an algorithm that decides whether f(n) is asymptotically exponential or polynomial, and in the latter case returns an exponent d such that f(n)=Theta(n^d) . Ultimately, the problem reduces to the following mathematical question, which may have other uses in other domains: given a system of recurrence equations described using the operators + and max, and defining integer sequences u_n, what is the asymptotic behavior of u_n as n tends to infinity? We show that, under simple assumptions, u_n is either exponential or polynomial, and that this can be decided, and the exponent computed, using a simple modification of Tarjan’s strongly connected components algorithm, in linear time.}
}
@inproceedings{KSHP-sasb16,
address = {Edinburgh, UK},
month = sep,
missingnumber = {2},
missingvolume = {},
series = {Electronic Notes in Theoretical Computer Science},
publisher = {Elsevier Science Publishers},
acronym = {{SASB}'16},
booktitle = {{P}roceedings of {T}he {S}eventh {I}nternational {W}orkshop on {S}tatic {A}nalysis and {S}ystems {B}iology (SASB 2016)},
title = {{Unfolding of Parametric Logical Regulatory Networks}},
author = {Kolc{\'a}k, Juraj and {\v S}afr{\'a}nek, David and Haar, Stefan and Paulev{\'e}, Lo{\"i}c},
year = {2016},
note = {To appear},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KSHP-SASB16.pdf},
url = {https://hal.archives-ouvertes.fr/hal-01354109},
abstract = {In systems biology, models of cellular regulatory processes such as gene regulatory networks or signalling pathways are crucial to understanding the behaviour of living cells. Available biological data are however often insufficient for full model specification. In this paper, we focus on partially specified models where the missing information is abstracted in the form of parameters. We introduce a novel approach to analysis of parametric logical regulatory networks addressing both sources of combinatoric explosion native to the model. First, we introduce a new compact representation of admissible parameters using Boolean lattices. Then, we define the unfolding of parametric regulatory networks. The resulting structure provides a partial- order reduction of concurrent transitions, and factorises the common transitions among the concrete models. A comparison is performed against state-of-the-art approaches to parametric model analysis.}
}
@article{KGHPAJRHH-tpnomc2016,
publisher = {Springer},
journal = {Transactions on Petri Nets and Other Models of Concurrency},
author = {Kordon, Fabrice and
Garavel, Hubert and
Hillah, Lom{-}Messan and
Paviot{-}Adet, Emmanuel and
Jezequel, Lo{\"{\i}}g and
Rodr{\'{\i}}guez, C{\'{e}}sar and
Hulin{-}Hubard, Francis },
title = {{MCC}'2015 - {T}he {F}ifth {M}odel {C}hecking {C}ontest},
volume = {11},
pages = {262-273},
year = {2016},
url = {http://dx.doi.org/10.1007/978-3-662-53401-4_12},
doi = {10.1007/978-3-662-53401-4_12},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KGHPAJRHH-tpnomc2016.pdf}
}
@article{ADFLP-fi2016,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {Abdulla, Parosh Aziz and Demri, St{\'e}phane and Finkel, Alain and Leroux, J{\'e}r{\^o}me and Potapov, Igor},
editor = {Abdulla, Parosh Aziz and Demri, St{\'e}phane and Finkel, Alain and Leroux, J{\'e}r{\^o}me and Potapov, Igor},
number = {3--4},
title = {Selected papers of Reachability Problems Workshop 2012 (Bordeaux) and 2013 (Uppsala)},
url = {http://content.iospress.com/journals/fundamenta-informaticae/143/3-4},
volume = {143},
year = {2016}
}
@proceedings{BDM-aiml16,
title = {{P}roceedings of the 11th {C}onference on {A}dvances in {M}odal {L}ogic ({AiML}'16)},
booktitle = {{P}roceedings of the 11th {C}onference on {A}dvances in {M}odal {L}ogic ({AiML}'16)},
acronym = {{AiML}'16},
editor = {Beklemishev, Lev and Demri, St{\'e}phane and Mat{\'e}, Andr{\'a}s},
publisher = {College Publications},
year = 2016,
month = sep,
address = {Budapest, Hungary},
url = {http://www.collegepublications.co.uk/aiml/?00008}
}
@inproceedings{Bollig-fsttcs16,
address = {Chennai, India},
month = dec,
year = 2016,
volume = {65},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {S. Akshay and Akash Lal and Saket Saurabh and Sandeep Sen},
acronym = {{FSTTCS}'16},
booktitle = {{P}roceedings of the 36th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'16)},
author = {Bollig, Benedikt},
title = {One-Counter Automata with Counter Observability},
pages = {20:1-20:14},
url = {http://drops.dagstuhl.de/opus/volltexte/2016/6855/},
doi = {10.4230/LIPIcs.FSTTCS.2016.20},
abstract = {In a one-counter automaton (OCA), one can produce a letter from some finite alphabet, increment and decrement the counter by one, or compare it with constants up to some threshold. It is well-known that universality and language inclusion for OCAs are undecidable. In this paper, we consider OCAs with counter observability: Whenever the automaton produces a letter, it outputs the current counter value along with it. Hence, its language is now a set of words over an infinite alphabet. We show that universality and inclusion for that model are PSPACE-complete, thus no harder than the corresponding problems for finite automata. In fact, by establishing a link with visibly one-counter automata, we show that OCAs with counter observability are effectively determinizable and closed under all boolean operations. Moreover, it turns out that they are expressively equivalent to strong automata, in which transitions are guarded by MSO formulas over the natural numbers with successor.}
}
@proceedings{FM-formats16,
title = {{P}roceedings of the 14th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'16)},
booktitle = {{P}roceedings of the 14th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'16)},
acronym = {{FORMATS}'16},
editor = {Fr{\"a}nzle, Martin and Markey, Nicolas},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {9884},
doi = {10.1007/978-3-319-44878-7},
url = {http://link.springer.com/book/10.1007/978-3-319-44878-7},
year = 2016,
month = aug,
address = {Qu\'ebec City, Canada}
}
@proceedings{BDJMS-casstingsyncop16,
title = {{P}roceedings of the {C}assting Workshop on
{G}ames for the {S}ynthesis of {C}omplex {S}ystems ({C}assting'16)
and of the 3rd {I}nternational {W}orkshop on
{S}ynthesis of {C}omplex {P}arameters ({S}yn{C}o{P}'16)},
booktitle = {{P}roceedings of the {C}assting Workshop on
{G}ames for the {S}ynthesis of {C}omplex {S}ystems ({C}assting'16)
and of the 3rd {I}nternational {W}orkshop on
{S}ynthesis of {C}omplex {P}arameters ({S}yn{C}o{P}'16)},
acronym = {{C}assting{{\slash}}{S}yn{C}o{P}'16},
editor = {Brihaye, {\relax Th}omas and Delahaye, Beno{\^\i}t and Jezequel,
Lo{\"\i}g and Markey, Nicolas and Srba, Ji{\v{r}}{\'i}},
doi = {10.4204/EPTCS.220},
url = {http://eptcs.web.cse.unsw.edu.au/content.cgi?CASSTINGSynCoP2016},
series = {Electronic Proceedings in Theoretical Computer Science},
volume = 220,
year = 2016,
month = jul,
address = {Eindhoven, The~Netherlands}
}
@incollection{BFLMOW-hmc18,
author = {Bouyer, Patricia and Fahrenberg, Uli and Larsen, Kim G.
and Markey, Nicolas and Ouaknine, Jo{\"e}l and
Worrell, James},
title = {Model Checking Real-Time Systems},
booktitle = {Handbook of Model Checking},
editor = {Clarke, Ed and Henzinger, Tom and Veith, Helmut},
publisher = {Springer},
year = 2018,
pages = {1001-1046},
nochapter = {29},
doi = {10.1007/978-3-319-10575-8_29},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BFLMOW-hmc17.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFLMOW-hmc17.pdf},
isbn = {978-3-319-10574-1},
abstract = {This chapter surveys timed automata as a formalism for
model checking real-time systems. We begin with introducing the
model, as an extension of finite-state automata with real-valued
variables for measuring time. We then present the main
model-checking results in this framework, and give a hint about some
recent extensions (namely weighted timed automata and timed
games).}
}
@inproceedings{BMS-gandalf16,
address = {Catania, Italy},
month = sep,
year = 2016,
volume = {226},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Cantone, Domenico and Delzanno, Giorgio},
acronym = {{GandALF}'16},
booktitle = {{P}roceedings of the 7th {I}nternational {S}ymposium
on {G}ames, {A}utomata, {L}ogics, and {F}ormal {V}erification
({GandALF}'16)},
author = {Bouyer, Patricia and Markey, Nicolas and Stan, Daniel},
title = {Stochastic Equilibria under Imprecise Deviations in
Terminal-Reward Concurrent Games},
pages = {61-75},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-gandalf16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMS-gandalf16.pdf},
doi = {10.4204/EPTCS.226.5},
abstract = {We study the existence of mixed-strategy equilibria in
concurrent games played on graphs. While existence is guaranteed
with safety objectives for each player, Nash equilibria need not
exist when players are given arbitrary terminal-reward objectives,
and their existence is undecidable with qualitative reachability
objectives (and~only three players). However, these results rely on
the fact that the players can enforce infinite plays while trying to
improve their payoffs. In this paper, we introduce a relaxed notion
of equilibria, where deviations are imprecise. We prove that
contrary to Nash equilibria, such (stationary) equilibria always
exist, and we develop a PSPACE algorithm to compute one.}
}
@inproceedings{Finkel-rp16,
address = {Aalborg, Denmark},
month = sep,
year = 2016,
volume = {9899},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Larsen, Kim G. and Srba, Ji{\v{r}}{\'\i}},
acronym = {{RP}'16},
booktitle = {{P}roceedings of the 10th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'16)},
author = {Finkel, Alain},
title = {The Ideal Theory for {WSTS}},
pages = {1-22},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/Finkel-rp16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Finkel-rp16.pdf},
doi = {10.1007/978-3-319-45994-3_1},
abstract = {We begin with a survey on well structured transition systems and, in particular, we present the ideal framework [FG09a, BFM14] which was recently used to obtain new deep results on Petri nets and extensions. We argue that the theory of ideals prompts a renewal of the theory of WSTS by providing a way to define a new class of monotonic systems, the so-called Well Behaved Transition Systems, which properly contains WSTS, and for which coverability is still decidable by a forward algorithm. We then recall the completion of WSTS which leads to defining a conceptual Karp-Miller procedure that terminates in more cases than the generalized Karp-Miller procedure on extensions of Petri nets.}
}
@inproceedings{ABDL-rp16,
address = {Aalborg, Denmark},
month = sep,
year = 2016,
volume = {9899},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Larsen, Kim G. and Srba, Ji{\v{r}}{\'\i}},
acronym = {{RP}'16},
booktitle = {{P}roceedings of the 10th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'16)},
author = {Alechina, Natasha and Bulling, Nils and Demri,
St{\'e}phane and Logan, Brian},
title = {On the Complexity of Resource-Bounded Logics},
pages = {36-50},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABDL-rp16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABDL-rp16.pdf},
doi = {10.1007/978-3-319-45994-3_3},
abstract = {We revisit decidability results for resource-bounded
logics and use decision problems on VASS to establish complexity
characterisation of (decidable) model-checking problems. We show
that the model-checking problem for the logic RB\(\pm\)ATL is
2EXPTIME-complete by using recent results on alternating VASS.
Moreover, we establish that the model-checking problem for RBTL is
EXPSPACE-complete and that the problem is decidable and of the same
complexity for RBTL\textsuperscript{*}, proving a new decidability
result as a by-product of the approach. We establish that the
model-checking problem for RB\(\pm\)ATL\textsuperscript{*}, the
extension of RB\(\pm\)ATL with arbitrary path formulae is decidable
by a reduction into parity games. We are also able to synthesise
values for resource parameters. Hence, the paper establishes formal
correspondences between model-checking problems and decision
problems on alternating VASS, paving the way to more applications.}
}
@inproceedings{LFS-rp16,
address = {Aalborg, Denmark},
month = sep,
year = 2016,
volume = {9899},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Larsen, Kim G. and Srba, Ji{\v{r}}{\'\i}},
acronym = {{RP}'16},
booktitle = {{P}roceedings of the 10th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'16)},
author = {Le{~}Co{\"e}nt, Adrien and Fribourg, Laurent and
Soulat, Romain},
title = {Compositional analysis of Boolean networks using local fixed-point
iterations},
pages = {134-147},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LFS-rp16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LFS-rp16.pdf},
doi = {10.1007/978-3-319-45994-3_10},
abstract = {We present a compositional method which allows to
over-approximate the set of attractors and under-approximate the set
of basins of attraction of a Boolean network~(BN). This merely
consists in replacing a global fixed-point computation by a
composition of local fixed-point computations. Once these
approximations have been computed, it~becomes much more tractable to
generate the exact sets of attractors and basins of attraction. We
illustrate the interest of our approach on several examples, among
which is a BN modeling a railway interlocking system with 50 nodes
and millions of attractors.}
}
@inproceedings{LFMDC-rp16,
address = {Aalborg, Denmark},
month = sep,
year = 2016,
volume = {9899},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Larsen, Kim G. and Srba, Ji{\v{r}}{\'\i}},
acronym = {{RP}'16},
booktitle = {{P}roceedings of the 10th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'16)},
author = {Le{~}Co{\"e}nt, Adrien and Fribourg, Laurent and
Markey, Nicolas and De{~}Vuyst, Florian and Chamoin, Ludovic},
title = {Distributed Synthesis of State-Dependent Switching Control},
pages = {119-133},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LFMDC-rp16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LFMDC-rp16.pdf},
doi = {10.1007/978-3-319-45994-3_9},
abstract = {We present a correct-by-design method of state-dependent
control synthesis for linear discrete-time switching systems. Given
an objective region~\(R\) of the state space, the method builds a
capture set~\(S\) and a control which steers any element of~\(S\)
into~\(R\). The method works by iterated backward reachability
from~\(R\). More precisely, \(S\)~is given as a parametric extension
of~\(R\), and the maximum value of the parameter is solved by linear
programming. The method can also be used to synthesize a stability
control which maintains indefinitely within~\(R\) all the states
starting at~\(R\). We~explain how the synthesis method can be
performed in a distributed manner. The method has been implemented
and successfully applied to the synthesis of a distributed control
of a concrete floor heating system with 11 rooms and \(2^11 = 2048\)
switching modes.}
}
@article{BMRLL-acta16,
publisher = {Springer},
journal = {Acta Informatica},
author = {Bouyer, Patricia and Markey, Nicolas and Randour, Mickael
and Larsen, Kim G. and Laursen, Simon},
title = {Average-energy games},
volume = {55},
number = {2},
year = 2018,
month = jul,
pages = {91-127},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMRLL-acta16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMRLL-acta16.pdf},
doi = {10.1007/s00236-016-0274-1},
abstract = {Two-player quantitative zero-sum games provide a natural
framework to synthesize controllers with performance guarantees for
reactive systems within an uncontrollable environment. Classical
settings include mean-payoff games, where the objective is to
optimize the long-run average gain per action, and energy games,
where the system has to avoid running out of energy. We study
average-energy games, where the goal is to optimize the long-run
average of the accumulated energy. We show that this objective
arises naturally in several applications, and that it yields
interesting connections with previous concepts in the literature. We
prove that deciding the winner in such games is in NP coNP and at
least as hard as solving mean-payoff games, and we establish that
memoryless strategies suffice to win. We also consider the case
where the system has to minimize the average-energy while
maintaining the accumulated energy within predefined bounds at all
times: this corresponds to operating with a finite-capacity storage
for energy. We give results for one-player and two-player games, and
establish complexity bounds and memory requirements.}
}
@inproceedings{HT-pasm16,
address = {M{\"u}nster, Germany},
month = apr,
year = 2016,
volume = {327},
series = {Electronic Notes in Theoretical Computer Science},
publisher = {Elsevier Science Publishers},
editor = {Haverkort, Boudewijn and Knottenbelt, William and Remke, Anne and Thomas, Nigel},
booktitle = {{P}roceedings of the 8th {I}nternational {W}orkshop on {P}ractical
{A}pplications of {S}tochastic {M}odelling ({PASM}'16)},
author = {Haar, Stefan and Theissing, Simon},
title = {Forecasting Passenger Loads in Transportation Networks},
pages = {49-69},
url = {https://hal.inria.fr/hal-01259585},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HT-pasm16.pdf},
doi = {10.1016/j.entcs.2016.09.023},
abstract = {This work is part of an ongoing effort to understand the
dynamics of passenger loads in modern, multimodal transportation
networks (TNs) and to mitigate the impact of perturbations. The
challenge is that the percentage of passengers at any given point of
the TN that have a certain destination, i.e. their distribution over
different trip profiles, is unknown. We introduce a stochastic
hybrid automaton model for multimodal TNs that allows to compute how
such probabilistic load vectors are propagated through the TN, and
develop a computation strategy for forecasting the network's load a
certain time into the future.}
}
@misc{vip-D42,
author = {Delaune, St{\'e}phanie and Gazeau, Ivan},
howpublished = {Deliverable VIP~4.2 (ANR-11-JS02-0006)},
month = jun,
note = {5~pages},
type = {Contract Report},
title = {Combination issues},
year = {2016},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/vip-d42.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/vip-d42.pdf}
}
@misc{vip-D22,
author = {Delaune, St{\'e}phanie and Gazeau, Ivan},
howpublished = {Deliverable VIP~2.2 (ANR-11-JS02-0006)},
month = jun,
note = {8~pages},
type = {Contract Report},
title = {Results on the case studies},
year = {2016},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/vip-d22.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/vip-d22.pdf}
}
@techreport{HT-hal16,
author = {Haar, Stefan and Theissing, Simon},
title = {A~Passenger-centric Multi-agent System Model for
Multimodal Public Transportation},
institution = {HAL-inria},
number = {hal-01322956},
month = may,
year = {2016},
type = {Research Report},
url = {https://hal.inria.fr/hal-01322956},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HT-hal16.pdf},
note = {12~pages},
abstract = {If we want to understand how perturbations spread across a
multi-modal public transportation system, we have to include
passenger flows into the model and the analysis. Indeed, in general
no two different lines in such a system are physically connected
directly, or share tracks or other resources. Rather, they are
connected by passengers changing lines and thus transmit
perturbations from one line or mode to another. We present a formal
passenger-centric multi-agent system model that can capture
(i)~individual and possibly multi-modal trip profiles with branches
resulting from different decision outcomes, (ii)~the~movement of
fixed-route operated transportation means, and (iii)~in-vehicle and
in-station capacity constraints. The model is based on a
nets-within-nets approach with Petri nets as the basic building
entities. Thus, it has a convenient graphical representation, and
the possibility of execution.}
}
@inproceedings{HT-qest16,
address = {Qu{\'e}bec City, Canada},
month = aug,
year = 2016,
volume = {9826},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Agha, Gul and Van{~}Houdt, Benny},
acronym = {{QEST}'16},
booktitle = {{P}roceedings of the 13th {I}nternational
{C}onference on {Q}uantitative
{E}valuation of {S}ystems
({QEST}'16)},
author = {Haar, Stefan and Theissing, Simon},
title = {Decoupling Passenger Flows for Improved Load Prediction},
pages = {364-379},
url = {https://hal.inria.fr/hal-01330136},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HT-qest16.pdf},
doi = {10.1007/978-3-319-43425-4_24},
abstract = {This paper continues our work on perturbation analysis of
multimodal transportation networks~(TNs) by means of a stochastic
hybrid automaton~(SHA) model. We focus here on the approximate
computation , in particular on the major bottleneck consisting in
the high dimensionality of systems of stochastic differential
balance equations (SDEs) that define the continuous passenger-flow
dynamics in the different modes of the SHA model. In fact, for every
pair of a mode and a station, one system of coupled SDEs relates the
passenger loads of all discrete points such as platforms considered
in this station, and all vehicles docked to it, to the passenger
flows in between. In general, such an SDE system has many
dimensions, which makes its numerical computation and thus the
approximate computation of the SHA model intractable. We show how
these systems can be canonically replaced by lower-dimensional ones,
by decoupling the passenger flows inside every mode from one
another. We prove that the resulting approximating passenger-flow
dynamics converges to the original one, if the replacing set of
balance equations set up for all decoupled passenger flows
communicate their results among each other in vanishing time
intervals.}
}
@inproceedings{HT-acc16,
address = {Boston, Massachusetts, USA},
month = jul,
year = 2016,
publisher = {{IEEE} Control System Society},
acronym = {{ACC}'16},
booktitle = {{P}roceedings of the 35th {A}merican {C}ontrol
{C}onference ({ACC}'16)},
author = {Haar, Stefan and Theissing, Simon},
title = {Predicting Traffic Load in Public Transportation Networks},
pages = {821-826},
url = {https://hal.inria.fr/hal-01329632},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HT-acc16.pdf},
doi = {10.1109/ACC.2016.7525015},
abstract = {This work is part of an ongoing effort to understand the
dynamics of passenger loads in modern, multimodal transportation
networks (TNs) and to mitigate the impact of perturbations, under
the restrictions that the precise number of passengers in some point
of the TN that intend to reach a certain destination (i.e. their
distribution over different trip profiles) is unknown. We introduce
an approach based on a stochastic hybrid automaton model for a TN
that allows to compute how such probabilistic load vectors are
propagated through the TN, and develop a computation strategy for
forecasting the network's load a certain time in the future.}
}
@inproceedings{FHLM-wodes16,
address = {Xi'an, China},
month = may # {-} # jun,
year = 2016,
publisher = {{IEEE} Control System Society},
editor = {Cassandras, Christos G. and Giua, Alessandro},
acronym = {{WODES}'16},
booktitle = {{P}roceedings of the 13th {W}orkshop on {D}iscrete {E}vent {S}ystems
({WODES}'16)},
author = {Fabre, {\'E}ric and H{\'e}lou{\"e}t, Lo{\"i}c and
Lefaucheux, Engel and Marchand, Herv{\'e}},
title = {Diagnosability of Repairable Faults},
pages = {230-236},
url = {https://hal.inria.fr/hal-01302562},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FHLM-wodes16.pdf},
doi = {10.1109/WODES.2016.7497853},
abstract = {The diagnosis problem for discrete event systems consists
in deciding whether some fault event occurred or not in the system,
given partial observations on the run of that system. Diagnosability
checks whether a correct diagnosis can be issued in bounded time
after a fault, for all faulty runs of that system. This problem
appeared two decades ago and numerous facets of it have been
explored, mostly for permanent faults. It is known for example that
diagnosability of a system can be checked in polynomial time, while
the construction of a diagnoser is exponential. The present paper
examines the case of transient faults, that can appear and be
repaired. Diagnosability in this setting means that the occurrence
of a fault should always be detected in bounded time, but also
before the fault is repaired. Checking this notion of diagnosability
is proved to be PSPACE-complete. It is also shown that faults can be
reliably counted provided the system is diagnosable for faults and
for repairs.}
}
@inproceedings{vDCC-bpm16,
address = {Rio de Janeiro, Brazil},
month = sep,
year = 2016,
volume = {9850},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {La{~}Rosa, Marcello and Loos, Peter and Pastor, Oscar},
acronym = {{BPM}'16},
booktitle = {{P}roceedings of the 14th {I}nternational {C}onference on
{B}usiness {P}rocess {M}anagement ({BPM}'16)},
author = {van Dongen, Boudewijn F. and Carmona, Josep and Chatain,
{\relax Th}omas},
title = {A Unified Approach for Measuring Precision and
Generalization Based on Anti-Alignments},
pages = {39-56},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/vDCC-bpm16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/vDCC-bpm16.pdf},
doi = {10.1007/978-3-319-45348-4_3},
abstract = {The holy grail in process mining is an algorithm that, given an
event log, produces fitting, precise, properly generalizing and simple
process models. While there is consensus on the existence of solid metrics
for fitness and simplicity, current metrics for precision and
generalization have important flaws, which hamper their applicability in a
general setting. In this paper, a novel approach to measure precision and
generalization is presented, which relies on the notion of
anti-alignments. An anti-alignment describes highly deviating model traces
with respect to observed behavior. We propose metrics for precision and
generalization that resemble the leave-one-out cross-validation
techniques, where individual traces of the log are removed and the
computed anti-alignment assess the model's capability to describe
precisely or generalize the observed behavior.}
}
@inproceedings{KS-csl16,
address = {Marseille, France},
month = sep,
year = 2016,
volume = {62},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Regnier, Laurent and Talbot, Jean-Marc},
acronym = {{CSL}'16},
booktitle = {{P}roceedings of the 25th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'16)},
author = {Prateek Karandikar and Schnoebelen,
{\relax Ph}ilippe},
title = {The height of piecewise-testable languages with applications in
logical complexity},
pages = {37:1-37:22},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-csl16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KS-csl16.pdf},
doi = {10.4230/LIPIcs.CSL.2016.37},
abstract = {The height of a piecewise-testable language~\(L\) is the maximum
length of the words needed to define~\(L\) by excluding and requiring given
subwords. The height of~\(L\) is an important descriptive complexity measure
that has not yet been investigated in a systematic way. This paper
develops a series of new techniques for bounding the height of finite
languages and of languages obtained by taking closures by subwords,
superwords and related operations.\par
As an application of these results, we show that
\({\textsf{FO}}^2(A^*,\sqsubseteq)\), the two-variable fragment of the
first-order logic of sequences with the subword ordering, can only express
piecewise-testable properties and has elementary complexity.}
}
@inproceedings{GGL-csl16,
address = {Marseille, France},
month = sep,
year = 2016,
volume = {62},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Regnier, Laurent and Talbot, Jean-Marc},
acronym = {{CSL}'16},
booktitle = {{P}roceedings of the 25th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'16)},
author = {Ganardi, Moses and G{\"o}ller, Stefan and Lohrey, Markus},
title = {On the Parallel Complexity of Bisimulation over Finite Systems},
pages = {12:1-12:17},
doi = {10.4230/LIPIcs.CSL.2016.12},
abstract = {In this paper the computational complexity of the (bi)simulation problem over restricted graph classes is studied. For trees given as pointer structures or terms the (bi)simulation problem is complete for logarithmic space or NC\(^1\), respectively. This solves an open problem from Balc{\'a}zar, Gabarr{\'o}, and S{\'a}ntha. We also show that the simulation problem is P-complete even for graphs of bounded path-width.}
}
@inproceedings{DGGL-csl16,
address = {Marseille, France},
month = sep,
year = 2016,
volume = {62},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Regnier, Laurent and Talbot, Jean-Marc},
acronym = {{CSL}'16},
booktitle = {{P}roceedings of the 25th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'16)},
author = {Dubut, J{\'e}r{\'e}my and Goubault, {\'E}ric and
Goubault{-}Larrecq, Jean},
title = {The Directed Homotopy Hypothesis},
pages = {9:1-9:16},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DBS-csl16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DBS-csl16.pdf},
doi = {10.4230/LIPIcs.CSL.2016.9},
abstract = {The homotopy hypothesis was originally stated by Grothendieck: topological spaces should be {"}equivalent{"} to (weak) infinite-groupoids, which give algebraic representatives of homotopy types. Much later, several authors developed geometrizations of computational models, e.g., for rewriting, distributed systems, (homotopy) type theory etc. But an essential feature in the work set up in concurrency theory, is that time should be considered irreversible, giving rise to the field of directed algebraic topology. Following the path proposed by Porter, we state here a directed homotopy hypothesis: Grandis' directed topological spaces should be {"}equivalent{"} to a weak form of topologically enriched categories, still very close to (infinite,1)-categories. We develop, as in ordinary algebraic topology, a directed homotopy equivalence and a weak equivalence, and show invariance of a form of directed homology.}
}
@inproceedings{DBS-csl16,
address = {Marseille, France},
month = sep,
year = 2016,
volume = {62},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Regnier, Laurent and Talbot, Jean-Marc},
acronym = {{CSL}'16},
booktitle = {{P}roceedings of the 25th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'16)},
author = {Amina Doumane and David Baelde and Alexis Saurin},
title = {Infinitary proof theory: the multiplicative additive case},
pages = {42:1-42:17},
doi = {10.4230/LIPIcs.CSL.2016.42},
abstract = {Infinitary and regular proofs are commonly used in fixed point logics. Being natural intermediate devices between semantics and traditional finitary proof systems, they are commonly found in completeness arguments, automated deduction, verification, etc. However, their proof theory is surprisingly underdeveloped. In particular, very little is known about the computational behavior of such proofs through cut elimination. Taking such aspects into account has unlocked rich developments at the intersection of proof theory and programming language theory. One would hope that extending this to infinitary calculi would lead, e.g., to a better understanding of recursion and corecursion in programming languages. Structural proof theory is notably based on two fundamental properties of a proof system: cut elimination and focalization. The first one is only known to hold for restricted (purely additive) infinitary calculi, thanks to the work of Santocanale and Fortier; the second one has never been studied in infinitary systems. In this paper, we consider the infinitary proof system muMALLi for multiplicative and additive linear logic extended with least and greatest fixed points, and prove these two key results. We thus establish muMALLi as a satisfying computational proof system in itself, rather than just an intermediate device in the study of finitary proof systems.}
}
@inproceedings{BLS-hal15,
address = {Marseille, France},
month = sep,
year = 2016,
volume = {62},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Regnier, Laurent and Talbot, Jean-Marc},
acronym = {{CSL}'16},
booktitle = {{P}roceedings of the 25th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'16)},
author = {Baelde, David and Lunel, Simon and Schmitz, Sylvain},
title = {A~Sequent Calculus for a Modal Logic on Finite Data
Trees},
pages = {32:1-32:16},
url = {https://hal.inria.fr/hal-01191172},
doi = {10.4230/LIPIcs.CSL.2016.32},
abstract = {We investigate the proof theory of a modal fragment of XPath
equipped with data (in)equality tests over finite data
trees, i.e. over finite unranked trees where nodes are
labelled with both a symbol from a finite alphabet and a
single data value from an infinite domain. We present a
sound and complete sequent calculus for this logic, which
yields the optimal PSPACE complexity bound for its validity
problem.}
}
@inproceedings{Bouyer-mfcs16,
address = {Krakow, Poland},
month = aug,
year = 2016,
volume = {58},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
acronym = {{MFCS}'16},
booktitle = {{P}roceedings of the 41st
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'16)},
author = {Bouyer, Patricia},
title = {Optimal Reachability in Weighted Timed Automata and Games},
pages = {3:1-3:3},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/bouyer-mfcs16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/bouyer-mfcs16.pdf},
doi = {10.4230/LIPIcs.MFCS.2016.3},
abstract = {This is an overview of the invited talk delivered at the 41st International Symposium on Math- ematical Foundations of Computer Science (MFCS-2016).}
}
@inproceedings{ABKMT-mfcs16,
address = {Krakow, Poland},
month = aug,
year = 2016,
volume = {58},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
acronym = {{MFCS}'16},
booktitle = {{P}roceedings of the 41st
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'16)},
author = {Akshay, S. and Bouyer, Patricia and Krishna, Shankara Narayanan and
Manasa, Lakshmi and Trivedi, Ashutosh },
title = {Stochastic Timed Games Revisited},
pages = {8:1-8:14},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ABKMT-mfcs16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABKMT-mfcs16.pdf},
doi = {10.4230/LIPIcs.MFCS.2016.8},
abstract = {Stochastic timed games (STGs), introduced by Bouyer and Forejt,
naturally generalize both continuous-time Markov chains and timed automata
by providing a partition of the locations between those controlled by two
players (Player Box and Player Diamond) with competing objectives and
those governed by stochastic laws. Depending on the number of
players---2,~1, or~0---subclasses of stochastic timed games are often
classified as \(2\frac{1}{2}\)-player, \(1\frac{1}{2}\)-player, and
\(\frac{1}{2}\)-player games where the \(\frac{1}{2}\) symbolizes the
presence of the stochastic {"}nature{"} player. For STGs with reachability
objectives it is known that \(1\frac{1}{2}\)-player one-clock STGs are
decidable for qualitative objectives, and that \(2\frac{1}{2}\)-player
three-clock STGs are undecidable for quantitative reachability objectives.
This paper further refines the gap in this decidability spectrum. We show
that quantitative reachability objectives are already undecidable for
\(1\frac{1}{2}\)-player four-clock STGs, and even under the time-bounded
restriction for \(2\frac{1}{2}\)-player five-clock~STGs. We~also obtain a
class of \(1\frac{1}{2}\), \(2\frac{1}{2}\)-player STGs for which the
quantitative reachability problem is decidable.}
}
@inproceedings{NPR-mfcs16,
address = {Krakow, Poland},
month = aug,
year = 2016,
volume = {58},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
acronym = {{MFCS}'16},
booktitle = {{P}roceedings of the 41st
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'16)},
author = {Reino Niskanen and Igor Potapov and Julien Reichert},
title = {Undecidability of Two-dimensional Robot Games},
pages = {73:1-73:13},
url = {http://arxiv.org/abs/1604.08779},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/NPR-mfcs16.pdf},
doi = {10.4230/LIPIcs.MFCS.2016.73},
abstract = {Robot game is a two-player vector addition game played on the integer lattice \(\mathbb{Z}^n\). Both players have sets of vectors and in each turn the vector chosen by a player is added to the current configuration vector of the game. One of the players, called Eve, tries to play the game from the initial configuration to the origin while the other player, Adam, tries to avoid the origin. The problem is to decide whether or not Eve has a winning strategy. In this paper we prove undecidability of the robot game in dimension two answering the question formulated by Doyen and Rabinovich in 2011 and closing the gap between undecidable and decidable cases.}
}
@inproceedings{DGGL-concur16,
address = {Qu{\'e}bec City, Canada},
month = aug,
year = 2016,
volume = {59},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Desharnais, Jos{\'e}e and Jagadeesan, Radha},
acronym = {{CONCUR}'16},
booktitle = {{P}roceedings of the 27th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'16)},
author = {Dubut, J{\'e}r{\'e}my and Goubault, {\'E}ric and Goubault{-}Larrecq, Jean},
title = {Bisimulations and unfolding in {{\(\mathcal{P}\)}}-accessible categorical models},
pages = {25:1-25:14},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DGGL-concur16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DGGL-concur16.pdf},
doi = {10.4230/LIPIcs.CONCUR.2016.25},
abstract = {We propose a categorical framework for bisimulations and
unfoldings that unifies the classical approach from Joyal
\emph{et~al.} via open maps and unfoldings. This is based on a
notion of categories accessible with respect to a subcategory of
path shapes, i.e., for which one can define a nice notion of trees
as glueings of paths. We show that transition systems and presheaf
models are instances of our framework. We also prove that in our
framework, several notions of bisimulation coincide, in particular
an {"}operational~one{"} akin to the standard definition in
transition systems. Also, our notion of accessibility is preserved
by coreflections. This also leads us to a notion of unfolding that
behaves well in the accessible case: it~is a right adjoint and is a
universal covering, i.e., it is initial among the morphisms that
have the unique lifting property with respect to path shapes. As an
application, we prove that the universal covering of a groupoid, a
standard construction in algebraic topology, is an unfolding, when
the category of path shapes is well chosen.}
}
@inproceedings{AGS-concur16,
address = {Qu{\'e}bec City, Canada},
month = aug,
year = 2016,
volume = {59},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Desharnais, Jos{\'e}e and Jagadeesan, Radha},
acronym = {{CONCUR}'16},
booktitle = {{P}roceedings of the 27th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'16)},
author = {Akshay, S. and Paul Gastin and Krishna, Shankara Narayanan},
title = {Analyzing Timed Systems Using Tree Automata},
pages = {27:1-27:14},
url = {http://arxiv.org/abs/1604.08443},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AGS-concur16.pdf},
doi = {10.4230/LIPIcs.CONCUR.2016.27},
abstract = {Timed systems, such as timed automata, are usually analyzed
using their operational semantics on timed words. The classical region
abstraction for timed automata reduces them to (untimed) finite state
automata with the same time-abstract properties, such as state
reachability. We propose a new technique to analyze such timed systems
using finite tree automata instead of finite word automata. The main idea
is to consider timed behaviors as graphs with matching edges capturing
timing constraints. Such graphs can be interpreted in trees opening the
way to tree automata based techniques which are more powerful than
analysis based on word automata. The technique is quite general and
applies to many timed systems. In this paper, as an example, we develop
the technique on timed pushdown systems, which have recently received
considerable attention. Further, we also demonstrate how we can use it on
timed automata and timed multi-stack pushdown systems (with boundedness
restrictions).}
}
@inproceedings{BHL-concur16,
address = {Qu{\'e}bec City, Canada},
month = aug,
year = 2016,
volume = {59},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Desharnais, Jos{\'e}e and Jagadeesan, Radha},
acronym = {{CONCUR}'16},
booktitle = {{P}roceedings of the 27th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'16)},
author = {Nathalie Bertrand and Serge Haddad and Engel Lefaucheux},
title = {Diagnosis in Infinite-State Probabilistic Systems},
pages = {37:1-37:15},
url = {https://hal.inria.fr/hal-01334218},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHL-concur16.pdf},
doi = {10.4230/LIPIcs.CONCUR.2016.37},
abstract = {In a recent work, we introduced four variants of
diagnosability (\textsf{FA}, \textsf{IA}, \textsf{FF},~\textsf{IF})
in (finite) probabilistic systems (pLTS) depending whether one
considers (1)~finite or infinite runs and (2)~faulty or all runs. We
studied their relationship and established that the corresponding
decision problems are PSPACE-complete. A~key ingredient of the
decision procedures was a characterisation of diagnosability by the
fact that a random run almost surely lies in an open set whose
specification only depends on the qualitative behaviour of the pLTS.
Here we investigate similar issues for infinite pLTS. We~first show
that this characterisation still holds for
\textsf{FF}-diagnosability but with a~\(G_{\delta}\) set instead of
an open set and also for \textsf{IF}-and \textsf{IA}-diagnosability
when pLTS are finitely branching. We also prove that surprisingly
\textsf{FA}-diagnosability cannot be characterised in this way even
in the finitely branching case. Then we apply our characterisations
for a partially observable probabilistic extension of visibly
pushdown automata (POpVPA), yielding EXPSPACE procedures for solving
diagnosability problems. In~addition, we~establish some
computational lower bounds and show that slight extensions of POpVPA
lead to undecidability.}
}
@inproceedings{DLM-concur16,
address = {Qu{\'e}bec City, Canada},
month = aug,
year = 2016,
volume = {59},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Desharnais, Jos{\'e}e and Jagadeesan, Radha},
acronym = {{CONCUR}'16},
booktitle = {{P}roceedings of the 27th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'16)},
author = {David, Am{\'e}lie and Laroussinie, Fran{\c{c}}ois and
Markey, Nicolas},
title = {On~the expressiveness of~{QCTL}},
pages = {28:1-28:15},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DLM-concur16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DLM-concur16.pdf},
doi = {10.4230/LIPIcs.CONCUR.2016.28},
abstract = {QCTL extends the temporal logic CTL with quantification
over atomic propositions. While the algorithmic questions for QCTL
and its fragments with limited quantification depth are
well-understood (e.g. satisfiability of QCTL\textsuperscript{\(k\)},
with at most \(k\) nested blocks of quantifiers, is
\(k+1\)-EXPTIME-complete), very few results are known about the
expressiveness of this logic. We~address such expressiveness
questions in this paper. We first consider the \emph{distinguishing
power} of these logics (i.e.,~their ability to separate models),
their relationship with behavioural equivalences, and their ability
to capture the behaviours of finite Kripke structures with so-called
characteristic formulas. We then consider their \emph{expressive
power} (i.e.,~their ability to express a property), showing that in
terms of expressiveness the hierarchy QCTL\textsuperscript{\(k\)}
collapses at level~2 (in~other terms, any~QCTL formula can be
expressed using at most two nested blocks of quantifiers).}
}
@inproceedings{GR-langonto16,
address = {Portoro{\v{z}}, Slovenia},
editor = {Grci{\'c} Simeunovi, Larisa and Vintar,
{\u{S}}pela and Khan, Fahad and Le{\'o}n Ara{\'u}z,
Pilar and Faber, Pamela and Fontini, Francesca and
Parvisi, Artemis and Unger, Christina},
acronym = {{LangOnto+TermiKS}'16},
booktitle = {{P}roceedings of the {J}oint 2nd {W}orkshop on {L}anguage and
{O}ntology~\& {T}erminology and {K}nowledge
{S}tructures ({LangOnto+TermiKS}'16)},
author = {Grefenstette, Gregory and Rafes, Karima},
title = {Transforming {W}ikipedia into an Ontology-based
Information Retrieval Search Engine for Local Experts
using a Third-Party Taxonomy},
year = 2016,
month = may,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GR-langonto16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GR-langonto16.pdf},
note = {To appear},
abstract = {Wikipedia is widely used for finding general information
about a wide variety of topics. Its vocation is not to provide
local information. For~example, it~provides plot, cast, and
production information about a given movie, but not showing times in
your local movie theatre. Here we describe how we can connect local
information to Wikipedia, without altering its content. The~case
study we present involves finding local scientific experts. Using a
third-party taxonomy, independent from Wikipedia's category
hierarchy, we index information connected to our local experts,
present in their activity reports, and we re-index Wikipedia content
using the same taxonomy. The connections between Wikipedia pages and
local expert reports are stored in a relational database, accessible
through as public SPARQL endpoint. A~Wikipedia gadget (or plugin)
activated by the interested user, accesses the endpoint as each
Wikipedia page is accessed. An~additional tab on the Wikipedia page
allows the user to open up a list of teams of local experts
associated with the subject matter in the Wikipedia page. The
technique, though presented here as a way to identify local experts,
is generic, in that any third party taxonomy, can be used in this to
connect Wikipedia to any non-Wikipedia data source.}
}
@article{DGG-acs16,
publisher = {Springer},
journal = {Applied Categorical Structures},
author = {Dubut, J{\'e}r{\'e}my and Goubault, {\'E}ric and
Goubault{-}Larrecq, Jean},
title = {Directed homology theories and {E}ilenberg-{S}teenrod
axioms},
year = 2017,
month = oct,
volume = {25},
number = {5},
pages = {775-807},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DGG-acs16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DGG-acs16.pdf},
doi = {doi:10.1007/s10485-016-9438-y},
abstract = {In this paper, we define and study a homology theory, that
we call {"}natural homology{"}, which associates a natural system of
abelian groups to every space in a large class of directed spaces
and precubical sets. We show that this homology theory enjoys many
important properties, as an invariant for directed homotopy. Among
its properties, we show that subdivided precubical sets have the
same homology type as the original ones ; similarly, the natural
homology of a precubical set is of the same type as the natural
homology of its geometric realization. By same type we mean
equivalent up to some form of bisimulation, that we define using the
notion of open map. Last but not least, natural homology, for the
class of spaces we consider, exhibits very important properties such
as Hurewicz theorems, and most of Eilenberg-Steenrod axioms, in
particular the dimension, homotopy, additivity and exactness axioms.
This last axiom is studied in a general framework of (generalized)
exact sequences.}
}
@article{LDRCF-ijdc16,
publisher = {Springer},
journal = {International Journal of Dynamics and Control},
author = {Le{~}Co{\"e}nt, Adrien and De{~}Vuyst, Florian and Rey,
Christian and Chamoin, Ludovic and Fribourg, Laurent},
title = {Control of mechanical systems using set-based methods},
pages = {1-17},
year = 2016,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LDRCF-ijdc16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LDRCF-ijdc16.pdf},
doi = {10.1007/s40435-016-0245-y},
abstract = {This paper considers large discrete-time linear systems obtained
from discretized partial differential equations, and controlled by a
\emph{quantized} law, i.e., a piecewise constant time function taking a
finite set of values. We show how to generate the control by, first,
applying \emph{model reduction} to the original system, then using a
{"}state-space bisection{"} method for synthesizing a control at the
reduced-order level, and finally computing an upper bound on the
deviations between the controlled output trajectories of the reduced-order
model and those of the original model. The effectiveness of our approach
is illustrated on several examples of the literature.}
}
@inproceedings{LACF-snr16,
address = {Vienna, Austria},
month = apr,
year = 2016,
publisher = {{IEEE} Computer Society Press},
acronym = {{SNR}'16},
booktitle = {{P}roceedings of the 2nd {I}nternational {W}orkshop
on {S}ymbolic and {N}umerical {M}ethods for
{R}eachability {A}nalysis ({SNR}'16)},
author = {Le{~}Co{\"e}nt, Adrien and Alexandre{ }dit{ }Sandretto,
Julien and Chapoutot, Alexandre and Fribourg,
Laurent},
title = {Control of Nonlinear Switched Systems Based on
Validated Simulation},
pages = {1-6},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LACF-snr16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LACF-snr16.pdf},
abstract = {We present an algorithm of control synthesis for nonlinear
switched systems, based on an existing procedure of state-space
bisection and made available for nonlinear systems with the help of
validated simulation. The use of validated simulation also permits
to take bounded perturbations and varying parameters into account.
The whole approach is entirely guaranteed and the induced
controllers are correct-by-design.}
}
@article{DFP-lmcs16,
journal = {Logical Methods in Computer Science},
author = {Demri, St{\'e}phane and Figueira, Diego and Praveen, M},
title = {Reasoning about Data Repetitions with Counter Systems},
year = 2016,
volume = {12},
number = {3},
month = aug,
pages = {1:1-1:55},
url = {http://arxiv.org/abs/1604.02887},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DFP-lmcs16.pdf},
doi = {10.2168/LMCS-12(3:1)2016},
abstract = {We study linear-time temporal logics interpreted over data words
with multiple attributes. We restrict the atomic formulas to equalities
of attribute values in successive positions and to repetitions of
attribute values in the future or past. We demonstrate correspondences
between satisfiability problems for logics and reachability-like decision
problems for counter systems. We show that allowing\slash disallowing
atomic formulas expressing repetitions of values in the past corresponds
to the reachability\slash coverability problem in Petri nets. This gives
us 2EXPSPACE upper bounds for several satisfiability problems. We prove
matching lower bounds by reduction from a reachability problem for a
newly introduced class of counter systems. This new class is a succinct
version of vector addition systems with states in which counters are
accessed via pointers, apotentially useful feature in other contexts. We
strengthen further the correspondences between data logics and counter
systems by characterizing the complexity of fragments, extensions and
variants of the logic. For instance, we precisely characterize the
relationship between the number of attributes allowed in the logic and
the number of counters needed in the counter system.}
}
@inproceedings{BBCM-csr16,
address = {St~Petersburg, Russia},
month = jun,
year = 2016,
volume = {9691},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Gerhard J. Woeginger},
acronym = {{CSR}'16},
booktitle = {{P}roceedings of the 11th {I}nternational {C}omputer {S}cience
{S}ymposium in {R}ussia ({CSR}'16)},
author = {Bouyer, Patricia and Brihaye, {\relax Th}omas and Carlier,
Pierre
and Menet, Quentin},
title = {Compositional Design of Stochastic Timed Automata},
pages = {117-130},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBCM-csr16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBCM-csr16.pdf},
doi = {10.1007/978-3-319-34171-2_9},
abstract = {In this paper, we study the model of stochastic timed automata
and we target the definition of adequate composition operators that will
allow a compositional approach to the design of stochastic systems with
hard real-time constraints. This paper achieves the first step towards
that goal. Firstly, we define a parallel composition operator that
(we~prove) corresponds to the interleaving semantics for that model; we
give conditions over probability distributions, which ensure that the
operator is well-defined; and we exhibit problematic behaviours when this
condition is not satisfied. We furthermore identify a large and natural
subclass which is closed under parallel composition. Secondly, we define
a bisimulation notion which naturally extends that for continuous-time
Markov chains. Finally, we importantly show that the defined bisimulation
is a congruence w.r.t. the parallel composition, which is an expected
property for a proper modular approach to system design.}
}
@inproceedings{BBBC-icalp16,
address = {Rome, Italy},
month = jul,
year = 2016,
volume = {55},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chatzigiannakis, Ioannis and Mitzenmacher,
Michael and Rabani, Yuval and Sangiorgi, Davide},
acronym = {{ICALP}'16},
booktitle = {{P}roceedings of the 43rd {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'16)},
author = {Bertrand, Nathalie and Bouyer, Patricia and Brihaye,
{\relax Th}omas
and Carlier, Pierre},
title = {Analysing Decisive Stochastic Processes},
pages = {101:1-101:14},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBBC-icalp16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBBC-icalp16.pdf},
doi = {10.4230/LIPIcs.ICALP.2016.101},
abstract = {In~2007, Abdulla \textit{et~al.} introduced the elegant concept
of decisive Markov chain. Intuitively, decisiveness allows one to lift the
good properties of finite Markov chains to infinite Markov chains. For
instance, the approximate quantitative reachability problem can be solved
for decisive Markov chains (enjoying reasonable effectiveness assumptions)
including probabilistic lossy channel systems and probabilistic vector
addition systems with states. In this paper, we extend the concept of
decisiveness to more general stochastic processes. This extension is non
trivial as we consider stochastic processes with a potentially continuous
set of states and uncountable branching (common features of real-time
stochastic processes). This allows us to obtain decidability results for
both qualitative and quantitative verification problems on some classes of
real-time stochastic processes, including generalized semi-Markov
processes and stochastic timed automata.}
}
@inproceedings{CH-icalp16,
address = {Rome, Italy},
month = jul,
year = 2016,
volume = {55},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chatzigiannakis, Ioannis and Mitzenmacher,
Michael and Rabani, Yuval and Sangiorgi, Davide},
acronym = {{ICALP}'16},
booktitle = {{P}roceedings of the 43rd {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'16)},
author = {Dmitry Chistikov and Christoph Haase},
title = {The Taming of the Semi-Linear Set},
pages = {128:1-128:14},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CH-icalp16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CH-icalp16.pdf},
doi = {10.4230/LIPIcs.ICALP.2016.128},
abstract = {Semi-linear sets, which are finitely generated subsets of
the monoid \((\mathbb{Z}^d, +)\), have numerous applications in theoretical
computer science. Although semi-linear sets are usually given
implicitly, by formulas in Presburger arithmetic or by other means,
the effect of Boolean operations on semi-linear sets in terms of the
size of generators has primarily been studied for explicit
representations. In this paper, we develop a framework suitable for
implicitly presented semi-linear sets, in which the size of a
semi-linear set is characterized by its norm---the maximal magnitude
of a generator.\par
We put together a {"}toolbox{"} of operations and decompositions for
semi-linear sets which give bounds in terms of the norm (as opposed
to just the bit-size of the description), a unified presentation,
and simplified proofs. This toolbox, in particular, provides
exponentially better bounds for the complement and set-theoretic
difference. We also obtain bounds on unambiguous decompositions and,
as an application of the toolbox, settle the complexity of the
equivalence problem for exponent-sensitive commutative grammars.}
}
@inproceedings{Zetzche-icalp16,
address = {Rome, Italy},
month = jul,
year = 2016,
volume = {55},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chatzigiannakis, Ioannis and Mitzenmacher,
Michael and Rabani, Yuval and Sangiorgi, Davide},
acronym = {{ICALP}'16},
booktitle = {{P}roceedings of the 43rd {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'16)},
author = {Georg Zetzsche},
title = {The complexity of downward closure comparisons},
pages = {123:1-123:14},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/Zetzche-icalp16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Zetzche-icalp16.pdf},
doi = {10.4230/LIPIcs.ICALP.2016.123},
abstract = {The downward closure of a language is the set of all (not
necessarily contiguous) subwords of its members. It is well-known
that the downward closure of every language is regular. Moreover,
recent results show that downward closures are computable for quite
powerful system models.\par
One advantage of abstracting a language by its downward closure is
that then, equivalence and inclusion become decidable. In~this work,
we study the complexity of these two problems. More precisely, we
consider the following decision problems: Given languages~\(K\)
and~\(L\) from classes~\(\mathcal{C}\) and~\(\mathcal{D}\),
respectively, does the downward closure of~\(K\) include (equal)
that of~\(L\)?\par
These problems are investigated for finite automata, one-counter
automata, context-free grammars, and reversal-bounded counter
automata. For each combination, we prove a completeness result
either for fixed or for arbitrary alphabets. Moreover, for Petri net
languages, we show that both problems are Ackermann-hard and for
higher-order pushdown automata of order~\(k\), we prove hardness for
complements of nondeterministic \(k\)-fold exponential time.}
}
@inproceedings{CD-icalp16,
address = {Rome, Italy},
month = jul,
year = 2016,
volume = {55},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chatzigiannakis, Ioannis and Mitzenmacher,
Michael and Rabani, Yuval and Sangiorgi, Davide},
acronym = {{ICALP}'16},
booktitle = {{P}roceedings of the 43rd {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'16)},
author = {Chatterjee, Krishnendu and Doyen, Laurent},
title = {Computation Tree Logic for Synchronization Properties},
pages = {98:1-98:14},
url = {http://arxiv.org/abs/1604.06384},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CD-icalp16.pdf},
doi = {10.4230/LIPIcs.ICALP.2016.98},
abstract = {We present a logic that extends CTL (Computation Tree Logic)
with operators that express synchronization properties. A property is
synchronized in a system if it holds in all paths of a certain length. The
new logic is obtained by using the same path quantifiers and temporal
operators as in CTL, but allowing a different order of the quantifiers.
This small syntactic variation induces a logic that can express
non-regular properties for which known extensions of MSO with equality of
path length are undecidable. We show that our variant of CTL is decidable
and that the model-checking problem is in \(\Delta_3^P = P^{NP^NP}\), and
is DP-hard. We analogously consider quantifier exchange in extensions of
CTL, and we present operators defined using basic operators of CTL* that
express the occurrence of infinitely many synchronization points. We show
that the model-checking problem remains in \(\Delta_3^P\). The
distinguishing power of CTL and of our new logic coincide if the Next
operator is allowed in the logics, thus the classical bisimulation
quotient can be used for state-space reduction before model checking.}
}
@inproceedings{GLS-icalp16,
address = {Rome, Italy},
month = jul,
year = 2016,
volume = {55},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chatzigiannakis, Ioannis and Mitzenmacher,
Michael and Rabani, Yuval and Sangiorgi, Davide},
acronym = {{ICALP}'16},
booktitle = {{P}roceedings of the 43rd {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'16)},
author = {Goubault{-}Larrecq, Jean and Schmitz, Sylvain},
title = {Deciding Piecewise Testable Separability for Regular
Tree Languages},
pages = {97:1-97:15},
url = {https://hal.inria.fr/hal-01276119/},
optpdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GLS-icalp16.pdf},
doi = {10.4230/LIPIcs.ICALP.2016.97},
abstract = {The piecewise testable separability problem asks, given
two input languages, whether there exists a piecewise testable
language that contains the first input language and is disjoint from
the second. We prove a general characterisation of piecewise
testable separability on languages in a well-quasi-order, in terms
of ideals of the ordering. This subsumes the known characterisations
in the case of finite words. In the case of finite ranked trees
ordered by homeomorphic embedding, we show using effective
representations for tree ideals that it entails the decidability of
piecewise testable separability when the input languages are
regular. A~final byproduct is a new proof of the decidability of
whether an input regular language of ranked trees is piecewise
testable, which was first shown in the unranked case by Boja{\'n}czyk,
Segoufin, and Straubing (Log.~Meth. in Comput.~Sci.,~8(3:26),
2012).}
}
@inproceedings{GHLT-icalp16,
address = {Rome, Italy},
month = jul,
year = 2016,
volume = {55},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chatzigiannakis, Ioannis and Mitzenmacher,
Michael and Rabani, Yuval and Sangiorgi, Davide},
acronym = {{ICALP}'16},
booktitle = {{P}roceedings of the 43rd {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'16)},
author = {Stefan G{\"o}ller and Christoph Haase and Ranko
Lazi{\'c} and Patrick Totzke},
title = {A Polynomial-Time Algorithm for Reachability in
Branching {VASS} in Dimension One},
pages = {105:1-105:13},
url = {http://arxiv.org/abs/1602.05547},
pfd = {http://www.lsv.fr/Publis/PAPERS/PDF/GHLT-icalp16.pdf},
doi = {10.4230/LIPIcs.ICALP.2016.105},
abstract = {Branching VASS (BVASS) generalise vector addition systems
with states by allowing for special branching transitions that can
non-deterministically distribute a counter value between two control
states. A~run of a BVASS consequently becomes a tree, and
reachability is to decide whether a given configuration is the root
of a reachability tree. This paper shows P-completeness of
reachability in BVASS in dimension one, the first decidability
result for reachability in a subclass of BVASS known so~far.
Moreover, we~show that coverability and boundedness in BVASS in
dimension one are P-complete as~well.}
}
@article{BMV-ic16,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Bouyer, Patricia and Markey, Nicolas and Vester, Steen},
title = {{N}ash Equilibria in Symmetric Graph Games with Partial Observation},
volume = {254},
number = {2},
month = jun,
year = 2017,
pages = {238-258},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BMV-ic16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BMV-ic16.pdf},
doi = {10.1016/j.ic.2016.10.010},
abstract = {We investigate a model for representing large multiplayer games,
which satisfy strong symmetry properties. This model is made of multiple
copies of an arena; each player plays in his own arena, and can partially
observe what the other players do. Therefore, this game has partial
information and symmetry constraints, which make the computation of Nash
equilibria difficult. We show several undecidability results, and for
bounded-memory strategies, we precisely characterize the complexity of
computing pure Nash equilibria (for qualitative objectives) in this game
model.}
}
@inproceedings{BCM-cav16,
address = {Toronto, Canada},
month = jul,
year = 2016,
volume = 9779,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Chaudhuri, Swarat and Farzan, Azadeh},
acronym = {{CAV}'16},
booktitle = {{P}roceedings of the 28th
{I}nternational {C}onference on
{C}omputer {A}ided {V}erification
({CAV}'16)~-- {P}art~{I}},
author = {Bouyer, Patricia and Colange, Maximilien and Markey, Nicolas},
title = {Symbolic Optimal Reachability in Weighted Timed Automata},
pages = {513-530},
url = {http://arxiv.org/abs/1602.00481},
doi = {10.1007/978-3-319-41528-4_28},
abstract = {Weighted timed automata have been defined in the early 2000's
for modelling resource-consumption or -allocation problems in real-time
systems. Optimal reachability is decidable in weighted timed automata, and
a symbolic forward algorithm has been developed to solve that problem. This
algorithm uses so-called priced zones, an extension of standard zones with
cost functions. In order to ensure termination, the algorithm requires
clocks to be bounded. For unpriced timed automata, much work has been done
to develop sound abstractions adapted to the forward exploration of timed
automata, ensuring termination of the model-checking algorithm without
bounding the clocks. In this paper, we take advantage of recent
developments on abstractions for timed automata, and propose an algorithm
allowing for symbolic analysis of all weighted timed automata, without
requiring bounded clocks.}
}
@inproceedings{BMRSS-icalp16,
address = {Rome, Italy},
month = jul,
year = 2016,
volume = {55},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chatzigiannakis, Ioannis and Mitzenmacher,
Michael and Rabani, Yuval and Sangiorgi, Davide},
acronym = {{ICALP}'16},
booktitle = {{P}roceedings of the 43rd {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'16)},
author = {Bouyer, Patricia and Markey, Nicolas and Randour,
Mickael and Sangnier, Arnaud and Stan, Daniel},
title = {Reachability in Networks of Register Protocols under
Stochastic Schedulers},
pages = {106:1-106:14},
url = {http://arxiv.org/abs/1602.05928},
doi = {10.4230/LIPIcs.ICALP.2016.106},
abstract = {We study the almost-sure reachability problem in a distributed
system obtained as the asynchronous composition of~\(N\) copies (called
\emph{processes}) of the same automaton (called \emph{protocol}), that can
communicate via a shared register with finite domain. The automaton has
two types of transitions: write-transitions update the value of the
register, while read-transitions move to a new state depending on the
content of the register. Non-determinism is resolved by a stochastic
scheduler. Given a protocol, we focus on almost-sure reachability of a
target state by one of the processes. The answer to this problem naturally
depends on the number~\(N\) of processes. However, we prove that our
setting has a cut-off property : the answer to the almost-sure
reachability problem is constant when \(N\) is large enough; we~then
develop an EXPSPACE algorithm deciding whether this constant answer is
positive or negative.}
}
@inproceedings{LS-lics16,
address = {New York City, USA},
month = jul,
year = 2016,
publisher = {ACM Press},
editor = {Grohe, Martin and Koskinen, Eric and Shankar, Natarajan},
acronym = {{LICS}'16},
booktitle = {{P}roceedings of the 31st {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'16)},
author = {Ranko Lazi{\'c} and Sylvain Schmitz},
title = {The Complexity of Coverability in {{\(\nu\)}}-{P}etri Nets},
pages = {467-476},
url = {https://hal.inria.fr/hal-01265302},
doi = {10.1145/2933575.2933593},
abstract = {We show that the coverability problem in nu-Petri
nets is complete for `double Ackermann' time, thus
closing an open complexity gap between an Ackermann
lower bound and a hyper-Ackermann upper bound. The
coverability problem captures the verification of
safety properties in this nominal extension of Petri
nets with name management and fresh name
creation. Our completeness result establishes
nu-Petri nets as a model of intermediate power among
the formalisms of nets enriched with data, and
relies on new algorithmic insights brought by the
use of well-quasi-order ideals.}
}
@inproceedings{DBHS-lics16,
address = {New York City, USA},
month = jul,
year = 2016,
publisher = {ACM Press},
editor = {Grohe, Martin and Koskinen, Eric and Shankar, Natarajan},
acronym = {{LICS}'16},
booktitle = {{P}roceedings of the 31st {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'16)},
author = {Amina Doumane and David Baelde and Lucca Hirschi
and Alexis Saurin},
title = {Towards Completeness via Proof Search in the Linear
Time {{\(\mu\)}}-calculus},
pages = {377-386},
url = {https://hal.archives-ouvertes.fr/hal-01275289/},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DBHS-lics16.pdf},
doi = {10.1145/2933575.2933598},
abstract = {Modal \(\mu\)-calculus is one of the central
languages of logic and verification, whose study
involves notoriously complex objects: automata over
infinite structures on the model-theoretical side;
infinite proofs and proofs by (co)induction on the
proof-theoretical side. Nevertheless,
axiomatizations have been given for both linear and
branching time \(\mu\)-calculi, with quite involved
completeness arguments. We come back to this
central problem, considering it from a proof search
viewpoint, and provide some new completeness
arguments in the linear time \(\mu\)-calculus. Our
results only deal with restricted classes of
formulas that closely correspond to
(non-alternating) \(\omega\)-automata but, compared
to earlier proofs, our completeness arguments are
direct and constructive. We first consider a
natural circular proof system based on sequent
calculus, and show that it is complete for
inclusions of parity automata directly expressed as
formulas, making use of Safra's construction
directly in proof search. We then consider the
corresponding finitary proof system, featuring
(co)induction rules, and provide a partial
translation result from circular to finitary
proofs. This yields completeness of the finitary
proof system for inclusions of sufficiently
deterministic parity automata, and finally for
arbitrary B{\"u}chi automata.}
}
@inproceedings{CG-lics16,
address = {New York City, USA},
month = jul,
year = 2016,
publisher = {ACM Press},
editor = {Grohe, Martin and Koskinen, Eric and Shankar, Natarajan},
acronym = {{LICS}'16},
booktitle = {{P}roceedings of the 31st {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'16)},
author = {{\relax Th}omas Colcombet and Stefan G{\"o}ller},
title = {Games with bound guess actions},
pages = {257-266},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CG-lics16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CG-lics16.pdf},
doi = {10.1145/2933575.2934502},
abstract = {We introduce games with (bound) guess actions. These are games in which the players may be asked along the play to provide num- bers that need to satisfy some bounding constraints. These are nat- ural extensions of domination games occurring in the regular cost function theory. In this paper we consider more specifically the case where the constraints to be bounded are regular cost functions, and the long term goal is an ?-regular winning condition. We show that such games are decidable on finite arenas.}
}
@inproceedings{CD-lics16,
address = {New York City, USA},
month = jul,
year = 2016,
publisher = {ACM Press},
editor = {Grohe, Martin and Koskinen, Eric and Shankar, Natarajan},
acronym = {{LICS}'16},
booktitle = {{P}roceedings of the 31st {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'16)},
author = {Chatterjee, Krishnendu and Doyen, Laurent},
title = {Perfect-information Stochastic Games with
Generalized Mean-Payoff Objectives},
pages = {247-256},
url = {http://arxiv.org/abs/1604.06376},
doi = {10.1145/2933575.2934513},
abstract = {Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information stochastic games, where some transitions of the game graph are controlled by two adversarial players, and the other transitions are executed probabilistically. We consider such games where the objective is the conjunction of several quantitative objectives (specified as mean-payoff conditions), which we refer to as generalized mean-payoff objectives. The basic decision problem asks for the existence of a finite-memory strategy for a player that ensures the generalized mean-payoff objective be satisfied with a desired probability against all strategies of the opponent. A special case of the decision problem is the almost-sure problem where the desired probability is~1. Previous results presented a semi-decision procedure for epsilon-approximations of the almost-sure problem. In this work, we show that both the almost-sure problem as well as the general basic decision problem are coNP-complete, significantly improving the previous results. Moreover, we show that in the case of 1-player stochastic games, randomized memoryless strategies are sufficient and the problem can be solved in polynomial time. In contrast, in two-player stochastic games, we show that even with randomized strategies exponential memory is required in general, and present a matching exponential upper bound. We also study the basic decision problem with infinite-memory strategies and present computational complexity results for the problem. Our results are relevant in the synthesis of stochastic reactive systems with multiple quantitative requirements. }
}
@inproceedings{DOMZ-lics16,
address = {New York City, USA},
month = jul,
year = 2016,
publisher = {ACM Press},
editor = {Grohe, Martin and Koskinen, Eric and Shankar, Natarajan},
acronym = {{LICS}'16},
booktitle = {{P}roceedings of the 31st {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'16)},
author = {D'Osualdo, Emanuele and Roland Meyer and Georg Zetzsche},
title = {First-order logic with reachability for infinite-state systems},
pages = {457-466},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DOMZ-lics16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DOMZ-lics16.pdf},
doi = {10.1145/2933575.2934552},
abstract = {First-order logic with the reachability predicate
(FO(R)) is an important means of specification in
system analysis. Its decidability status is known
for some individual types of infinite-state systems
such as pushdown (decidable) and vector addition
systems (undecidable). \par This work aims at a
general understanding of which types of systems
admit decidability. As a unifying model, we employ
valence systems over graph monoids, which feature a
finite-state control and are parameterized by a
monoid to represent their storage mechanism. As
special cases, this includes pushdown systems,
various types of counter systems (such as vector
addition systems) and combinations thereof. Our
main result is a complete characterization of those
graph monoids where FO(R) is decidable for the
resulting transition systems.}
}
@inproceedings{ACHKSZ-lics16,
address = {New York City, USA},
month = jul,
year = 2016,
publisher = {ACM Press},
editor = {Grohe, Martin and Koskinen, Eric and Shankar, Natarajan},
acronym = {{LICS}'16},
booktitle = {{P}roceedings of the 31st {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'16)},
author = {Atig, Mohamed Faouzi and Dmitry Chistikov and Piotr
Hofman and Kumar, K. Narayan and Prakash Saivasan and
Georg Zetzsche},
title = {Complexity of regular abstractions of one-counter languages},
pages = {207-216},
url = {http://arxiv.org/abs/1602.03419},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACHKSZ-lics16.pdf},
doi = {10.1145/2933575.2934561},
abstract = {We study the computational and descriptional complexity of
the following transformation: Given a one-counter
automaton~(OCA)~\(A\), construct a nondeterministic
finite automaton~(NFA)~\(B\) that recognizes an
abstraction of the language~\(L(A)\): its~(1)~downward
closure, (2)~upward closure, or (3)~Parikh image. For
the Parikh image over a fixed alphabet and for the
upward and downward closures, we find polynomial-time
algorithms that compute such an NFA. For the Parikh
image with the alphabet as part of the input, we find
a quasi-polynomial time algorithm and prove a
completeness result: we construct a sequence of OCA
that admits a polynomial-time algorithm iff there is
one for all OCA. For all three abstractions, it was
previously unknown if appropriate NFA of
sub-exponential size exist.}
}
@inproceedings{HBD-sp16,
address = {San Jose, California, USA},
month = may,
year = 2016,
publisher = {IEEECSP},
editor = {Locasto, Michael and Shmatikov, Vitaly and Erlingsson, {\'U}lfar},
acronym = {{S\&P}'16},
booktitle = {{P}roceedings of the 37th {IEEE} {S}ymposium
on {S}ecurity and {P}rivacy ({S\&P}'16)},
author = {Hirschi, Lucca and Baelde, David and Delaune, St{\'e}phanie},
title = {A~method for verifying privacy-type properties:
the~unbounded case},
pages = {564-581},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HBD-sp16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HBD-sp16.pdf},
doi = {10.1109/SP.2016.40},
abstract = {In~this paper, we~consider the problem of verifying
anonymity and unlinkability in the symbolic model, where protocols
are represented as processes in a variant of the applied pi calculus
notably used in the Proverif tool. Existing tools and techniques do
not allow one to verify directly these properties, expressed as
behavioral equivalences. We propose a different approach: we design
two conditions on protocols which are sufficient to ensure anonymity
and unlinkability, and which can then be effectively checked
automatically using Proverif. Our two conditions correspond to two
broad classes of attacks on unlinkability, corresponding to data and
control-flow leaks.\par
This theoretical result is general enough to apply to a wide class
of protocols. In particular, we apply our techniques to provide the
first formal security proof of the BAC protocol (e-passport). Our
work has also lead to the discovery of new attacks, including one on
the LAK protocol (RFID authentication) which was previously claimed
to be unlinkable (in~a weak sense) and one on the PACE protocol
(e-passport).}
}
@inproceedings{CC-pn16,
address = {Tor{\'u}n, Poland},
month = jun,
year = 2016,
volume = {9698},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Kordon, Fabrice and Moldt, Daniel},
acronym = {{PETRI~NETS}'16},
booktitle = {{P}roceedings of the 37th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'16)},
author = {Carmona, Josep and Chatain, {\relax Th}omas},
title = {Anti-Alignments in Conformance Checking~-- The~Dark Side of Process Models},
pages = {240-258},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CC-pn16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CC-pn16.pdf},
doi = {10.1007/978-3-319-39086-4_15},
abstract = {Conformance checking techniques asses the suitability of a
process model in representing an underlying process, observed
through a collection of real executions. These techniques suffer
from the well-known state space explosion problem, hence handling
process models exhibiting large or even infinite state spaces
remains a challenge. One important metric in conformance checking is
to asses the precision of the model with respect to the observed
executions, i.e., characterize the ability of the model to produce
behavior unrelated to the one observed. By~avoiding the computation
of the full state space of a model, current techniques only provide
estimations of the precision metric, which in some situations tend
to be very optimistic, thus hiding real problems a process model may
have. In this paper we present the notion of anti-alignment as a
concept to help unveiling traces in the model that may deviate
significantly from the observed behavior. Using anti-alignments,
current estimations can be improved, e.g., in precision checking. We
show how to express the problem of finding anti-alignments as the
satisfiability of a Boolean formula, and provide a tool which can
deal with large models efficiently.}
}
@comment{{B-arxiv16,
author = Bollig, Benedikt,
affiliation = aff-LSVmexico,
title = One-Counter Automata with Counter Visibility,
institution = Computing Research Repository,
number = 1602.05940,
month = feb,
nmonth = 2,
year = 2016,
type = RR,
axeLSV = mexico,
NOcontrat = "",
url = http://arxiv.org/abs/1602.05940,
PDF = "http://www.lsv.fr/Publis/PAPERS/PDF/B-arxiv16.pdf",
lsvdate-new = 20160222,
lsvdate-upd = 20160222,
lsvdate-pub = 20160222,
lsv-category = "rapl",
wwwpublic = "public and ccsb",
note = 18~pages,
abstract = "In a one-counter automaton (OCA), one can read a letter
from some finite alphabet, increment and decrement the counter by
one, or test it for zero. It is well-known that universality and
language inclusion for OCAs are undecidable. We consider here OCAs
with counter visibility: Whenever the automaton produces a letter,
it outputs the current counter value along with~it. Hence, its
language is now a set of words over an infinite alphabet. We show
that universality and inclusion for that model are in PSPACE, thus
no harder than the corresponding problems for finite automata, which
can actually be considered as a special case. In fact, we show that
OCAs with counter visibility are effectively determinizable and
closed under all boolean operations. As~a~strict generalization, we
subsequently extend our model by registers. The general nonemptiness
problem being undecidable, we impose a bound on the number of
register comparisons and show that the corresponding nonemptiness
problem is NP-complete.",
}}
@techreport{CHH-arxiv16,
author = {Chistikov, Dmitry and Haase, Christoph and Halfon, Simon},
title = {Context-Free Commutative Grammars with Integer Counters and Resets},
institution = {Computing Research Repository},
number = {1511-04893},
year = {2015},
month = nov,
type = {Research Report},
url = {http://arxiv.org/abs/1511.04893},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CHH-arxiv16.pdf},
note = {31~pages},
abstract = {We study the computational complexity of reachability,
coverability and inclusion for extensions of context-free commutative
grammars with integer counters and reset operations on them. Those
grammars can alternatively be viewed as an extension of communication-free
Petri nets. Our main results are that reachability and coverability are
inter-reducible and both NP-complete. In particular, this class of
commutative grammars enjoys semi-linear reachability sets. We also show
that the inclusion problem is, in general, coNEXP-complete and already
\(\Pi^{P}_{2}\)-complete for grammars with only one non-terminal symbol.
Showing the lower bound for the latter result requires us to develop a
novel \(\Pi^{P}_{2}\)-complete variant of the classic subset sum
problem.}
}
@techreport{DD-arxiv16,
author = {D{\'i}az{-}Caro, Alejandro and Dowek, Gilles},
title = {Quantum superpositions and projective measurement in
the lambda calculus},
institution = {Computing Research Repository},
number = {1601.04294},
year = {2016},
month = jan,
type = {Research Report},
url = {http://arxiv.org/abs/1601.04294},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-arxiv16.pdf},
note = {22~pages},
abstract = {We propose an extension of simply typed lambda-calculus to
handle some properties of quantum computing. The equiprobable quantum
superposition is taken as a commutative pair and the quantum measurement
as a non-deterministic projection over it. Destructive interferences are
achieved by introducing an inverse symbol with respect to pairs. The
no-cloning property is ensured by using a combination of syntactic
linearity with linear logic. Indeed, the syntactic linearity is enough for
unitary gates, while a function measuring its argument needs to enforce
that the argument is used only once.}
}
@misc{vip-D32,
author = {Baelde, David and Delaune, St{\'e}phanie and Kremer, Steve},
title = {Decision procedures for equivalence based properties (part~{II})},
howpublished = {Deliverable VIP~3.2 (ANR-11-JS02-0006)},
month = sep,
year = {2015},
note = {9~pages},
type = {Contract Report},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/vip-d32.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/vip-d32.pdf}
}
@misc{vip-D41,
author = {Delaune, St{\'e}phanie and Kremer, Steve},
title = {Composition results for equivalence-based security properties},
howpublished = {Deliverable VIP~3.1 (ANR-11-JS02-0006)},
month = sep,
year = {2015},
note = {6~pages},
type = {Contract Report},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/vip-d41.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/vip-d41.pdf}
}
@article{LS-sigmodrec15,
publisher = {ACM Press},
journal = {SIGMOD Records},
author = {Segoufin, Luc},
title = {Constant Delay Enumeration for Conjunctive Queries},
year = 2015,
volume = {44},
number = {1},
pages = {10-17},
month = mar,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-sigmodrec15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LS-sigmodrec15.pdf},
doi = {10.1145/2783888.2783894},
abstract = {We survey some of the recent results about enumerating the
answers to queries over a database. We focus on the case where the
enumeration is performed with a constant delay between any two consecutive
solutions, after a linear time preprocessing.\par
This cannot be always achieved. It requires restricting either the class
of queries or the class of databases.\par
We consider conjunctive queries and describe several scenarios when this
is possible.}
}
@article{PS-lmcs15,
journal = {Logical Methods in Computer Science},
author = {Place, {\relax Th}omas and Segoufin, Luc},
title = {Deciding definability in
{{\(\textrm{FO}^{2}(<_{\textbf{h}},<_{\textbf{v}})\)}} on
trees},
year = 2015,
volume = {11},
number = {3:5},
nopages = {},
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/PS-lmcs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/PS-lmcs15.pdf},
doi = {10.2168/LMCS-11(3:5)2015},
abstract = {We provide a decidable characterization of regular forest
languages definable in \(\textrm{FO}^{2}(<_{\textbf{h}},<_{\textbf{v}})\).
By~\(\textrm{FO}^{2}(<_{\textbf{h}},<_{\textbf{v}})\) we refer to the two
variable fragment of first order logic built from the descendant relation
and the following sibling relation. In terms of expressive power it
corresponds to a fragment of the navigational core of XPath that contains
modalities for going up to some ancestor, down to some descendant, left to
some preceding sibling, and right to some following sibling.\par
We also show that our techniques can be applied to other two variable
first-order logics having exactly the same vertical modalities as
\(\textrm{FO}^{2}(<_{\textbf{h}},<_{\textbf{v}})\) but having different
horizontal modalities.}
}
@article{FSS-lmcs15,
journal = {Logical Methods in Computer Science},
author = {Francis, Nadime and Segoufin, Luc and Sirangelo, Cristina},
title = {Datalog Rewritings of Regular Path Queries using Views},
year = 2015,
volume = {11},
number = {4:14},
nopages = {},
month = dec,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FSS-lmcs15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FSS-lmcs15.pdf},
doi = {10.2168/LMCS-11(4:14)2015},
abstract = {We consider query answering using views on graph databases, i.e.
databases structured as edge-labeled graphs. We mainly consider views and
queries specified by Regular Path Queries~(RPQ). These are queries
selecting pairs of nodes in a graph database that are connected via a path
whose sequence of edge labels belongs to some regular language. We say
that a view~\(\textbf{V}\) determines a query~\(Q\) if for all graph
databases~\(D\), the~view image~\(\textbf{V}(D)\) always contains enough
information to answer~\(Q\) on~\(D\). In~other words, there is a well
defined function from~\(\textbf{V}(D)\) to~\(Q(D)\).\par
Our main result shows that when this function is monotone, there exists a
rewriting of~\(Q\) as a Datalog query over the view
instance~\(\textbf{V}(D)\). In particular the rewriting query can be
evaluated in time polynomial in the size of~\(\textbf{V}(D)\). Moreover
this implies that it is decidable whether an RPQ query can be rewritten in
Datalog using RPQ views.}
}
@article{BCS-jacm15,
publisher = {ACM Press},
journal = {Journal of the~{ACM}},
author = {B{\'a}r{\'a}ny, Vince and ten Cate, Balder and Segoufin, Luc},
title = {Guarded nagation},
year = 2015,
volume = {62},
number = {3:22},
nopages = {},
month = jun,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BCS-jacm15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BCS-jacm15.pdf},
doi = {10.1145/2701414},
abstract = { We consider restrictions of first-order logic and of fixpoint
logic in which all occurrences of negation are required to be guarded by
an atomic predicate. In terms of expressive power, the logics in question,
called GNFO and GNFP, extend the guarded fragment of first-order logic and
the guarded least fixpoint logic, respectively. They also extend the
recently introduced unary negation fragments of first-order logic and of
least fixpoint logic.\par
We show that the satisfiability problem for GNFO and for GNFP is
2ExpTime-complete, both on arbitrary structures and on finite structures.
We also study the complexity of the associated model checking problems.
Finally, we show that GNFO and GNFP are not only computationally well
behaved, but also model theoretically: we~show that GNFO and GNFP have the
tree-like model property and that GNFO has the finite model property, and
we characterize the expressive power of GNFO in terms of invariance for an
appropriate notion of bisimulation.\par
Our complexity upper bounds for GNFO and GNFP hold true even for their
{"}clique-guarded{"} extensions CGNFO and CGNFP, in which clique guards are
allowed in the place of guards.}
}
@inproceedings{DS-flc2,
noaddress = {Berlin, Germany},
month = sep,
year = 2015,
volume = 9300,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
noacronym = {},
booktitle = {Fields of Logic and Computation~{II}~-- Essays Dedicated to {Y}uri
{G}urevich on the Occasion of His 75th Birthday},
editor = { Beklemishev, Lev D. and Blass, Andreas and Dershowitz,
Nachum and Finkbeiner, Bernd and Schulte, Wolfram},
author = {Dawar, Anuj and Segoufin, Luc},
title = {Capturing {MSO} with one quantifier},
pages = {142-152},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DS-flc2.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DS-flc2.pdf},
doi = {10.1007/978-3-319-23534-9_8},
abstract = {We construct a single Lindstr{\"o}m quantifier~\(Q\) such that
\(\textrm{FO} (Q)\), the extension of first-order logic with~\(Q\) has the same
expressive power as monadic second-order logic on the class of binary
trees (with distinct left and right successors) and also on unranked trees
with a sibling order. This resolves a conjecture by ten~Cate and Segoufin.
The quantifier~\(Q\) is a variation of a quantifier expressing the Boolean
satisfiability problem.}
}
@inproceedings{SA-adbis15,
address = {Poitiers, France},
month = sep,
year = 2015,
nmnote = {post-proceedings published by LNCS, to appear},
editor = {Bellatreche, Ladjel},
acronym = {{ADBIS}'15},
booktitle = {{P}roceedings of the 19th {E}ast-{E}uropean {C}onference on {A}dvances in
{D}atabases and {I}nformation {S}ystems ({ADBIS}'15)},
author = {Abiteboul, Serge},
title = {The Story of Webdamlog},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SA-adbis15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SA-adbis15.pdf},
abstract = {We~summarize in this paper works about the management of data in
a distributed manner based on Webdamlog, a datalog-extension. We~point to
relevant articles on these works. More references may be found there.}
}
@inproceedings{FGMP-hscc16,
address = {Vienna, Austria},
month = apr,
year = 2016,
publisher = {ACM Press},
editor = {Abate, Alessandro and Fainekos, Georgios},
acronym = {{HSCC}'16},
booktitle = {{P}roceedings of the 19th {ACM} {I}nternational {C}onference
on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
({HSCC}'16)},
author = {Fribourg, Laurent and Goubault, {\'E}ric and Mohamed, Sameh
and Putot, Sylvie},
title = {A~Topological Method for Finding Invariant Sets of Switched Systems},
pages = {61-70},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FGMP-hscc16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FGMP-hscc16.pdf},
doi = {10.1145/2883817.2883822},
abstract = {We~revisit the problem of finding controlled invariants sets
(viability), for a class of differential inclusions, using topological
methods based on Wazewski property. In~many ways, this generalizes the
Viability Theorem approach, which is itself a generalization of the
Lyapunov function approach for systems described by ordinary differential
equations. We give a computable criterion based on SoS methods for a class
of differential inclusions to have a non-empty viability kernel within
some given region. We use this method to prove the existence of
(controlled) invariant sets of switched systems inside a region described
by a polynomial template, both with time-dependent switching and with
state-based switching through a finite set of hypersurfaces. A~Matlab
implementation allows us to demonstrate its use.}
}
@phdthesis{rc-phd2016,
author = {Chr{\'e}tien, R{\'e}my},
title = {Analyse automatique de propri{\'e}t{\'e}s d'{\'e}quivalence pour
les protocoles cryptographiques},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2016,
month = jan,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/rc-phd16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/rc-phd16.pdf}
}
@article{DGLM-tocs16,
publisher = {Springer},
journal = {Theory of Computing Systems},
author = {Demri, St{\'e}phane and Galmiche, Didier and
Larchey-Wendling, Dominique and Mery, Daniel},
title = {Separation Logic with One Quantified Variable},
year = 2017,
volume = {61},
number = {2},
pages = {371-461},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DGLM-tocs16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DGLM-tocs16.pdf},
doi = {10.1007/s00224-016-9713-1},
abstract = {We investigate first-order separation logic with one record
field restricted to a unique quantified variable (1SL1). Undecidability is
known when the number of quantified variables is unbounded and the
satisfiability problem is pspace-complete for the propositional fragment.
We show that the satisfiability problem for 1SL1 is pspace-complete and we
characterize its expressive power by showing that every formula is
equivalent to a Boolean combination of atomic properties. This contributes
to our understanding of fragments of first-order separation logic that can
specify properties about the memory heap of programs with singly-linked
lists. All the fragments we consider contain the magic wand operator and
first-order quantification over a single variable.}
}
@inproceedings{LS-stacs16,
address = {Orl{\'e}ans, France},
month = feb,
year = 2016,
volume = {47},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Ollinger, Nicolas and Vollmer, Heribert},
acronym = {{STACS}'16},
booktitle = {{P}roceedings of the 33rd {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'16)},
author = {Leroux, J{\'e}r{\^o}me and Schmitz, Sylvain},
title = {Ideal Decompositions for Vector Addition Systems},
pages = {1:1-1:13},
url = {http://drops.dagstuhl.de/opus/volltexte/2016/5702},
doi = {10.4230/LIPIcs.STACS.2016.1},
abstract = {Vector addition systems, or equivalently Petri nets, are one of
the most popular formal models for the representation and the analysis of
parallel processes. Many problems for vector addition systems are known to
be decidable thanks to the theory of well-structured transition systems.
Indeed, vector addition systems with configurations equipped with the
classical point-wise ordering are well-structured transition systems.
Based on this observation, problems like coverability or termination can
be proven decidable.\par
However, the theory of well-structured transition systems does not explain
the decidability of the reachability problem. In this presentation, we
show that runs of vector addition systems can also be equipped with a well
quasi-order. This observation provides a unified understanding of the data
structures involved in solving many problems for vector addition systems,
including the central reachability problem.}
}
@article{siglog16-Schmitz,
publisher = {ACM Press},
journal = {SIGLOG News},
author = {Schmitz, Sylvain},
title = {Automata column: The~complexity of reachability in
vector addition systems},
volume = 3,
number = 1,
pages = {3-21},
year = 2016,
month = jan,
url = {https://hal.inria.fr/hal-01275972},
doi = {10.1145/2893582.2893585},
annote = {Invited column},
abstract = {The program of the 30th Symposium on Logic in Computer Science
held in 2015 in Kyoto included two contributions on the computational
complexity of the reachability problem for vector addition systems:
Blondin, Finkel, G{\"o}ller, Haase, and McKenzie~[2015] attacked the
problem by providing the first tight complexity bounds in the case of
dimension-2 systems with states, while Leroux and Schmitz~[2015] proved
the first complexity upper bound in the general case. The purpose of this
column is to present the main ideas behind these two results, and more
generally survey the current state of affairs.}
}
@article{CFS-tcs16,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Chambart, Pierre and Finkel, Alain and Schmitz, Sylvain},
title = {Forward Analysis and Model Checking for Trace
Bounded~{WSTS}},
year = 2016,
volume = {637},
pages = {1-29},
month = jul,
url = {http://arxiv.org/abs/1004.2802},
doi = {10.1016/j.tcs.2016.04.020},
abstract = {We investigate a subclass of well-structured transition
systems~(WSTS), the bounded---in the sense of Ginsburg and Spanier
(Trans.~AMS, 1964)---complete deterministic ones, which we claim provide
an adequate basis for the study of forward analyses as developed by
Finkel and Goubault-Larrecq (ICALP~2009). Indeed, we prove that, unlike
other conditions considered previously for the termination of forward
analysis, boundedness is decidable. Boundedness turns out to be a
valuable restriction for WSTS verification, as we show that it further
allows to decide all {{\(\omega\)}}-regular properties on the set of infinite
traces of the system.}
}
@article{toct-Schmitz13,
publisher = {ACM Press},
journal = {ACM Transactions on Computation Theory},
author = {Schmitz, Sylvain},
title = {Complexity Hierarchies Beyond {E}lementary},
volume = {8},
number = {1:3},
nopages = {},
year = 2016,
month = feb,
url = {http://arxiv.org/abs/1312.5686},
doi = {10.1145/2858784},
abstract = {We introduce a hierarchy of fast-growing complexity classes and
show its suitability for completeness statements of many non elementary
problems. This hierarchy allows the classification of many decision
problems with a non-elementary complexity, which occur naturally in
logic, combinatorics, formal languages, verification, etc., with
complexities ranging from simple towers of exponentials to Ackermannian
and beyond.}
}
@proceedings{HM-acsd2015,
editor = {Haar, Stefan and Meyer, Roland},
title = {{P}roceedings of the 15th {I}nternational
{C}onference on {A}pplication of {C}oncurrency
to {S}ystem {D}esign
({ACSD}'15)},
booktitle = {{P}roceedings of the 15th {I}nternational
{C}onference on {A}pplication of {C}oncurrency
to {S}ystem {D}esign
({ACSD}'15)},
acronym = {{ACSD}'15},
publisher = {{IEEE} Computer Society Press},
year = 2015,
month = jun,
address = {Brussels, Belgium},
url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7352411}
}
@inproceedings{ADESWSS-webdb15,
address = {Melbourne, Australia},
month = may,
year = 2015,
publisher = {ACM Press},
editor = {Stoyanovich, Julia and Suchanek, Fabian M},
acronym = {({W}eb{DB}'15)},
booktitle = {{P}roceedings of the 18th {I}nternational {W}orkshop on the
{W}eb and {D}atabases ({W}eb{DB}'15)},
author = {Abiteboul, Serge and Dong, Xin Luna and Etzioni, Oren and
Srivastava, Divesh and Weikum, Gerhard and Stoyanovich,
Julia and Suchanek, Fabian M.},
title = {The elephant in the room: getting value from Big Data},
pages = {1-5},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/ADESWSS-webdb15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ADESWSS-webdb15.pdf},
doi = {10.1145/2767109.2770014}
}
@inproceedings{MSAM-sigmod15,
address = {Melbourne, Australia},
month = may # {-} # jun,
year = 2015,
publisher = {ACM Press},
editor = {Sellis, Timos K. and Davidson, Susan B. and Ives,Zachary G.},
acronym = {{SIGMOD}'15},
booktitle = {{P}roceedings of the {ACM} {SIGMOD} {I}nternaitonal
{C}onference on {M}anagement of {D}ata ({SIGMOD}'15)},
author = {Moffitt, Vera Zaychik and Stoyanovich, Julia and Abiteboul,
Serge and Miklau, Gerome},
title = {Collaborative Access Control in {W}ebdam{L}og},
pages = {197-211},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/MSAM-sigmod15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/MSAM-sigmod15.pdf},
doi = {10.1109/DSAA.2015.7344775},
abstract = {The management of Web users' personal information is
increasingly distributed across a broad array of applications and systems,
including online social networks and cloud-based services. Users wish to
share data using these systems, but avoiding the risks of unintended
disclosures or unauthorized access by applications has become a major
challenge.\par
We propose a novel access control model that operates within a distributed
data management framework based on datalog. Using this model, users can
control access to data they own and control applications they run. They
can conveniently specify access control policies providing flexible
tuple-level control derived using provenance information. We present a
formal specification of the model, an implementation built using an
open-source distributed datalog engine, and an extensive experimental
evaluation showing that the computational cost of access control is
modest.}
}
@article{cacm15-AAK,
publisher = {ACM Press},
journal = {Communications of the~{ACM}},
author = {Abiteboul, Serge and Andr{\'e}, Benjamin and Kaplan, Daniel},
title = {Managing your digital life},
volume = {58},
number = {5},
pages = {32-35},
year = 2015,
month = may,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/cacm15-AAK.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/cacm15-AAK.pdf},
doi = {10.1145/2670528},
abstract = {Everyone should be able to manage their personal data
with a personal information management system.}
}
@inproceedings{CCHPW-fossacs16,
address = {Eindhoven, The~Netherlands},
month = apr,
year = 2016,
volume = {9634},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Jacobs, Bart and L{\"o}ding, Christof},
acronym = {{FoSSaCS}'16},
booktitle = {{P}roceedings of the 19th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'16)},
author = {Chistikov, Dmitry and Czerwi{\'n}ski, Wojciech and Hofman,
Piotr and Pilipczuk, Micha{\l} and Wehar, Michael},
title = {Shortest paths in one-counter systems},
pages = {462-478},
url = {http://arxiv.org/abs/1510.05460},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCHPW-fossacs16.pdf},
doi = {10.1007/978-3-662-49630-5_27},
abstract = {We show that any one-counter automaton with \(n\) states, if its
language is non-empty, accepts some word of length at most~\(O(n^2)\).
This closes the gap between the previously known upper bound of~\(O(n^3)\)
and lower bound of~\(\Omega(n^2)\). More generally, we prove a tight upper
bound on the length of shortest paths between arbitrary configurations in
one-counter transition systems. Weaker bounds have previously appeared in
the literature, and our result offers an improvement.}
}
@inproceedings{HLLLST-fossacs16,
address = {Eindhoven, The~Netherlands},
month = apr,
year = 2016,
volume = {9634},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Jacobs, Bart and L{\"o}ding, Christof},
acronym = {{FoSSaCS}'16},
booktitle = {{P}roceedings of the 19th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'16)},
author = {Hofman, Piotr and Lasota, S{\l}awomir and Lazi{\'c}, Ranko and
Leroux, J{\'e}r{\^o}me and Schmitz, Sylvain and Totzke, Patrick},
title = {Coverability Trees for {P}etri Nets with Unordered Data},
pages = {445-461},
url = {https://hal.inria.fr/hal-01252674},
doi = {10.1007/978-3-662-49630-5_26},
abstract = {We study an extension of classical Petri nets where tokens carry
values from a countable data domain, that can be tested for equality upon
firing transitions. These Unordered Data Petri Nets (UDPN) are
well-structured and therefore allow generic decision procedures for
several verification problems including coverability and boundedness. We
show how to construct a finite representation of the coverability set in
terms of its ideal decomposition. This not only provides an alternative
method to decide coverability and boundedness, but is also an important
step towards deciding the reachability problem. This also allows to answer
more precise questions about the reachability set, for instance whether
there is a bound on the number of tokens on a given place (place
boundedness), or if such a bound exists for the number of different data
values carried by tokens (place width boundedness). We provide matching
Hyper-Ackermann bounds on the size of cover-ability trees and on the
running time of the induced decision procedures.}
}
@inproceedings{FG-fossacs16,
address = {Eindhoven, The~Netherlands},
month = apr,
year = 2016,
volume = {9634},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Jacobs, Bart and L{\"o}ding, Christof},
acronym = {{FoSSaCS}'16},
booktitle = {{P}roceedings of the 19th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'16)},
author = {Fortin, Marie and Gastin, Paul},
title = {Verification of parameterized communicating automata via split-width},
pages = {197-213},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/FG-fossacs16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FG-fossacs16.pdf},
doi = {10.1007/978-3-662-49630-5_12},
abstract = {We~study verification problems for distributed systems
communicating via unbounded FIFO channels. The number of processes
of the system as well as the communication topology are not fixed
a~priori. Systems are given by parameterized communicating automata
(PCAs) which can be run on any communication topology of bounded
degree, with arbitrarily many processes. Such systems are Turing
powerful so we concentrate on under-approximate verification. We
extend the notion of split-width to behaviors of PCAs. We show that
emptiness, reachability and model-checking problems of PCAs are
decidable when restricted to behaviors of bounded split-width.
Reachability and emptiness are EXPTIME-complete, but only polynomial
in the size of the PCA. We also describe several concrete classes of
bounded split-width, for which we prove similar results.}
}
@inproceedings{CDD-post16,
address = {Eindhoven, The~Netherlands},
month = apr,
year = 2016,
volume = { 9635},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Piessens, Frank and Vigan{\'o}, Luca},
acronym = {{POST}'16},
booktitle = {{P}roceedings of the 5th {I}nternational {C}onference on
{P}rinciples of {S}ecurity and {T}rust
({POST}'16)},
author = {Cortier, V{\'e}ronique and Dallon, Antoine and
Delaune, St{\'e}phanie},
title = {Bounding the number of agents, for equivalence~too},
pages = {211-232},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/CDD-post16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDD-post16.pdf},
doi = {10.1007/978-3-662-49635-0_11},
abstract = {Bounding the number of agents is a current practice when
modeling a protocol. In~2003, it has been shown that one honest agent and
one dishonest agent are indeed sufficient to find all possible attacks,
for secrecy properties. This is no longer the case for equivalence
properties, crucial to express many properties such as vote privacy or
untraceability.\par
In this paper, we show that it is sufficient to consider two honest agents
and two dishonest agents for equivalence properties, for deterministic
processes with standard primitives and without else branches. More
generally, we show how to bound the number of agents for arbitrary
constructor theories and for protocols with simple else branches. We show
that our hypotheses are tight, providing counter-examples for non
actiondeterministic processes, non constructor theories, or protocols with
complex else branches.}
}
@inproceedings{tacas16-BFHH,
address = {Eindhoven, The Netherlands},
month = apr,
year = 2016,
volume = {9636},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Chechik, Marsha and Raskin, Jean-Fran{\c{c}}ois},
acronym = {{TACAS}'16},
booktitle = {{P}roceedings of the 22th {I}nternational
{C}onference on {T}ools and {A}lgorithms for
{C}onstruction and {A}nalysis of {S}ystems
({TACAS}'16)},
author = {Blondin, Michael and Finkel, Alain and Haase, Christoph and
Haddad, Serge},
title = {Approaching the Coverability Problem Continuously},
pages = {480-496},
url = {http://arxiv.org/abs/1510.05724},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/arxiv15-BFHH.pdf},
doi = {10.1007/978-3-662-49674-9_28},
abstract = {The coverability problem for Petri nets plays a central role in
the verification of concurrent shared-memory programs. However, its high
EXPSPACE-complete complexity poses a challenge when encountered in
real-world instances. In this paper, we develop a new approach to this
problem which is primarily based on applying forward coverability in
continuous Petri nets as a pruning criterion inside a backward
coverability framework. A cornerstone of our approach is the efficient
encoding of a recently developed polynomial-time algorithm for
reachability in continuous Petri nets into SMT. We demonstrate the
effectiveness of our approach on standard benchmarks from the literature,
which shows that our approach decides significantly more instances than
any existing tool and is in addition often much faster, in particular on
large instances.}
}
@inproceedings{APS-tap15,
address = {L'Aquila, Italy},
month = jul,
year = 2015,
volume = 9154,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = { Blanchette, Jasmin Christian and Kosmatov, Nikolai},
acronym = {{TAP}'15},
booktitle = {{P}roceedings of the 9th {I}nternational {C}onference
on {T}ests and {P}roofs ({TAP}'15)},
author = {Athanasiou, Konstantinos and Ponce{ }de{~}Le{\'o}n, Hern\'an
and Schwoon, Stefan},
title = {Test Case Generation for Concurrent Systems
Using Event Structures},
pages = {19-37},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/APS-tap15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/APS-tap15.pdf},
doi = {10.1007/978-3-319-21215-9_2},
abstract = {This paper deals with the test-case generation problem for
concurrent systems that are specified by true-concurrency models such as
Petri nets. We show that using true-concurrency models reduces both the
size and the number of test cases needed for achieving certain coverage
criteria. We present a test-case generation algorithm based on Petri net
unfoldings and a SAT encoding for solving controllability problems in test
cases. Finally, we evaluate our algorithm against traditional test-case
generation methods under interleaving semantics.}
}
@inproceedings{HH-stacs16,
address = {Orl{\'e}ans, France},
month = feb,
year = 2016,
volume = {47},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Ollinger, Nicolas and Vollmer, Heribert},
acronym = {{STACS}'16},
booktitle = {{P}roceedings of the 33rd {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'16)},
author = {Haase, Christoph and Hofman, Piotr},
title = {Tightening the Complexity of Equivalence Problems for
Commutative Grammars},
pages = {41:1-14},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HH-stacs16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HH-stacs16.pdf},
doi = {10.4230/LIPIcs.STACS.2016.41},
abstract = {Given two finite-state automata, are the Parikh images of the
languages they generate equivalent? This problem was shown decidable in
coNEXP by Huynh in 1985 within the more general setting of context-free
commutative grammars. Huynh conjectured that a~\(\Pi_{2}^{P}\) upper bound
might be possible, and Kopczy{\'n}ski and To established in 2010 such an
upper bound when the size of the alphabet is fixed. The contribution of
this paper is to show that the language equivalence problem for regular
and context-free commutative grammars is actually coNEXP-complete. In
addition, our lower bound immediately yields further coNEXP-completeness
results for equivalence problems for regular commutative expressions,
reversal-bounded counter automata and communication-free Petri nets.
Finally, we improve both lower and upper bounds for language equivalence
for exponent-sensitive commutative grammars.}
}
@article{JGL-mscs16,
publisher = {Cambridge University Press},
journal = {Mathematical Structures in Computer Science},
author = {Goubault{-}Larrecq, Jean},
title = {Isomorphism theorems between models of mixed choice},
volume = {27},
number = {6},
pages = {1032-1067},
month = sep,
year = 2017,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-mscs16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JGL-mscs16.pdf},
doi = {10.1017/S0960129515000547},
abstract = {We relate the so-called powercone models of mixed
non-deterministic and probabilistic choice proposed by Tix, Keimel,
Plotkin, Mislove, Ouaknine, Worrell, Morgan, and McIver, to our own models
of previsions. Under suitable topological assumptions, we show that they
are isomorphic. We rely on Keimel's cone-theoretic variants of the
classical Hahn-Banach separation theorems, using functional analytic
methods, and on the Schr{\"o}der-Simpson Theorem.}
}
@inproceedings{BHL-lata16,
address = {Prague, Czech Republic},
month = mar,
year = 2016,
volume = {9618},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Mart{\'\i}n-Vide, Carlos},
acronym = {{LATA}'16},
booktitle = {{P}roceedings of the 10th {I}nternational {C}onference on {L}anguage
and {A}utomata {T}heory and {A}pplications ({LATA}'16)},
author = {Bertrand, Nathalie and Haddad, Serge and Lefaucheux, Engel},
title = {Accurate Approximate Diagnosability of Stochastic Systems},
pages = {549-561},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BHL-lata16.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHL-lata16.pdf},
doi = {10.1007/978-3-319-30000-9_42},
abstract = {Diagnosis of partially observable stochastic systems prone to
faults was introduced in the late nineties. Diagnosability, i.e. the
existence of a diagnoser, may be specified in different ways: (1)~exact
diagnosability (called A-diagnosability) requires that almost surely a
fault is detected and that no fault is erroneously claimed while
(2)~approximate diagnosability (called \(\varepsilon\)-diagnosability)
allows a small probability of error when claiming a fault and (3)~accurate
approximate diagnosability (called AA-diagnosability) requires that this
error threshold may be chosen arbitrarily small. Here we mainly focus on
approximate diagnoses. We first refine the almost sure requirement about
finite delay introducing a uniform version and showing that while it does
not discriminate between the two versions of exact diagnosability this is
no more the case in approximate diagnosis. Then we establish a complete
picture for the decidability status of the diagnosability problems:
(uniform) \(\varepsilon\)-diagnosability and uniform AA-diagnosability are
undecidable while AA-diagnosability is decidable in PTIME, answering a
longstanding open question.}
}
@article{DD-tocl15b,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Demri, St{\'e}phane and Deters, Morgan},
title = {Expressive Completeness of Separation Logic With Two Variables and
No Separating Conjunction},
volume = {17},
number = {2},
pages = {12:1-12:44},
month = mar,
year = 2016,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-tocl15b.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DD-tocl15b.pdf},
doi = {10.1145/2835490},
abstract = {Separation logic is used as an assertion language for
Hoare-style proof systems about programs with pointers, and there is an
ongoing quest for understanding its complexity and expressive power.
Herein, we show that first-order separation logic with one record field
restricted to two variables and the separating implication (no~separating
conjunction) is as expressive as weak second-order logic, substantially
sharpening a previous result. Capturing weak second-order logic with such
a restricted form of separation logic requires substantial updates to
known proof techniques. We develop these, and as a by-product identify the
smallest fragment of separation logic known to be undecidable: first-order
separation logic with one record field, two variables, and no separating
conjunction. Because we forbid ourselves the use of many syntactic
resources, this underscores even further the power of separating
implication on concrete heaps.}
}
@article{HOW-fi15,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {Haase, Christoph and Ouaknine, Jo{\"e}l and Worrell, James},
title = {Relating Reachability Problems in Timed and Counter Automata},
volume = {143},
number = {3-4},
pages = {317-338},
year = 2016,
month = jan,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/HOW-fi15.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HOW-fi15.pdf},
doi = {10.3233/FI-2016-1316},
abstract = {We establish a relationship between reachability problems in
timed automata and space-bounded counter automata. We show that
reachability in timed automata with three or more clocks is
logarithmic-space inter-reducible with reachability in space-bounded
counter automata with two counters. We moreover show the logarithmic-space
equivalence of reachability in two-clock timed automata and space-bounded
one-counter automata. This last reduction has recently been employed by
Fearnley and Jurdzi{\'n}ski to settle the computational complexity of
reachability in two-clock timed automata.}
}
@techreport{BJM-arxiv16,
author = {Bouyer, Patricia and Markey, Nicolas and Jug{\'e}, Vincent},
title = {Dynamic Complexity of Parity Games with Bounded Tree-Width},
institution = {Computing Research Repository},
number = {1610.00571},
year = {2016},
url = {https://arxiv.org/abs/1610.00571},
pdf = {https://arxiv.org/abs/1610.00571},
month = oct,
type = {Research Report},
note = {33~pages}
}
@misc{mcc:2017,
author = {F. Kordon and H. Garavel and L. M. Hillah and Hulin{-}Hubard, Francis
and B. Berthomieu and G. Ciardo and M. Colange and S. {Dal Zilio} and E.
Amparore and M. Beccuti and T. Liebke and J. Meijer and A. Miner and C.
Rohr and J. Srba and Y. Thierry-Mieg and J. van de Pol and K. Wolf},
month = jun,
title = {{Complete Results for the 2017 Edition of the Model Checking Contest}},
year = {2017},
url = {http://mcc.lip6.fr/2017/results.php}
}
@misc{mcc:2016,
author = {F. Kordon and H. Garavel and L. M. Hillah and Hulin{-}Hubard, Francis
and G. Chiardo and A. Hamez and L. Jezequel and A. Miner and J. Meijer
and E. Paviot-Adet and D. Racordon and C. Rodriguez and C. Rohr and J.
Srba and Y. Thierry-Mieg and G. Tr{\d i}nh and K. Wolf},
month = jun,
title = {{Complete Results for the 2016 Edition of the Model Checking Contest}},
year = {2016},
url = {http://mcc.lip6.fr/2016/results.php}
}
@misc{mcc:2015,
author = {F. Kordon and H. Garavel and L. M. Hillah and Hulin{-}Hubard, Francis
and A. Linard and M. Beccuti and A. Hamez and E. Lopez-Bobeda and L.
Jezequel and J. Meijer and E. Paviot-Adet and C. Rodriguez and C. Rohr
and J. Srba and Y. Thierry-Mieg and K. Wolf},
month = jun,
title = {{Complete Results for the 2015 Edition of the Model Checking Contest}},
year = {2015},
url = {http://mcc.lip6.fr/2015/results.php}
}
@misc{mcc:2014,
author = {F. Kordon and H. Garavel and L.-M. Hillah and Hulin{-}Hubard, Francis
and A. Linard and M. Beccuti and S. Evangelista and A. Hamez and N.
Lohmann and E. Lopez and E. Paviot-Adet and C. Rodriguez and C. Rohr and
J. Srba},
month = jun,
title = {{Results for the MCC @ Petri Nets 2014}},
year = {2014},
url = {http://mcc.lip6.fr/2014}
}
@phdthesis{montoya-phd2017,
author = {Montoya, David},
title = {Une base de connaissance personnelle int\'egrant les donn\'ees d'un utilisateur et une chronologie de ses activit\'es},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2017,
month = mar,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/montoya-phd17.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/montoya-phd17.pdf}
}
@article{CMRZZ-dmtcs2017,
journal = {Discrete Mathematics \& Theoretical Computer Science},
author = {Czerwi{\'{n}}ski, Wojciech and Martens, Wim and van Rooijen, Lorijn and Zeitoun, Marc and Zetzsche, Georg},
title = {A Characterization for Decidable Separability by Piecewise Testable Languages},
volume = {19},
number = {4},
year = {2017},
month = dec,
nopages = {},
doi = {10.23638/DMTCS-19-4-1},
url = {https://dmtcs.episciences.org/4131},
pdf = {https://arxiv.org/pdf/1410.1042.pdf}
}
@article{HKZ-sf2017,
publisher = {Springer},
journal = {Semigroup Forum},
author = {Huschenbett, Martin and Kuske, Dietrich and Zetzsche, Georg},
title = {The Monoid of Queue Actions},
volume = {95},
number = {3},
year = {2017},
month = dec,
pages = {475-508},
doi = {10.1007/s00233-016-9835-4},
abstract = {We model the behavior of a fifo-queue as a monoid of transformations that are induced by sequences of writing and reading. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic algebraic properties such as conjugacy. Moreover, we show that while several properties concerning its rational subsets are undecidable, their uniform membership problem is NL-complete. Furthermore, we present an algebraic characterization of this monoid's recognizable subsets. Finally, we prove that it is not Thurston-automatic.}
}
@article{ZKL-tocs17,
publisher = {Springer},
journal = {Theory of Computing Systems},
author = {Zetzsche, Georg and Kuske, Dietrich and Lohrey, Markus},
title = {On {Boolean} closed full trios and rational {Kripke} frames},
volume = {60},
number = {3},
year = {2017},
month = apr,
pages = {438-472},
doi = {10.1007/s00224-016-9694-0}
}
@mastersthesis{m2-riesner,
author = {Riesner, M{\'e}lissa},
title = {Regularity of deterministic pushdown automata},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2017},
month = aug
}
@inproceedings{D-lics17,
address = {Reykjavik, Iceland},
month = jun,
publisher = {{IEEE} Press},
editor = {Ouaknine, Jo{\"e}l},
acronym = {{LICS}'17},
booktitle = {{P}roceedings of the 32nd {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'17)},
author = {Doumane, Amina},
title = {Constructive completeness for the linear-time {\(\mu\)}-calculus},
pages = {1-12},
year = {2017},
doi = {10.1109/LICS.2017.8005075},
abstract = {Modal \(\mu\)-calculus is one of the central logics for verification. In his seminal paper, Kozen proposed an axiomatization for this logic, which was proved to be complete, 13 years later, by Kaivola for the linear-time case and by Walukiewicz for the branching-time one. These proofs are based on complex, non-constructive arguments, yielding no reasonable algorithm to construct proofs for valid formulas. The problematic of constructiveness becomes central when we consider proofs as certificates, supporting the answers of verification tools. In our paper, we provide a new completeness argument for the linear-time \(\mu\)-calculus which is constructive, i.e. it builds a proof for every valid formula. To achieve this, we decompose this difficult problem into several easier ones, taking advantage of the correspondence between the \(\mu\)-calculus and automata theory. More precisely, we lift the well-known automata transformations (non-determinization for instance) to the logical level. To solve each of these smaller problems, we perform first a proof-search in a circular proof system, then we transform the obtained circular proofs into proofs of Kozen's axiomatization.}
}
@inproceedings{G-fossacs17,
address = {Uppsala, Sweden},
month = apr,
year = 2017,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Esparza, Javier and Murawski, Andrzej},
acronym = {{FoSSaCS}'17},
booktitle = {{P}roceedings of the 20th {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'17)},
author = {Gilbert, Fr{\'e}d{\'e}ric},
title = {Automated Constructivization of Proofs},
pages = {480-495},
url = {https://hal.inria.fr/hal-01516788},
pdf = {https://hal.inria.fr/hal-01516788/file/constructivization.pdf},
doi = {10.1007/978-3-662-54458-7_28},
abstract = {No computable function can output a constructive proof from a classical one whenever its associated theorem also holds constructively. We show in this paper that it is however possible, in practice, to turn a large amount of classical proofs into constructive ones. We describe for this purpose a linear-time constructivization algorithm which is provably complete on large fragments of predicate logic.}
}
@inproceedings{G-itp17,
address = {Bras{\'{\i}}lia, Brazil},
year = 2017,
month = sep,
volume = 10499,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ayala{-}Rinc{\'{o}}n, Mauricio and Mu{\~{n}}oz, C{\'{e}}sar A.},
acronym = {{ITP}'17},
booktitle = {{P}roceedings of the 8th {I}nternational {C}onference on
{I}nteractive {T}heorem {P}roving ({ITP}'17)},
author = {Gilbert, Fr{\'e}d{\'e}ric},
title = {Proof Certificates in {PVS}},
pages = {262-268},
url = {https://hal.inria.fr/hal-01673517},
pdf = {https://hal.inria.fr/hal-01673517/file/main.pdf},
doi = {10.1007/978-3-319-66107-0_17},
abstract = {The purpose of this work is to allow the proof system PVS to export proof certificates that can be checked externally. This is done through the instrumentation of PVS to record detailed proofs step by step during the proof search process. At the current stage of this work, proofs can be built for any PVS theory. However, some reasoning steps rely on unverified assumptions. For a restricted fragment of PVS, the proofs are exported to the universal proof checker Dedukti, and the unverified assumptions are proved externally using the automated theorem prover MetiTarski.}
}
@inproceedings{B-ocaml17,
author = {Bury, Guillaume},
title = {{mSAT: An OCaml SAT Solver}},
booktitle = {{OCaml Users and Developers Workshop}},
nopages = {},
noeditor = {},
month = sep,
year = 2017,
address = {Oxford, UK},
url = {https://hal.inria.fr/hal-01670765},
pdf = {https://hal.inria.fr/hal-01670765/file/poster.pdf},
abstract = {mSAT: a SAT solving library in OCaml. It solves the satisfibility of propositional clauses. It is Modular: the user provides the theory. And it produces formal proofs.},
note = {Poster}
}
@inproceedings{JS-lpar17,
address = {Maun, Botswana},
month = may,
volume = {46},
series = {EPiC Series in Computing},
publisher = {EasyChair},
editor = {Eiter, Thomas and Sands, David},
acronym = {{LPAR}'17},
booktitle = {{P}roceedings of the 21st {I}nternational
{C}onference on {L}ogic for {P}rogramming,
{A}rtificial {I}ntelligence, and {R}easoning
({LPAR}'17)},
author = {Jouannaud, Jean-Pierre and Strub, Pierre-Yves},
title = {{Coq without Type Casts: A Complete Proof of Coq Modulo Theory}},
pages = {474-489},
year = {2017},
pdf = {https://hal.inria.fr/hal-01664457/file/final-version.pdf},
url = {https://easychair.org/publications/paper/BKQ},
abstract = {Incorporating extensional equality into a dependent intensional type system such as the Calculus of Constructions provides with stronger type-checking capabilities and makes the proof development closer to intuition. Since strong forms of extensionality lead to undecidable type-checking, a good trade-off is to extend intensional equality with a decidable first-order theory T, as done in CoqMT, which uses matching modulo T for the weak and strong elimination rules, we call these rules T-elimination. So far, type-checking in CoqMT is known to be decidable in presence of a cumulative hierarchy of universes and weak T-elimination. Further, it has been shown by Wang with a formal proof in Coq that consistency is preserved in presence of weak and strong elimination rules, which actually implies consistency in presence of weak and strong T-elimination rules since T is already present in the conversion rule of the calculus.
\par
We justify here CoqMT's type-checking algorithm by showing strong normalization as well as the Church-Rosser property of \(\beta\)-reductions augmented with CoqMT's weak and strong T-elimination rules. This therefore concludes successfully the meta-theoretical study of CoqMT.}
}
@article{BFM-lmcs17,
journal = {Logical Methods in Computer Science},
author = {Blondin, Michael and Finkel, Alain and McKenzie, Pierre},
title = {Well Behaved Transition Systems},
volume = {13},
number = {3},
year = {2017},
month = sep,
pages = {1-19},
doi = {10.23638/LMCS-13(3:24)2017},
url = {https://doi.org/10.23638/LMCS-13(3:24)2017}
}
@article{FS-lmcs17,
journal = {Logical Methods in Computer Science},
author = {Figueira, Diego and Segoufin, Luc},
title = {Bottom-up automata on data trees and vertical {XP}ath},
volume = {13},
number = {4:5},
year = {2017},
month = nov,
doi = {10.23638/LMCS-13(4:5)2017},
abstract = {A data tree is a finite tree whose every node
carries a label from a finite alphabet and a datum
from some infinite domain. We introduce a new model
of automata over unranked data trees with a
decidable emptiness problem. It is essentially a
bottom-up alternating automaton with one register
that can store one data value and can be used to
perform equality tests with the data values
occurring within the subtree of the current node. We
show that it captures the expressive power of the
vertical fragment of XPath - containing the child,
descendant, parent and ancestor axes - obtaining
thus a decision procedure for its satisfiability
problem.}
}
@phdthesis{schmitz-hdr2017,
author = {Schmitz, Sylvain},
title = {Algorithmic Complexity of Well-Quasi-Orders},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {M{\'e}moire d'habilitation},
year = 2017,
month = nov,
url = {http://tel.archives-ouvertes.fr/tel-01663266}
}
@inproceedings{GBM-stacs18,
address = {Caen, France},
month = feb,
volume = {96},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Niedermeier, Rolf and Vall{\'e}e, Brigitte},
acronym = {{STACS}'18},
booktitle = {{P}roceedings of the 35th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'18)},
author = {Gardy, Patrick and Bouyer, Patricia and Markey, Nicolas},
title = {Dependences in Strategy Logic},
pages = {34:1-34:15},
year = {2018},
doi = {10.4230/LIPIcs.STACS.2018.34},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/8532/pdf/LIPIcs-STACS-2018-34.pdf},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8532},
abstract = {Strategy Logic (SL) is a very expressive logic for specifying and verifying properties of multi-agent systems: in SL, one can quantify over strategies, assign them to agents, and express properties of the resulting plays. Such a powerful framework has two drawbacks: first, model checking SL has non-elementary complexity; second, the exact semantics of SL is rather intricate, and may not correspond to what is expected. In this paper, we focus on strategy dependences in SL, by tracking how existentially-quantified strategies in a formula may (or may not) depend on other strategies selected in the formula. We study different kinds of dependences, refining the approach of [Mogavero et al., Reasoning about strategies: On the model-checking problem, 2014], and prove that they give rise to different satisfaction relations. In the setting where strategies may only depend on what they have observed, we identify a large fragment of SL for which we prove model checking can be performed in 2-EXPTIME.}
}
@inproceedings{BFG-stacs18,
address = {Caen, France},
month = feb,
volume = {96},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Niedermeier, Rolf and Vall{\'e}e, Brigitte},
acronym = {{STACS}'18},
booktitle = {{P}roceedings of the 35th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'18)},
author = {Bollig, Benedikt and Fortin, Marie and Gastin, Paul},
title = {Communicating Finite-State Machines and Two-Variable Logic},
pages = {17:1-17:14},
year = {2018},
doi = {10.4230/LIPIcs.STACS.2018.17},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/8529/pdf/LIPIcs-STACS-2018-17.pdf},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8529},
abstract = {Communicating finite-state machines are a fundamental, well-studied model of finite-state processes that communicate via unbounded first-in first-out channels. We show that they are expressively equivalent to existential MSO logic with two first-order variables and the order relation.}
}
@inproceedings{GKLZ-stacs18,
address = {Caen, France},
month = feb,
volume = {96},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Niedermeier, Rolf and Vall{\'e}e, Brigitte},
acronym = {{STACS}'18},
booktitle = {{P}roceedings of the 35th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'18)},
author = {Ganardi, Moses and K{\"o}nig, Daniel and Lohrey, Markus and Zetzsche, Georg},
title = {Knapsack problems for wreath products},
pages = {32:1-32:13},
year = {2018},
doi = {10.4230/LIPIcs.STACS.2018.32},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/8520/pdf/LIPIcs-STACS-2018-32.pdf},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8520}
}
@inproceedings{PhS-mfcs17,
address = {Aalborg, Denmark},
month = aug,
year = 2017,
volume = {83},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Fran{\c{c}}ois},
acronym = {{MFCS}'17},
booktitle = {{P}roceedings of the 42nd
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'17)},
author = {Schnoebelen, {\relax Ph}ilippe},
title = {Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk)},
pages = {85:1-85:4},
url = {http://drops.dagstuhl.de/opus/volltexte/2017/8139/},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/8139/pdf/LIPIcs-MFCS-2017-85.pdf},
doi = {10.4230/LIPIcs.MFCS.2017.85},
abstract = {We explain how the downward-closed subsets of a well-quasi-ordering (\(X,\leq\)) can be represented via the ideals of \(X\) and how this leads to simple and efficient algorithms for the verification of well-structured systems.}
}
@article{JGL-minimax17,
publisher = {Heldermann Verlag},
journal = {Minimax Theory and its Applications},
author = {Goubault{-}Larrecq, Jean},
title = {A Non-{H}ausdorff Minimax Theorem},
volume = {3},
number = {1},
year = {2017},
pages = {73-80}
}
@inproceedings{MHP-cmsb17,
address = {Darmstadt, Germany},
month = sep,
year = 2017,
volume = {10545},
series = {Lecture Notes in Bioinformatics},
publisher = {Springer-Verlag},
editor = {Feret, J{\'e}r{\^o}me and Koeppl, Heinz},
acronym = {{CMSB}'17},
booktitle = {{P}roceedings of the 15th
{C}onference on
{C}omputational {M}ethods in {S}ystem {B}iology
({CMSB}'17)},
author = {Mandon, Hugues and Haar, Stefan and Paulev{\'e}, Lo{\"i}c},
title = {{Temporal Reprogramming of Boolean Networks}},
pages = {179-195},
pdf = {https://hal.inria.fr/hal-01589251/document},
doi = {10.1007/978-3-319-67471-1\_11},
abstract = {Cellular reprogramming, a technique that opens huge opportunities in modern and regenerative medicine, heavily relies on identifying key genes to perturb. Most of computational methods focus on finding mutations to apply to the initial state in order to control which attractor the cell will reach. However, it has been shown, and is proved in this article, that waiting between the perturbations and using the transient dynamics of the system allow new reprogramming strategies. To identify these temporal perturbations, we consider a qualitative model of regulatory networks, and rely on Petri nets to model their dynamics and the putative perturbations. Our method establishes a complete characterization of temporal perturbations, whether permanent (mutations) or only temporary, to achieve the existential or inevitable reachability of an arbitrary state of the system. We apply a prototype implementation on small models from the literature and show that we are able to derive temporal perturbations to achieve trans-differentiation.}
}
@article{BFM-ic17,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Blondin, Michael and Finkel, Alain and McKenzie, Pierre},
title = {Handling Infinitely Branching Well-structured Transition Systems},
volume = {258},
year = {2018},
pages = {28--49},
doi = {10.1016/j.ic.2017.11.001}
}
@techreport{CDD-hal17,
author = {Cortier, V{\'e}ronique and Dallon, Antoine and Delaune, St{\'e}phanie},
institution = {HAL},
month = oct,
number = {hal-01615265},
type = {Research Report},
title = {A typing result for trace inclusion (for pair and symmetric encryption only)},
year = {2017},
url = {https://hal.archives-ouvertes.fr/hal-01615265},
pdf = {https://hal.archives-ouvertes.fr/hal-01615265/document},
abstract = {Privacy-type properties such as vote secrecy, anonymity, or untraceability are typically expressed using the notion of trace equivalence in a process algebra that models security protocols. In this paper, we propose some results to reduce the search space when we are looking for an attack regarding trace equivalence. Our work is strongly inspired from [10], which establishes that, if there is a witness of non trace equivalence, then there is one that is well-typed.\par
Our main contribution is to establish a similar result for trace inclusion. Our motivation is twofolds: first, this small attack property is needed for proving soundness of the tool SatEquiv [13]. Second, we revisit the proof in order to simplify it. Specifically, we show two results. First, if there is a witness of non-inclusion then there is one that is well-typed. We establish this result by providing a decision procedure for trace inclusion similar to the one proposed in [10] for trace equivalence. We also show that we can reduce the search space when considering the notion of static inclusion. Acutally, if there is a witness of static non-inclusion there is one of a specific shape.\par
Even if our setting slightly differs from the one considered in [10], our proofs essentially follow the same ideas than the existing proof for trace equivalence. Nevertheless, we hope that this proof will be easier to extend to other primitives such as asymmetric encryption or signatures.}
}
@article{DDS-tcs17,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Demri, St{\'e}phane and Dhar, Amit and Sangnier, Arnaud},
title = {Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic},
volume = {735},
optnumber = {},
year = {2017},
pages = {2-23},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DDS-tcs17.pdf}
}
@article{GLL-fmsd17,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Goubault{-}Larrecq, Jean and Lachance, Jean-Philippe},
title = {On the Complexity of Monitoring {O}rchids Signatures, and Recurrence Equations},
volume = {53},
number = {1},
year = {2018},
month = aug,
pages = {6-32},
doi = {10.1007/s10703-017-0303-x},
url = {https://doi.org/10.1007/s10703-017-0303-x},
abstract = {Modern monitoring tools such as our intrusion detection tool Orchids work by firing new monitor instances dynamically. Given an Orchids signature (a.k.a. a rule, a specification), what is the complexity of checking that specification, that signature? In other words, let \(f(n)\) be the maximum number of monitor instances that can be fired on a sequence of \(n\) events: we design an algorithm that decides whether \(f(n)\) is asymptotically exponential or polynomial, and in the latter case returns an exponent \(d\) such that \(f(n)=\Theta(n^d)\). Ultimately, the problem reduces to the following mathematical question, which may have other uses in other domains: given a system of recurrence equations described using the operators \(+\) and \(\max\), and defining integer sequences \(u_n\), what is the asymptotic behavior of \(u_n\) as \(n\) tends to infinity? We show that, under simple assumptions, \(u_n\) is either exponential or polynomial, and that this can be decided, and the exponent computed, using a simple modification of Tarjan's strongly connected components algorithm, in linear time.},
note = {Special issue of RV'16}
}
@article{GLN-lmcs17,
journal = {Logical Methods in Computer Science},
author = {Goubault{-}Larrecq, Jean and Ng, Kok Min},
title = {A Few Notes on Formal Balls},
volume = {13},
number = {4},
year = {2017},
month = nov,
pages = {1-34},
doi = {10.23638/LMCS-13(4:18)2017},
url = {https://lmcs.episciences.org/4100},
pdf = {https://lmcs.episciences.org/4100/pdf},
note = {Special Issue of the Domains XII Workshop}
}
@incollection{CDH-kimfest17,
author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, {\relax Th}omas~A.},
title = {The Cost of Exactness in Quantitative Reachability},
editor = {Aceto, Luca and Bacci, Giorgio and Bacci, Giovani
and Ing{\'o}lfsd{\'o}ttir, Anna and Legay, Axel and
Mardare, Radu},
booktitle = {Models, Algorithms, Logics and Tools: Essays
Dedicated to Kim Guldstrand Larsen on the Occasion
of His 60th Birthday},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {10460},
year = {2017},
pages = {367-381},
month = aug,
doi = {10.1007/978-3-319-63121-9_18},
abstract = {In the analysis of reactive systems a quantitative objective assigns a real value to every trace of the system. The value decision problem for a quantitative objective requires a trace whose value is at least a given threshold, and the exact value decision problem requires a trace whose value is exactly the threshold. We compare the compu- tational complexity of the value and exact value decision problems for classical quantitative objectives, such as sum, discounted sum, energy, and mean-payoff for two standard models of reactive systems, namely, graphs and graph games.},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDH-2017.pdf}
}
@article{CDFR-ic17,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Krishnendu Chatterjee and Laurent Doyen and Emmanuel Filiot and Jean{-}Fran{\c{c}}ois Raskin},
title = {Doomsday equilibria for omega-regular games},
volume = {254},
year = {2017},
pages = {296-315},
doi = {10.1016/j.ic.2016.10.012},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDFR-ic2017.pdf},
abstract = {Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games.\par
In this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile such that all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players objective, then the objective of every player is violated.\par
We present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ?-regular objectives, both for imperfect-information games, and for perfect-information games. We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect- information games.}
}
@inproceedings{D-rp17,
address = {London, UK},
month = sep,
year = 2017,
volume = {10506},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Matthew Hague and Igor Potapov},
acronym = {{RP}'17},
booktitle = {{P}roceedings of the 11th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'17)},
author = {Doyen, Laurent},
title = {The Multiple Dimensions of Mean-Payoff Games},
pages = {1-8},
url = {https://doi.org/10.1007/978-3-319-67089-8_1},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Doyen-rp2017.pdf},
doi = {10.1007/978-3-319-67089-8_1},
abstract = {We consider quantitative game models for the design of reactive systems working in resource-constrained environment. The game is played on a finite weighted graph where some resource (e.g., battery) can be consumed or recharged along the edges of the graph.}
}
@article{LS-siglog17,
publisher = {ACM Press},
journal = {SIGLOG News},
abstract = {We consider a logical framework building on
existential positive formulas and then adding
guarded negations and guarded fixpoints, where the
guards are atomic formulas containing all free
variables. The resulting first-order and fixpoint
logics turn out to have nice algorithmic properties
and nice expressive power. We survey some of them.},
author = {Segoufin, Luc},
doi = {10.1145/3129173.3129178},
month = jul,
number = {3},
pages = {12-26},
title = {A survey on guarded negation},
volume = {4},
year = {2017}
}
@inproceedings{TFL-async17,
address = {San Diego, California, USA},
month = may,
publisher = {{IEEE} Computer Society},
editor = {Beign{\'e}, Edith and Stevens, Ken},
acronym = {{ASYNC}'17},
booktitle = {{P}roceedings of the 23rd {IEEE} {I}nternational {S}ymposium on {A}synchronous {C}ircuits and {S}ystems ({ASYNC}'17)},
author = {Ghaith Tarawneh and Matthias F{\"u}gger and Christoph Lenzen},
title = {Metastability Tolerant Computing},
pages = {25-32},
year = {2017},
doi = {10.1109/ASYNC.2017.9},
pdf = {http://www.lsv.fr/~mfuegger/papers/TFL17_async.pdf},
url = {http://ieeexplore.ieee.org/abstract/document/8097381/},
abstract = {Synchronization using flip-flop chains imposes a latency of a few clock cycles when transferring data and control signals between clock domains. We propose a design scheme that avoids this latency by performing synchronization as part of state/data computations while guaranteeing that metastability is contained and its effects tolerated (with an acceptable failure probability). We present a theoretical framework for modeling synchronous state machines in the presence of metastability and use it to prove properties that guarantee some form of reliability. Specifically, we show that the inevitable state/data corruption resulting from propagating metastable states can be confined to a subset of computations. Applications that can tolerate certain failures can exploit this property to leverage low-latency and quasi-reliable operation simultaneously. We demonstrate the approach by designing a Network-on-Chip router with zero- latency asynchronous ports and show via simulation that it outperforms a variant with two flip-flop synchronizers at a negligible cost in packet transfer reliability.}
}
@inproceedings{FKLP-async17,
address = {San Diego, California, USA},
month = may,
publisher = {{IEEE} Computer Society},
editor = {Beign{\'e}, Edith and Stevens, Ken},
acronym = {{ASYNC}'17},
booktitle = {{P}roceedings of the 23rd {IEEE} {I}nternational {S}ymposium on {A}synchronous {C}ircuits and {S}ystems ({ASYNC}'17)},
author = {Matthias F{\"u}gger and Attila Kinali and Christoph Lenzen and Thomas Polzer},
title = {Metastability-Aware Memory-Efficient Time-to-Digital Converter},
pages = {49-56},
year = {2017},
doi = {10.1109/ASYNC.2017.12},
pdf = {http://www.lsv.fr/~mfuegger/pub/FKLP17.pdf},
url = {https://doi.org/10.1109/ASYNC.2017.12},
abstract = {We propose a novel method for transforming delay- line time-to-digital converters (TDCs) into TDCs that output Gray code without relying on synchronizers. We formally prove that the inevitable metastable memory upsets (Marino, TC'81) do not induce an additional time resolution error. Our modified design provides suitable inputs to the recent metastability-containing sorting networks by Lenzen and Medina (ASYNC'16) and Bund et al. (DATE'17). In contrast, employing existing TDCs would require using thermometer code at the TDC output (followed by conversion to Gray code) or resolving metastability inside the TDC. The former is too restrictive w.r.t. the dynamic range of the TDCs, while the latter loses the advantage of enabling (accordingly much faster) computation without having to first resolve metastability.\par
Our all-digital designs are also of interest in their own right: they support high sample rates and large measuring ranges at nearly optimal bit-width of the output, yet maintain the original delay-line?s time resolution. No previous approach unifies all these properties in a single device.}
}
@inproceedings{FNS-disc17,
address = {Vienna, Austria},
month = oct,
year = 2017,
volume = 91,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Richa, Andr{\'e}a},
acronym = {{DISC}'17},
booktitle = {{P}roceedings of the 31st {I}nternational
{S}ymposium on {D}istributed {C}omputing
({DISC}'17)},
author = {Matthias F{\"u}gger and {\relax Th}omas Nowak and Manfred Schwarz},
title = {Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks},
pages = {51:1-51:3},
url = {http://drops.dagstuhl.de/opus/volltexte/2017/7992/},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/7992/pdf/LIPIcs-DISC-2017-51.pdf},
doi = {10.4230/LIPIcs.DISC.2017.51},
abstract = {In this work we study the performance of asymptotic and approximate consensus algorithms in dynamic networks. The asymptotic consensus problem requires a set of agents to repeatedly set their outputs such that the outputs converge to a common value within the convex hull of initial values. This problem, and the related approximate consensus problem, are fundamental building blocks in distributed systems where exact consensus among agents is not required, e.g., man- made distributed control systems, and have applications in the analysis of natural distributed systems, such as flocking and opinion dynamics. We prove new nontrivial lower bounds on the contraction rates of asymptotic consensus algorithms, from which we deduce lower bounds on the time complexity of approximate consensus algorithms. In particular, the obtained bounds show optimality of asymptotic and approximate consensus algorithms presented in [Charron-Bost et al., ICALP’16] for certain classes of networks that include classical failure assumptions, and confine the search for optimal bounds in the general case.
Central to our lower bound proofs is an extended notion of valency, the set of reachable limits of an asymptotic consensus algorithm starting from a given configuration. We further relate topological properties of valencies to the solvability of exact consensus, shedding some light on the relation of these three fundamental problems in dynamic networks.}
}
@article{BCMW-fi17,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {David Baelde and Arnaud Carayol and Ralph Matthes and Igor Walukiewicz},
title = {Preface: Special Issue of {Fixed Points in Computer Science} ({FICS}'13)},
volume = {150},
number = {3-4},
pages = {i-ii},
year = {2017},
url = {https://doi.org/10.3233/FI-2017-1468},
doi = {10.3233/FI-2017-1468}
}
@inproceedings{BDGK-csf17,
address = {Santa Barbara, California, USA},
month = aug,
publisher = {{IEEE} Computer Society Press},
editor = {K{\"o}pf, Boris and Chong, Steve},
acronym = {{CSF}'17},
booktitle = {{P}roceedings of the
30th {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'17)},
author = {Baelde, David and Delaune, St{\'e}phanie and Gazeau, Ivan and Kremer, Steve},
title = {Symbolic Verification of Privacy-Type Properties for Security Protocols with {XOR}},
pages = {234-248},
year = {2017},
doi = {10.1109/CSF.2017.22},
pdf = {https://hal.inria.fr/hal-01533694/document},
url = {https://hal.inria.fr/hal-01533694},
abstract = {In symbolic verification of security protocols, process equivalences have recently been used extensively to model strong secrecy, anonymity and unlinkability properties. However, tool support for automated analysis of equivalence properties is limited compared to trace properties, e.g., modeling authentication and weak notions of secrecy. In this paper, we present a novel procedure for verifying equivalences on finite processes, i.e., without replication, for protocols that rely on various cryptographic primitives including exclusive or (xor). We have implemented our procedure in the tool AKISS, and successfully used it on several case studies that are outside the scope of existing tools, e.g., unlinkability on various RFID protocols, and resistance against guessing attacks on protocols that use xor.}
}
@inproceedings{CDD-csf17,
address = {Santa Barbara, California, USA},
month = aug,
publisher = {{IEEE} Computer Society Press},
editor = {K{\"o}pf, Boris and Chong, Steve},
acronym = {{CSF}'17},
booktitle = {{P}roceedings of the
30th {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'17)},
author = {Cortier, V{\'e}ronique and Dallon, Antoine and Delaune, St{\'e}phanie},
title = {{SAT-Equiv}: An Efficient Tool for Equivalence Properties},
pages = {481-494},
year = {2017},
doi = {10.1109/CSF.2017.15},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDD-csf17.pdf},
url = {http://ieeexplore.ieee.org/document/8049740/},
abstract = {Automatic tools based on symbolic models have been successful in analyzing security protocols. Such tools are particularly adapted for trace properties (e.g. secrecy or authentication), while they often fail to analyse equivalence properties.Equivalence properties can express a variety of security properties, including in particular privacy properties (vote privacy, anonymity, untraceability). Several decision procedures have already been proposed but the resulting tools are rather inefficient.In this paper, we propose a novel algorithm, based on graph planning and SAT-solving, which significantly improves the efficiency of the analysis of equivalence properties. The resulting implementation, SAT-Equiv, can analyze several sessions where most tools have to stop after one or two sessions.}
}
@inproceedings{CCV-er17,
address = {Valencia, Spain},
month = nov,
volume = 10650,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Mayr, Heinrich C. and Guizzardi, Giancarlo and Ma, Hui and Pastor, Oscar},
booktitle = {{P}roceedings of the 36th {I}nternational {C}onference on {C}onceptual {M}odeling ({ER}'17)},
author = {Chatain, {\relax Th}omas and Carmona, Josep and van Dongen, Boudewijn},
title = {Alignment-Based Trace Clustering},
pages = {295-308},
year = {2017},
doi = {10.1007/978-3-319-69904-2_24},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CCV-er17.pdf},
url = {https://doi.org/10.1007/978-3-319-69904-2_24},
abstract = {A novel method to cluster event log traces is presented in this paper. In contrast to the approaches in the literature, the clustering approach of this paper assumes an additional input: a process model that describes the current process. The core idea of the algorithm is to use model traces as centroids of the clusters detected, computed from a generalization of the notion of alignment. This way, model explanations of observed behavior are the driving force to compute the clusters, instead of current model agnostic approaches, e.g., which group log traces merely on their vector-space similarity. We believe alignment-based trace clustering provides results more useful for stakeholders. Moreover, in case of log incompleteness, noisy logs or concept drift, they can be more robust for dealing with highly deviating traces. The technique of this paper can be combined with any clustering technique to provide model explanations to the clusters computed. The proposed technique relies on encoding the individual alignment problems into the (pseudo-)Boolean domain, and has been implemented in our tool DarkSider that uses an open-source solver.},
note = {To appear}
}
@mastersthesis{m2-hirschi,
author = {Hirschi, Lucca},
title = {Reduction of interleavings for trace equivalence checking of security protocols},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2013},
month = aug
}
@mastersthesis{m2-doumane,
author = {Doumane, Amina},
title = {{\'E}tudes des automates en ludique},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2014},
month = sep
}
@phdthesis{doumane-phd2017,
author = {Doumane, Amina},
title = {On the infinitary proof theory of logics with fixed points},
school = {Universit{\'e} Paris-Diderot, Paris, France},
type = {Th{\`e}se de doctorat},
year = 2017,
month = jun,
url = {https://www.irif.fr/~doumane/these.pdf},
pdf = {https://www.irif.fr/~doumane/these.pdf}
}
@inproceedings{LDCF-snr17,
address = {Uppsala, Sweden},
month = apr,
year = 2017,
volume = 247,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Erika {\'{A}}brah{\'{a}}m and Sergiy Bogomolov},
acronym = {{SNR}'17},
booktitle = {{P}roceedings of the 3rd {I}nternational {W}orkshop
on {S}ymbolic and {N}umerical {M}ethods for
{R}eachability {A}nalysis ({SNR}'17)},
author = {Adrien Le{ }Co{\"e}nt and
Florian De{ }Vuyst and
Ludovic Chamoin and
Laurent Fribourg},
title = {Control Synthesis of Nonlinear Sampled Switched Systems using Euler's Method},
pages = {18-33},
url = {https://arxiv.org/abs/1704.03102v1},
pdf = {https://arxiv.org/pdf/1704.03102v1.pdf},
doi = {10.4204/EPTCS.247.2},
abstract = {In this paper, we propose a symbolic control synthesis method for nonlinear sampled switched systems whose vector fields are one-sided Lipschitz. The main idea is to use an approximate model obtained from the forward Euler method to build a guaranteed control. The benefit of this method is that the error introduced by symbolic modeling is bounded by choosing suitable time and space discretizations. The method is implemented in the interpreted language Octave. Several examples of the literature are performed and the results are compared with results obtained with a previous method based on the Runge-Kutta integration method.}
}
@inproceedings{F-formats17,
address = {Berlin, Germany},
month = sep,
year = 2017,
volume = {10419},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abate, Alessandro and Geeraerts, Gilles},
acronym = {{FORMATS}'17},
booktitle = {{P}roceedings of the 15th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'17)},
author = {Fribourg, Laurent},
title = {Euler's Method Applied to the Control of Switched Systems},
pages = {3-21},
url = {https://doi.org/10.1007/978-3-319-65765-3_1},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/F-formats17.pdf},
doi = {10.1007/978-3-319-65765-3_1},
abstract = {Hybrid systems are a powerful formalism for modeling and reasoning about cyber-physical systems. They mix the continuous and discrete natures of the evolution of computerized systems. Switched systems are a special kind of hybrid systems, with restricted discrete behaviours: those systems only have finitely many different modes of (continuous) evolution, with isolated switches between modes. Such systems provide a good balance between expressiveness and controllability, and are thus in widespread use in large branches of industry such as power electronics and automotive control. The control law for a switched system defines the way of selecting the modes during the run of the system. Controllability is the problem of (automatically) synthesizing a control law in order to satisfy a desired property, such as safety (maintaining the variables within a given zone) or stabilisation (confinement of the variables in a close neighborhood around an objective point). In order to compute the control of a switched system, we need to compute the solutions of the differential equations governing the modes. Euler's method is the most basic technique for approximating such solutions. We present here an estimation of the Euler's method local error, using the notion of ''one-sided Lispchitz constant'' for modes. This yields a general control synthesis approach which can encompass several features such as bounded disturbance and compositionality.}
}
@inproceedings{BLL-rp17,
address = {London, UK},
month = sep,
year = 2017,
volume = {10506},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Matthew Hague and Igor Potapov},
acronym = {{RP}'17},
booktitle = {{P}roceedings of the 11th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'17)},
author = {Florian Bruse and
Martin Lange and
{\'E}tienne Lozes},
title = {Space-Efficient Fragments of Higher-Order Fixpoint Logic},
pages = {26-41},
url = {https://doi.org/10.1007/978-3-319-67089-8_3},
doi = {10.1007/978-3-319-67089-8_3},
abstract = {Higher-Order Fixpoint Logic (HFL) is a modal specification language whose expressive power reaches far beyond that of Monadic Second-Order Logic, achieved through an incorporation of a typed \(\lambda\)-calculus into the modal \(\mu\)-calculus. Its model checking problem on finite transition systems is decidable, albeit of high complexity, namely \(k\)-EXPTIME-complete for formulas that use functions of type order at most \(k>0\). In this paper we present a fragment with a presumably easier model checking problem. We show that so-called tail-recursive formulas of type order \(k\) can be model checked in \((k-1)\)-EXPSPACE, and also give matching lower bounds. This yields generic results for the complexity of bisimulation-invariant non-regular properties, as these can typically be defined in HFL.}
}
@inproceedings{LACFDC-rp17,
address = {London, UK},
month = sep,
year = 2017,
volume = {10506},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Matthew Hague and Igor Potapov},
acronym = {{RP}'17},
booktitle = {{P}roceedings of the 11th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'17)},
author = {Adrien Le{ }Co{\"{e}}nt and
Julien {Alexandre dit Sandretto} and
Alexandre Chapoutot and
Laurent Fribourg and
Florian De{ }Vuyst and
Ludovic Chamoin},
title = {Distributed Control Synthesis Using Euler's Method},
pages = {118-131},
url = {https://link.springer.com/chapter/10.1007/978-3-319-67089-8_9},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LACFDC-rp17.pdf},
doi = {10.1007/978-3-319-67089-8_9},
abstract = {In a previous work, we explained how Euler's method for computing approximate solutions of systems of ordinary differential equations can be used to synthesize safety controllers for sampled switched systems. We continue here this line of research by showing how Euler's method can also be used for synthesizing safety controllers in a distributed manner. The global system is seen as an interconnection of two (or more) sub-systems where, for each component, the sub-state corresponding to the other component is seen as an ?input?; the method exploits (a variant of) the notions of incremental input-to-state stability (\(\delta\)-ISS) and ISS Lyapunov function. We illustrate this distributed control synthesis method on a building ventilation example.}
}
@article{HM-tcs17,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Haddad, Serge and Monmege, Benjamin},
title = {Interval iteration algorithm for {MDP}s and {IMDP}s},
volume = {735},
year = {2018},
pages = {111-131},
month = jul,
doi = {10.1016/j.tcs.2016.12.003},
url = {http://authors.elsevier.com/sd/article/S0304397516307095},
abstract = {Markov Decision Processes (MDP) are a widely used model including both non-deterministic and probabilistic choices. Minimal and maximal probabilities to reach a target set of states, with respect to a policy resolving non-determinism, may be computed by several methods including value iteration. This algorithm, easy to implement and efficient in terms of space complexity, iteratively computes the probabilities of paths of increasing length. However, it raises three issues: (1) defining a stopping criterion ensuring a bound on the approximation, (2) analysing the rate of convergence, and (3) specifying an additional procedure to obtain the exact values once a sufficient number of iterations has been performed. The first two issues are still open and, for the third one, an upper bound on the number of iterations has been proposed. Based on a graph analysis and transformation of MDPs, we address these problems. First we introduce an interval iteration algorithm, for which the stopping criterion is straightforward. Then we exhibit its convergence rate. Finally we significantly improve the upper bound on the number of iterations required to get the exact values. We extend our approach to also deal with Interval Markov Decision Processes (IMDP) that can be seen as symbolic representations of MDPs.}
}
@article{FHLM-deds17,
publisher = {Springer},
journal = {Discrete Event Dynamic Systems: Theory and Applications},
author = {{\'E}ric Fabre and Lo{\"i}c H{\'e}lou{\"e}t and Engel Lefaucheux and Herv{\'e} Marchand},
title = {Diagnosability of Repairable Faults},
volume = {28},
number = {2},
month = jun,
year = {2018},
pages = {183-213},
doi = {10.1007/s10626-017-0255-8},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/FHLM-deds17.pdf},
abstract = {The diagnosis problem for discrete event systems consists in deciding whether some fault event occurred or not in the system, given partial observations on the run of that system. Diagnosability checks whether a correct diagnosis can be issued in bounded time after a fault, for all faulty runs of that system. This problem appeared two decades ago and numerous facets of it have been explored, mostly for permanent faults. It is known for example that diagnosability of a system can be checked in polynomial time, while the construction of a diagnoser is exponential. The present paper examines the case of transient faults, that can appear and be repaired. Diagnosability in this setting means that the occurrence of a fault should always be detected in bounded time, but also before the fault is repaired, in order to prepare for the detection of the next fault or to take corrective measures while they are needed. Checking this notion of diagnosability is proved to be PSPACE-complete. It is also shown that faults can be reliably counted provided the system is diagnosable for faults and for repairs.}
}
@inproceedings{BHL-msr17,
address = {Marseille, France},
month = nov,
year = 2017,
futureseries = {Journal Europ{\'e}en des Syst{\`e}mes Automatis{\'e}s},
publisher = {HAL},
editor = {Demongodin, Isabel and Reynier, Pierre-Alain},
acronym = {{MSR}'17},
booktitle = {{A}ctes du 11{\`e}me {C}olloque sur la
{M}od{\'e}lisation des {S}yst{\`e}mes
{R}{\'e}actifs
({MSR}'17)},
author = {Nathalie Bertrand and Serge Haddad and Engel Lefaucheux},
title = {Diagnostic et contr{\^o}le de la d{\'e}gradation des syst{\`e}mes probabilistes},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHL-msr17.pdf},
abstract = {Le diagnostic actif est op{\'e}r{\'e} par un contr{\^o}leur en vue de rendre un syst{\`e}me diagnosticable. Afin d'{\'e}viter que le contr{\^o}leur ne d{\'e}grade trop fortement le syst{`e}me, on lui affecte g{\'e}n{\'e}ralement un second objectif en termes de qualit{\'e} de service. Dans le cadre des syst{\`e}mes probabilistes, une sp{\'e}cification possible consiste {\`a} assurer une probabilit{\'e} positive qu'une ex{\'e}cution infinie soit correcte, ce qu'on appelle le diagnostic
actif s{\^u}r. Nous introduisons ici deux sp{\'e}cifications alternatives. La gamma-correction du syst{\`e}me affecte {\`a} une ex{\'e}cution une valeur de correction d{\'e}pendant d'un facteur de d{\'e}cote gamma et le contr{\^o}leur doit assurer une valeur moyenne sup{\'e}rieure {\`a} un seuil fix{\'e}. La alpha-d{\'e}gradation requiert qu'asymptotiquement, {\`a} chaque unit{\'e} de temps une proportion sup{\'e}rieure {\`a} alpha des ex{\'e}cutions jusqu'alors correctes le demeure. D'un point de vue s{\'e}mantique, nous explicitons des liens significatifs entre les diff{\'e}rentes notions. Algorithmiquement, nous {\'e}tablissons la fronti{\`e}re entre d{\'e}cidabilit{\'e} et ind{\'e}cidabilit{\'e} des probl{\`e}mes et dans le cas positif nous exhibons la complexit{\'e} pr{\'e}cise ainsi qu'une synth{\`e}se, potentiellement {\`a} m{\'e}moire infinie.}
}
@inproceedings{BHL-fsttcs17,
address = {Kanpur, India},
month = dec,
year = 2017,
volume = {93},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Satya Lokam and R. Ramanujam},
acronym = {{FSTTCS}'17},
booktitle = {{P}roceedings of the 37th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'17)},
author = {B{\'e}atrice B{\'e}rard and Serge Haddad and Engel Lefaucheux},
title = {Probabilistic Disclosure: Maximisation vs. Minimisation},
pages = {13:1-13:14},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8384},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/8384/pdf/LIPIcs-FSTTCS-2017-13.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2017.13},
abstract = {We consider opacity questions where an observation function provides to an external attacker a view of the states along executions and secret executions are those visiting some state from a fixed subset. Disclosure occurs when the observer can deduce from a finite observation that the execution is secret, the epsilon-disclosure variant corresponding to the execution being secret with probability greater than 1 - epsilon. In a probabilistic and non deterministic setting, where an internal agent can choose between actions, there are two points of view, depending on the status of this agent: the successive choices can either help the attacker trying to disclose the secret, if the system has been corrupted, or they can prevent disclosure as much as possible if these choices are part of the system design. In the former situation, corresponding to a worst case, the disclosure value is the supremum over the strategies of the probability to disclose the secret (maximisation), whereas in the latter case, the disclosure is the infimum (minimisation). We address quantitative problems (comparing the optimal value with a threshold) and qualitative ones (when the threshold is zero or one) related to both forms of disclosure for a fixed or finite horizon. For all problems, we characterise their decidability status and their complexity. We discover a surprising asymmetry: on the one hand optimal strategies may be chosen among deterministic ones in maximisation problems, while it is not the case for minimisation. On the other hand, for the questions addressed here, more minimisation problems than maximisation ones are decidable.}
}
@inproceedings{BFG-fsttcs17,
address = {Kanpur, India},
month = dec,
year = 2017,
volume = {93},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Satya Lokam and R. Ramanujam},
acronym = {{FSTTCS}'17},
booktitle = {{P}roceedings of the 37th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'17)},
author = {Michael Blondin and Alain Finkel and Jean Goubault{-}Larrecq},
title = {Forward Analysis for {WSTS}, {Part III}: {Karp-Miller} Trees},
pages = {16:1-16:15},
url = {https://hal.archives-ouvertes.fr/hal-01736704/},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/8403/pdf/LIPIcs-FSTTCS-2017-16.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2017.16},
abstract = {This paper is a sequel of ''Forward Analysis for WSTS, Part I: Completions'' [STACS 2009, LZI Intl. Proc. in Informatics 3, 433-444] and ''Forward Analysis for WSTS, Part II: Complete WSTS'' [Logical Methods in Computer Science 8(3), 2012]. In these two papers, we provided a framework to conduct forward reachability analyses of WSTS, using finite representations of downwards-closed sets. We further develop this framework to obtain a generic Karp-Miller algorithm for the new class of very-WSTS. This allows us to show that coverability sets of very-WSTS can be computed as their finite ideal decompositions. Under natural assumptions on positive sequences, we also show that LTL model checking for very-WSTS is decidable. The termination of our procedure rests on a new notion of acceleration levels, which we study. We characterize those domains that allow for only finitely many accelerations, based on ordinal ranks.}
}
@inproceedings{DLL-fsttcs17,
address = {Kanpur, India},
month = dec,
year = 2017,
volume = {93},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Satya Lokam and R. Ramanujam},
acronym = {{FSTTCS}'17},
booktitle = {{P}roceedings of the 37th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'17)},
author = {St{\'e}phane Demri and {\'E}tienne Lozes and Denis Lugiez},
title = {On Symbolic Heaps Modulo Permission Theories},
pages = {25:1-25:14},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DLL-fsttcs17.pdf},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.25},
doi = {10.4230/LIPIcs.FSTTCS.2017.25}
}
@phdthesis{dubut-phd2017,
author = {Dubut, J{\'e}r{\'e}my},
title = {Directed homotopic and homologic theories for geometric models of true concurrency},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2017,
month = sep,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/dubut-phd17.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/dubut-phd17.pdf}
}
@phdthesis{gardy-phd2017,
author = {Gardy, Patrick},
title = {Semantics of {S}trategy {L}ogic},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2017,
month = jun,
url = {https://tel.archives-ouvertes.fr/tel-01561802},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/gardy-phd17.pdf}
}
@inproceedings{GBBLM-gretsi17,
address = {Juan-les-Pins, France},
month = sep,
year = 2017,
publisher = {},
editor = {},
acronym = {{GRETSI}'17},
booktitle = {Actes du XXVI$^{\text{\`eme}}$ colloque GRETSI},
author = {Mauricio Gonz{\'a}lez and Olivier Beaude and
Patricia Bouyer and Samson Lasaulce and Nicolas
Markey},
title = {Strat{\'e}gies d'ordonnancement de consommation
d'{\'e}nergie en pr{\'e}sence d'information
imparfaite de pr{\'e}vision},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/GBBLM-gretsi17.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GBBLM-gretsi17.pdf}
}
@techreport{Haddad-hal17,
author = {Haddad, Serge},
title = {Memoryless Determinacy of Finite Parity Games: Another Simple Proof},
institution = {HAL-inria},
number = {hal-01541508},
month = jun,
year = {2017},
type = {Research Report},
url = {https://hal.inria.fr/hal-01541508},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/Haddad-hal17.pdf},
note = {7~pages},
abstract = {Memoryless determinacy of (infinite) parity games is an important result with numerous applications. It was first independently established by Emerson and Jutla [1] and Mostowski [2] but their proofs involve elaborate developments. The elegant and simpler proof of Zielonka [3] still requires a nested induction on the finite number of priorities and on ordinals for sets of vertices. There are other proofs for finite games like the one of Bj{\"o}rklund, Sandberg and Vorobyovin [4] that relies on relating infinite and finite duration games. We present here another simple proof that finite parity games are determined with memoryless strategies using induction on the number of relevant states. The closest proof that relies on induction over non absorbing states is the one of Graedel [5]. However instead of focusing on a single appropriate vertex for induction as we do here, he considers two reduced games per vertex, for all the vertices of the game. The idea of reasoning about a single state has been inspired to me by the analysis of finite stochastic priority games by Karelovic and Zielonka [6].}
}
@techreport{BJM-arxiv17,
author = {Bouyer, Patricia and Markey, Nicolas and
Jug{\'e}, Vincent},
institution = {Computing Research Repository},
month = feb,
note = {14~pages},
number = {1702.05183},
type = {Research Report},
title = {Courcelle's Theorem Made Dynamic},
year = {2017},
url = {https://arxiv.org/abs/1702.05183},
pdf = {https://arxiv.org/abs/1702.05183}
}
@inproceedings{CP-concur17,
address = {Berlin, Germany},
month = sep,
year = 2017,
volume = {85},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Meyer, Roland and Nestmann, Uwe},
acronym = {{CONCUR}'17},
booktitle = {{P}roceedings of the 28th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'17)},
author = {Chatain, {\relax Th}omas and Paulev{\'e}, Lo{\"i}c},
title = {Goal-Driven Unfolding of {P}etri Nets},
pages = {18:1-18:16},
url = {http://drops.dagstuhl.de/opus/volltexte/2017/7773},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/7773/pdf/LIPIcs-CONCUR-2017-18.pdf},
doi = {10.4230/LIPIcs.CONCUR.2017.18},
abstract = {Unfoldings provide an efficient way to avoid the state-space explosion due to interleavings of concurrent transitions when exploring the runs of a Petri net. The theory of adequate orders allows one to define finite prefixes of unfoldings which contain all the reachable markings. In this paper we are interested in reachability of a single given marking, called the goal. We propose an algorithm for computing a finite prefix of the unfolding of a 1-safe Petri net that preserves all minimal configurations reaching this goal. Our algorithm combines the unfolding technique with on-the-fly model reduction by static analysis aiming at avoiding the exploration of branches which are not needed for reaching the goal. We present some experimental results.}
}
@inproceedings{BHJ-concur17,
address = {Berlin, Germany},
month = sep,
year = 2017,
volume = {85},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Meyer, Roland and Nestmann, Uwe},
acronym = {{CONCUR}'17},
booktitle = {{P}roceedings of the 28th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'17)},
author = {Bouyer, Patricia and Haddad, Serge and Jug{\'e}, Vincent},
title = {Unbounded product-form {P}etri nets},
pages = {31:1--31:16},
url = {http://drops.dagstuhl.de/opus/volltexte/2017/7795},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/7795/pdf/LIPIcs-CONCUR-2017-31.pdf},
doi = {10.4230/LIPIcs.CONCUR.2017.31},
abstract = {Computing steady-state distributions in infinite-state stochastic systems is in general a very difficult task. Product-form Petri nets are those Petri nets for which the steady-state distribution can be described as a natural product corresponding, up to a normalising constant, to an exponentiation of the markings. However, even though some classes of nets are known to have a product-form distribution, computing the normalising constant can be hard. The class of (closed) \(\Pi^3\)-nets has been proposed in an earlier work, for which it is shown that one can compute the steady-state distribution efficiently. However these nets are bounded. In this paper, we generalise queuing Markovian networks and closed \(\Pi^3\)-nets to obtain the class of open \(\Pi^3\)-nets, that generate infinite-state systems. We show interesting properties of these nets: (1) we prove that liveness can be decided in polynomial time, and that reachability in live \(\Pi^3\)-nets can be decided in polynomial time; (2) we show that we can decide ergodicity of such nets in polynomial time as well; (3) we provide a pseudo-polynomial time algorithm to compute the normalising constant.}
}
@inproceedings{AGKS-concur17,
address = {Berlin, Germany},
month = sep,
year = 2017,
volume = {85},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Meyer, Roland and Nestmann, Uwe},
acronym = {{CONCUR}'17},
booktitle = {{P}roceedings of the 28th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'17)},
author = {Akshay, S. and Gastin, Paul and Krishna, Shankara Narayanan and Sarkar, Ilias},
title = {Towards an Efficient Tree Automata based technique for Timed Systems},
pages = {39:1--39:15},
url = {http://drops.dagstuhl.de/opus/volltexte/2017/7801},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/7801/pdf/LIPIcs-CONCUR-2017-39.pdf},
doi = {10.4230/LIPIcs.CONCUR.2017.39},
abstract = {The focus of this paper is the analysis of real-time systems with recursion, through the development of good theoretical techniques which are implementable. Time is modeled using clock variables, and recursion using stacks. Our technique consists of modeling the behaviours of the timed system as graphs, and interpreting these graphs on tree terms by showing a bound on their tree-width. We then build a tree automaton that accepts exactly those tree terms that describe realizable runs of the timed system. The emptiness of the timed system thus boils down to emptiness of a finite tree automaton that accepts these tree terms. This approach helps us in obtaining an optimal complexity, not just in theory (as done in earlier work e.g.[concur16]), but also in going towards an efficient implementation of our technique. To do this, we make several improvements in the theory and exploit these to build a first prototype tool that can analyze timed systems with recursion.}
}
@inproceedings{BQS-concur17,
address = {Berlin, Germany},
month = sep,
year = 2017,
volume = {85},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Meyer, Roland and Nestmann, Uwe},
acronym = {{CONCUR}'17},
booktitle = {{P}roceedings of the 28th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'17)},
author = {Bollig, Benedikt and Quaas, Karin and Sangnier, Arnaud},
title = {The Complexity of Flat Freeze LTL},
pages = {33:1--33:16},
url = {http://drops.dagstuhl.de/opus/volltexte/2017/7799},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/7799/pdf/LIPIcs-CONCUR-2017-33.pdf},
doi = {10.4230/LIPIcs.CONCUR.2017.33},
abstract = {We consider the model-checking problem for freeze LTL on one-counter automata (OCAs). Freeze LTL extends LTL with the freeze quantifier, which allows one to store different counter values of a run in registers so that they can be compared with one another. As the model-checking problem is undecidable in general, we focus on the flat fragment of freeze LTL, in which the usage of the freeze quantifier is restricted. Recently, Lechner et al. showed that model checking for flat freeze LTL on OCAs with binary encoding of counter updates is decidable and in 2NEXPTIME. In this paper, we prove that the problem is, in fact, NEXPTIME-complete no matter whether counter updates are encoded in unary or binary. Like Lechner et al., we rely on a reduction to the reachability problem in OCAs with parameterized tests (OCAPs). The new aspect is that we simulate OCAPs by alternating two-way automata over words. This implies an exponential upper bound on the parameter values that we exploit towards an NP algorithm for reachability in OCAPs with unary updates. We obtain our main result as a corollary.}
}
@inproceedings{BJM-formats17,
address = {Berlin, Germany},
month = sep,
year = 2017,
volume = {10419},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Abate, Alessandro and Geeraerts, Gilles},
acronym = {{FORMATS}'17},
booktitle = {{P}roceedings of the 15th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'17)},
author = {Bouyer, Patricia and Jaziri, Samy and Markey, Nicolas},
title = {On the Determinization of Timed Systems},
pages = {25-41},
url = {https://hal.archives-ouvertes.fr/hal-01566436/},
doi = {10.1007/978-3-319-65765-3_2},
abstract = {We introduce a new formalism called automata over a timed domain which provides an adequate framework for the determinization of timed systems. In this formalism, determinization w.r.t. timed language is always possible at the cost of changing the timed domain. We give a condition for determinizability of automata over a timed domain without changing the timed domain, which allows us to recover several known determinizable classes of timed systems, such as strongly-non-zeno timed automata, integer-reset timed automata, perturbed timed automata, etc. Moreover in the case of timed automata this condition encompasses most determinizability conditions from the literature.}
}
@inproceedings{GMS-mfcs17,
address = {Aalborg, Denmark},
month = aug,
year = 2017,
volume = {83},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Fran{\c{c}}ois},
acronym = {{MFCS}'17},
booktitle = {{P}roceedings of the 42nd
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'17)},
author = {Grosshans, Nathan and McKenzie, Pierre and Segoufin, Luc},
title = {The power of programs over monoids in {DA}},
pages = {2:1--2:20},
url = {http://drops.dagstuhl.de/opus/volltexte/2017/8090/},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/8090/pdf/LIPIcs-MFCS-2017-2.pdf},
doi = {10.4230/LIPIcs.MFCS.2017.2},
abstract = {The program-over-monoid model of computation originates with Barrington's proof that it captures the complexity class NC^1. Here we make progress in understanding the subtleties of the model. First, we identify a new tameness condition on a class of monoids that entails a natural characterization of the regular languages recognizable by programs over monoids from the class. Second, we prove that the class known as DA satisfies tameness and hence that the regular languages recognized by programs over monoids in DA are precisely those recognizable in the classical sense by morphisms from QDA. Third, we show by contrast that the well studied class of monoids called J is not tame and we exhibit a regular language, recognized by a program over a monoid from J, yet not recognizable classically by morphisms from the class QJ. Finally, we exhibit a program-length-based hierarchy within the class of languages recognized by programs over monoids from DA.}
}
@article{BGH-fmsd17,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Bollig, Benedikt and Grindei, Manuela-Lidia and Habermehl, Peter},
title = {Realizability of Concurrent Recursive Programs},
volume = {53},
number = {3},
year = {2018},
pages = {339-362},
doi = {10.1007/s10703-017-0282-y},
abstract = {We study the realizability problem for concurrent recursive programs: Given a distributed system architecture and a sequential specification over words, find a distributed automata implementation that is equivalent to the specification. This problem is well-studied as far as finite-state processes are concerned, and it has a solution in terms of Zielonka's Theorem. We lift Zielonka's Theorem to the case where processes are recursive and modeled as visibly pushdown (or, equivalently, nested-word) automata. However, contrarily to the finite-state case, it is undecidable whether a specification is realizable or not. Therefore, we also consider suitable underapproximation techniques from the literature developed for multi-pushdown systems, and we show that they lead to a realizability framework with effective algorithms.
}
}
@article{BDH-lmcs17,
journal = {Logical Methods in Computer Science},
author = {Baelde, David and Delaune, St{\'e}phanie and Hirschi, Lucca},
title = {{A Reduced Semantics for Deciding Trace Equivalence}},
volume = {13},
number = {2:8},
year = {2017},
pages = {1-48},
doi = {10.23638/LMCS-13(2:8)2017},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BDH-lmcs17.pdf},
url = {https://lmcs.episciences.org/3703},
abstract = {Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e. without replication) by means of symbolic execution and constraint solving. However, this does not suffice to obtain practical tools. Current prototypes suffer from a classical combinatorial explosion problem caused by the exploration of many interleavings in the behaviour of processes. M{\"o}dersheim et al. [40] have tackled this problem for reachability properties using partial order reduction techniques. We revisit their work, generalize it and adapt it for equivalence checking. We obtain an optimisation in the form of a reduced symbolic semantics that eliminates redundant interleavings on the fly. The obtained partial order reduction technique has been integrated in a tool called Apte. We conducted complete benchmarks showing dramatic improvements.}
}
@article{BFHH-tocl17,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Blondin, Michael and Finkel, Alain and Haase, Christoph and
Haddad, Serge},
title = {The Logical View on Continuous {P}etri Nets},
volume = {18},
number = {3},
year = {2017},
pages = {24:1--24:28},
url = {http://doi.acm.org/10.1145/3105908},
doi = {10.1145/3105908},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BFHH-tocl17.pdf},
abstract = {Continuous Petri nets are a relaxation of classical discrete Petri nets in which transitions can be fired a fractional number of times, and consequently places may contain a fractional number of tokens. Such continuous Petri nets are an appealing object to study since they over approximate the set of reachable configurations of their discrete counterparts, and their reachability problem is known to be decidable in polynomial time. The starting point of this paper is to show that the reachability relation for continuous Petri nets is definable by a sentence of linear size in the existential theory of the rationals with addition and order. Using this characterization, we obtain decidability and complexity results for a number of classical decision problems for continuous Petri nets. In particular, we settle the open problem about the precise complexity of reachability set inclusion. Finally, we show how continuous Petri nets can be incorporated inside the classical backward coverability algorithm for discrete Petri nets as a pruning heuristic in order to tackle the symbolic state explosion problem. The cornerstone of the approach we present is that our logical characterization enables us to leverage the power of modern SMT-solvers in order to yield a highly performant and robust decision procedure for coverability in Petri nets. We demonstrate the applicability of our approach on a set of standard benchmarks from the literature.}
}
@phdthesis{hirschi-phd2017,
author = {Hirschi, Lucca},
title = {{Automated Verification of Privacy in Security Protocols: Back and Forth Between Theory \& Practice}},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2017,
month = apr,
url = {http://www.lsv.fr/Publis/PAPERS/PDF/hirschi-phd17.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/hirschi-phd17.pdf}
}
@inproceedings{SV-icdt17,
address = {Venice, Italy},
month = mar,
year = 2017,
volume = 68,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Benedikt, Michael and Orsi, Georgio},
acronym = {{ICDT}'17},
booktitle = {{P}roceedings of the 18th {I}nternational {C}onference on
{D}atabase {T}heory ({ICDT}'17)},
author = {Segoufin, Luc and Vigny, Alexandre},
title = {Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion},
pages = {20:1-20:16},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=7060},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/7060/pdf/LIPIcs-ICDT-2017-20.pdf},
doi = {10.4230/LIPIcs.ICDT.2017.20},
abstract = {We consider the evaluation of first-order queries over classes of databases with local bounded expansion. This class was introduced by Nesetril and Ossona de Mendez and generalizes many well known classes of databases, such as bounded degree, bounded tree width or bounded expansion. It is known that over classes of databases with local bounded expansion, first-order sentences can be evaluated in pseudo-linear time (pseudo-linear time means that for all \(\epsilon\) there exists an algorithm working in time \(O(n^{1+\epsilon})\)). Here, we investigate other scenarios, where queries are not sentences. We show that first-order queries can be enumerated with constant delay after a pseudo-linear preprocessing over any class of databases having locally bounded expansion. We also show that, in this context, counting the number of solutions can be done in pseudo-linear time.}
}
@phdthesis{stan-phd2017,
author = {Stan, Daniel},
title = {Randomized Strategies in Concurrent Games},
school = {Laboratoire Sp{\'e}cification et V{\'e}rification,
ENS Cachan, France},
type = {Th{\`e}se de doctorat},
year = 2017,
month = mar,
url = {https://hal.archives-ouvertes.fr/tel-01519354},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/stan-phd17.pdf}
}
@article{ABG-ic17,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Aiswarya, C. and Bollig, Benedikt and Gastin, Paul},
title = {An Automata-Theoretic Approach to the Verification of Distributed Algorithms},
volume = {259},
month = apr,
year = {2018},
pages = {305-327},
doi = {10.1016/j.ic.2017.05.006},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABG-ic17.pdf},
abstract = {We introduce an automata-theoretic method for the verification of distributed algorithms running on ring networks. In a distributed algorithm, an arbitrary number of processes cooperate to achieve a common goal (e.g., elect a leader). Processes have unique identifiers (pids) from an infinite, totally ordered domain. An algorithm proceeds in synchronous rounds, each round allowing a process to perform a bounded sequence of actions such as send or receive a pid, store it in some register, and compare register contents wrt. the associated total order. An algorithm is supposed to be correct independently of the number of processes. To specify correctness properties, we introduce a logic that can reason about processes and pids. Referring to leader election, it may say that, at the end of an execution, each process stores the maximum pid in some dedicated register.
We show that the verification problem of distributed algorithms can be reduced to satisfiability of a formula from propositional dynamic logic with loop and converse (LCPDL), interpreted over grids over a finite alphabet. This translation is independent of any restriction imposed on the algorithm. However, since the verification problem (and satisfiability for LCPDL) is undecidable, we propose an underapproximation technique, which bounds the number of rounds. This is an appealing approach, as the number of rounds needed by a distributed algorithm to conclude is often exponentially smaller than the number of processes. Using our reduction to LCPDL, we provide an automata-theoretic solution, reducing model checking to emptiness for alternating two-way automata on words. Overall, we show that round-bounded verification of distributed algorithms over rings is PSPACE-complete, provided the number of rounds is given in unary.}
}
@inproceedings{CK-csf17,
address = {Santa Barbara, California, USA},
month = aug,
publisher = {{IEEE} Computer Society Press},
editor = {K{\"o}pf, Boris and Chong, Steve},
acronym = {{CSF}'17},
booktitle = {{P}roceedings of the
30th {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'17)},
author = {Comon, Hubert and Koutsos, Adrien},
title = {Formal Computational Unlinkability Proofs of RFID Protocols},
pages = {100-114},
year = {2017},
doi = {10.1109/CSF.2017.9},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CK-csf17.pdf},
url = {http://ieeexplore.ieee.org/document/8049714/},
abstract = {We set up a framework for the formal proofs of
RFID protocols in the computational model. We rely on the
so-called computationally complete symbolic attacker model. Our
contributions are:
1) To design (and prove sound) axioms reflecting the proper-
ties of hash functions (Collision-Resistance, PRF).
2) To formalize computational unlinkability in the model.
3) To illustrate the method, providing the first formal proofs
of unlinkability of RFID protocols, in the computational
model.}
}
@inproceedings{CGKM-csf17,
address = {Santa Barbara, California, USA},
month = aug,
publisher = {{IEEE} Computer Society Press},
editor = {K{\"o}pf, Boris and Chong, Steve},
acronym = {{CSF}'17},
booktitle = {{P}roceedings of the
30th {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'17)},
author = {Calzavara, Stefano and Grishchenko, Ilya and Koutsos, Adrien and Maffei, Matteo},
title = {A Sound Flow-Sensitive Heap Abstraction for the Static Analysis of Android Applications},
pages = {22-36},
year = {2017},
doi = {10.1109/CSF.2017.19},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CGKM-csf17.pdf},
url = {http://ieeexplore.ieee.org/document/8049649/},
abstract = {The present paper proposes the first static analysis
for Android applications which is both flow-sensitive on the heap
abstraction and provably sound with respect to a rich formal
model of the Android platform. We formulate the analysis as a
set of Horn clauses defining a sound over-approximation of the
semantics of the Android application to analyse, borrowing ideas
from recency abstraction and extending them to our concurrent
setting. Moreover, we implement the analysis in HornDroid, a
state-of-the-art information flow analyser for Android applica-
tions. Our extension allows HornDroid to perform strong updates
on heap-allocated data structures, thus significantly increasing its
precision, without sacrificing its soundness guarantees. We test
our implementation on DroidBench, a popular benchmark of
Android applications developed by the research community, and
we show that our changes to HornDroid lead to an improvement
in the precision of the tool, while having only a moderate cost in
terms of efficiency. Finally, we assess the scalability of our tool
to the analysis of real applications.}
}
@article{KV-jcss17,
publisher = {Elsevier Science Publishers},
journal = {Journal of Computer and System Sciences},
author = {Koutsos, Adrien and Vianu, Victor},
title = {{Process-centric views of data-driven business artifacts}},
volume = {86},
number = {1},
year = {2017},
pages = {82-107},
doi = {10.1016/j.jcss.2016.11.012},
month = jun,
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/KV-jcss17.pdf},
url = {http://dx.doi.org/10.1016/j.jcss.2016.11.012},
abstract = {Declarative, data-aware workflow models are becoming increasingly pervasive. While these have numerous benefits, classical process-centric specifications retain certain advantages. Workflow designers are used to development tools such as BPMN or UML diagrams, that focus on control flow. Views describing valid sequences of tasks are also useful to provide stakeholders with high-level descriptions of the workflow, stripped of the accompanying data. In this paper we study the problem of recovering process-centric views from declarative, data-aware workflow specifications in a variant of IBM's business artifact model. We focus on the simplest process-centric views, specified by finite-state transition systems, describing regular languages. The results characterize when process-centric views of artifact systems are regular, using both linear and branching-time semantics. We also study the impact of data dependencies on regularity of the views. As a side effect, we obtain several new results on verification of business artifacts, including a decidability result for branching-time properties.}
}
@inproceedings{FL-icalp17,
address = {Warsaw, Poland},
month = jul,
volume = {80},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Muscholl, Anca and Kuhn, Fabian},
acronym = {{ICALP}'17},
booktitle = {{P}roceedings of the 44th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'17)},
author = {Finkel, Alain and Lozes, {\'E}tienne},
title = {Synchronizability of Communicating Finite State Machines is not Decidable},
pages = {122:1-122:14},
year = {2017},
doi = {10.4230/LIPIcs.ICALP.2017.122},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/7402/pdf/LIPIcs-ICALP-2017-122.pdf},
url = {http://drops.dagstuhl.de/opus/volltexte/2017/7402},
abstract = {A system of communicating finite state machines is synchronizable if its send trace semantics, i.e. the set of sequences of sendings it can perform, is the same when its communications are FIFO asynchronous and when they are just rendez-vous synchronizations. This property was claimed to be decidable in several conference and journal papers for either mailboxes or peer-to-peer communications, thanks to a form of small model property. In this paper, we show that this small model property does not hold neither for mailbox communications, nor for peer-to-peer communications, therefore the decidability of synchronizability becomes an open question. We close this question for peer-to-peer communications, and we show that synchronizability is actually undecidable. We show that synchronizability is decidable if the topology of communications is an oriented ring. We also show that, in this case, synchronizability implies the absence of unspecified receptions and orphan messages, and the channel-recognizability of the reachability set.}
}
@inproceedings{Dowek-icalp17,
address = {Warsaw, Poland},
month = jul,
volume = {80},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Muscholl, Anca and Kuhn, Fabian},
acronym = {{ICALP}'17},
booktitle = {{P}roceedings of the 44th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'17)},
author = {Dowek, Gilles},
title = {Models and termination of proof reduction in the \(\lambda\Pi\)-calculus modulo theory},
pages = {109:1-109:14},
year = {2017},
doi = {10.4230/LIPIcs.ICALP.2017.109},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2017/7391/pdf/LIPIcs-ICALP-2017-109.pdf},
url = {http://drops.dagstuhl.de/opus/volltexte/2017/7391},
abstract = {We define a notion of model for the \(\lambda\Pi\)-calculus modulo theory and prove a soundness theorem. We then use this notion to define a notion of super-consistent theory and prove that proof reduction terminates in the \(\lambda\Pi\)-calculus modulo any super-consistent theory. We prove this way the termination of proof reduction in several theories including Simple type theory and the Calculus of constructions.}
}
@inproceedings{FMW-cav17,
address = {Heidelberg, Germany},
month = jul,
volume = {10427},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Kuncak, Viktor and Majumdar, Rupak},
acronym = {{CAV}'17},
booktitle = {{P}roceedings of the 29th
{I}nternational {C}onference on
{C}omputer {A}ided {V}erification
({CAV}'17)},
author = {Fortin, Marie and Muscholl, Anca and Walukiewicz, Igor},
title = {Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems},
pages = {155-175},
year = {2017},
doi = {10.1007/978-3-319-63390-9_9},
url = {https://arxiv.org/abs/1606.08707},
abstract = {}
}
@inproceedings{HSZ-lics17,
address = {Reykjavik, Iceland},
month = jun,
publisher = {{IEEE} Press},
editor = {Ouaknine, Jo{\"e}l},
acronym = {{LICS}'17},
booktitle = {{P}roceedings of the 32nd {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'17)},
author = {Halfon, Simon and Schnoebelen, {\relax Ph}ilippe and Zetzsche, Georg},
title = {Decidability, complexity, and expressiveness of first-order logic over the subword ordering},
pages = {1-12},
year = {2017},
doi = {10.1109/LICS.2017.8005141},
url = {https://arxiv.org/abs/1701.07470},
abstract = {We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the \(\Sigma_1\) theory is undecidable (already over two letters).\par
We investigate the decidability border by considering fragments where all but a certain number of variables are alternation bounded, meaning that the variable must always be quantified over languages with a bounded number of letter alternations. We prove that when at most two variables are not alternation bounded, the \(\Sigma_1\) fragment is decidable, and that it becomes undecidable when three variables are not alternation bounded. Regarding higher quantifier alternation depths, we prove that the \(\Sigma_2\) fragment is undecidable already for one variable without alternation bound and that when all variables are alternation bounded, the entire first-order theory is decidable.}
}
@inproceedings{CJLS-lics17,
address = {Reykjavik, Iceland},
month = jun,
publisher = {{IEEE} Press},
editor = {Ouaknine, Jo{\"e}l},
acronym = {{LICS}'17},
booktitle = {{P}roceedings of the 32nd {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'17)},
author = {Colcombet, {\relax Th}omas and Jurdzi{\'n}ski,
Marcin and Lazi{\'c}, Ranko and Schmitz, Sylvain},
title = {Perfect Half Space Games},
pages = {1--11},
year = {2017},
doi = {10.1109/LICS.2017.8005105},
url = {http://arxiv.org/abs/1704.05626},
abstract = {We introduce perfect half space games,
in which the goal of Player 2
is to make the sums of encountered multi-dimensional weights diverge in
a direction which is consistent with a chosen sequence of perfect half spaces (chosen dynamically by Player 2).
We establish that the bounding games of
Jurdzinski et al. (ICALP 2015) can be reduced to perfect half space games, which in turn can be translated to the lexicographic
energy games of Colcombet and Niwinski, and are positionally determined in a strong sense (Player 2 can play without knowing the current perfect half space).
We finally show how perfect half space games and bounding games can be employed
to solve multi-dimensional energy parity games in pseudo-polynomial time
when both the numbers of energy dimensions and of priorities are fixed, regardless of whether the initial credit is given as part of the input or existentially quantified. This also yields an optimal 2EXP complexity
with given initial credit, where the best known upper bound was non-elementary.}
}
@inproceedings{HPV-icsc17,
address = {San Diego, CA, USA},
month = jan,
volume = 11,
series = {IEEE ICSC},
publisher = {{IEEE} Press},
todoeditor = {D?Auria, Daniela and Liu, Jianquan and Pilato, Giovanni},
acronym = {{ICSC}'17},
booktitle = {{P}roceedings of the 11th International Conference on Semantic Computing ({ICSC}'17)},
author = {Haar, Stefan and Perchy, Salim and Valencia, Frank},
title = {{D-SPACES: Implementing Declarative Semantics for Spatially Structured Information}},
pages = {227-233},
year = {2017},
doi = {10.1109/ICSC.2017.34},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HPV-icsc17.pdf},
url = {https://hal.inria.fr/hal-01328189},
abstract = {We introduce in this paper D-SPACES, an implementation of constraint systems with space and extrusion operators. Constraint systems are algebraic models that allow for a semantic language-like representation of information in systems where the concept of space is a primary structural feature. We give this information mainly an epistemic interpretation and consider various agents as entities acting upon it. D-SPACES is coded as a c++11 library providing implementations for constraint systems, space functions and extrusion functions. The interfaces to access each implementation are minimal and thoroughly documented. D-SPACES also provides property-checking methods as well as an implementation of a specific type of constraint systems (a boolean algebra). This last implementation serves as an entry point for quick access and proof of concept when using these models. Furthermore, we offer an illustrative example in the form of a small social network where users post their beliefs and utter their opinions.}
}
@article{GHPRV-jlamp17,
publisher = {Elsevier Science Publishers},
journal = {Journal of Logic and Algebraic Methods in Programming},
author = {Guzm{\'a}n, Michell and Haar, Stefan and Perchy, Salim and Rueda, Camilo and Valencia, Frank},
title = {{Belief, Knowledge, Lies and Other Utterances in an Algebra for Space and Extrusion}},
volume = {86},
number = {1},
year = {2017},
pages = {107-133},
doi = {10.1016/j.jlamp.2016.09.001},
month = jan,
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/GHPRV-jlamp17.pdf},
url = {https://hal.inria.fr/hal-01257113},
abstract = {The notion of constraint system (cs) is central to declarative formalisms from concurrency theory such as process calculi for concurrent constraint programming (ccp). Constraint systems are often represented as lattices: their elements, called constraints, represent partial information and their order corresponds to entailment. Recently a notion of n-agent spatial cs was introduced to represent information in concurrent constraint programs for spatially distributed multi-agent systems. From a computational point of view a spatial constraint system can be used to specify partial information holding in a given agent's space (local information). From an epistemic point of view a spatial cs can be used to specify information that a given agent considers true (beliefs). Spatial constraint systems, however, do not provide a mechanism for specifying the mobility of information/processes from one space to another. Information mobility is a fundamental aspect of concurrent systems. In this article we develop the theory of spatial constraint systems with operators to specify information and processes moving from a space to another. We shall investigate the properties of this new family of constraint systems and illustrate their applications. From a computational point of view the new operators provide for process/information extrusion, a central concept in formalisms for mobile communication. From an epistemic point of view extrusion corresponds I to a notion we shall call utterance; a piece of information that an agent communicate to others but that may be inconsistent with the agent's beliefs. Utterances can then be used to express instances of epistemic notions such as hoaxes or intentional lies which are common place in social media. Spatial constraint system can express the epistemic notion of belief by means of space functions that specify local information. We shall also show that spatial constraint can also express the epistemic notion of knowledge by means of a derived spatial operator that specifies global information.}
}
@inproceedings{OBH-most17,
address = {San Jose, CA, USA},
month = may,
editor = {Chen, Hao and Koved, Larry},
booktitle = {{P}roceedings of Mobile Security Technologies (MoST'17), held as part of the {IEEE} Computer Society Security and Privacy Workshops},
author = {{O'Hanlon}, Piers and Borgaonkar, Ravishankar and Hirschi, Lucca},
title = {Mobile subscriber WiFi privacy},
todopages = {252-261},
year = {2017},
tododoi = {},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/OBH-most17.pdf},
abstract = {This paper investigates and analyses the insufficient protections afforded to mobile identities when using today?s operator backed WiFi services. Specifically we detail a range of attacks, on a set of widely deployed authentication protocols, that enable a malicious user to obtain and track a user?s International Mobile Subscriber Identity (IMSI) over WiFi. These attacks are possible due to a lack of sufficient privacy protection measures, which are exacerbated by preconfigured device profiles. We provide a formal analysis of the protocols involved, examine their associated configuration profiles, and document our experiences with reporting the issues to the relevant stakeholders. We detail a range of potential countermeasures to tackle these issues to ensure that privacy is better protected in the future.}
}
@inproceedings{VCCT-caise17,
address = {Essen, Germany},
month = jun,
volume = 10253,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Dubois, Eric and Pohl, Klaus},
acronym = {{CAiSE}'17},
booktitle = {{P}roceedings of the 29th {I}nternational {C}onference on {A}dvanced {I}nformation {S}ystems {E}ngineering ({CAiSE}'17)},
author = {{van Dongen}, Boudewijn and Carmona, Josep and Chatain, {\relax Th}omas and Taymouri, Farbod},
title = {Aligning Modeled and Observed Behavior: A Compromise Between Complexity and Quality},
pages = {94-109},
year = {2017},
doi = {10.1007/978-3-319-59536-8_7},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/VCCT-caise17.pdf},
abstract = {Certifying that a process model is aligned with the real process executions is perhaps the most desired feature a process model may have: aligned process models are crucial for organizations, since strategic decisions can be made easier on models instead of on plain data. In spite of its importance, the current algorithmic support for computing alignments is limited: either techniques that explicitly explore the model behavior (which may be worst-case exponential with respect to the model size), or heuristic approaches that cannot guarantee a solution, are the only alternatives. In this paper we propose a solution that sits right in the middle in the complexity spectrum of alignment techniques; it can always guarantee a solution, whose quality depends on the exploration depth used and local decisions taken at each step. We use linear algebraic techniques in combination with an iterative search which focuses on progressing towards a solution. The experiments show a clear reduction in the time required for reaching a solution, without sacrificing significantly the quality of the alignment obtained.}
}
@inproceedings{BBDH-sia17,
address = {Montigny-le-Bretonneux, France},
month = mar,
editor = {{Di Valentin}, Laurent and Landel, Eric},
acronym = {SIA Simulation Num{\'e}rique},
booktitle = {SIA Simulation Num{\'e}rique},
author = {Barbot, Beno{\^i}t and B{\'e}rard, B{\'e}atrice and Duplouy, Yann and Haddad, Serge},
title = {Statistical Model-Checking for Autonomous Vehicle Safety Validation},
todopages = {},
year = {2017},
todolsvdate-pub = 20170320,
tododoi = {},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBDH-sia17.pdf},
url = {https://hal.archives-ouvertes.fr/hal-01491064},
abstract = {We present an application of statistical
model-checking to the verification of an autonomous
vehicle controller. Our goal is to check safety properties
in various traffic situations. More specifically, we
focus on a traffic jam situation.\par
The controller is specified by a C++ program. Using
sensors, it registers positions and velocities of nearby
vehicles and modifies the position and velocity of the
controlled vehicle to avoid collisions. We model the environment
using a stochastic high level Petri net, where
random behaviors of other vehicles can be described.
We use HASL, a quantitative variant of linear temporal
logic, to express the desired properties. A large family
of performance indicators can be specified in HASL
and we target in particular the expectation of travelled
distance or the collision probability.\par
We evaluate the properties of this model using COSMOS1.
This simulation tool implements numerous statistical
techniques such as sequential hypothesis testing
and most confidence range computation methods.
Its efficiency allowed us to conduct several experiments
with success.}
}
@inproceedings{BHSS-pn17,
address = {Zaragoza, Spain},
month = jun,
volume = {10258},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {van der Aalst, Wifred and Best, Eike},
acronym = {{PETRI~NETS}'17},
booktitle = {{P}roceedings of the 38th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'17)},
author = {B{\'e}rard, B{\'e}atrice and Haar, Stefan and
Schmitz, Sylvain and Schwoon, Stefan},
title = {The Complexity of Diagnosability and Opacity
Verification for {P}etri Nets},
pages = {200-220},
year = {2017},
doi = {10.1007/978-3-319-57861-3_13},
url = {https://hal.inria.fr/hal-01484476},
abstract = {Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues. We first relate different notions of diagnosability and opacity. We consider in particular fairness issues and extend the definition of Germanos et al. [ACM TECS, 2015] of weakly fair diagnosability for safe Petri nets to general Petri nets and to opacity questions. Second, we provide a global picture of complexity results for the verification of diagnosability and opacity. We show that diagnosability is NL-complete for finite state systems, PSPACE-complete for safe Petri nets (even with fairness), and EXPSPACE-complete for general Petri nets without fairness, while non diagnosability is inter-reducible with reachability when fault events are not weakly fair. Opacity is ESPACE-complete for safe Petri nets (even with fairness) and undecidable for general Petri nets already without fairness.}
}
@misc{JGL:pls16,
author = {Goubault{-}Larrecq, Jean},
howpublished = {Encart dans l'article ''S'adapter {\`a} la cyberguerre'', de Karen Elazari, Pour La Science 459},
month = jan,
title = {Les m{\'e}thodes formelles: l'autre arme de la cybers{\'e}curit{\'e}},
year = {2016},
pages = {50-55}
}
@misc{JGL:stc16,
author = {Goubault{-}Larrecq, Jean},
howpublished = {Invited talk (plenary speaker), Summer Topology Conference, Leicester, UK},
month = aug,
title = {A few things on Noetherian spaces},
year = {2016}
}
@misc{JGL:gs16,
author = {Goubault{-}Larrecq, Jean},
howpublished = {Invited talk, Galway Symposium, Leicester, UK},
month = aug,
title = {An introduction to asymmetric topology and domain theory: why, what, and how},
year = {2016}
}
@misc{JGL:dom15,
author = {Goubault{-}Larrecq, Jean},
howpublished = {Invited talk, Domains XII workshop, Cork, Ireland},
month = aug,
title = {Formal balls},
year = {2015}
}
@misc{JGL:lls14,
author = {Goubault{-}Larrecq, Jean},
howpublished = {Matinale de l'innovation Logiciels Libres et S{\'e}curit{\'e}, Paris, France},
month = dec,
title = {D{\'e}tection d'intrusions avec {OrchIDS}},
year = {2014}
}
@misc{JGL:ccc14,
author = {Goubault{-}Larrecq, Jean},
howpublished = {Invited talk, Continuity, Computability, Constructivity workshop (CCC), Ljubljana, Slovenia},
month = sep,
title = {Noetherian spaces},
year = {2014}
}
@misc{JGL:cps14,
author = {Goubault{-}Larrecq, Jean},
howpublished = {CPS Summer School, Grenoble, France},
month = jul,
title = {{OrchIDS}: on the value of rigor in intrusion detection},
year = {2014}
}
@misc{JGL:stc13,
author = {Goubault{-}Larrecq, Jean},
howpublished = {Invited talk (semi-plenary speaker), Summer Topology Conference, North Bay, Ontario, CA},
month = jul,
title = {A few pearls in the theory of quasi-metric spaces},
year = {2013}
}
@misc{JGL:dga13,
author = {Goubault{-}Larrecq, Jean},
howpublished = {S{\'e}minaire DGA Innosciences. DGA, Bagneux},
month = jun,
title = {{OrchIDS}, ou : de l'importance de la s{\'e}mantique},
year = {2013}
}
@misc{JGL:at13,
author = {Goubault{-}Larrecq, Jean},
howpublished = {Invited talk, Workshop on Asymmetric Topology, Summer Topology Conference, North Bay, Ontario, CA},
month = jul,
title = {A short proof of the {Schr{\"o}der-Simpson} theorem},
year = {2013}
}
@misc{JGL:dm16,
author = {Goubault{-}Larrecq, Jean},
howpublished = {Invited talk, Dale Miller Festschrift, Paris Diderot University, Paris},
month = dec,
title = {A semantics for {{\(\nabla\)}}},
year = {2016}
}
@misc{GSHM:dga-inria16,
author = {Goubault-Larrecq, Jean and Sentucq, Pierre-Arnaud and Hulin-Hubard, Francis and Majorczyk, Fr{\'e}d{\'e}ric},
howpublished = {Rapport final et fourniture 4 du contrat DGA-INRIA Orchids},
month = may,
title = {Etat final des travaux engag{\'e}s sur {Orchids}},
year = {2016}
}
@misc{GM:dga-inria16,
author = {Goubault-Larrecq, Jean and Majorczyk, Fr{\'e}d{\'e}ric},
howpublished = {Fourniture 3 du contrat DGA-INRIA Orchids},
month = may,
title = {G{\'e}n{\'e}ration de signatures pour le suivi de flux d'informations},
year = {2016}
}
@misc{GSM:dga-inria15,
author = {Goubault-Larrecq, Jean and Sentucq, Pierre-Arnaud and Majorczyk, Fr{\'e}d{\'e}ric},
howpublished = {Rapport interm{\'e}diaire du contrat DGA-INRIA Orchids},
month = may,
title = {Etat d'avancement interm{\'e}diaire des travaux engag{\'e}s sur {OrchIDS}},
year = {2015}
}
@misc{GSM:dga-inria-2-14,
author = {Goubault-Larrecq, Jean and Sentucq, Pierre-Arnaud and Majorczyk, Fr{\'e}d{\'e}ric},
howpublished = {Fourniture 2 du contrat DGA-INRIA Orchids},
month = may,
title = {Techniques et m{\'e}thodes de g{\'e}n{\'e}ration de signatures pour la d{\'e}tection d'intrusions},
year = {2014}
}
@misc{GSM:dga-inria-1-14,
author = {Goubault-Larrecq, Jean and Sentucq, Pierre-Arnaud and Majorczyk, Fr{\'e}d{\'e}ric},
howpublished = {Fourniture 1 du contrat DGA-INRIA Orchids},
month = may,
title = {Politiques de s{\'e}curit{\'e} syst{\`e}me},
year = {2014}
}
@misc{AG:anr-cpp12,
author = {Adj{\'e}, Assal{\'e} and Goubault-Larrecq, Jean},
howpublished = {Fourniture du projet ANR CPP (Confidence, Proofs, and Probabilities), WP 2, version 1},
month = oct,
title = {Concrete semantics of programs with non-deterministic and random inputs},
year = {2012},
url = {http://arxiv.org/abs/1210.2605}
}
@misc{GL:ARC-ProNoBis-16,
author = {Goubault-Larrecq, Jean},
howpublished = {Rapport final ARC ProNoBis},
month = oct,
title = {{Pronobis: Probability and nondeterminism,
bisimulations and security}},
year = {2007}
}
@article{ABH-ijfcs17,
publisher = {World Scientific},
journal = {International Journal of Foundations of Computer Science},
author = {Atig, Mohamed Faouzi and Bollig, Benedikt and Habermehl, Peter},
title = {Emptiness of ordered multi-pushdown automata is {2ETIME}-complete},
volume = {28},
number = {8},
year = {2017},
pages = {945-975},
doi = {10.1142/S0129054117500332},
url = {http://www.worldscientific.com/doi/abs/10.1142/S0129054117500332},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABH-ijfcs17.pdf},
abstract = {We consider ordered 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.
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 ordered
multi-pushdown automata with the model of bounded-phase (visibly)
multi-stack pushdown automata, which do not impose an ordering on stacks,
but restrict the number of alternations of pop operations on different
stacks.}
}
@article{DKP-jar2017,
publisher = {Springer},
journal = {Journal of Automated Reasoning},
author = {Demri, St{\'e}phane and Kapur, Deepak and Weidenbach, Christoph},
editor = {Demri, St{\'e}phane and Kapur, Deepak and Weidenbach, Christoph},
title = {Special Issue of Selected Extended Papers of IJCAR 2014},
url = {http://link.springer.com/journal/10817/58/1/page/1},
volume = {58},
number = {1},
year = {2017}
}
@inproceedings{AMP-lfmtp16,
address = {Porto, Portugal},
month = jun,
publisher = {ACM Press},
editor = {Dowek, Gilles and Licata, Daniel R. and Alves, Sandra},
acronym = {{LFMTP}'16},
booktitle = {Proceedings of the 11th {I}nternational {W}orkshop on {L}ogical {F}rameworks and
{M}eta-{L}anguages: {T}heory and {P}ractice ({LFMTP}'16)},
author = {Cauderlier, Rapha{\"e}l},
title = {{{A Rewrite System for Proof Constructivization}}},
pages = {2:1-2:7},
year = {2016},
doi = {10.1007/978-3-319-40578-0\_5},
url = {https://hal.inria.fr/hal-01420634/},
pdf = {https://hal.inria.fr/hal-01420634/file/LFMTP_2016.pdf},
abstract = {Proof constructivization is the problem of automatically extracting constructive proofs out of classical proofs. This process is required when classical theorem provers are integrated in intuitionistic proof assistants. We use the ability of rewrite systems to represent partial functions to implement heuristics for proof constructivization in Dedukti, a logical framework based on rewriting in which proofs are first-class objects which can be the subject of computation. We benchmark these heuristics on the proofs output by the automated theorem prover Zenon on the TPTP library of problems.}
}
@inproceedings{AMP-rc16,
address = {Bologna, Italy},
month = jul,
volume = 9720,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Lanese, Ivan and Devitt, Simon},
acronym = {{RC}'16},
booktitle = {8th Conference on Reversible Computation (RC'16)},
author = {Arrighi, Pablo and Martiel, Simon and Perdrix, Simon},
title = {{{Reversible Causal Graph Dynamics}}},
pages = {73-88},
year = {2016},
doi = {10.1007/978-3-319-40578-0\_5},
url = {https://hal.archives-ouvertes.fr/hal-01361427},
abstract = {Causal Graph Dynamics extend Cellular Automata to arbitrary , bounded-degree, time-varying graphs. The whole graph evolves in discrete time steps, and this global evolution is required to have a number of physics-like symmetries: shift-invariance (it acts everywhere the same) and causality (information has a bounded speed of propagation). We add a further physics-like symmetry, namely reversibility.}
}
@inproceedings{ADJL-hatt2016,
author = {Assaf, Ali and Dowek, Gilles and Jouannaud, Jean-Pierre and Liu, Jiaxiang},
title = {{{Encoding Proofs in Dedukti: the case of Coq proofs}}},
nopages = {},
booktitle = {Preliminary Proceedings of the 1st International Workshop on Hammers for Type Theories (HaTT'16)},
year = {2016},
address = {Coimbra, Portugal},
url = {https://hal.inria.fr/hal-01330980},
pdf = {https://hal.inria.fr/hal-01330980/file/HaTT_2016_paper_3.pdf},
abstract = {A main ambition of the Inria project Dedukti is to serve as a common language for representing and type checking proof objects originating from other proof systems. Encoding these proof objects makes heavy use of the rewriting capabilities of LambdaPiModulo, the formal system on which Dedukti is based. So far, the proofs generated by two automatic proof systems, Zenon and iProver, have been encoded, and can therefore be read and checked by Dedukti. But Dedukti goes far beyond this so-called hammering technique of sending goals to automated provers. Proofs from HOL and Matita can be encoded as well. Some Coq?s proofs can be encoded already, when they do not use universe polymorphism. Our ambition here is to close this remaining gap. To this end, we describe a rewrite-based encoding in LambdaPiModulo of the Calculus of Constructions with a cumulative hierarchy of predicative universes above Prop, which is confluent on open terms.}
}
@inproceedings{ADJL-hor2016,
author = {Assaf, Ali and Dowek, Gilles and Jouannaud, Jean-Pierre and Liu, Jiaxiang},
title = {{{Untyped Confluence in Dependent Type Theories}}},
nopages = {},
booktitle = {Proceedings of the 8th International Workshop on Higher-Order Rewriting (HOR'16)},
year = {2016},
address = {Porto, Portugal},
url = {https://hal.inria.fr/hal-01330955},
pdf = {https://hal.inria.fr/hal-01330955/file/HOR_2016_paper.pdf},
abstract = {We investigate techniques based on van Oostrom's decreasing diagrams that reduce confluence proofs to the checking of critical pairs in the absence of termination properties, which are useful in dependent type calculi to prove confluence on untyped terms. These techniques are applied to a complex example originating from practice: a faithful encoding, in an extension of LF with rewrite rules on objects and types, of a subset of the calculus of inductive constructions with a cumulative hierarchy of predicative universes above Prop. The rules may be first-order or higher-order, plain or modulo, non-linear on the right or on the left. Variables which occur non-linearly in lefthand sides of rules must take their values in confined types: in our example, the natural numbers. The first-order rules are assumed to be terminating and confluent modulo some theory: in our example, associativity, commutativity and identity. Critical pairs involving higher-order rules must satisfy van Oostrom's decreasing diagram condition wrt their indexes taken as labels.}
}
@inproceedings{A-types2016,
address = {Novi Sad, Serbia},
volume = {97},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Ghilezan, Silvia and Ivetic, Jelena},
acronym = {{TYPES}'16},
booktitle = {{P}roceedings of the 22nd {I}nternational {C}onference on {T}ypes for {P}roofs and {P}rograms
({TYPES}'16)},
author = {Assaf, Ali and Burel, Guillaume and Cauderlier, Rapha{\"e}l and Delahaye, David and Dowek, Gilles and Dubois, Catherine and Gilbert, Fr{\'e}d{\'e}ric and Halmagrand, Pierre and Hermant, Olivier and Saillard, Ronan},
title = {{{Expressing theories in the {{\(\lambda\Pi\)}}-calculus modulo theory and in the Dedukti system}}},
year = {2016},
note = {To appear}
}
@unpublished{D-preprint2016,
title = {{Rules and derivations in an elementary logic course}},
author = {Dowek, Gilles},
note = {preprint},
year = {2016},
month = jan,
url = {https://hal.inria.fr/hal-01252124/},
pdf = {https://hal.inria.fr/hal-01252124/file/ttl.pdf},
abstract = {When teaching an elementary logic course to students who have a general scientific background but have never been exposed to logic, we have to face the problem that the notions of deduction rule and of derivation are completely new to them, and are related to nothing they already know, unlike, for instance, the notion of model, that can be seen as a generalization of the notion of algebraic structure. In this note, we defend the idea that one strategy to introduce these notions is to start with the notion of inductive definition [1]. Then, the notion of derivation comes naturally. We also defend the idea that derivations are pervasive in logic and that defining precisely this notion at an early stage is a good investment to later define other notions in proof theory, computability theory, automata theory, ... Finally, we defend the idea that to define the notion of derivation precisely, we need to distinguish two notions of derivation: labeled with elements and labeled with rule names. This approach has been taken in [2].}
}
@unpublished{AD-preprint2016,
title = {{What is the Planck constant the magnitude of?}},
author = {Arrighi, Pablo and Dowek, Gilles},
note = {preprint},
year = {2016},
month = dec,
url = {https://hal.inria.fr/hal-01421711},
pdf = {https://hal.inria.fr/hal-01421711/file/planck.pdf},
abstract = {The Planck constant is the minimal area of one bit.}
}
@inproceedings{CD-ictac16,
address = {Taipei, Taiwan},
month = oct,
volume = 9965,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Alves Sampaio, Cesar and Wang, Farn},
acronym = {{ICTAC}'16},
booktitle = {{P}roceedings of the 13th {I}nternational {C}olloquium on
{T}heoretical {A}spects of {C}omputing ({ICTAC}'16)},
author = {Cauderlier, Rapha{\"e}l and Dubois, Catherine},
title = {{{ML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe to Dedukti}}},
pages = {459-468},
year = {2016},
pdf = {https://hal.inria.fr/hal-01420638/file/ICTAC_2016.pdf},
url = {https://hal.inria.fr/hal-01420638/},
abstract = {The programming environment FoCaLiZe allows the user to specify, implement, and prove programs with the help of the theorem prover Zenon. In the actual version, those proofs are verified by Coq. In this paper we propose to extend the FoCaLiZe compiler by a backend to the Dedukti language in order to benefit from Zenon Modulo, an extension of Zenon for Deduction modulo. By doing so, FoCaLiZe can benefit from a technique for finding and verifying proofs more quickly. The paper focuses mainly on the process that overcomes the lack of local pattern-matching and recursive definitions in Dedukti.}
}
@mastersthesis{m2-thire,
author = {Thir{\'e}, Fran{\c{c}}ois},
title = {Reverse engineering on arithmetic proofs},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2016},
month = aug,
url = {https://hal.inria.fr/hal-01424816},
pdf = {https://hal.inria.fr/hal-01424816/file/main.pdf},
note = {26~pages}
}
@phdthesis{ph-phd2016,
author = {Halmagrand, Pierre},
title = {{Automated Deduction and Proof Certification for the B Method}},
school = {{Conservatoire National Des Arts et M{\'e}tiers, Paris}},
type = {Th{\`e}se de doctorat},
year = 2016,
month = dec,
url = {https://hal.inria.fr/tel-01420460/}
}
@inproceedings{AD-dcm15,
address = {Cali, Colombia},
month = mar,
volume = 204,
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Mu\~noz, C\'esar A. and P\'erez, Jorge A.},
acronym = {{DCM}'15},
booktitle = {{P}roceedings of the 11th {I}nternational {W}orkshop on
{D}evelopments in {C}omputational {M}odels ({DCM}'15)},
author = {Arrighi, Pablo and Dowek, Gilles},
doi = {10.4204/EPTCS.204.1},
pages = {1-10},
title = {Free fall and cellular automata},
url = {https://hal.inria.fr/hal-01421712},
year = {2016},
abstract = {Three reasonable hypotheses lead to the thesis that physical phenomena can be described and simulated with cellular automata. In this work, we attempt to describe the motion of a particle upon which a constant force is applied, with a cellular automaton, in Newtonian physics, in Special Relativity, and in General Relativity. The results are very different for these three theories.}
}
@article{BGMS-toct16,
publisher = {ACM Press},
journal = {ACM Transactions on Computation Theory},
author = {Beame, Paul and Grosshans, Nathan and McKenzie, Pierre and Segoufin, Luc},
title = {Nondeterminism and An Abstract Formulation of {Ne\v{c}iporuk}'s Lower Bound Method},
volume = {9},
number = {1},
year = {2016},
pages = {5:1-5:34},
doi = {10.1145/3013516},
month = dec
}
@article{ACR-tecs17,
publisher = {ACM Press},
journal = {ACM Transactions in Embedded Computing Systems},
author = {Andr{\'e}, {\'E}tienne and Chatain, {\relax Th}omas and Rodr{\'\i}guez, C{\'e}sar},
title = {Preserving Partial-Order Runs in Parametric Time {P}etri Nets},
volume = {16},
number = {2},
year = {2017},
pages = {43:1-43:26},
doi = {10.1145/3012283},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ACR-tecs17.pdf},
abstract = {Parameter synthesis for timed systems aims at deriving parameter valuations satisfying a given property. In this article, we target concurrent systems. We use partial-order semantics for parametric time Petri nets as a way to both cope with the well-known state-space explosion due to concurrency and significantly enhance the result of an existing synthesis algorithm. Given a reference parameter valuation, our approach synthesizes other valuations preserving the partial-order executions of the reference parameter valuation. We show the applicability of our approach using a tool applied to asynchronous circuits.}
}
@incollection{BLMOW-kimfest17,
author = {Bouyer, Patricia and Laroussinie, Fran{\c{c}}ois and
Markey, Nicolas and Ouaknine, Jo{\"e}l and Worrell,
James},
title = {Timed temporal logics},
editor = {Aceto, Luca and Bacci, Giorgio and Bacci, Giovani
and Ing{\'o}lfsd{\'o}ttir, Anna and Legay, Axel and
Mardare, Radu},
booktitle = {Models, Algorithms, Logics and Tools: Essays
Dedicated to Kim Guldstrand Larsen on the Occasion
of His 60th Birthday},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {10460},
year = {2017},
pages = {211-230},
month = aug,
doi = {10.1007/978-3-319-65764-6_11},
abstract = {Since the early 1990's, classical temporal logics
have been extended with timing constraints. While
temporal logics only express contraints on the order
of events, their timed extensions can add
quantitative constraints on delays between those
events. We survey expressiveness and algorithmic
results on those logics, and discuss semantic
choices that may look unimportant but do have an
impact on the questions we consider.},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BLMOW-kimfest17.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BLMOW-kimfest17.pdf}
}
@inproceedings{BG-wst18,
address = {Oxford, UK},
month = jul,
editor = {Lucas, Salvador},
acronym = {{WST}'18},
booktitle = {{P}roceedings of the 16th {I}nternational {W}orkshop on {T}ermination
({WST}'18)},
author = {Blanqui, Fr{\'e}d{\'e}ric and Genestier, Guillaume},
title = {Termination of $\lambda \Pi$ modulo rewriting using the size-change principle},
pages = {10--14},
year = 2018,
pdf = {https://hal.inria.fr/hal-01944731/file/main.pdf}
}
@inproceedings{Thire-lfmtp2018,
address = {Oxford, UK},
month = jul,
year = 2018,
publisher = {ACM Press},
editor = {Blanqui, Fr{\'e}d{\'e}ric and Reis, Giselle},
acronym = {{LFMTP}'18},
booktitle = {Proceedings of the 13th {I}nternational {W}orkshop on {L}ogical {F}rameworks and
{M}eta-{L}anguages: {T}heory and {P}ractice ({LFMTP}'18)},
author = {Thir{\'e}, Fran{\c{c}}ois},
title = {{S}haring a {L}ibrary between {P}roof {A}ssistants: {R}eaching out to the {HOL}
{F}amily *},
pages = {57--71},
url = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?LFMTP2018.5},
pdf = {https://hal.inria.fr/hal-01929714/file/sttforall-lfmtp.pdf},
doi = {10.4204/EPTCS.274.4}
}
@inproceedings{Burel-mfcs2018,
address = {Liverpool, UK},
month = aug,
volume = {117},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Potapov, Igor and Spirakis, Paul and Worrell, James},
acronym = {{MFCS}'18},
booktitle = {{P}roceedings of the 42nd
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'18)},
author = {Burel, Guillaume},
title = {Linking Focusing and Resolution with Selection},
pages = {9:1--9:14},
year = {2018},
doi = {10.4230/LIPIcs.MFCS.2018.9},
url = {https://hal.inria.fr/hal-01670476},
pdf = {https://hal.inria.fr/hal-01670476/file/lipics.pdf},
futureannote = {Keywords: logic in computer science, automated deduction,
proof theory, sequent calculus, refinements of resolution, deduction
modulo theory, polarization}
}
@inproceedings{CLS-jfla19,
address = {Lamoura, France},
month = jan,
year = 2019,
editor = {Nicolas Magaud and Zaynah Dargaye},
acronym = {{JFLA}'19},
booktitle = {{A}ctes des 30{\`e}mes {J}ourn{\'e}es
{F}rancophones sur les {L}angages
{A}pplicatifs
({JFLA}'19)},
author = {Simon Colin and Rodolphe Lepigre and Gabriel Scherer},
title = {{Unboxing Mutually Recursive Type Definitions}},
pdf = {https://lepigre.fr/files/publications/CLS2019.pdf},
abstract = {In modern OCaml, single-argument datatype declarations (variants with a single constructor, records with a single immutable field) can sometimes be ''unboxed''. This means that their memory representation is the same as their single argument, omitting an indirection through the variant or record constructor, thus achieving better memory efficiency. However, in the case of generalized/guarded algebraic datatypes (GADTs), unboxing is not always possible due to a subtle assumption about the runtime representation of OCaml values. The current correctness check is incomplete, rejecting many valid definitions, in particular those involving mutually-recursive datatype declarations. In this paper, we explain the notion of separability as a semantic for the unboxing criterion, and propose a set of inference rules to check separability. From these inference rules, we derive a new implementation of the unboxing check that properly supports mutually-recursive definitions.},
note = {To appear}
}
@inproceedings{LR-lfmtp2018,
address = {Oxford, UK},
month = jul,
year = 2018,
publisher = {ACM Press},
editor = {Blanqui, Fr{\'e}d{\'e}ric and Reis, Giselle},
acronym = {{LFMTP}'18},
booktitle = {Proceedings of the 13th {I}nternational {W}orkshop on {L}ogical {F}rameworks and
{M}eta-{L}anguages: {T}heory and {P}ractice ({LFMTP}'18)},
author = {Rodolphe Lepigre and Christophe Raffalli},
title = {Abstract Representation of Binders in OCaml using the Bindlib Library},
pages = {42-56},
url = {https://arxiv.org/abs/1807.01872},
pdf = {https://arxiv.org/pdf/1807.01872.pdf},
doi = {10.4204/EPTCS.274.4},
abstract = {The Bindlib library for OCaml provides a set of tools for the manipulation of data structures with variable binding. It is very well suited for the representation of abstract syntax trees, and has already been used for the implementation of half a dozen languages and proof assistants (including a new version of the logical framework Dedukti). Bindlib is optimised for fast substitution, and it supports variable renaming. Since the representation of binders is based on higher-order abstract syntax, variable capture cannot arise during substitution. As a consequence, variable names are not updated at substitution time. They can however be explicitly recomputed to avoid ''visual capture'' (i.e., distinct variables with the same apparent name) when a data structure is displayed.}
}
@article{LR-toplas18,
publisher = {ACM Press},
journal = {ACM Transactions on Programming Languages and Systems},
author = {Rodolphe Lepigre and Christophe Raffalli},
title = {{Practical Subtyping for Curry-Style Languages}},
volume = {41},
number = {1},
year = {2018},
pages = {5:1--5:58},
doi = {10.1145/3285955},
pdf = {https://lepigre.fr/files/publications/LepRaf2018a.pdf},
abstract = {We present a new, syntax-directed framework for Curry-style type systems with subtyping. It supports a rich set of features, and allows for a reasonably simple theory and implementation. The system we consider has sum and product types, universal and existential quantifiers, and inductive and coinductive types. The latter two may carry size invariants that can be used to establish the termination of recursive programs. For example, the termination of quicksort can be derived by showing that partitioning a list does not increase its size. The system deals with complex programs involving mixed induction and coinduction, or even mixed polymorphism and (co-)induction. One of the key ideas is to separate the notion of size from recursion. We do not check the termination of programs directly, but rather show that their (circular) typing proofs are well-founded. Termination is then obtained using a standard (semantic) normalisation proof. To demonstrate the practicality of the system, we provide an implementation accepting all the examples discussed in the article.}
}
@inproceedings{L-types2017,
address = {Budapest, Hungary},
year = 2018,
volume = {104},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Ambrus Kaposi and Tam{\'a}s Kozsik},
acronym = {{TYPES}'17},
booktitle = {{P}roceedings of the 23rd {I}nternational {C}onference on {T}ypes for {P}roofs and {P}rograms
({TYPES}'17},
author = {Rodolphe Lepigre},
title = {{PML\(_2\):} Integrated Program Verification in ML},
pages = {4:1--4:27},
url = {http://drops.dagstuhl.de/opus/volltexte/2018/10052/},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/10052/pdf/LIPIcs-TYPES-2017-4.pdf},
doi = {10.4230/LIPIcs.TYPES.2017.4},
abstract = {We present the PML\(_2\) language, which provides a uniform environment for programming, and for proving properties of programs in an ML-like setting. The language is Curry-style and call-by-value, it provides a control operator (interpreted in terms of classical logic), it supports general recursion and a very general form of (implicit, non-coercive) subtyping. In the system, equational properties of programs are expressed using two new type formers, and they are proved by constructing terminating programs. Although proofs rely heavily on equational reasoning, equalities are exclusively managed by the type-checker. This means that the user only has to choose which equality to use, and not where to use it, as is usually done in mathematical proofs. In the system, writing proofs mostly amounts to applying lemmas (possibly recursive function calls), and to perform case analyses (pattern matchings).}
}
@inproceedings{CHKP-valuetools17,
address = {Venice, Italy},
month = dec,
year = 2017,
acronym = {{VALUETOOLS}'17},
booktitle = {{P}roceedings of the 11th {I}nternational {C}onference
on {P}erformance {E}valuation {M}ethodologies and {T}ools
({VALUETOOLS}'17)},
author = {Chatzikokolakis, Kostas and Haddad, Serge and Kassem, Ali and Palamidessi, Catuscia},
title = {{Trading Optimality for Performance in Location Privacy}},
pages = {221-222},
url = {https://arxiv.org/abs/1710.05524},
pdf = {https://arxiv.org/pdf/1710.05524.pdf},
doi = {10.1145/3150928.3150962},
abstract = {Location-Based Services (LBSs) provide invaluable aid in the everyday activities of many individuals, however they also pose serious threats to the user' privacy. There is, therefore, a growing interest in the development of mechanisms to protect location privacy during the use of LBSs. Nowadays, the most popular methods are probabilistic, and the so-called optimal method achieves an optimal trade-off between privacy and utility by using linear optimization techniques. Unfortunately, due to the complexity of linear programming, the method is unfeasible for a large number n of locations, because the constraints are \(O(n^3)\). In this paper, we propose a technique to reduce the number of constraints to \(O(n^2)\), at the price of renouncing to perfect optimality. We show however that on practical situations the utility loss is quite acceptable, while the gain in performance is significant.}
}
@incollection{SD-EORM18,
author = {Demri, St{\'e}phane},
title = {Reasoning about reversal-bounded counter machines},
editor = {Goli{\'n}ska-Pilarek, Joanna and Zawidzki, Micha\l},
booktitle = {Ewa Orlowska on Relational Methods in Logic and Computer Science},
publisher = {Springer},
series = {Outstanding Contributions to Logic},
volume = {17},
year = {2018},
pages = {441-479},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/SD-EORM.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SD-EORM.pdf}
}
@inproceedings{AFMS-vmcai2019,
address = {Cascais/Lisbon, Portugal},
month = jan,
year = 2019,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Enea, Constantin and Piskac, Ruzica},
acronym = {{VMCAI}'19},
booktitle = {{P}roceedings of the 20th {I}nternational {C}onference on
{V}erification, {M}odel {C}hecking and {A}bstract {I}nterpretation
({VMCAI}'19)},
author = {Andr{\'e}, {\'E}tienne and Fribourg, Laurent and Mota, Jean-Marc and Soulat, Romain},
title = {Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking},
pages = {409-424},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/AFMS-vmcai19.pdf},
abstract = {The election of a leader in a network is a challenging task, especially when the processes are asynchronous, i.e., execute an algorithm with time-varying periods. Thales developed an industrial election algorithm with an arbitrary number of processes, that can possibly fail. In this work, we prove the correctness of a variant of this industrial algorithm. We use a method combining abstraction, the SafeProver solver, and a parametric timed model-checker. This allows us to prove the correctness of the algorithm for a large number \(p\) of processes (\(p = 5000\)).}
}
@inproceedings{HKP-vmcai2019,
address = {Cascais/Lisbon, Portugal},
month = jan,
year = 2019,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Enea, Constantin and Piskac, Ruzica},
acronym = {{VMCAI}'19},
booktitle = {{P}roceedings of the 20th {I}nternational {C}onference on
{V}erification, {M}odel {C}hecking and {A}bstract {I}nterpretation
({VMCAI}'19)},
author = {Haar, Stefan and Kolc{\'a}k, Juraj and Paulev{\'e}, Lo{\"i}c},
title = {{Combining Refinement of Parametric Models with Goal-Oriented Reduction of Dynamics}},
pages = {555-576},
url = {https://hal.archives-ouvertes.fr/hal-01940174/},
pdf = {https://hal.archives-ouvertes.fr/hal-01940174/file/manuscript.pdf},
abstract = {Parametric models abstract part of the specification of dynamical models by integral parameters. They are for example used in computational systems biology, notably with parametric regulatory networks, which specify the global architecture (interactions) of the networks, while parameterising the precise rules for drawing the possible temporal evolutions of the states of the components. A key challenge is then to identify the discrete parameters corresponding to concrete models with desired dynamical properties. This paper addresses the restriction of the abstract execution of parametric regulatory (discrete) networks by the means of static analysis of reachability properties (goal states). Initially defined at the level of concrete parameterised models, the goal-oriented reduction of dynamics is lifted to parametric networks, and is proven to preserve all the minimal traces to the specified goal states. It results that one can jointly perform the refinement of parametric networks (restriction of domain of parameters) while reducing the necessary transitions to explore and preserving reachability properties of interest.}
}
@phdthesis{dallon-phd2018,
author = {Dallon, Antoine},
title = {{Verification of indistinguishability properties in cryptographic protocols} -- {Small attacks and efficient decision with SAT-Equiv}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2018,
month = nov,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/dallon-phd18.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/dallon-phd18.pdf}
}
@phdthesis{duplouy-phd2018,
author = {Duplouy, Yann},
title = {{Applying Formal Methods to Autonomous Vehicle Control}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2018,
month = nov,
url = {http://www.lsv.fr/~duplouy/defence/}
}
@inproceedings{BGMR-gandalf18,
address = {Saarbr{\"u}cken, Germany},
month = sep,
volume = {277},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Andrea Orlandini and Martin Zimmermann},
acronym = {{GandALF}'18},
booktitle = {{P}roceedings of the 9th {I}nternational {S}ymposium
on {G}ames, {A}utomata, {L}ogics, and {F}ormal {V}erification
({GandALF}'18)},
author = {Bouyer, Patricia and Gonz{\'a}lez, Mauricio and Markey, Nicolas and Randour, Mickael},
title = {Multi-weighted Markov Decision Processes with Reachability Objectives},
pages = {250-264},
year = {2018},
doi = {10.4204/EPTCS.277.18},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BGMR-gandalf18.pdf},
url = {http://arxiv.org/abs/1809.03107},
abstract = {In this paper, we are interested in the synthesis of schedulers in double-weighted Markov decision processes, which satisfy both a percentile constraint over a weighted reachability condition, and a quantitative constraint on the expected value of a random variable defined using a weighted reachability condition. This problem is inspired by the modelization of an electric-vehicle charging problem. We study the cartography of the problem, when one parameter varies, and show how a partial cartography can be obtained via two sequences of opimization problems. We discuss completeness and feasability of the method.}
}
@inproceedings{BJM-rv18,
address = {Limassol, Cyprus},
month = nov,
volume = 11237,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Colombo, Christian and Leucker, Martin},
acronym = {{RV}'18},
booktitle = {{P}roceedings of the 18th {W}orkshop on {R}untime {V}erification ({RV}'18)},
author = {Bouyer, Patricia and Jaziri, Samy and Markey, Nicolas},
title = {Efficient Timed Diagnosis Using Automata with Timed Domains},
pages = {205-221},
year = {2018},
doi = {10.1007/978-3-030-03769-7_12},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BJM-rv18.pdf},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BJM-rv18.pdf},
abstract = {We consider the problems of efficiently diagnosing and predicting what did (or will) happen in a partially-observable one-clock timed automaton. We introduce timed sets as a formalism to keep track of the evolution of the reachable configurations over time, and use our previous work on automata over timed domains to build a candidate diagnoser for our timed automaton. We report on our implementation of this approach compared to the approach of [Tripakis, Fault diagnosis for timed automata, 2002].}
}
@inproceedings{BDH-esorics18,
address = {Barcelona, Spain},
month = sep,
year = 2018,
volume = {11098},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Javier L{\'{o}}pez and
Jianying Zhou and
Miguel Soriano},
acronym = {{ESORICS}'18},
booktitle = {{P}roceedings of the 23rd {E}uropean {S}ymposium on
{R}esearch in {C}omputer {S}ecurity ({ESORICS}'18)},
author = {David Baelde and St{\'e}phanie Delaune and Lucca Hirschi},
title = {{POR} for Security Protocol Equivalences - Beyond Action-Determinism},
pages = {385-405},
url = {https://arxiv.org/abs/1804.03650},
doi = {10.1007/978-3-319-99073-6\_19},
abstract = {Formal methods have proved effective to automatically analyse protocols. Recently, much research has focused on verifying trace equivalence on protocols, which is notably used to model interesting privacy properties such as anonymity or unlinkability. Several tools for checking trace equivalence rely on a naive and expensive exploration of all interleavings of concurrent actions, which calls for partial-order reduction (POR) techniques. In this paper, we present the first POR technique for protocol equivalences that does not rely on an action-determinism assumption: we recast trace equivalence as a reachability problem, to which persistent and sleep set techniques can be applied, and we show how to effectively apply these results in the context of symbolic execution. We report on a prototype implementation, improving the tool DeepSec.}
}
@inproceedings{CDD-esorics18,
address = {Barcelona, Spain},
month = sep,
year = 2018,
volume = {11098},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Javier L{\'{o}}pez and
Jianying Zhou and
Miguel Soriano},
acronym = {{ESORICS}'18},
booktitle = {{P}roceedings of the 23rd {E}uropean {S}ymposium on
{R}esearch in {C}omputer {S}ecurity ({ESORICS}'18)},
author = {V{\'e}ronique Cortier and Antoine Dallon and St{\'e}phanie Delaune},
title = {Efficiently Deciding Equivalence for Standard Primitives and Phases},
pages = {491-511},
url = {https://hal.archives-ouvertes.fr/hal-01819366},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CDD-esorics18.pdf},
doi = {10.1007/978-3-319-99073-6\_24},
abstract = {Privacy properties like anonymity or untraceability are now
well identified, desirable goals of many security protocols. Such properties
are typically stated as equivalence properties. However, automatically
checking equivalence of protocols often yields efficiency issues.\par
We propose an efficient algorithm, based on graph planning and SATsolving.
It can decide equivalence for a bounded number of sessions, for
protocols with standard cryptographic primitives and phases (often necessary
to specify privacy properties), provided protocols are well-typed,
that is encrypted messages cannot be confused. The resulting implementation,
SAT-Equiv, demonstrates a significant speed-up w.r.t. other
existing tools that decide equivalence, covering typically more than 100
sessions. Combined with a previous result, SAT-Equiv can now be used to
prove security, for some protocols, for an unbounded number of sessions.}
}
@article{BLMP-jml18,
publisher = {World Scientific},
journal = {Journal of Mathematical Logic},
author = {Brattka, Vasco and Le{~}Roux, St{\'e}phane and Miller, Joseph S. and Pauly, Arno},
title = {{Connected Choice and Brouwer's Fixed Point Theorem}},
year = {2018},
note = {To appear}
}
@article{KS-lmcs19,
journal = {Logical Methods in Computer Science},
author = {P. Karandikar and Schnoebelen, {\relax Ph}ilippe},
title = {The height of piecewise-testable languages and the complexity of the logic of subwords},
volume = {15},
number = {2},
pages = {6:1-6:27},
year = {2019},
month = apr,
pdf = {https://lmcs.episciences.org/5409/pdf},
url = {https://lmcs.episciences.org/5409},
abstract = {The height of a piecewise-testable language \(L\) is the maximum length of the words needed to define \(L\) by excluding and requiring given subwords. The height of \(L\) is an important descriptive complexity measure that has not yet been investigated in a systematic way. This paper develops a series of new techniques for bounding the height of finite languages and of languages obtained by taking closures by subwords, superwords and related operations. As an application of these results, we show that \(FO^2(A^*,\sqsubseteq)\), the two-variable fragment of the first-order logic of sequences with the subword ordering, can only express piecewise-testable properties and has elementary complexity.}
}
@inproceedings{D-time18,
address = {Warsaw, Poland},
month = oct,
year = 2018,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Natasha Alechina and Kjetil Norvag and Wojciech Penczek},
acronym = {{TIME}'18},
booktitle = {{P}roceedings of the 25th {I}nternational {S}ymposium on
{T}emporal {R}epresentation and {R}easoning
({TIME}'18)},
author = {Demri, St{\'e}phane},
title = {On temporal and separation logics},
pages = {1:1-1:4},
url = {http://drops.dagstuhl.de/opus/volltexte/2018/9766/pdf/LIPIcs-TIME-2018-1.pdf}
}
@mastersthesis{m2-Hilaire,
author = {Hilaire, Mathieu},
title = {{Complexity of the reachability problem for parametric timed automata}},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2018},
month = sep,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hilaire-M2-2018.pdf}
}
@techreport{CHKTP-hal18,
author = {Chatain, {\relax Th}omas and Haar, Stefan and Kolc{\'a}k, Juraj and Thakkar, Aalok and Paulev{\'e}, Lo{\"i}c},
institution = {HAL},
month = oct,
note = {33~pages},
number = {hal-01893106},
type = {Research Report},
title = {{Concurrency in Boolean networks}},
year = {2018},
url = {https://hal.inria.fr/hal-01893106},
pdf = {https://hal.inria.fr/hal-01893106/document},
abstract = {Boolean networks (BNs) are widely used to model the qualitative dynamics of biological systems. Besides the logical rules determining the evolution of each component with respect to the state of its regulators, the scheduling of components updates can have a dramatic impact on the predicted behaviours. In this paper, we explore the use of Contextual Petri Nets (CPNs) to study dynamics of BNs with a concurrency theory perspective. After showing bi-directional translations between CPNs and BNs and analogies between results on synchronism sensitivies, we illustrate that usual updating modes for BNs can miss plausible behaviours, i.e., incorrectly conclude on the absence/impossibility of reaching specific configurations. Taking advantage of CPN semantics enabling more behaviour than the generalized asynchronous updating mode, we propose an encoding of BNs ensuring a correct abstraction of any multivalued refinement, as one may expect to achieve when modelling biological systems with no assumption on its time features.}
}
@phdthesis{Lefaucheux-phd2018,
author = {Lefaucheux, Engel},
title = {Controlling Information in Probabilistic Systems},
school = {Universit{\'e} Rennes~1, Rennes, France},
type = {Th{\`e}se de doctorat},
year = 2018,
month = sep,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/lefaucheux-phd18.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/lefaucheux-phd18.pdf}
}
@phdthesis{Grosshans-phd2018,
author = {Grosshans, Nathan},
title = {The limits of {Ne\v{c}iporuk}'s method and the power of programs over monoids taken from small varieties of finite monoids},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2018,
month = sep,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/grosshans-phd18.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/grosshans-phd18.pdf}
}
@inproceedings{LPR-fsttcs18,
address = {Ahmedabad, India},
month = dec,
year = 2018,
volume = {122},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Sumit Ganguly and Paritosh Pandya},
acronym = {{FSTTCS}'18},
booktitle = {{P}roceedings of the 38th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'18)},
author = {Le{~}Roux, Stephane and Pauly, Arno and Randour, Mickael},
title = {Extending finite-memory determinacy to Boolean combinations of winning conditions},
pages = {38:1-38:20},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9937},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/9937/pdf/LIPIcs-FSTTCS-2018-38.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2018.38},
abstract = {We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable controllers. We establish general conditions under which FM strategies suffice to play optimally, even in a broad multi-objective setting. We show that our framework encompasses important classes of games from the literature, and permits to go further, using a unified approach. While such an approach cannot match ad-hoc proofs with regard to tightness of memory bounds, it has two advantages: first, it gives a widely-applicable criterion for FM determinacy; second, it helps to understand the cornerstones of FM determinacy, which are often hidden but common in proofs for specific (combinations of) winning conditions.}
}
@inproceedings{M-fsttcs18,
address = {Ahmedabad, India},
month = dec,
year = 2018,
volume = {122},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Sumit Ganguly and Paritosh Pandya},
acronym = {{FSTTCS}'18},
booktitle = {{P}roceedings of the 38th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'18)},
author = {Alessio Mansutti},
title = {Extending propositional separation logic for robustness properties},
pages = {42:1-42:23},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9941},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/9941/pdf/LIPIcs-FSTTCS-2018-42.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2018.42},
abstract = {We study an extension of propositional separation logic that can specify robustness properties, such as acyclicity and garbage freedom, for automatic verification of stateful programs with singly-linked lists. We show that its satisfiability problem is PSpace-complete, whereas modest extensions of the logic are shown to be Tower-hard. As separating implication, reachability predicates (under some syntactical restrictions) and a unique quantified variable are allowed, this logic subsumes several PSpace-complete separation logics considered in previous works.}
}
@inproceedings{BHL-fsttcs18,
address = {Ahmedabad, India},
month = dec,
year = 2018,
volume = {122},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Sumit Ganguly and Paritosh Pandya},
acronym = {{FSTTCS}'18},
booktitle = {{P}roceedings of the 38th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'18)},
author = {B{\'e}atrice B{\'e}rard and Stefan Haar and Lo{\"i}c H{\'e}lou{\"e}t},
title = {Hyper Partial Order Logic},
pages = {20:1-20:21},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9919},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/9919/pdf/LIPIcs-FSTTCS-2018-20.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2018.20},
abstract = {We define HyPOL, a local hyper logic for partial order models, expressing properties of sets of runs. These properties depict shapes of causal dependencies in sets of partially ordered executions, with similarity relations defined as isomorphisms of past observations. Unsurprisingly, since comparison of projections are included, satisfiability of this logic is undecidable. We then address model checking of HyPOL and show that, already for safe Petri nets, the problem is undecidable. Fortunately, sensible restrictions of observations and nets allow us to bring back model checking of HyPOL to a decidable problem, namely model checking of MSO on graphs of bounded treewidth.}
}
@inproceedings{FLS-fsttcs18,
address = {Ahmedabad, India},
month = dec,
year = 2018,
volume = {122},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Sumit Ganguly and Paritosh Pandya},
acronym = {{FSTTCS}'18},
booktitle = {{P}roceedings of the 38th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'18)},
author = {Alain Finkel and J{\'e}r{\^o}me Leroux and Gr{\'e}goire Sutre},
title = {Reachability for Two-Counter Machines with One Test and One Reset},
pages = {31:1-31:14},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9930},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/9930/pdf/LIPIcs-FSTTCS-2018-31.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2018.31},
abstract = {We prove that the reachability relation of two-counter machines with one zero-test and one reset is Presburger-definable and effectively computable. Our proof is based on the introduction of two classes of Presburger-definable relations effectively stable by transitive closure. This approach generalizes and simplifies the existing different proofs and it solves an open problem introduced by Finkel and Sutre in 2000.}
}
@inproceedings{BLS-fsttcs18,
address = {Ahmedabad, India},
month = dec,
year = 2018,
volume = {122},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Sumit Ganguly and Paritosh Pandya},
acronym = {{FSTTCS}'18},
booktitle = {{P}roceedings of the 38th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'18)},
author = {Baelde, David and Lick, Anthony and Schmitz, Sylvain},
title = {A Hypersequent Calculus with Clusters for Tense Logic over Ordinals},
pages = {15:1-15:19},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9914},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/9914/pdf/LIPIcs-FSTTCS-2018-15.pdf},
doi = {10.4230/LIPIcs.FSTTCS.2018.15},
abstract = {Prior's tense logic forms the core of linear temporal logic, with both past-and future-looking modalities. We present a sound and complete proof system for tense logic over ordinals. Technically, this is a hypersequent system, enriched with an ordering, clusters, and annotations. The system is designed with proof search algorithms in mind, and yields an optimal coNP complexity for the validity problem. It entails a small model property for tense logic over ordinals: every satisfiable formula has a model of order type at most \(\omega^2\). It also allows to answer the validity problem for ordinals below or exactly equal to a given one.}
}
@techreport{CHP-arxiv18,
author = {Chatain, {\relax Th}omas and Haar, Stefan and Paulev{\'e}, Lo{\"i}c},
institution = {Computing Research Repository},
month = aug,
note = {15~pages},
number = {1808.10240},
type = {Research Report},
title = {Most Permissive Semantics of Boolean Networks},
year = {2018},
url = {https://arxiv.org/abs/1808.10240},
pdf = {https://arxiv.org/pdf/1808.10240v1.pdf},
abstract = {As shown in [3], the usual update modes of
Boolean networks (BNs), including synchronous and (generalized)
asynchronous, fail to capture behaviours introduced by multivalued
refinements. Thus, update modes do not allow a correct abstract
reasoning on dynamics of biological systems, as they may lead to reject
valid BN models.\par
We introduce a new semantics for interpreting BNs which meets with a
correct abstraction of any multivalued refinements, with any update
mode. This semantics subsumes all the usual updating modes, while
enabling new behaviours achievable by more concrete models. Moreover, it
appears that classical dynamical analyses of reachability and
attractors have a simpler computational complexity:
\begin{itemize}
\item reachability can be assessed in a polynomial number of iterations
(instead of being PSPACE-complete with update modes);
\item attractors are hypercubes, and deciding the existence of attractors
with a given upper-bounded dimension is in NP (instead of
PSPACE-complete with update modes).
\end{itemize}
The computation of iterations is in NP in the very general case, and is
linear when local functions are monotonic, or with some usual
representations of functions of BNs (binary decision diagrams, Petri
nets, automata networks, etc.).\par
In brief, the most permissive semantics of BNs enables a correct
abstract reasoning on dynamics of BNs, with a greater tractability than
previously introduced update modes.\par
This technical report lists the main
definitions and properties of the most permissive semantics of BNs, and
draw some remaining open questions.}
}
@inproceedings{JK-ccs18,
address = {Toronto, Canada},
month = oct,
publisher = {ACM Press},
editor = {Backes, Michael and Wang, XiaoFeng},
acronym = {{CCS}'18},
booktitle = {{P}roceedings of the 25th {ACM} {C}onference
on {C}omputer and {C}ommunications {S}ecurity
({CCS}'18)},
author = {Barthe, Gilles and Fan, Xiong and Gancher, Joshua and Gr{\'e}goire, Benjamin and Jacomme, Charlie and Shi, Elaine},
title = {Symbolic Proofs for Lattice-Based Cryptography},
pages = {538-555},
year = {2018},
pdf = {https://eprint.iacr.org/2018/765.pdf},
url = {https://dl.acm.org/citation.cfm?doid=3243734.3243825}
}
@inproceedings{BLS-pods19,
address = {Amsterdam, Netherlands},
month = jun # {-} # jul,
publisher = {ACM Press},
editor = {Christoph Koch},
acronym = {{PODS}'19},
booktitle = {{P}roceedings of the 38th {A}nnual
{ACM} {SIGACT}-{SIGMOD}-{SIGART} {S}ymposium
on {P}rinciples of {D}atabase {S}ystems
({PODS}'19)},
author = {Baelde, David and Lick, Anthony and Schmitz, Sylvain},
title = {Decidable {XP}ath Fragments in the Real World},
pages = {285-302},
year = 2019,
doi = {10.1145/3294052.3319685},
url = {https://hal.inria.fr/hal-01852475},
abstract = {XPath is arguably the most popular query language for selecting elements in XML documents. Besides query evaluation, query satisfiability and containment are the main computational problems for XPath; they are useful, for instance, to detect dead code or validate query optimisations. These problems are undecidable in general, but several fragments have been identified over time for which satisfiability (or query containment) is decidable: CoreXPath 1.0 and 2.0 without so-called data joins, fragments with data joins but limited navigation, etc. However, these fragments are often given in a simplified syntax, and sometimes wrt. a simplified XPath semantics. Moreover, they have been studied mostly with theoretical motivations, with little consideration for the practically relevant features of XPath. To investigate the practical impact of these theoretical fragments, we design a benchmark compiling thousands of real-world XPath queries extracted from open-source projects. These queries are then matched against syntactic fragments from the literature. We investigate how to extend these fragments with seldom-considered features such as free variables, data tests, data joins, and the last() and id() functions, for which we provide both undecidability and decidability results. We analyse the coverage of the original and extended fragments, and further provide a glimpse at which other practically-motivated features might be worth investigating in the future.}
}
@inproceedings{FN-disc18,
address = {New Orleans, USA},
month = oct,
volume = 121,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Ulrich Schmid},
acronym = {{DISC}'18},
booktitle = {{P}roceedings of the 32nd {I}nternational
{S}ymposium on {D}istributed {C}omputing
({DISC}'18)},
author = {F{\"u}gger, Matthias and Nowak, {\relax Th}omas},
title = {Fast Multidimensional Asymptotic and Approximate Consensus},
pages = {27:1-27:15},
year = {2018},
url = {https://arxiv.org/abs/1805.04923}
}
@inproceedings{BLS-atva18,
address = {Los Angeles, California, USA},
month = oct,
year = {2018},
volume = {11138},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Shuvendu Lahiri and Chao Wang},
acronym = {{ATVA}'18},
booktitle = {{P}roceedings of the 16th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'18)},
author = {Benedikt Bollig and Mathieu Lehaut and Nathalie Sznajder},
title = {Round-Bounded Control of Parameterized Systems},
pages = {370-386},
url = {https://hal.archives-ouvertes.fr/hal-01849206},
doi = {10.1007/978-3-030-01090-4_22},
abstract = {We consider systems with unboundedly many processes that communicate through shared memory. In that context, simple verification questions have a high complexity or, in the case of pushdown processes, are even undecidable. Good algorithmic properties are recovered under round-bounded verification, which restricts the system behavior to a bounded number of round-robin schedules. In this paper, we extend this approach to a game-based setting. This allows one to solve synthesis and control problems and constitutes a further step towards a theory of languages over infinite alphabets.}
}
@phdthesis{halfon-phd2018,
author = {Halfon, Simon},
title = {On Effective Representations of Well Quasi-Orderings},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2018,
month = jun,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/halfon-phd18.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/halfon-phd18.pdf}
}
@inproceedings{BBJ-csl18,
address = {Birmingham, UK},
month = sep,
year = 2018,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Ghica, Dan R. and Jung, Achim},
acronym = {{CSL}'18},
booktitle = {{P}roceedings of the 27th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'18)},
author = {B{\'e}rard, B{\'e}atrice and Bouyer, Patricia and Jug{\'e}, Vincent},
title = {Finite bisimulations for dynamical systems with overlapping trajectories},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9693},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/9693/pdf/LIPIcs-CSL-2018-26.pdf},
doi = {10.4230/LIPIcs.CSL.2018.26},
abstract = {Having a finite bisimulation is a good feature for a dynamical system, since it can lead to the decidability of the verification of reachability properties. We investigate a new class of o-minimal dynamical systems with very general flows, where the classical restrictions on trajectory intersections are partly lifted. We identify conditions, that we call Finite and Uniform Crossing: When Finite Crossing holds, the time-abstract bisimulation is computable and, under the stronger Uniform Crossing assumption, this bisimulation is finite and definable.}
}
@inproceedings{GMS-concur18,
address = {Beijing, China},
month = sep,
year = 2018,
volume = {118},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Schewe, Sven and Zhang, Lijun},
acronym = {{CONCUR}'18},
booktitle = {{P}roceedings of the 29th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'18)},
author = {Paul Gastin and Sayan Mukherjee and B. Srivathsan},
title = {Reachability in timed automata with diagonal constraints},
pages = {28:1-28:17},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9566},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/9566/pdf/LIPIcs-CONCUR-2018-28.pdf},
doi = {10.4230/LIPIcs.CONCUR.2018.28},
abstract = {We consider the reachability problem for timed automata having diagonal constraints (like x - y < 5) as guards in transitions. The best algorithms for timed automata proceed by enumerating reachable sets of its configurations, stored in a data structure called ''zones''. Simulation relations between zones are essential to ensure termination and efficiency. The algorithm employs a simulation test Z <= Z' which ascertains that zone Z does not reach more states than zone Z', and hence further enumeration from Z is not necessary. No effective simulations are known for timed automata containing diagonal constraints as guards. We propose a simulation relation <=_{LU}^d for timed automata with diagonal constraints. On the negative side, we show that deciding Z not <=_{LU}^d Z' is NP-complete. On the positive side, we identify a witness for Z not <=_{LU}^d Z' and propose an algorithm to decide the existence of such a witness using an SMT solver. The shape of the witness reveals that the simulation test is likely to be efficient in practice.}
}
@inproceedings{BFG-concur18,
address = {Beijing, China},
month = sep,
year = 2018,
volume = {118},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Schewe, Sven and Zhang, Lijun},
acronym = {{CONCUR}'18},
booktitle = {{P}roceedings of the 29th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'18)},
author = {Bollig, Benedikt and Fortin, Marie and Gastin, Paul},
title = {It Is Easy to Be Wise After the Event: Communicating Finite-State
Machines Capture First-Order Logic with ''Happened Before''},
pages = {7:1-7:17},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9545},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2018/9545/pdf/LIPIcs-CONCUR-2018-7.pdf},
doi = {10.4230/LIPIcs.CONCUR.2018.7},
abstract = {Message sequence charts (MSCs) naturally arise as executions of communicating finite-state machines (CFMs), in which finite-state processes exchange messages through unbounded FIFO channels. We study the first-order logic of MSCs, featuring Lamport's happened-before relation. We introduce a star-free version of propositional dynamic logic (PDL) with loop and converse. Our main results state that (i) every first-order sentence can be transformed into an equivalent star-free PDL sentence (and conversely), and (ii) every star-free PDL sentence can be translated into an equivalent CFM. This answers an open question and settles the exact relation between CFMs and fragments of monadic second-order logic. As a byproduct, we show that first-order logic over MSCs has the three-variable property.}
}
@article{CFMF-fac18,
publisher = {Springer},
journal = {Formal Aspects of Computing},
author = {Rapha{\"e}l Chane-Yack-Fa and Marc Frappier and Amel Mammar and Alain Finkel},
title = {{Parameterized Verification of Monotone Information Systems}},
volume = {30},
number = {3-4},
year = {2018},
pages = {463-489},
doi = {10.1007/s00165-018-0460-8},
url = {https://link.springer.com/article/10.1007/s00165-018-0460-8},
abstract = {In this paper, we study the information system verification problem as a parameterized verification one. Informations systems are modeled as multi-parameterized systems in a formal language based on the Algebraic State-Transition Diagrams (ASTD) notation. Then, we use the Well Structured Transition Systems (WSTS) theory to solve the coverability problem for an unbounded ASTD state space. Moreover, we define a new framework to prove the effective pred-basis condition of WSTSs, i.e. the computability of a base of predecessors for every states.}
}
@mastersthesis{m2-Gonzalez,
author = {Gonz{\'a}lez, Mauricio},
title = {{Constructions d'Information Parfaite pour certains Jeux {\`a} Information Imparfaite. Quelques Algorithmes.}},
school = {Universit{\'e} Pierre et Marie Curie, Paris, France},
type = {Rapport de {M}aster},
year = {2015},
month = dec
}
@mastersthesis{m2-Fang,
author = {Fang, Erwin},
title = {{Permissive multi-strategies in timed games}},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2013},
month = aug
}
@mastersthesis{m2-Fortin,
author = {Fortin, Marie},
title = {{Verification of distributed systems with parameterized network topology}},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2015},
month = sep
}
@mastersthesis{m2-Jaziri,
author = {Jaziri, Samy},
title = {{Robustness issues in priced timed automata}},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2014},
month = sep
}
@inproceedings{BLS-aiml18,
address = {Bern, Switzerland},
month = aug,
year = 2018,
publisher = {College Publications},
editor = {Guram Bezhanishvili and Giovanna D'Agostino and
George Metcalfe and Thomas Studer},
acronym = {{AiML}'18},
booktitle = {{P}roceedings of the 10th
{C}onference on {A}dvances in {M}odal {L}ogics
({AiML}'18)},
author = {Baelde, David and Lick, Anthony and Schmitz, Sylvain},
title = {A Hypersequent Calculus with Clusters for Linear Frames},
pages = {36-55},
url = {https://hal.inria.fr/hal-01756126},
abstract = {The logic Kt4.3 is the basic modal logic of linear frames. Along with its extensions, it is found at the core of linear-time temporal logics and logics on words. In this paper, we consider the problem of designing proof systems for these logics, in such a way that proof search yields decision procedures for validity with an optimal complexity---coNP in this case. In earlier work, Indrzejczak has proposed an ordered hypersequent calculus that is sound and complete for Kt4.3 but does not yield any decision procedure. We refine his approach, using a hypersequent structure that corresponds to weak rather than strict total orders, and using annotations that reflect the model-theoretic insights given by small models for Kt4.3. We obtain a sound and complete calculus with an associated coNP proof search algorithm. These results extend naturally to the cases of unbounded and dense frames, and to the complexity of the two-variable fragment of first-order logic over total orders.}
}
@inproceedings{DF-aiml18,
address = {Bern, Switzerland},
month = aug,
year = 2018,
publisher = {College Publications},
editor = {Guram Bezhanishvili and Giovanna D'Agostino and
George Metcalfe and Thomas Studer},
acronym = {{AiML}'18},
booktitle = {{P}roceedings of the 10th
{C}onference on {A}dvances in {M}odal {L}ogics
({AiML}'18)},
author = {Demri, St{\'e}phane and Fervari, Raul},
title = {On the complexity of modal separation logics},
pages = {179-198},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/DF-aiml18.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DF-aiml18.pdf}
}
@phdthesis{Gilbert-phd2018,
author = {Gilbert, Fr{\'e}d{\'e}ric},
title = {{Extending higher-order logic with predicate subtyping}},
school = {Universit{\'e} Paris~7, Paris, France},
type = {Th{\`e}se de doctorat},
year = 2018,
month = apr,
pdf = {https://hal.inria.fr/hal-01673518/file/dissertation.pdf}
}
@mastersthesis{m2-LeenaSubramaniam,
author = {Chaitanya Leena Subramaniam},
title = {{Cubical Type Theory in Dedukti}},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2017},
month = sep
}
@techreport{Burel-hal18,
author = {Burel, Guillaume},
institution = {HAL Research Report},
number = {hal-01670476},
type = {Research Report},
title = {{Linking Focusing and Resolution with Selection}},
year = {2018},
month = apr,
url = {https://hal.inria.fr/hal-01670476},
pdf = {https://hal.inria.fr/hal-01670476/file/lipics.pdf},
abstract = {Focusing and selection are techniques that shrink the proof search space for respectively sequent calculi and resolution. To bring out a link between them, we generalize them both: we introduce a sequent calculus where each occurrence of an atom can have a positive or a negative polarity; and a resolution method where each literal, whatever its sign, can be selected in input clauses. We prove the equivalence between cut-free proofs in this sequent calculus and derivations of the empty clause in that resolution method. Such a generalization is not semi-complete in general, which allows us to consider complete instances that correspond to theories of any logical strength. We present three complete instances: first, our framework allows us to show that ordinary focusing corresponds to hyperresolution and semantic resolution; the second instance is deduction modulo theory and the related framework called superdeduction; and a new setting, not captured by any existing framework, extends deduction modulo theory with rewriting rules having several left-hand sides, which restricts even more the proof search space.}
}
@techreport{Thire-hal17,
author = {Thir{\'e}, Fran{\c{c}}ois},
institution = {HAL Research Report},
number = {hal-01668250},
type = {Research Report},
title = {{Exporting an Arithmetic Library from Dedukti to HOL}},
year = {2017},
month = dec,
url = {https://hal.inria.fr/hal-01668250},
pdf = {https://hal.inria.fr/hal-01668250/file/sttforall-fscd.pdf},
abstract = {Today, we observe a large diversity of proof systems. This diversity has the negative consequence that a lot of theorems are proved many times. Unlike programming languages, it is difficult for these systems to cooperate because they do not implement the same logic. Logical frameworks are a class of theorems provers that overcome this issue by their capacity of implementing various logics. In this work, we study the STT\(\forall_{\beta\delta}\) logic, an extension of the Simple Type Theory that has been encoded in the logical framework Dedukti. We show that this new logic is a good candidate to export proofs to other provers. As an example, we show how this logic has been encoded into Dedukti and how we used it to export proofs to the HOL family provers via OpenTheory.}
}
@mastersthesis{m2-genestier,
author = {Genestier, Guillaume},
title = {Termination checking in the \(\lambda\Pi\)-calculus modulo theory},
school = {Universit{\'e} Paris~7, Paris, France},
type = {Rapport de {M}aster},
year = {2017},
month = sep,
url = {https://hal.inria.fr/hal-01676409},
pdf = {https://hal.inria.fr/hal-01676409/file/Genestier_RapportLMFI.pdf}
}
@mastersthesis{m2-defourne,
author = {Defourn{\'e}, Antoine},
title = {{Proof Tactics in Dedukti}},
school = {Inria Saclay},
type = {Rapport de {M}aster},
year = {2017},
month = sep,
url = {https://hal.inria.fr/hal-01661872},
pdf = {https://hal.inria.fr/hal-01661872/file/rapport_pfe_ensimag.pdf}
}
@inproceedings{FNS-podc18,
address = {Egham, UK},
month = jul,
publisher = {ACM Press},
editor = {Keidar, Idit},
acronym = {{PODC}'18},
booktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing ({PODC}'18)},
author = {F{\"u}gger, Matthias and Nowak, {\relax Th}omas and Schwarz, Manfred},
title = {Tight Bounds for Asymptotic and Approximate Consensus},
pages = {325-334},
year = {2018},
doi = {10.1145/3212734.3212762},
url = {https://arxiv.org/abs/1705.02898},
abstract = {In this work we study the performance of asymptotic and approximate consensus algorithms in dynamic networks. The asymptotic consensus problem requires a set of agents to repeatedly set their outputs such that the outputs converge to a common value within the convex hull of initial values. This problem, and the related approximate consensus problem, are fundamental building blocks in distributed systems where exact consensus among agents is not required, e.g., man-made distributed control systems, and have applications in the analysis of natural distributed systems, such as flocking and opinion dynamics. We prove new nontrivial lower bounds on the contraction rates of asymptotic consensus algorithms, from which we deduce lower bounds on the time complexity of approximate consensus algorithms. In particular, the obtained bounds show optimality of asymptotic and approximate consensus algorithms presented in [Charron-Bost et al., ICALP'16] for certain classes of networks that include classical failure assumptions, and confine the search for optimal bounds in the general case.
\par
Central to our lower bound proofs is an extended notion of valency, the set of reachable limits of an asymptotic consensus algorithm starting from a given configuration. We further relate topological properties of valencies to the solvability of exact consensus, shedding some light on the relation of these three fundamental problems in dynamic networks.}
}
@article{Z-icomp18,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Zetzsche, Georg},
title = {The Emptiness Problem for Valence Automata over Graph Monoids},
year = {2018},
note = {To appear}
}
@article{LZ-tocs18,
publisher = {Springer},
journal = {Theory of Computing Systems},
author = {Lohrey, Markus and Zetzsche, Georg},
title = {Knapsack in Graph Groups},
volume = {62},
number = {1},
year = {2018},
month = jan,
pages = {192-246},
doi = {10.1007/s00224-017-9808-3}
}
@article{BHL-icomp19,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Nathalie Bertrand and Serge Haddad and Engel Lefaucheux},
title = {{A Tale of Two Diagnoses in Probabilistic Systems}},
volume = {269},
year = {2019},
month = dec,
doi = {10.1016/j.ic.2019.104441},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BHL-icomp18.pdf},
abstract = {Diagnosis of partially observable stochastic systems prone to faults was introduced
in the late nineties. Diagnosability, i.e. the existence of a diagnoser, may be specified in different ways: exact diagnosability requires that almost surely a fault is detected and that no fault is erroneously claimed; approximate diagnosability tolerates a small error probability when claiming a fault; last, accurate approximate diagnosability guarantees that the error probability can be chosen arbitrarily small. In this article, we first refine the specification of diagnosability by identifying three criteria: (1) detecting faulty runs or providing information
for all runs (2) considering finite or infinite runs, and (3) requiring or not a uniform detection delay. We then give a complete picture of relations between the different diagnosability specifications for probabilistic systems and establish characterisations for most of them in the finite-state case. Based on these characterisations, we develop decision procedures, study their complexity and prove their optimality. We also design synthesis algorithms to construct diagnosers
and we analyse their memory requirements. Finally we establish undecidability of the diagnosability problems for which we provided no characterisation.}
}
@inproceedings{SGF-hscc18,
address = {Porto, Portugal},
month = apr,
publisher = {ACM Press},
editor = {Prandini, Maria and Deshmukh, Jyotirmoy V.},
acronym = {{HSCC}'18},
booktitle = {{P}roceedings of the 21st {ACM} {I}nternational {C}onference
on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
({HSCC}'18)},
author = {Saoud, Adnane and Girard, Antoine and Fribourg, Laurent},
title = {Contract based Design of Symbolic Controllers for Vehicle Platooning},
pages = {277-278},
year = {2018},
doi = {10.1145/3178126.3187001},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SGF-hscc18.pdf},
abstract = {In this work, we present an application of symbolic control and contract
based design techniques to vehicle platooning. We use a compositional approach based on continuous-time assume-guarantee contracts. Each vehicle in the platoon is assigned an assumeguarantee contract; and a controller is synthesized using symbolic control to enforce the satisfaction of this contract. The assumeguarantee framework makes it possible to deal with different types of vehicles and asynchronous controllers (i.e controllers with different
sampling periods). Numerical results illustrate the effectiveness of the approach.},
note = {Poster}
}
@article{JGL-mscs18,
publisher = {Cambridge University Press},
journal = {Mathematical Structures in Computer Science},
author = {Goubault{-}Larrecq, Jean},
title = {A semantics for nabla},
volume = {29},
pages = {1250--1274},
year = {2019},
doi = {10.1017/S0960129518000063},
url = {https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/semantics-for-nabla/A3337AB54DC58CBDDEC78116F4390777}
}
@article{B-jfp18,
publisher = {Cambridge University Press},
journal = {Journal of Functional Programming},
author = {Blanqui, Fr{\'e}d{\'e}ric},
title = {Size-based termination of higher-order rewriting},
volume = {28},
year = {2018},
month = apr,
doi = {10.1017/S0956796818000072},
pdf = {https://hal.inria.fr/hal-01424921/file/main.pdf},
url = {https://www.cambridge.org/core/journals/journal-of-functional-programming/article/sizebased-termination-of-higherorder-rewriting/2134D9160988448FA62DD693D337892D},
abstract = {We provide a general and modular criterion for the termination of simply typed \(\lambda\)-calculus extended with function symbols defined by user-defined rewrite rules. Following a work of Hughes, Pareto and Sabry for functions defined with a fixpoint operator and pattern matching, several criteria use typing rules for bounding the height of arguments in function calls. In this paper, we extend this approach to rewriting-based function definitions and more general user-defined notions of size.}
}
@article{AM-prd17,
publisher = {American Physical Society},
journal = {Physical Review D},
author = {Arrighi, Pablo and Martiel, Simon},
title = {Quantum causal graph dynamics},
volume = {96},
number = {2},
year = {2017},
pdf = {https://arxiv.org/pdf/1607.06700.pdf},
abstract = {Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded speed, with respect to the distance given by the graph. Suppose, moreover, that the graph itself is subject to the evolution, and may be driven to be in a quantum superposition of graphs—in accordance to the superposition principle. We show that these unitary causal operators must decompose as a finite-depth circuit of local unitary gates. This unifies a result on Quantum Cellular Automata with another on Reversible Causal Graph Dynamics. Along the way we formalize a notion of causality which is valid in the context of quantum superpositions of time-varying graphs, and has a number of good properties.
}
}
@book{AD18,
title = {{Le temps des algorithmes}},
author = {Abiteboul, Serge and Dowek, Gilles},
url = {https://hal.inria.fr/hal-01502505},
publisher = {{Editions Le Pommier}},
pages = {192},
year = {2017},
isbn = {978-2-7465-1175-0}
}
@article{AGK-lmcs18,
journal = {Logical Methods in Computer Science},
author = {Akshay, S. and Gastin, Paul and Krishna, Shankara Narayanan},
title = {Analyzing Timed Systems Using Tree Automata},
volume = {14},
number = {2},
pages = {1-35},
year = {2018},
month = may,
doi = {10.23638/LMCS-14(2:8)2018},
pdf = {https://lmcs.episciences.org/4489/pdf},
url = {https://lmcs.episciences.org/4489},
abstract = {Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such as state reachability. We propose a new technique to analyze such timed systems using finite tree automata instead of finite word automata. The main idea is to consider timed behaviors as graphs with matching edges capturing timing constraints. When a family of graphs has bounded tree-width, they can be interpreted in trees and MSO-definable properties of such graphs can be checked using tree automata. The technique is quite general and applies to many timed systems. In this paper, as an example, we develop the technique on timed pushdown systems, which have recently received considerable attention. Further, we also demonstrate how we can use it on timed automata and timed multi-stack pushdown systems (with boundedness restrictions).}
}
@inproceedings{BBFLMR-fm18,
address = {Oxford, UK},
month = jul,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Roscoe, {Bill W.} and Peleska, Jan},
acronym = {{FM}'18},
booktitle = {{P}roceedings of the 22nd {I}nternational {S}ymposium on {F}ormal
{M}ethods ({FM}'18)},
author = {Bacci, Giovanni and Bouyer, Patricia and Fahrenberg, Uli and Larsen, Kim G. and Markey, Nicolas and Reynier, Pierre-Alain},
title = {Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty},
pages = {203-221},
year = {2018},
doi = {10.1007/978-3-319-95582-7_12},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/BBFLMR-fm18.pdf},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/BBFLMR-fm18.pdf},
note = {Best paper award},
abstract = {In this paper, we propose a novel framework for the synthesis of robust and optimal energy-aware controllers. The framework is based on energy timed automata, allowing for easy expression of timing-constraints and variable energy-rates. We prove decidability of the energy-constrained infinite-run problem in settings with both certainty and uncertainty of the energy-rates. We also consider the optimization problem of identifying the minimal upper bound that will permit existence of energy-constrained infinite runs. Our algorithms are based on quantifier elimination for linear real arithmetic. Using Mathematica and Mjollnir, we illustrate our framework through a real industrial example of a hydraulic oil pump. Compared with previous approaches our method is completely automated and provides improved results.}
}
@article{BBBC-jlamp18,
publisher = {Elsevier Science Publishers},
journal = {Journal of Logic and Algebraic Methods in Programming},
author = {Bertrand, Nathalie and Bouyer, Patricia and Brihaye, Thomas and Carlier, Pierre},
title = {When are Stochastic Transition Systems Tameable?},
volume = {99},
pages = {41-96},
year = {2018},
month = oct,
doi = {10.1016/j.jlamp.2018.03.004},
pdf = {https://arxiv.org/pdf/1703.04806.pdf},
url = {https://doi.org/10.1016/j.jlamp.2018.03.004},
abstract = {A decade ago, Abdulla, Ben Henda and Mayr introduced the elegant concept of decisiveness for denumerable Markov chains [1]. Roughly speaking, decisiveness allows one to lift most good properties from finite Markov chains to denumerable ones, and therefore to adapt existing verification algorithms to infinite-state models. Decisive Markov chains however do not encompass stochastic real-time systems, and general stochastic transition systems (STSs for short) are needed. In this article, we provide a framework to perform both the qualitative and the quantitative analysis of STSs. First, we define various notions of decisiveness (inherited from [1]), notions of fairness and of attractors for STSs, and make explicit the relationships between them. Then, we define a notion of abstraction, together with natural concepts of soundness and completeness, and we give general transfer properties, which will be central to several verification algorithms on STSs. We further design a generic construction which will be useful for the analysis of ω-regular properties, when a finite attractor exists, either in the system (if it is denumerable), or in a sound denumerable abstraction of the system. We next provide algorithms for qualitative model-checking, and generic approximation procedures for quantitative model-checking. Finally, we instantiate our framework with stochastic timed automata (STA), generalized semi-Markov processes (GSMPs) and stochastic time Petri nets (STPNs), three models combining dense-time and probabilities. This allows us to derive decidability and approximability results for the verification of these models. Some of these results were known from the literature, but our generic approach permits to view them in a unified framework, and to obtain them with less effort. We also derive interesting new approximability results for STA, GSMPs and STPNs.}
}
@inproceedings{JKS-eurosp17,
address = {Paris, France},
month = apr,
publisher = {{IEEE} Press},
editor = {Andrei Sabelfeld and Matthew Smith},
acronym = {{EuroS\&P}'17},
booktitle = {{P}roceedings of the 2nd IEEE European Symposium on
Security and Privacy ({EuroS\&P}'17)},
author = {Jacomme, Charlie and Kremer, Steve and Scerri, Guillaume},
title = {Symbolic Models for Isolated Execution Environments},
pages = {530-545},
year = {2018},
doi = {10.1109/EuroSP.2017.16},
url = {https://ieeexplore.ieee.org/document/7962001/},
abstract = {Isolated Execution Environments (IEEs), such as ARM
TrustZone and Intel SGX, offer the possibility to
execute sensitive code in isolation from other
malicious programs, running on the same machine, or
a potentially corrupted OS. A key feature of IEEs is
the ability to produce reports binding
cryptographically a message to the program that
produced it, typically ensuring that this message is
the result of the given program running on an
IEE. We present a symbolic model for specifying and
verifying applications that make use of such
features. For this we introduce the S{\(\ell\)}APIC
process calculus, that allows to reason about
reports issued at given locations. We also provide
tool support, extending the SAPIC/TAMARIN toolchain
and demonstrate the applicability of our framework
on several examples implementing secure outsourced
computation (SOC), a secure licensing protocol and a
one-time password protocol that all rely on such
IEEs.}
}
@inproceedings{JK-csf18,
address = {Oxford, UK},
month = jul,
publisher = {{IEEE} Computer Society Press},
editor = {Chong, Steve and Delaune, St{\'e}phanie},
acronym = {{CSF}'18},
booktitle = {{P}roceedings of the
31st {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'18)},
author = {Jacomme, Charlie and Kremer, Steve},
title = {An extensive formal analysis of multi-factor authentication protocols},
pages = {1-15},
year = {2018},
doi = {10.1109/CSF.2018.00008},
pdf = {https://easychair.org/publications/preprint/m89p},
url = {https://ieeexplore.ieee.org/document/8429292/},
abstract = {Passwords are still the most widespread means for authenticating users, even though they have been shown to create huge security problems. This motivated the use of additional authentication mechanisms used in so-called multi-factor authentication protocols. In this paper we define a detailed threat model for this kind of protocols: while in classical protocol analysis attackers control the communication network, we take into account that many communications are performed over TLS channels, that computers may be infected by different kinds of malwares, that attackers could perform phishing, and that humans may omit some actions. We formalize this model in the applied pi calculus and perform an extensive analysis and comparison of several widely used protocols - variants of Google 2-step and FIDO's U2F. The analysis is completely automated, generating systematically all combinations of threat scenarios for each of the protocols and using the ProVerif tool for automated protocol analysis. Our analysis highlights weaknesses and strengths of the different protocols, and allows us to suggest several small modifications of the existing protocols which are easy to implement, yet improve their security in several threat scenarios.}
}
@inproceedings{FMNNS-date18,
address = {Dresden, Germany},
month = mar,
publisher = {{IEEE} Computer Society Press},
acronym = {{DATE}'18},
booktitle = {{P}roceedings of the {C}onference on {D}esign, {A}utomation and {T}est in
{E}urope (DATE'18)},
author = {Matthias F{\"u}gger and
J{\"u}rgen Maier and
Robert Najvirt and
{\relax Th}omas Nowak and
Ulrich Schmid},
title = {A Faithful Binary Circuit Model with Adversarial Noise},
pages = {1327-1332},
year = {2018},
doi = {10.23919/DATE.2018.8342219},
pdf = {http://www.lsv.fr/~mfuegger/papers/FMNNS18_date.pdf},
url = {https://doi.org/10.23919/DATE.2018.8342219},
abstract = {Accurate delay models are important for static and dynamic timing analysis of digital circuits, and mandatory for formal verification. However, F{\"u}gger et al. [IEEE TC 2016] proved that pure and inertial delays, which are employed for dynamic timing analysis in state-of-the-art tools like ModelSim, NC-Sim and VCS, do not yield faithful digital circuit models. Involution delays, which are based on delay functions that are mathematical involutions depending on the previous-output-to- input time offset, were introduced by F{\"u}gger et al. [DATE'15] as a faithful alternative (that can easily be used with existing tools). Although involution delays were shown to predict real signal traces reasonably accurately, any model with a deterministic delay function is naturally limited in its modeling power.
\par
In this paper, we thus extend the involution model, by adding non-deterministic delay variations (random or even adversarial), and prove analytically that faithfulness is not impaired by this generalization. Albeit the amount of non-determinism must be considerably restricted to ensure this property, the result is surprising: the involution model differs from non-faithful models mainly in handling fast glitch trains, where small delay shifts have large effects. This originally suggested that adding even small variations should break the faithfulness of the model, which turned out not to be the case. Moreover, the results of our simulations also confirm that this generalized involution model has larger modeling power and, hence, applicability.}
}
@article{FFL-toc18,
publisher = {{IEEE} Computer Society Press},
journal = {IEEE Transactions on Computers},
author = {Stephan Friedrichs and Matthias F{\"u}gger and Christoph Lenzen},
title = {Metastability-Containing Circuits},
volume = {67},
number = {8},
pages = {1167-1183},
year = {2018},
month = aug,
doi = {10.1109/TC.2018.2808185},
url = {https://ieeexplore.ieee.org/document/8314764/},
abstract = {In digital circuits, metastability can cause deteriorated signals that neither are logical 0 nor logical 1, breaking the abstraction of Boolean logic. Synchronizers, the only traditional countermeasure, exponentially decrease the odds of maintained metastability over time. We propose a fundamentally different approach: It is possible to deterministically contain metastability by fine-grained logical masking so that it cannot infect the entire circuit. At the heart of our approach lies a time- and value-discrete model for metastability in synchronous clocked digital circuits, in which metastability is propagated in a worst-case fashion. The proposed model permits positive results and passes the test of reproducing Marino's impossibility results. We fully classify which functions can be computed by circuits with standard registers. Regarding masking registers, we show that more functions become computable with each clock cycle, and that masking registers permit exponentially smaller circuits for some tasks. Demonstrating the applicability of our approach, we present the first fault-tolerant distributed clock synchronization algorithm that deterministically guarantees correct behavior in the presence of metastability. As a consequence, clock domains can be synchronized without using synchronizers, enabling metastability-free communication between them.}
}
@article{CFN-dam17,
publisher = {Elsevier Science Publishers},
journal = {Discrete Applied Mathematics},
author = {Bernadette {Charron-Bost} and Matthias F{\"u}gger and {\relax Th}omas Nowak and Manfred Schwarz},
title = {New transience bounds for max-plus linear systems},
volume = {219},
pages = {83-99},
year = {2017},
month = mar,
doi = {10.1016/j.dam.2016.11.003},
pdf = {http://www.lsv.fr/~mfuegger/papers/CFN17_dam.pdf},
url = {https://doi.org/10.1016/j.dam.2016.11.003},
abstract = {Linear max-plus systems describe the behavior of a large variety of complex systems. It is known that these systems show a periodic behavior after an initial transient phase. Assessment of the length of this transient phase provides important information on complexity measures of such systems, and so is crucial in system design. We identify relevant parameters in a graph representation of these systems and propose a modular strategy to derive new upper bounds on the length of the transient phase. By that we are the first to give asymptotically tight and potentially subquadratic transience bounds. We use our bounds to derive new complexity results, in particular in distributed computing.}
}
@inproceedings{FKLW-async18,
address = {Vienna, Austria},
month = may,
publisher = {{IEEE} Computer Society},
editor = {Krstic, Milos and Jones, {Ian W.}},
acronym = {{ASYNC}'18},
booktitle = {{P}roceedings of the 24th {IEEE} {I}nternational {S}ymposium on {A}synchronous {C}ircuits and {S}ystems ({ASYNC}'18)},
author = {Matthias F{\"u}gger and Attila Kinali and Christoph Lenzen and Ben Wiederhake},
title = {Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance},
pages = {68-77},
year = {2018},
doi = {10.1109/ASYNC.2018.00025},
url = {https://hal.inria.fr/hal-01936403},
abstract = {Naive handling of supply voltage droops in synchronous circuits results in conservative bounds on clock speeds, resulting in poor performance even if droops are rare. Adaptive strategies detect such potentially hazardous events and either initiate a rollback to a previous state or proactively reduce clock speed in order to prevent timing violations. The performance of such solutions critically depends on a very fast response to droops. However, state-of-the-art solutions incur synchronization delay to avoid that the clock signal is affected by metastability. Addressing the challenges discussed by Keith Bowman in his ASYNC 2017 keynote talk, we present an all-digital circuit that can respond to droops within a fraction of a clock cycle. This is achieved by delaying clock signals based on measurement values while they undergo synchronization simultaneously. We verify our solution by formally proving correctness, complemented by VHDL and Spice simulations of a 65 nm ASIC design confirming the theoretically obtained results.}
}
@article{BVdB-ijfcs18,
publisher = {World Scientific},
journal = {International Journal of Foundations of Computer Science},
author = {Berwanger, Dietmar and {van den Bogaard}, Marie},
title = {Consensus Game Acceptors and Iterated Transductions},
volume = {29},
number = {02},
pages = {165-185},
year = {2018},
month = feb,
doi = {10.1142/S0129054118400026},
url = {https://www.worldscientific.com/doi/abs/10.1142/S0129054118400026},
abstract = {We study a game for recognising formal languages, in which two players with imperfect information should coordinate on a common decision, given private input words correlated by a finite graph. The players have a common objective to avoid an inadmissible decision, in spite of the uncertainty induced by the input.
We show that the acceptor model based on consensus games characterises context-sensitive languages. Further, we describe the expressiveness of these games in terms of iterated synchronous transductions and identify a subclass that characterises context-free languages.},
pdf = {http://www.lsv.fr/~dwb/consensus.pdf}
}
@article{BM-icomp17,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Berwanger, Dietmar and Mathew, Anup Basil},
title = {Infinite games with finite knowledge gaps},
volume = {254},
pages = {217-237},
year = {2017},
month = jun,
url = {https://doi.org/10.1016/j.ic.2016.10.009},
doi = {10.1016/j.ic.2016.10.009},
abstract = {Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning strategies can be constructed effectively without restricting the direction of information flow. Instead, our condition requires that the players attain common knowledge about the actual state of the game over and over again along every play. We show that it is decidable whether a given game satisfies the condition, and prove tight complexity bounds for the strategy synthesis problem under ω-regular winning conditions given by deterministic parity automata.},
pdf = {http://lsv.fr/~dwb/rec.pdf}
}
@article{BMVdB-acta17,
publisher = {Springer},
journal = {Acta Informatica},
author = {Berwanger, Dietmar and Mathew, Anup Basil and {van den Bogaard}, Marie},
title = {Hierarchical information and the synthesis of distributed strategies},
year = {2017},
month = jun,
url = {https://doi.org/10.1007/s00236-017-0306-5},
doi = {10.1007/s00236-017-0306-5},
abstract = {Infinite games with imperfect information are known to be undecidable unless the information flow is severely restricted. One fundamental decidable case occurs when there is a total ordering among players, such that each player has access to all the information that the following ones receive. In this paper we consider variations of this hierarchy principle for synchronous games with perfect recall, and identify new decidable classes for which the distributed synthesis problem is solvable with finite-state strategies. In particular, we show that decidability is maintained when the information hierarchy may change along the play, or when transient phases without hierarchical information are allowed. Finally, we interpret our result in terms of distributed system architectures.},
pdf = {http://lsv.fr/~dwb/hi.pdf}
}
@inproceedings{BR-sr17,
address = {Liverpool, UK},
month = jul,
editor = {{van der Hoek}, Wiebe and Maubert, Bastien and Murano, Aniello and Rubin, Sasha},
acronym = {{SR}'17},
booktitle = {{P}roceedings of the 5th International Workshop on Strategic Reasoning ({SR}'17)},
author = {Dietmar Berwanger and R. Ramanujam},
title = {{Deviator Detection under Imperfect Monitoring}},
year = {2017},
url = {https://arxiv.org/abs/1712.09686},
pdf = {https://arxiv.org/pdf/1712.09686.pdf},
abstract = {Grim-trigger strategies are a fundamental mechanism for sustaining equilibria in iterated games: the players cooperate along an agreed path, and as soon as one player deviates, the others form a coalition to play him down to his minmax level. A precondition to triggering such a strategy is that the identity of the deviating player becomes common knowledge among the other players. This can be difficult or impossible to attain in games where the information structure allows only imperfect monitoring of the played actions or of the global state.
We study the problem of synthesising finite-state strategies for detecting the deviator from an agreed strategy profile in games played on finite graphs with different information structures. We show that the problem is undecidable in the general case where the global state cannot be monitored. On the other hand, we prove that under perfect monitoring of the global state and imperfect monitoring of actions, the problem becomes decidable, and we present an effective synthesis procedure that covers infinitely repeated games with private monitoring.}
}
@inproceedings{DGK-lics18,
address = {Oxford, UK},
publisher = {ACM Press},
editor = {Hofmann, Martin and Dawar, Anuj and Gr{\"a}del, Erich},
acronym = {{LICS}'18},
booktitle = {{P}roceedings of the 33rd {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'18)},
author = {Dave, Vrunda and Gastin, Paul and Krishna, Shankara Narayanan},
month = jul,
title = {{Regular Transducer Expressions for Regular Transformations}},
year = {2018},
url = {https://arxiv.org/abs/1802.02094},
pdf = {https://arxiv.org/pdf/1802.02094.pdf},
pages = {315-324},
doi = {10.1145/3209108.3209182},
abstract = {Functional MSO transductions, deterministic two-way transducers, as well as streaming string transducers are all equivalent models for regular functions. In this paper, we show that every regular function, either on finite words or on infinite words, captured by a deterministic two-way transducer, can be described with a regular transducer expression (RTE). For infinite words, the transducer uses Muller acceptance and \(\omega\)-regular look-ahead. RTEs are constructed from constant functions using the combinators if-then-else (deterministic choice), Hadamard product, and unambiguous versions of the Cauchy product, the 2-chained Kleene-iteration and the 2-chained omega-iteration. Our proof works for transformations of both finite and infinite words, extending the result on finite words of Alur et al. in LICS'14. In order to construct an RTE associated with a deterministic two-way Muller transducer with look-ahead, we introduce the notion of transition monoid for such two-way transducers where the look-ahead is captured by some backward deterministic Büchi automaton. Then, we use an unambiguous version of Imre Simon's famous forest factorization theorem in order to derive a ''good'' (\(\omega\)-)regular expression for the domain of the two-way transducer. ''Good'' expressions are unambiguous and Kleene-plus as well as \(\omega\)-iterations are only used on subexpressions corresponding to idempotent elements of the transition monoid. The combinator expressions are finally constructed by structural induction on the ''Good'' (\(\omega\)-)regular expression describing the domain of the transducer.}
}
@article{CCD-ic17,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Vincent Cheval and Hubert Comon{-}Lundh and St{\'e}phanie Delaune},
title = {{A procedure for deciding symbolic equivalence between sets of constraint systems}},
volume = {255},
year = {2017},
pages = {94-125},
doi = {10.1016/j.ic.2017.05.004},
url = {https://www.sciencedirect.com/science/article/pii/S0890540117300949},
abstract = {We consider security properties of cryptographic protocols that can be modelled using trace equivalence, a crucial notion when specifying privacy-type properties, like anonymity, vote-privacy, and unlinkability. Infinite sets of possible traces are symbolically represented using deducibility constraints. We describe an algorithm that decides trace equivalence for protocols that use standard primitives and that can be represented using such constraints. More precisely, we consider symbolic equivalence between sets of constraint systems, and we also consider disequations. Considering sets and disequations is actually crucial to decide trace equivalence for processes that may involve else branches and/or private channels (for a bounded number of sessions). Our algorithm for deciding symbolic equivalence between sets of constraint systems is implemented and performs well in practice. Unfortunately, it does not scale up well for deciding trace equivalence between processes. This is however the first implemented algorithm deciding trace equivalence on such a large class of processes.}
}
@article{KSHP-tcs19,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Kolc{\'a}k, Juraj and {\v S}afr{\'a}nek, David and Haar, Stefan and Paulev{\'e}, Lo{\"i}c},
title = {{Parameter Space Abstraction and Unfolding Semantics of Discrete Regulatory Networks}},
volume = {765},
year = {2019},
pages = {120-144},
doi = {10.1016/j.tcs.2018.03.009},
pdf = {https://hal.archives-ouvertes.fr/hal-01734805/document},
url = {https://hal.archives-ouvertes.fr/hal-01734805/},
abstract = {The modelling of discrete regulatory networks combines a graph specifying the pairwise influences between the variables of the system, and a parametrisation from which can be derived a discrete transition system. Given the influence graph only, the exploration of admissible parametrisations and the behaviours they enable is computationally demanding due to the combinatorial explosions of both parametrisation and reachable state space. This article introduces an abstraction of the parametrisation space and its refinement to account for the existence of given transitions, and for constraints on the sign and observability of influences. The abstraction uses a convex sub-lattice containing the concrete parametrisation space specified by its infimum and supremum parametrisations. It is shown that the computed abstractions are optimal, i.e., no smaller convex sublattice exists. Although the abstraction may introduce over-approximation, it has been proven to be conservative with respect to reachability of states. Then, an unfolding semantics for Parametric Regulatory Networks is defined, taking advantage of concurrency between transitions to provide a compact representation of reachable transitions. A prototype implementation is provided: it has been applied to several examples of Boolean and multi-valued networks, showing its tractability for networks with numerous components.}
}
@inproceedings{JMS-wodes18,
address = {Sorrento Coast, Italy},
month = may # {-} # jun,
year = 2018,
volume = {51(7)},
series = {IFAC-PapersOnLine},
publisher = {Elsevier Science Publishers},
editor = {Chris Hadjicostis and Jan Komenda},
acronym = {{WODES}'18},
booktitle = {{P}roceedings of the 14th {W}orkshop on {D}iscrete {E}vent {S}ystems
({WODES}'18)},
author = {Lo{\"i}g Jezequel and Agnes Madalinski and Stefan Schwoon},
title = {{Distributed computation of vector clocks in Petri nets unfolding for test selection}},
pages = {106-111},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/JMS-wodes18.pdf},
abstract = {It has been shown that annotating Petri net unfoldings with time stamps allows for
building distributed testers for distributed systems. However, the construction of the annotated
unfolding of a distributed system currently remains a centralized task. In this paper we extend
a distributed unfolding technique in order to annotate the resulting unfolding with time stamps.
This allows for distributed construction of distributed testers for distributed systems.}
}
@article{BHSS-fi18,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {B{\'e}atrice B{\'e}rard and Stefan Haar and Sylvain Schmitz and Stefan Schwoon},
title = {{The Complexity of Diagnosability and Opacity Verification for Petri Nets}},
volume = 161,
number = 4,
year = 2018,
pages = {317-349},
doi = {10.3233/FI-2018-1706},
url = {https://hal.inria.fr/hal-01852119},
abstract = {Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues.
\par
We first relate different notions of diagnosability and opacity. We consider in particular fairness issues and extend the definition of Germanos et al. [ACM TECS, 2015] of weakly fair diagnosability for safe Petri nets to general Petri nets and to opacity questions.
\par
Second, we provide a global picture of complexity results for the verification of diagnosability and opacity. We show that diagnosability is NL-complete for finite state systems, PSPACE-complete for safe convergent Petri nets (even with fairness), and EXPSPACE-complete for general Petri nets without fairness, while non diagnosability is inter-reducible with reachability when fault events are not weakly fair. Opacity is ESPACE-complete for safe Petri nets (even with fairness) and undecidable for general Petri nets already without fairness.}
}
@inproceedings{CGR-automata18,
address = {Ghent, Belgium},
month = jun,
year = 2018,
volume = 10875,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Jan Baetens and Martin Kutrib},
acronym = {{AUTOMATA}'18},
booktitle = {{P}roceedings of the 24th Annual International Workshop on Cellular Automata and Discrete Complex Systems ({AUTOMATA}'18)},
author = {Carton, Olivier and Guillon, Bruno and Reiter, Fabian},
title = {{Counter Machines and Distributed Automata}},
pages = {13-28},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/CGR-automata18.pdf},
doi = {10.1007/978-3-319-92675-9\_2},
abstract = {We prove the equivalence of two classes of counter machines and one class of distributed automata. Our counter machines operate on finite words, which they read from left to right while incrementing or decrementing a fixed number of counters. The two classes differ in the extra features they offer: one allows to copy counter values, whereas the other allows to compute copyless sums of counters. Our distributed automata, on the other hand, operate on directed path graphs that represent words. All nodes of a path synchronously execute the same finite-state machine, whose state diagram must be acyclic except for self-loops, and each node receives as input the state of its direct predecessor. These devices form a subclass of linear-time one-way cellular automata.}
}
@inproceedings{CHP-automata18,
address = {Ghent, Belgium},
month = jun,
year = 2018,
volume = 10875,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Jan Baetens and Martin Kutrib},
acronym = {{AUTOMATA}'18},
booktitle = {{P}roceedings of the 24th Annual International Workshop on Cellular Automata and Discrete Complex Systems ({AUTOMATA}'18)},
author = {Chatain, {\relax Th}omas and Haar, Stefan and Paulev{\'e}, Lo{\"i}c},
title = {{Boolean Networks: Beyond Generalized Asynchronicity}},
pages = {29-42},
url = {https://hal.inria.fr/hal-01768359v2},
doi = {10.1007/978-3-319-92675-9\_3},
abstract = {Boolean networks are commonly used in systems biology to model dynamics of biochemical networks by abstracting away many (and often unknown) parameters related to speed and species activity thresholds. It is then expected that Boolean networks produce an over-approximation of behaviours (reachable configurations), and that subsequent refinements would only prune some impossible transitions. However, we show that even generalized asynchronous updating of Boolean networks, which subsumes the usual updating modes including synchronous and fully asynchronous, does not capture all transitions doable in a multi-valued or timed refinement. We define a structural model transformation which takes a Boolean network as input and outputs a new Boolean network whose asynchronous updating simulates both synchronous and asynchronous updating of the original network, and exhibits even more behaviours than the generalized asynchronous updating. We argue that these new behaviours should not be ignored when analyzing Boolean networks, unless some knowledge about the characteristics of the system explicitly allows one to restrict its behaviour.}
}
@inproceedings{LGS-atpn18,
address = {Bratislava, Slovakia},
month = jun,
year = 2018,
volume = {10877},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Victor Khomenko and {Olivier H.} Roux},
acronym = {{PETRI~NETS}'18},
booktitle = {{P}roceedings of the 39th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'18)},
author = {Engel Lefaucheux and Alessandro Giua and Carla Seatzu},
title = {{Basis Coverability Graph for Partially Observable Petri Nets with Application to Diagnosability Analysis}},
pages = {164-183},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LGS-atpn18.pdf},
abstract = {Petri nets have been proposed as a fundamental model for
discrete-event systems in a wide variety of applications and have been
an asset to reduce the computational complexity involved in solving a
series of problems, such as control, state estimation, fault diagnosis, etc.
Many of those problems require an analysis of the reachability graph
of the Petri net. The basis reachability graph is a condensed version of
the reachability graph that was introduced to efficiently solve problems
linked to partial observation. It was in particular used for diagnosis which
consists in deciding whether some fault events occurred or not in the
system, given partial observations on the run of the system. However
this method is, with very specific exceptions, limited to bounded Petri
nets. In this paper, we introduce the notion of basis coverability graph
to remove this requirement. We then establish the relationship between
the coverability graph and the basis coverability graph. Finally, we focus
on the diagnosability problem: we show how the basis coverability graph
can be used to get an efficient algorithm.}
}
@inproceedings{BBDH-atpn18,
address = {Bratislava, Slovakia},
month = jun,
year = 2018,
volume = {10877},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Victor Khomenko and {Olivier H.} Roux},
acronym = {{PETRI~NETS}'18},
booktitle = {{P}roceedings of the 39th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'18)},
author = {Barbot, Beno{\^i}t and B{\'e}rard, B{\'e}atrice and Duplouy, Yann and Haddad, Serge},
title = {{Integrating Simulink Models into the Model Checker Cosmos}},
pages = {363-373},
url = {https://hal.archives-ouvertes.fr/hal-01725835/},
pdf = {https://hal.archives-ouvertes.fr/hal-01725835/document},
doi = {10.1007/978-3-319-91268-4_19},
abstract = {We present an implementation for Simulink model executions in the statistical model-checker Cosmos. We take profit of this implementation for an hybrid modeling combining Petri nets and Simulink models.}
}
@techreport{BBFHP-hal18,
author = {Barbot, Beno{\^i}t and Beccuti, Marco and Franceschinis, Giuliana and Haddad, Serge and Picaronny, Claudine},
institution = {HAL-Inria},
month = mar,
number = {hal-01726011},
type = {Research Report},
title = {Bounds Computation for Symmetric Nets},
year = {2018},
url = {https://hal.inria.fr/hal-01726011},
pdf = {https://hal.inria.fr/hal-01726011/file/main.pdf},
abstract = {Monotonicity in Markov chains is the starting point for quantitative abstraction of complex probabilistic systems leading to (upper or lower) bounds for probabilities and mean values relevant to their analysis. While numerous case studies exist in the literature, there is no generic model for which monotonicity is directly derived from its structure. Here we propose such a model and formalize it as a subclass of Stochastic Symmetric (Petri) Nets (SSNs) called Stochastic Monotonic SNs (SMSNs). On this subclass the monotonicity is proven by coupling arguments that can be applied on an abstract description of the state (symbolic marking). Our class includes both process synchronizations and resource sharings and can be extended to model open or cyclic closed systems. Automatic methods for transforming a non monotonic system into a monotonic one matching the MSN pattern, or for transforming a monotonic system with large state space into one with reduced state space are presented. We illustrate the interest of the proposed method by expressing standard monotonic models and modelling a flexible manufacturing system case study.}
}
@article{GM-softc18,
publisher = {Springer},
journal = {Soft Computing},
author = {Gastin, Paul and Monmege, Benjamin},
title = {{A unifying survey on weighted logics and weighted automata}},
volume = {22},
number = {4},
year = {2018},
month = feb,
pages = {1047-1065},
doi = {10.1007/s00500-015-1952-6},
url = {http://www.lsv.fr/Publis/PAPERS/PDF/softc2016-GM.pdf},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/softc2016-GM.pdf},
abstract = {Logical formalisms equivalent to weighted automata have been the topic of numerous research papers in the recent years. It started with the seminal result by Droste and Gastin on weighted logics over semirings for words. It has been extended in two dimensions by many authors. First, the weight domain has been extended to valuation monoids, valuation structures, etc. to capture more quantitative properties. Along another dimension, different structures such as ranked or unranked trees, nested words, Mazurkiewicz traces, etc. have been considered. The long and involved proofs of equivalences in all these papers are implicitly based on the same core arguments. This article provides a meta-theorem which unifies these different approaches. Towards this, we first revisit weighted automata by defining a new semantics for them in two phases---an abstract semantics based on multisets of weight structures (independent of particular weight domains) followed by a concrete semantics. Then, we introduce a core weighted logic with a minimal number of features and a simplified syntax, and lift the new semantics to this logic. We show at the level of the abstract semantics that weighted automata and core weighted logic have the same expressive power. Finally, we show how previous results can be recovered from our result by logical reasoning. In this paper, we prove the meta-theorem for words, ranked and unranked trees, showing the robustness of our approach.}
}
@inproceedings{D-PxTP17,
address = {Bras{\'{\i}}lia, Brazil},
month = sep,
year = 2017,
volume = {262},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Catherine Dubois and Bruno {Woltzenlogel Paleo}},
acronym = {{PxTP}'17},
booktitle = {Proceedings of the 5th Workshop on Proof eXchange for Theorem Proving ({PxTP}'17)},
author = {Gilles Dowek},
title = {Analyzing Individual Proofs as the Basis of Interoperability between Proof Systems},
pages = {3-12},
url = {https://arxiv.org/abs/1712.01485v1},
pdf = {https://arxiv.org/pdf/1712.01485v1.pdf},
doi = {10.4204/EPTCS.262.1},
abstract = {We describe the first results of a project of analyzing in which theories formal proofs can be expressed. We use this analysis as the basis of interoperability between proof systems.}
}
@inproceedings{DD-tpnc17,
address = {Prague, Czech Republic},
year = 2017,
volume = 10687,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Carlos Mart{\'{\i}}n{-}Vide and
Roman Neruda and
Miguel A. Vega{-}Rodr{\'{\i}}guez},
acronym = {{TPNC}'17},
booktitle = {Proceedings of the 6th International Conference on Theory and Practice of Natural Computing ({TPNC}'17)},
author = {Alejandro D{\'{\i}}az{-}Caro and Gilles Dowek},
title = {Typing Quantum Superpositions and Measurement},
pages = {281-293},
url = {https://arxiv.org/abs/1601.04294},
doi = {10.1007/978-3-319-71069-3_22},
abstract = {We propose a way to unify two approaches of non-cloning in quantum lambda-calculi. The first approach is to forbid duplicating variables, while the second is to consider all lambda-terms as algebraic-linear functions. We illustrate this idea by defining a quantum extension of first-order simply-typed lambda-calculus, where the type is linear on superposition, while allows cloning base vectors. In addition, we provide an interpretation of the calculus where superposed types are interpreted as vector spaces and non-superposed types as their basis.}
}
@article{D-lmcs17,
journal = {Logical Methods in Computer Science},
author = {Dowek, Gilles},
title = {{Lineal: A linear-algebraic Lambda-calculus}},
volume = {13},
number = {1},
year = {2017},
month = mar,
pages = {1-33},
doi = {10.23638/LMCS-13(1:8)2017},
url = {https://lmcs.episciences.org/3203},
pdf = {https://lmcs.episciences.org/3203/pdf}
}
@article{D-flap17,
publisher = {College Publications},
journal = {IfCoLoG Journal of Logics and their Applications},
author = {Dowek, Gilles},
title = {{Rules and derivations in an elementary logic course}},
volume = {4},
number = {1},
year = {2017},
pages = {21-32},
pdf = {https://hal.inria.fr/hal-01252124/file/ttl.pdf},
note = {Special Issue: Tools for Teaching Logic}
}
@inproceedings{LFV-adhs18,
address = {Oxford, UK},
month = jul,
year = 2018,
number = 16,
volume = 51,
series = {IFAC-PapersOnLine},
publisher = {Elsevier Science Publishers},
editor = {Alessandro Abate and Antoine Girard and Maurice Heemels},
acronym = {{ADHS}'18},
booktitle = {{P}roceedings of the 6th {IFAC} {C}onference on {A}nalysis and
{D}esign of {H}ybrid {S}ystems ({ADHS}'18)},
author = {Adrien Le{ }Co{\"e}nt and Laurent Fribourg and Jonathan Vacher},
title = {Control Synthesis for Stochastic Switched Systems using the Tamed Euler Method},
pages = {259-264},
url = {https://doi.org/10.1016/j.ifacol.2018.08.044},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LFV-adhs18.pdf},
doi = {10.1016/j.ifacol.2018.08.044},
abstract = {In this paper, we explain how, under the one-sided Lipschitz (OSL) hypothesis, one can find an error bound for a variant of the Euler-Maruyama approximation method for stochastic switched systems. We then explain how this bound can be used to control stochastic switched switched system in order to stabilize them in a given region. The method is illustrated on several examples of the literature.}
}
@inproceedings{SGF-ecc18,
address = {Limassol, Cyprus},
month = jun,
year = 2018,
publisher = {{IEEE} Press},
editor = {Thomas Parisini},
acronym = {{ECC}'18},
booktitle = {{P}roceedings of the European Control Conference ({ECC}'18)},
author = {Adnane Saoud and Antoine Girard and Laurent Fribourg},
title = {On the Composition of Discrete and Continuous-time Assume-Guarantee Contracts for Invariance},
pages = {435-440},
url = {https://ieeexplore.ieee.org/document/8550622},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/SGF-ecc18.pdf},
doi = {10.23919/ECC.2018.8550622},
abstract = {Many techniques for verifying invariance prop- erties are limited to systems of moderate size. In this paper, we propose an approach based on assume-guarantee contracts and compositional reasoning for verifying invariance properties of a broad class of discrete-time and continuous-time systems consisting of interconnected components. The notion of assume- guarantee contracts makes it possible to divide responsibil- ities among the system components: a contract specifies an invariance property that a component must fulfill under some assumptions on the behavior of its environment (i.e. of the other components). We define weak and strong semantics of assume- guarantee contracts for both discrete-time and continuous-time systems. We then establish a certain number of results for compositional reasoning, which allow us to show that a global invariance property of the whole system is satisfied when all components satisfy their own contract. Interestingly, we show that the weak satisfaction of the contract is sufficient to deal with cascade compositions, while strong satisfaction is needed to reason about feedback composition. Specific results for systems described by differential inclusions are then developed. Throughout the paper, the main results are illustrated using simple examples.}
}
@article{LFMDC-tcs18,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Adrien Le{ }Co{\"e}nt and
Laurent Fribourg and
Nicolas Markey and
Florian De{ }Vuyst and
Ludovic Chamoin},
title = {Compositional synthesis of state-dependent switching control},
volume = {750},
year = {2018},
pages = {53-68},
doi = {10.1016/j.tcs.2018.01.021},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LFMDC-tcs18.pdf},
url = {https://doi.org/10.1016/j.tcs.2018.01.021},
abstract = {We present a correct-by-design method of state-dependent control synthesis for sampled switching systems. Given a target region R of the state space, our method builds a capture set S and a control that steers any element of S into R. The method works by iterated backward reachability from R. The method is also used to synthesize a recurrence control that makes any state of R return to R infinitely often. We explain how the synthesis method can be performed in a compositional manner, and apply it to the synthesis of a compositional control of a concrete floor-heating system with 11 rooms and up to 2^11=2048 toswitching modes.}
}
@phdthesis{Carlier-phd2017,
author = {Carlier, Pierre},
title = {{Verification of Stochastic Timed Automata}},
school = {{Ecole Normale Sup{\'e}rieure de Cachan (ENS Paris-Saclay) and Universit{\'e} de Mons}},
type = {Th{\`e}se de doctorat},
year = 2017,
month = dec,
url = {https://tel.archives-ouvertes.fr/tel-01696130},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/carlier-phd2017.pdf}
}
@inproceedings{DLM-pnse16,
address = {Torun, Poland},
month = jun,
year = 2016,
volume = 1591,
series = {CEUR Workshop Proceedings},
publisher = {CEUR-WS.org},
editor = {Lawrence Cabac and Lars Michael Kristensen and Heiko R{\"o}lke:},
acronym = {{PNSE}'16},
booktitle = {{P}roceedings of the 10th {I}nternational {W}orkshop on {P}etri
{N}ets and {S}oftware {E}ngineering ({PNSE}'16)},
author = {Alban Linard and
Beno{\^{\i}}t Barbot and
Didier Buchs and
Maximilien Colange and
Cl{\'{e}}ment D{\'{e}}moulins and
Lom{-}Messan Hillah and
Alexis Martin},
title = {Layered Data: {A} Modular Formal Definition without Formalisms},
pages = {287-306},
url = {http://ceur-ws.org/Vol-1591/},
pdf = {http://ceur-ws.org/Vol-1591/paper19.pdf},
abstract = {Defining formalisms and models in a modular way is a painful task. Metamodeling tools and languages have usually not been created with this goal in mind. This article proposes a data structure, called layered data, that allows defining easily modular abstract syntax for for- malisms and models. It also shows its use through an exhaustive example. As a side effect, this article discusses the notion of formalism, and asserts that they do not exist as standalone objects, but rather as relations between models.}
}
@article{LACF-fmsd18,
publisher = {Springer},
journal = {Formal Methods in System Design},
author = {Adrien Le{ }Co{\"{e}}nt and
Julien {Alexandre dit Sandretto} and
Alexandre Chapoutot and
Laurent Fribourg},
title = {An improved algorithm for the control synthesis of nonlinear sampled switched systems},
volume = {53},
number = {3},
year = {2018},
pages = {363-383},
doi = {10.1007/s10703-017-0305-8},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/LACF-fmsd18.pdf},
url = {https://link.springer.com/article/10.1007/s10703-017-0305-8},
abstract = {A novel algorithm for the control synthesis for nonlinear switched systems is presented in this paper. Based on an existing procedure of state-space bisection and made available for nonlinear systems with the help of guaranteed integration, the algorithm has been improved to be able to consider longer patterns of modes with a better pruning approach. Moreover, the use of guaranteed integration also permits to take bounded perturbations and varying parameters into account. It is particularly interesting for safety critical applications, such as in aeronautical, military or medical fields. The whole approach is entirely guaranteed and the induced controllers are correct-by-design. Some experimentations are performed to show the important gain of the new algorithm.}
}
@article{ABDL-tcs18,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Alechina, Natasha and Bulling, Nils and Demri,
St{\'e}phane and Logan, Brian},
title = {On the Complexity of Resource-Bounded Logics},
volume = {750},
year = {2018},
pages = {69--100},
doi = {10.1016/j.tcs.2018.01.019},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/ABDL-tcs18.pdf}
}
@article{HGJX-lmcs18,
journal = {Logical Methods in Computer Science},
author = {Ho, Weng Kin and Goubault-Larrecq, Jean and Jung, Achim and Xi, Xiaoyong},
title = {{The Ho-Zhao Problem}},
volume = {14},
number = {1},
year = {2018},
month = jan,
pages = {1-19},
doi = {10.23638/LMCS-14(1:7)2018},
url = {https://lmcs.episciences.org/4218},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/HGJX-lmcs18.pdf}
}
@article{H-ipl18,
publisher = {Elsevier Science Publishers},
journal = {Information Processing Letters},
author = {Haddad, Serge},
title = {{Memoryless determinacy of finite parity games: Another simple proof}},
volume = {132},
pages = {19-21},
month = apr,
year = {2018},
pdf = {https://hal.inria.fr/hal-01541508/document},
doi = {10.1016/j.ipl.2017.11.012},
abstract = {Memoryless determinacy of (infinite) parity games is an important result with numerous applications. It was first independently established by Emerson and Jutla [1] and Mostowski [2] but their proofs involve elaborate developments. The elegant and simpler proof of Zielonka [3] still requires a nested induction on the finite number of priorities and on ordinals for sets of vertices. There are other proofs for finite games like the one of Björklund, Sandberg and Vorobyovin [4] that relies on relating infinite and finite duration games. We present here another simple proof that finite parity games are determined with memoryless strategies using induction on the number of relevant states. The closest proof that relies on induction over non absorbing states is the one of Grädel [5]. However instead of focusing on a single appropriate vertex for induction as we do here, he considers two reduced games per vertex, for all the vertices of the game. The idea of reasoning about a single state has been inspired to me by the analysis of finite stochastic priority games by Karelovic and Zielonka [6].}
}
@inproceedings{CCDJR-lata18,
address = {Bar-Ilan, Israel},
month = apr,
year = 2018,
volume = {10792},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Mart{\'\i}n-Vide, Carlos},
acronym = {{LATA}'18},
booktitle = {{P}roceedings of the 12th {I}nternational {C}onference on {L}anguage
and {A}utomata {T}heory and {A}pplications ({LATA}'18)},
author = {Chatain, {\relax Th}omas and Comlan, Maurice and Delfieu, David and Jezequel, Lo{\"i}g and Roux, Olivier H.},
title = {Pomsets and Unfolding of Reset Petri Nets},
pages = {258-270},
url = {https://doi.org/10.1007/978-3-319-77313-1_20},
doi = {10.1007/978-3-319-77313-1_20},
abstract = {Reset Petri nets are a particular class of Petri nets where transition firings can remove all tokens from a place without checking if this place actually holds tokens or not. In this paper we look at partial order semantics of such nets. In particular, we propose a pomset bisimulation for comparing their concurrent behaviours. Building on this pomset bisimulation we then propose a generalization of the standard finite complete prefixes of unfolding to the class of safe reset Petri nets.}
}
@inproceedings{DLM-fossacs18,
address = {Thessaloniki, Greece},
month = apr,
year = 2018,
volume = {10803},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Baier, Christel and {Dal Lago}, Ugo},
acronym = {{FoSSaCS}'18},
booktitle = {{P}roceedings of the 21st {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'18)},
author = {St{\'e}phane Demri and {\'E}tienne Lozes and Alessio Mansutti},
title = {The Effects of Adding Reachability Predicates in Propositional Separation Logic},
pages = {476-493},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/DLM-fossacs18.pdf}
}
@inproceedings{B-fossacs18,
address = {Thessaloniki, Greece},
month = apr,
year = 2018,
volume = {10803},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Baier, Christel and {Dal Lago}, Ugo},
acronym = {{FoSSaCS}'18},
booktitle = {{P}roceedings of the 21st {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'18)},
author = {Bouyer, Patricia},
title = {Games on graphs with a public signal monitoring},
pages = {530-547},
url = {https://arxiv.org/abs/1710.07163},
pdf = {http://www.lsv.fr/Publis/PAPERS/PDF/B-fossacs18.pdf},
doi = {10.1007/978-3-319-89366-2_29},
abstract = {We study Nash equilibria in games on graphs with an imperfect monitoring based on a public signal. In such games, deviations and players responsible for those deviations can be hard to detect and track. We propose a generic epistemic game abstraction, which conveniently allows to represent the knowledge of the players about these deviations, and give a characterization of Nash equilibria in terms of winning strategies in the abstraction. We then use the abstraction to develop algorithms for some payoff functions.}
}
@inproceedings{Genestier-hor19,
address = {Dortmund, Germany},
month = jun,
novolume = {??},
noseries = {??},
noeditor = {},
acronym = {{HOR}'19},
booktitle = {{P}roceedings of the 10th {I}nternational {W}orkshop on {H}igher-{O}rder {R}ewriting
({HOR}'19)},
author = {Genestier, Guillaume},
title = {{S}ize{C}hange{T}ool: {A} {T}ermination {C}hecker for {R}ewriting {D}ependent {T}ypes},
pages = {14--19},
year = 2019,
pdf = {https://hal.archives-ouvertes.fr/hal-02442465/file/presentationSCT.pdf}
}
@inproceedings{EBB-pxtp19,
address = {Natal, Brazil},
month = aug,
volume = {301},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Giselle Reis and Haniel Barbosa},
acronym = {{PxTP}'19},
booktitle = {{P}roceedings of the 6th {W}orkshop on {P}roof e{X}change for {T}heorem {P}roving
({PxTP}'19)},
author = {El Haddad, Mohamed and Burel, Guillaume and Blanqui, Fr{\'e}d{\'e}ric},
title = {{E}kstrakto: {A} tool to reconstruct {D}edukti proofs from {TSTP} files (extended abstract)},
pages = {27--35},
year = 2019,
pdf = {https://hal.inria.fr/hal-02200548/file/main.pdf},
url = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?PxTP2019.5}
}
@inproceedings{JGL-lncs11760,
volume = 11760,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {M{\'a}rio S. Alvim and Kostas Chatzikokolakis and Carlos Olarte and Franck Valencia},
acronym = {{The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy}},
booktitle = {The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy---Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday},
author = {Goubault{-}Larrecq, Jean},
title = {Fooling the Parallel or Tester with Probability $8/27$},
pages = {313--328},
year = 2019,
note = {Updated version on arXiv:1903.12653},
url = {https://arxiv.org/abs/1903.12653},
abstract = {It is well-known that the higher-order language PCF is not fully abstract: there is a program - the so-called parallel or tester, meant to test whether its input behaves as a parallel or - which never terminates on any input, operationally, but is denotationally non-trivial. We explore a probabilistic variant of PCF, and ask whether the parallel or tester exhibits a similar behavior there. The answer is no: operationally, one can feed the parallel or tester an input that will fool it into thinking it is a parallel or. We show that the largest probability of success of such would-be parallel ors is exactly 8/27. The bound is reached by a very simple probabilistic program. The difficult part is to show that that bound cannot be exceeded.}
}
@inproceedings{MSHPP-cmsb19,
address = {Trieste, Italy},
month = sep,
volume = {11773},
series = {Lecture Notes in Bioinformatics},
publisher = {Springer-Verlag},
editor = {Luca Bortolussi and Guido Sanguinetti},
acronym = {{CMSB}'19},
booktitle = {{P}roceedings of the 17th
{C}onference on
{C}omputational {M}ethods in {S}ystem {B}iology
({CMSB}'19)},
author = {Mandon, Hugues and Su, Cui and Haar, Stefan and Pang, Jun and Paulev{\'e}, Lo{\"i}c},
title = {Sequential Reprogramming of Boolean Networks Made Practical},
pages = {3-19},
doi = {10.1007/978-3-030-31304-3_1},
year = 2019,
abstract = {We address the sequential reprogramming of gene regulatory networks modelled as Boolean networks. We develop an attractor-based sequential reprogramming method to compute all sequential reprogramming paths from a source attractor to a target attractor, where only attractors of the network are used as intermediates. Our method is more practical than existing reprogramming methods as it incorporates several practical constraints: (1) only biologically observable states, viz. attractors, can act as intermediates; (2) certain attractors, such as apoptosis, can be avoided as intermediates; (3) certain nodes can be avoided to perturb as they may be essential for cell survival or difficult to perturb with biomolecular techniques; and (4) given a threshold \(k\), all sequential reprogramming paths with no more than \(k\) perturbations are computed. We compare our method with the minimal one-step reprogramming and the minimal sequential reprogramming on a variety of biological networks. The results show that our method can greatly reduce the number of perturbations compared to the one-step reprogramming, while having comparable results with the minimal sequential reprogramming. Moreover, our implementation is scalable for networks of more than 60 nodes.}
}
@inproceedings{DGJL-isdt19,
address = {Yangzhou, China},
month = jun,
volume = 345,
series = {Electronic Notes in Theoretical Computer Science},
publisher = {Elsevier Science Publishers},
editor = {Jung, Achim and Li, Qingguo and Xu, Luoshan and Zhang, Guo-Qiang},
acronym = {{ISDT}'19},
booktitle = {{P}roceedings of the {I}nternational {S}ymposium on {D}omain {T}heory ({ISDT}'19)},
author = {de Brecht, Matthew and Goubault{-}Larrecq, Jean and Jia, Xiaodong and Lyu, Zhenchao},
title = {Domain-complete and LCS-complete Spaces},
pages = {3-35},
doi = {10.1016/j.entcs.2019.07.014},
year = 2019
}
@inproceedings{GJ-isdt19,
address = {Yangzhou, China},
month = jun,
volume = 345,
series = {Electronic Notes in Theoretical Computer Science},
publisher = {Elsevier Science Publishers},
editor = {Jung, Achim and Li, Qingguo and Xu, Luoshan and Zhang, Guo-Qiang},
acronym = {{ISDT}'19},
booktitle = {{P}roceedings of the {I}nternational {S}ymposium on {D}omain {T}heory ({ISDT}'19)},
author = {Goubault{-}Larrecq, Jean and Jia, Xiaodong},
title = {Algebras of the Extended Probabilistic Powerdomain Monad},
pages = {37-61},
doi = {10.1016/j.entcs.2019.07.015},
year = 2019
}
@article{GM-hjm20,
publisher = {University of Houston},
journal = {Houston Journal of Mathematics},
author = {Goubault{-}Larrecq, Jean and Mynard, Fr{\'e}d{\'e}ric},
title = {Convergence without Points},
volume = {46},
number = {1},
pages = {227-282},
year = 2020,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GM-hjm20.pdf}
}
@techreport{DH-hal19,
author = {Donatelli, Susanna and Haddad, Serge},
institution = {HAL},
month = oct,
note = {23~pages},
number = {hal-02306021},
type = {Research Report},
title = {{Autonomous Transitions Enhance CSLTA Expressiveness and Conciseness}},
year = {2019},
url = {https://hal.inria.fr/hal-02306021},
pdf = {https://hal.inria.fr/hal-02306021/document},
abstract = {CSLTA is a stochastic temporal logic for continuous-time Markov chains (CTMC) where formulas similarly to those of CTL* are inductively defined by nesting of timed path formulas and state formulas. In particular a timed path formula of CSLTA is specified by a single-clock Deterministic Timed Automaton (DTA). Such a DTA features two kinds of transitions: synchronizing transitions triggered by CTMC transitions and autonomous transitions triggered by time elapsing that change the location of the DTA when the clock reaches a given threshold. It has already been shown that CSLTA strictly includes stochastic logics like CSL and asCSL. An interesting variant of CSLTA consists in equipping transitions rather than locations by boolean formulas. Here we answer the following question: do autonomous transitions and/or boolean guards on transitions enhance expressiveness and/or conciseness of DTAs? We show that this is indeed the case. In establishing our main results we also identify an accurate syntactical characterization of DTAs for which the autonomous transitions do not add expressive power but lead to exponentially more concise DTAs.}
}
@inproceedings{DLM-csl20,
address = {Barcelona, Spain},
month = jan,
year = 2020,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Fern{\'a}ndel, Maribel and Muscholl, Anca},
acronym = {{CSL}'20},
booktitle = {{P}roceedings of the 28th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'20)},
author = {St{\'e}phane Demri and {\'E}tienne Lozes and Alessio Mansutti},
title = {Internal Calculi for Separation Logics},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/11662/},
doi = {10.4230/LIPIcs.CSL.2020.19}
}
@inproceedings{GF-fsttcs19,
address = {Bombay, India},
month = dec,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Arkadev Chattopadhyay and Paul Gastin},
acronym = {{FSTTCS}'19},
booktitle = {{P}roceedings of the 39th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'19)},
author = {Ekanshdeep Gupta and Alain Finkel},
title = {The well structured problem for Presburger counter machines},
pages = {41:1-41:15},
year = 2019,
doi = {10.4230/LIPIcs.FSTTCS.2019.41},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2019/11603/pdf/LIPIcs-FSTTCS-2019-41.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=11603},
abstract = {We introduce the well structured problem as the question of whether a model (here a counter machine) is well structured (here for the usual ordering on integers). We show that it is undecidable for most of the (Presburger-defined) counter machines except for Affine VASS of dimension one. However, the strong well structured problem is decidable for all Presburger counter machines. While Affine VASS of dimension one are not, in general, well structured, we give an algorithm that computes the set of predecessors of a configuration; as a consequence this allows to decide the well structured problem for 1-Affine VASS.}
}
@inproceedings{BBM-fsttcs19,
address = {Bombay, India},
month = dec,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Arkadev Chattopadhyay and Paul Gastin},
acronym = {{FSTTCS}'19},
booktitle = {{P}roceedings of the 39th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'19)},
author = {Nathalie Bertrand and Patricia Bouyer and Anirban Majumdar},
title = {Concurrent parameterized games},
pages = {31:1-31:15},
year = 2019,
doi = {10.4230/LIPIcs.FSTTCS.2019.31},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2019/11593/pdf/LIPIcs-FSTTCS-2019-31.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=11593},
abstract = {Traditional concurrent games on graphs involve a fixed number of players, who take decisions simultaneously, determining the next state of the game. In this paper, we introduce a parameterized variant of concurrent games on graphs, where the parameter is precisely the number of players. Parameterized concurrent games are described by finite graphs, in which the transitions bear regular languages to describe the possible move combinations that lead from one vertex to another. We consider the problem of determining whether the first player, say Eve, has a strategy to ensure a reachability objective against any strategy profile of her opponents as a coalition. In particular Eve's strategy should be independent of the number of opponents she actually has. Technically, this paper focuses on an a priori simpler setting where the languages labeling transitions only constrain the number of opponents (but not their precise action choices). These constraints are described as semilinear sets, finite unions of intervals, or intervals. We establish the precise complexities of the parameterized reachability game problem, ranging from PTIME-complete to PSPACE-complete, in a variety of situations depending on the contraints (semilinear predicates, unions of intervals, or intervals) and on the presence or not of non-determinism.}
}
@article{BQS-lmcs19,
journal = {Logical Methods in Computer Science},
author = {Bollig, Benedikt and Quaas, Karin and Sangnier, Arnaud},
title = {The Complexity of Flat Freeze LTL},
volume = {15},
number = {3},
pages = {32:1-32:26},
year = 2019,
doi = {10.23638/LMCS-15(3:32)2019},
pdf = {https://lmcs.episciences.org/5795/pdf},
url = {https://arxiv.org/abs/1609.06124},
abstract = {We consider the model-checking problem for freeze LTL on one-counter automata (OCA). Freeze LTL extends LTL with the freeze quantifier, which allows one to store different counter values of a run in registers so that they can be compared with one another. As the model-checking problem is undecidable in general, we focus on the flat fragment of freeze LTL, in which the usage of the freeze quantifier is restricted. In a previous work, Lechner et al. showed that model checking for flat freeze LTL on OCA with binary encoding of counter updates is decidable and in 2NEXPTIME. In this paper, we prove that the problem is, in fact, NEXPTIME-complete no matter whether counter updates are encoded in unary or binary. Like Lechner et al., we rely on a reduction to the reachability problem in OCA with parameterized tests (OCA(P)). The new aspect is that we simulate OCA(P) by alternating two-way automata over words. This implies an exponential upper bound on the parameter values that we exploit towards an NP algorithm for reachability in OCA(P) with unary updates. We obtain our main result as a corollary. As another application, relying on a reduction by Bundala and Ouaknine, one obtains an alternative proof of the known fact that reachability in closed parametric timed automata with one parametric clock is in NEXPTIME.}
}
@article{DF-jlc19,
publisher = {Oxford University Press},
journal = {Journal of Logic and Computation},
author = {Demri, St{\'e}phane and Fervari, Raul},
title = {The power of modal separation logics},
volume = {29},
number = {8},
pages = {1139--1184},
year = 2019,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DF-jlc19.pdf}
}
@inproceedings{SZ-rp19,
address = {Brussels, Belgium},
month = sep,
volume = {11674},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Rapha{\"e}l Jungers and Emmanuel Fillot and Igor Potapov},
acronym = {{RP}'19},
booktitle = {{P}roceedings of the 13th {W}orkshop
on {R}eachability {P}roblems in {C}omputational {M}odels ({RP}'19)},
author = {Sylvain Schmitz and Georg Zetzsche},
title = {Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets},
year = 2019,
pages = {193-201},
pdf = {https://arxiv.org/pdf/1906.07069.pdf},
url = {https://arxiv.org/abs/1906.07069},
doi = {10.1007/978-3-030-30806-3_15},
abstract = {We consider the model of pushdown vector addition systems with resets.
These consist of vector addition systems that have access to a pushdown stack and have
instructions to reset counters. For this model, we study the coverability problem. In
the absence of resets, this problem is known to be decidable for one-dimensional pushdown
vector addition systems, but decidability is open for general pushdown vector addition
systems. Moreover, coverability is known to be decidable for reset vector addition
systems without a pushdown stack. We show in this note that the problem is undecidable
for one-dimensional pushdown vector addition systems with resets.}
}
@inproceedings{BGH-fscd19,
address = {Dortmund, Germany},
month = jun,
volume = {131},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Herman Geuvers},
acronym = {{FSCD}'19},
booktitle = {{P}roceedings of the 4th International Conference on
Formal Structures for Computation and Deduction ({FSCD}'19)},
author = {Fr{\'e}d{\'e}ric Blanqui and Guillaume Genestier and Olivier Hermant},
title = {Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting},
pages = {9:1-9:21},
doi = {10.4230/LIPIcs.FSCD.2019.9},
year = 2019,
pdf = {http://drops.dagstuhl.de/opus/volltexte/2019/10516/pdf/LIPIcs-FSCD-2019-9.pdf},
url = {http://drops.dagstuhl.de/opus/volltexte/2019/10516/},
abstract = {Dependency pairs are a key concept at the core of modern automated termination
provers for first-order term rewriting systems. In this paper, we introduce an extension
of this technique for a large class of dependently-typed higher-order rewriting systems.
This extends previous results by Wahlstedt on the one hand and the first author on the
other hand to strong normalization and non-orthogonal rewriting systems. This new criterion
is implemented in the type-checker Dedukti.}
}
@inproceedings{DD-fscd19,
address = {Dortmund, Germany},
month = jun,
volume = {131},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Herman Geuvers},
acronym = {{FSCD}'19},
booktitle = {{P}roceedings of the 4th International Conference on
Formal Structures for Computation and Deduction ({FSCD}'19)},
author = {Alejandro {D{\'i}az-Caro} and Gilles Dowek},
title = {Proof Normalisation in a Logic Identifying Isomorphic Propositions},
pages = {14:1-14:23},
doi = {10.4230/LIPIcs.FSCD.2019.14},
year = 2019,
pdf = {http://drops.dagstuhl.de/opus/volltexte/2019/10521/pdf/LIPIcs-FSCD-2019-14.pdf},
url = {http://drops.dagstuhl.de/opus/volltexte/2019/10521/},
abstract = {We define a fragment of propositional logic where isomorphic propositions, such
as A wedge B and B wedge A, or A ==> (B wedge C) and (A ==> B) wedge (A ==> C) are identified.
We define System I, a proof language for this logic, and prove its normalisation and consistency.}
}
@inproceedings{GMG-dlt19,
address = {Warsaw, Poland},
month = aug,
volume = {11647},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Piotrek Hofman and Micha\l Skrzypczak},
acronym = {{DLT}'19},
booktitle = {{P}roceedings of the 23th {I}nternational
{C}onference on {D}evelopments in {L}anguage {T}heory
({DLT}'19)},
author = {Paul Gastin and Amaldev Manuel and R. Govind},
title = {Logics for Reversible Regular Languages and Semigroups with Involution},
pages = {182-191},
doi = {10.1007/978-3-030-24886-4_13},
year = 2019,
pdf = {https://arxiv.org/pdf/1907.01214.pdf},
url = {https://arxiv.org/abs/1907.01214},
abstract = {We present MSO and FO logics with predicates ``between'' and
``neighbour'' that characterise various fragments of the class of regular
languages that are closed under the reverse operation. The standard
connections that exist between MSO and FO logics and varieties of finite
semigroups extend to this setting with semigroups extended with an
involution. The case is different for FO with neighbour relation where
we show that one needs additional equations to characterise the class.}
}
@inproceedings{Gastin-cai19,
address = {Ni{\u s}, Serbia},
month = jun,
volume = 11545,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Miroslav {\'C}iri{\'c} and Manfred Droste and Jean-{\'E}ric Pin},
acronym = {{CAI}'19},
booktitle = {{P}roceedings of the 8th {I}nternational {C}onference on
{A}lgebraic {I}nformatics ({CAI}'19)},
author = {Gastin, Paul},
title = {Modular Descriptions of Regular Functions},
pages = {3-9},
note = {Invited talk},
year = 2019,
pdf = {https://arxiv.org/abs/1908.01137},
doi = {10.1007/978-3-030-21363-3_1},
abstract = {We discuss various formalisms to describe string-to-string
transformations. Many are based on automata and can be seen as operational
descriptions, allowing direct implementations when the input scanner is
deterministic. Alternatively, one may use more human friendly descriptions
based on some simple basic transformations (e.g., copy, duplicate, erase,
reverse) and various combinators such as function com- position or extensions
of regular operations.}
}
@article{CHKPT-nc19,
publisher = {Springer},
journal = {Natural Computing},
author = {Chatain, {\relax Th}omas and Haar, Stefan and Kolc{\'a}k, Juraj and Paulev{\'e}, Lo{\"i}c and Thakkar, Aalok},
title = {Concurrency in {Boolean} networks},
volume = {19},
pages = {91--109},
year = 2020,
pdf = {https://hal.inria.fr/hal-01893106v2/document},
url = {https://link.springer.com/article/10.1007/s11047-019-09748-4},
abstract = {Boolean networks (BNs) are widely used to model the qualitative dynamics
of biological systems. Besides the logical rules determining the evolution of each
component with respect to the state of its regulators, the scheduling of component
updates can have a dramatic impact on the predicted behaviours. In this paper, we
explore the use of Read (contextual) Petri Nets (RPNs) to study dynamics of BNs from
a concurrency theory perspective. After showing bi-directional translations between
RPNs and BNs and analogies between results on synchronism sensitivity, we illustrate
that usual updating modes for BNs can miss plausible behaviours, i.e., incorrectly
conclude on the absence/impossibility of reaching specific configurations. We propose
an encoding of BNs capitalizing on the RPN semantics enabling more behaviour than the
generalized asynchronous updating mode. The proposed encoding ensures a correct
abstraction of any multivalued refinement, as one may expect to achieve when modelling
biological systems with no assumption on its time features.}
}
@inproceedings{K-csf19,
address = {Hoboken, NJ, USA},
month = jul,
publisher = {{IEEE} Computer Society Press},
editor = {Delaune, St{\'e}phanie and Jia, Limin},
acronym = {{CSF}'19},
booktitle = {{P}roceedings of the
32nd {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'19)},
author = {Adrien Koutsos},
title = {Decidability of a Sound Set of Inference Rules for Computational Indistinguishability},
pages = {48-61},
year = 2019,
doi = {10.1109/CSF.2019.00011},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/K-csf19.pdf},
abstract = {Computational indistinguishability is a key property in cryptography and verification of security protocols. Current tools for proving it rely on cryptographic game transformations. We follow Bana and Comon's approach, axiomatizing what an adversary cannot distinguish. We prove the decidability of a set of first-order axioms which are computationally sound, though incomplete, for protocols with a bounded number of sessions whose security is based on an IND-CCA_2 encryption scheme. Alternatively, our result can be viewed as the decidability of a family of cryptographic game transformations. Our proof relies on term rewriting and automated deduction techniques.}
}
@inproceedings{K-eurosp19,
address = {Stockholm, Sweden},
month = jun,
publisher = {{IEEE} Press},
editor = {Frank Piessens and Frank Stajano},
acronym = {{EuroS\&P}'19},
booktitle = {{P}roceedings of the 4th IEEE European Symposium on
Security and Privacy ({EuroS\&P}'19)},
author = {Adrien Koutsos},
title = {The {5G-AKA} Authentication Protocol Privacy},
pages = {464-479},
year = 2019,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/K-eurosp19.pdf},
doi = {10.1109/EuroSP.2019.00041},
abstract = {We study the 5G-AKA authentication protocol described in the 5G mobile communication standards. This version of AKA tries to achieve a better privacy than the 3G and 4G versions through the use of asymmetric randomized encryption. Nonetheless, we show that except for the IMSI-catcher attack, all known attacks against 5G-AKA privacy still apply. Next, we modify the 5G-AKA protocol to prevent these attacks, while satisfying 5G-AKA efficiency constraints as much as possible. We then formally prove that our protocol is sigma-unlinkable. This is a new security notion, which allows for a fine-grained quantification of a protocol privacy. Our security proof is carried out in the Bana-Comon indistinguishability logic. We also prove mutual authentication as a secondary result.}
}
@article{JGL-topa19,
publisher = {Elsevier Science Publishers},
journal = {Topology and its Applications},
author = {Goubault{-}Larrecq, Jean},
title = {Formal Ball Monads},
volume = {263},
pages = {372--391},
year = 2019,
doi = {10.1016/j.topol.2019.06.044},
url = {http://www.sciencedirect.com/science/article/pii/S0166864119302160},
abstract = {The formal ball construction B is a central tool of
quasi-metric space theory. We show that it induces monads on certain
natural categories of quasi-metric spaces, with 1-Lipschitz maps as
morphisms, or with 1-Lipschitz continuous maps as morphisms. Those are
left Kock-Zöberlein monads, and that allows us to characterize their
algebras exactly. As an application, we study so-called Lipschitz
regular spaces, a natural class of spaces that contain all standard
algebraic quasi-metric spaces with relatively compact balls, in
particular all metric spaces whose closed balls are compact. There are
other Lipschitz regular spaces, as we show, and notably all B-algebras.
That includes all spaces of formal balls, with their d+-Scott topology.
The value of Lipschitz regularity is that, for a Lipschitz regular
standard quasi-metric space X,d, the space LX of lower semicontinuous
maps from X to the extended non-negative reals, with the Scott topology,
retracts onto each of the spaces L_alpha(X,d) of alpha-Lipschitz
continuous maps, and that the subspace topology on the latter coincides
with the Scott topology.}
}
@inproceedings{GMS-cav19,
address = {New York, USA},
month = jul,
volume = {11561},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Isil Dillig and Serdar Tasiran},
acronym = {{CAV}'19},
booktitle = {{P}roceedings of the 31st
{I}nternational {C}onference on
{C}omputer {A}ided {V}erification
({CAV}'19)},
author = {Paul Gastin and Sayan Mukherjee and B. Srivathsan},
title = {Fast algorithms for handling diagonal constraints in timed automata},
pages = {41-59},
year = 2019,
doi = {10.1007/978-3-030-25540-4_3},
pdf = {https://arxiv.org/pdf/1904.08590.pdf},
url = {https://arxiv.org/abs/1904.08590}
}
@inproceedings{BCC-atpn19,
address = {Aachen, Germany},
month = jun,
year = 2019,
volume = {11522},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Susanna Donatelli and Stefan Haar},
acronym = {{PETRI~NETS}'19},
booktitle = {{P}roceedings of the 40th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'19)},
author = {Mathilde Boltenhagen and Thomas Chatain and Josep Carmona},
title = {Generalized Alignment-Based Trace Clustering of Process Behavior},
pages = {237-257},
url = {https://link.springer.com/chapter/10.1007/978-3-030-21571-2_14},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCC-atpn19.pdf},
doi = {10.1007/978-3-030-21571-2_14},
abstract = {Process mining techniques use event logs containing real process executions in order to mine, align and extend process models. The partition of an event log into trace variants facilitates the understanding and analysis of traces, so it is a common pre-processing in process mining environments. Trace clustering automates this partition; traditionally it has been applied without taking into consideration the availability of a process model. In this paper we extend our previous work on process model based trace clustering, by allowing cluster centroids to have a complex structure, that can range from a partial order, down to a subnet of the initial process model. This way, the new clustering framework presented in this paper is able to cluster together traces that are distant only due to concurrency or loop constructs in process models. We show the complexity analysis of the different instantiations of the trace clustering framework, and have implemented it in a prototype tool that has been tested on different datasets.}
}
@inproceedings{BBM-mfcs19,
address = {Aachen, Germany},
month = aug,
volume = {138},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Pinar Heggernes and Joost-Pieter Katoen and Peter Rossmanith},
acronym = {{MFCS}'19},
booktitle = {{P}roceedings of the 42nd
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'19)},
author = {Manfred Droste and Paul Gastin},
title = {Aperiodic Weighted Automata and Weighted First-Order Logic},
pages = {76:1-76:15},
year = 2019,
doi = {10.4230/LIPIcs.MFCS.2019.76},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2019/11020/pdf/LIPIcs-MFCS-2019-76.pdf},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=11020}
}
@inproceedings{BT-mfcs19,
address = {Aachen, Germany},
month = aug,
volume = {138},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Pinar Heggernes and Joost-Pieter Katoen and Peter Rossmanith},
acronym = {{MFCS}'19},
booktitle = {{P}roceedings of the 42nd
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'19)},
author = {Patricia Bouyer and Nathan Thomasset},
title = {Nash equilibria in games over graphs equipped with a communication mechanism},
pages = {9:1-9:14},
year = 2019,
doi = {10.4230/LIPIcs.MFCS.2019.9},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2019/10953/pdf/LIPIcs-MFCS-2019-9.pdf},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=10953}
}
@inproceedings{BBM-concur19,
address = {Amsterdam, The Netherlands},
month = aug,
volume = {140},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Wan Fokkink and Rob {van Glabbeek}},
acronym = {{CONCUR}'19},
booktitle = {{P}roceedings of the 30th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'19)},
author = {Nathalie Bertrand and Patricia Bouyer and Anirban Majumdar},
title = {Reconfiguration and message losses in parameterized broadcast networks},
pages = {32:1-32:15},
year = 2019,
doi = {10.4230/LIPIcs.CONCUR.2019.32},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2019/10934/pdf/LIPIcs-CONCUR-2019-32.pdf},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=10934}
}
@inproceedings{FP-concur19,
address = {Amsterdam, The Netherlands},
month = aug,
volume = {140},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Wan Fokkink and Rob {van Glabbeek}},
acronym = {{CONCUR}'19},
booktitle = {{P}roceedings of the 30th
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'19)},
author = {Alain Finkel and M. Praveen},
title = {Verification of Flat FIFO Systems},
pages = {12:1-12:17},
year = 2019,
doi = {10.4230/LIPIcs.CONCUR.2019.12},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2019/10914/pdf/LIPIcs-CONCUR-2019-12.pdf},
url = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=10914},
abstract = {The decidability and complexity of reachability problems and model-checking for flat counter systems have been explored in detail. However, only few results are known for flat FIFO systems, only in some particular cases (a single loop or a single bounded expression). We prove, by establishing reductions between properties, and by reducing SAT to a subset of these properties that many verification problems like reachability, non-termination, unboundedness are NP-complete for flat FIFO systems, generalizing similar existing results for flat counter systems. We construct a trace-flattable counter system that is bisimilar to a given flat FIFO system, which allows to model-check the original flat FIFO system. Our results lay the theoretical foundations and open the way to build a verification tool for (general) FIFO systems based on analysis of flat subsystems.}
}
@article{HBD-jcs19,
publisher = {{IOS} Press},
journal = {Journal of Computer Security},
author = {Hirschi, Lucca and Baelde, David and Delaune, St{\'e}phanie},
title = {A method for unbounded verification of privacy-type properties},
volume = {27},
number = {3},
pages = {277-342},
year = 2019,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HBD-jcs19.pdf},
doi = {10.3233/JCS-171070},
url = {https://content.iospress.com/articles/journal-of-computer-security/jcs171070}
}
@article{GBM-tocsys19,
publisher = {Springer},
journal = {Theory of Computing Systems},
author = {Gardy, Patrick and Bouyer, Patricia and Markey, Nicolas},
title = {Dependences in Strategy Logic},
volume = {64},
number = {3},
year = 2020,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GBM-tocsys19.pdf},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GBM-tocsys19.pdf}
}
@inproceedings{BKMMMP-ijcai19,
futureaddress = {},
month = jul,
publisher = {IJCAI organization},
editor = {Kraus, Sarit},
acronym = {{IJCAI}'19},
booktitle = {{P}roceedings of the 28th {I}nternational {J}oint
{C}onference on {A}rtificial {I}ntelligence
({IJCAI}'19)},
author = {Bouyer, Patricia and Kupferman, Orna and Markey, Nicolas and Maubert, Bastien and Murano, Aniello and Perelli, Giuseppe},
title = {Reasoning about Quality and Fuzziness of Strategic Behaviours},
pages = {1588-1594},
year = 2019,
doi = {10.24963/ijcai.2019/220},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKMMMP-ijcai19.pdf},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKMMMP-ijcai19.pdf}
}
@inproceedings{BD-aamas19,
address = {Montreal, Canada},
month = jun,
publisher = {ACM Press},
acronym = {{AAMAS}'19},
booktitle = {{P}roceedings of the 18th {I}nternational {J}oint {C}onference on
{A}utonomous {A}gents and {M}ulti-{A}gent {S}ystems
({AAMAS}'19)},
author = {Belardinelli, Francesco and Demri, St{\'e}phane},
title = {Resource-bounded ATL: the Quest for Tractable Fragments},
pages = {206--214},
year = 2019,
pdf = {http://www.ifaamas.org/Proceedings/aamas2019/pdfs/p206.pdf},
url = {http://www.ifaamas.org/Proceedings/aamas2019/forms/contents.htm#3F}
}
@article{MSPPHP-ipl19,
publisher = {ACM Press},
journal = {IEEE/ACM Transaction on Computational Biology and Bioinformatics},
author = {Mandon, Hugues and Su, Cui and Pang, Jun and Paul, Soumya and Haar, Stefan and Paulev{\'e}, Lo{\"i}c},
title = {Algorithms for the Sequential Reprogramming of Boolean Networks},
volume = {16},
number = {5},
pages = {1610--1619},
year = 2019,
pdf = {https://hal.archives-ouvertes.fr/hal-02113864/file/main.pdf},
url = {https://hal.archives-ouvertes.fr/hal-02113864}
}
@inproceedings{Schmitz-icalp19,
address = {Patras, Greece},
month = jul,
volume = {132},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chatzigiannakis, Ioannis and Merelli, Emanuela},
acronym = {{ICALP}'19},
booktitle = {{P}roceedings of the 46th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'19)},
author = {Schmitz, Sylvain},
title = {The Parametric Complexity of Lossy Counter Machines},
year = 2019,
pages = {129:1-129:15},
doi = {10.4230/LIPIcs.ICALP.2019.129},
pdf = {https://hal.archives-ouvertes.fr/hal-02020728v2/document},
url = {http://drops.dagstuhl.de/opus/volltexte/2019/10705/},
abstract = {The reachability problem in lossy counter machines is
the best-known ACKERMANN-complete problem and has been used to establish
most of the ACKERMANN-hardness statements in the literature. This hides
however a complexity gap when the number of counters is fixed. We close
this gap and prove F_d-completeness for machines with d counters, which
provides the first known uncontrived problems complete for the fast-growing
complexity classes at levels 3 < d < omega. We develop for this an approach
through antichain factorisations of bad sequences and analysing the length
of controlled antichains.}
}
@inproceedings{Fortin-icalp19,
address = {Patras, Greece},
month = jul,
volume = {132},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Chatzigiannakis, Ioannis and Merelli, Emanuela},
acronym = {{ICALP}'19},
booktitle = {{P}roceedings of the 46th {I}nternational
{C}olloquium on {A}utomata, {L}anguages and
{P}rogramming ({ICALP}'19)},
author = {Fortin, Marie},
title = {FO = FO3 for linear orders with monotone binary relations},
year = 2019,
pages = {116:1-116:13},
doi = {10.4230/LIPIcs.ICALP.2019.116},
pdf = {http://drops.dagstuhl.de/opus/volltexte/2019/10692/pdf/LIPIcs-ICALP-2019-116.pdf},
url = {http://drops.dagstuhl.de/opus/volltexte/2019/10692/},
abstract = {We show that over the class of linear orders with additional
binary relations satisfying some monotonicity conditions, monadic first-order
logic has the three-variable property. This generalizes (and gives a new proof
of) several known results, including the fact that monadic first-order logic
has the three-variable property over linear orders, as well as over
(R, <, +1), and answers some open questions mentioned in a paper from
Antonopoulos, Hunter, Raza and Worrell [FoSSaCS 2015]. Our proof is based on
a translation of monadic first-order logic formulas into formulas of a star-free
variant of Propositional Dynamic Logic, which are in turn easily expressible in
monadic first-order logic with three variables.}
}
@inproceedings{DFM-jelia19,
address = {Rende, Italy},
month = jun,
year = 2019,
volume = 11468,
series = {Lecture Notes in Artificial Intelligence},
publisher = {Springer},
editor = {Calimeri, Francesco and Leone, Nicola and Manna, Marco},
acronym = {{JELIA}'19},
booktitle = {{P}roceedings of the 16th {E}uropean {C}onference on {L}ogics in
{A}rtificial {I}ntelligence ({JELIA}'19)},
author = {Demri, St{\'e}phane and Fervari, Raul and Mansutti, Alessio},
title = {Axiomatising logics with separating conjunctions and modalities},
pages = {692-708},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DFM-jelia19.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DFM-jelia19.pdf},
doi = {10.1007/978-3-030-19570-0_45}
}
@article{HS-ipl19,
publisher = {Elsevier Science Publishers},
journal = {Information Processing Letters},
author = {Halfon, Simon and Schnoebelen, {\relax Ph}ilippe},
title = {On shuffle products, acyclic automata and piecewise-testable languages},
volume = {145},
pages = {68-73},
year = 2019,
doi = {10.1016/j.ipl.2019.01.012},
abstract = {We show that the shuffle $L\unicode{x29E2} F$ of a
piecewise-testable language $L$ and a finite language $F$ is
piecewise-testable. The proof relies on a classic but little-used
automata-theoretic characterization of piecewise-testable languages. We
also discuss some mild generalizations of the main result, and provide
bounds on the piecewise complexity of $L\unicode{x29E2} F$.}
}
@inproceedings{BGJKS-csf19,
address = {Hoboken, NJ, USA},
month = jul,
publisher = {{IEEE} Computer Society Press},
editor = {Delaune, St{\'e}phanie and Jia, Limin},
acronym = {{CSF}'19},
booktitle = {{P}roceedings of the
32nd {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'19)},
author = {Barthe, Gilles and Gr{\'e}goire, Benjamin and Jacomme, Charlie and Kremer, Steve and Strub, Pierre-Yves},
title = {Symbolic methods in computational cryptography proofs},
pages = {136-151},
year = 2019,
doi = {10.1109/CSF.2019.00017},
pdf = {https://hal.inria.fr/hal-02117794/document},
url = {https://hal.inria.fr/hal-02117794},
abstract = {Code-based game-playing is a popular methodology for proving security of cryptographic constructions and side-channel countermeasures. This methodology relies on treating cryptographic proofs as an instance of relational program verification (between probabilistic programs), and decomposing the latter into a series of elementary relational program verification steps. In this paper, we develop principled methods for proving such elementary steps for probabilistic programs that operate over finite fields and related algebraic structures. We focus on three essential properties: program equivalence, information flow, and uniformity. We give characterizations of these properties based on deducibility and other notions from symbolic cryptography. We use (sometimes improve) tools from symbolic cryptography to obtain decision procedures or sound proof methods for program equivalence, information flow, and uniformity. Finally, we evaluate our approach using examples drawn from provable security and from side-channel analysis-for the latter, we focus on the masking countermeasure against differential power analysis. A partial implementation of our approach is integrated in EASYCRYPT, a proof assistant for provable security, and in MASKVERIF, a fully automated prover for masked implementations.}
}
@inproceedings{FHK-atpn19,
address = {Aachen, Germany},
month = jun,
year = 2019,
volume = {11522},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Susanna Donatelli and Stefan Haar},
acronym = {{PETRI~NETS}'19},
booktitle = {{P}roceedings of the 40th
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'19)},
author = {Finkel, Alain and Haddad, Serge and Khmelnitsky, Igor},
title = {Coverability and Termination in Recursive Petri Nets},
pages = { 429-448},
url = {https://hal.inria.fr/hal-02081019},
pdf = {https://hal.inria.fr/hal-02081019/document},
doi = {10.1007/978-3-030-21571-2_23},
abstract = {In the early two-thousands, Recursive Petri nets have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessary. Although Recursive Petri nets strictly extend Petri nets and stack automata, most of the usual property problems are solvable but using non primitive recursive algorithms, even for coverability and termination. For almost all other extended Petri nets models containing a stack the complexity of coverability and termination are unknown or strictly larger than EXPSPACE. In contrast, we establish here that for Recursive Petri nets, the coverability and termination problems are EXPSPACE-complete as for Petri nets. From an expressiveness point of view, we show that coverability languages of Recursive Petri nets strictly include the union of coverability languages of Petri nets and context-free languages. Thus we get for free a more powerful model than Petri net.}
}
@inproceedings{JGL-lics19,
address = {Vancouver, Canada},
month = jun,
publisher = {{IEEE} Press},
editor = {Bouyer, Patricia},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 34th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'19)},
author = {Goubault{-}Larrecq, Jean},
title = {A Probabilistic and Non-Deterministic Call-by-Push-Value Language},
pages = {1-13},
year = 2019,
doi = {10.1109/LICS.2019.8785809},
abstract = {There is no known way of giving a domain-theoretic semantics to higher-order probabilistic languages, in such a way that the involved domains are continuous or quasi-continuous. We argue that the problem naturally disappears for languages with two kinds of types, where one kind is interpreted in a Cartesian-closed category of continuous dcpos, and the other is interpreted in a category that is closed under the probabilistic powerdomain functor. Such a setting is provided by Paul B. Levy's call-by-push-value paradigm. Following this insight, we define a call-by-push-value language, with probabilistic choice sitting inside the value types, and where conversion from a value type to a computation type involves demonic non-determinism. We give both a domain-theoretic semantics and an operational semantics for the resulting language, and we show that they are sound and adequate. With the addition of statistical termination testers and parallel if, we show that the language is even fully abstract-and those two primitives are required for that.}
}
@inproceedings{AGJK-lics19,
address = {Vancouver, Canada},
month = jun,
publisher = {{IEEE} Press},
editor = {Bouyer, Patricia},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 34th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'19)},
author = {Akshay, S. and Gastin, Paul and Jug{\'e}, Vincent and Krishna, Shankara Narayanan},
title = {Timed systems through the lens of logic},
pages = {1-13},
year = 2019,
doi = {10.1109/LICS.2019.8785684},
pdf = {https://arxiv.org/pdf/1903.03773.pdf},
url = {https://arxiv.org/abs/1903.03773},
abstract = {In this paper, we analyze timed systems with data structures, using a rich interplay of logic and properties of graphs. We start by describing behaviors of timed systems using graphs with timing constraints. Such a graph is called realizable if we can assign time-stamps to nodes or events so that they are consistent with the timing constraints. The logical definability of several graph properties has been a challenging problem, and we show, using a highly non-trivial argument, that the realizability property for collections of graphs with strict timing constraints is logically definable in a class of propositional dynamic logic (EQ-ICPDL), which is strictly contained in MSO. Using this result, we propose a novel, algorithmically efficient and uniform proof technique for the analysis of timed systems enriched with auxiliary data structures, like stacks and queues. Our technique unravels new results (for emptiness checking as well as model checking) for timed systems with richer features than considered so far, while also recovering existing results.}
}
@inproceedings{BD-lics19,
address = {Vancouver, Canada},
month = jun,
publisher = {{IEEE} Press},
editor = {Bouyer, Patricia},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 34th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'19)},
author = {Bednarczyk, Bartosz and Demri, St{\'e}phane},
title = {Why propositional quantification makes modal logics on trees robustly hard ?},
pages = {1-13},
year = 2019,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BD-lics2019.pdf},
doi = {10.1109/LICS.2019.8785656}
}
@inproceedings{CD-lics19,
address = {Vancouver, Canada},
month = jun,
publisher = {{IEEE} Press},
editor = {Bouyer, Patricia},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 34th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'19)},
author = {Chatterjee, Krishnendu and Doyen, Laurent},
title = {Graph Planning with Expected Finite Horizon},
pages = {1-13},
year = 2019,
doi = {10.1109/LICS.2019.8785706},
abstract = {Graph planning gives rise to fundamental algorithmic questions such as shortest path, traveling salesman problem, etc. A classical problem in discrete planning is to consider a weighted graph and construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon is not fixed, but the stopping time is chosen according to some distribution such that the expected stopping time is T. If the stopping time distribution is not known, then to ensure robustness, the distribution is chosen by an adversary, to represent the worst-case scenario. A stationary plan for every vertex always chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution, stationary plans are not sufficient for optimality. Quite surprisingly we show that when an adversary chooses the stopping-time distribution with expected stopping time T, then stationary plans are sufficient. While computing optimal stationary plans for fixed horizon is NP-complete, we show that computing optimal stationary plans under adversarial stopping-time distribution can be achieved in polynomial time. Consequently, our polynomial-time algorithm for adversarial stopping time also computes an optimal plan among all possible plans.}
}
@inproceedings{LS-lics19,
address = {Vancouver, Canada},
month = jun,
publisher = {{IEEE} Press},
editor = {Bouyer, Patricia},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 34th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'19)},
author = {J{\'e}r{\^o}me Leroux and Schmitz, Sylvain},
title = {Reachability in Vector Addition Systems is
Primitive-Recursive in Fixed Dimension},
pages = {1-13},
year = 2019,
doi = {10.1109/LICS.2019.8785796},
url = {https://arxiv.org/abs/1903.08575},
abstract = {The reachability problem in vector addition systems
is a central question, not only for the static
verification of these systems, but also for many
inter-reducible decision problems occurring in
various fields. The currently best known upper bound
on this problem is not primitive-recursive, even
when considering systems of fixed dimension. We
provide significant refinements to the classical
decomposition algorithm of Mayr, Kosaraju, and
Lambert and to its termination proof, which yield an
ACKERMANN upper bound in the general case, and
primitive-recursive upper bounds in fixed
dimension. While this does not match the currently
best known TOWER lower bound for reachability, it is
optimal for related problems.}
}
@article{LS-icomp19,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Ranko Lazi\'c and Sylvain Schmitz},
title = {The Ideal View on {R}ackoff's Coverability
Technique},
url = {https://hal.inria.fr/hal-01176755},
year = 2019,
note = {To appear},
abstract = {Well-structured transition systems form a large
class of infinite-state systems, for which safety
verification is decidable thanks to a generic
backward coverability algorithm. However, for
several classes of systems, the generic upper bounds
one can extract from the algorithm are far from
optimal. In particular, in the case of vector
addition systems (VAS) and several of their
extensions, the known tight upper bounds were rather
derived thanks to ad-hoc arguments based on
Rackoff's small witness property. We show how to
derive the same bounds directly on the computations
of the VAS instantiation of the generic backward
coverability algorithm. This relies on a dual view
of the algorithm using ideal decompositions of
downwards-closed sets, which exhibits a key
structural invariant in the VAS case. This reasoning
offers a uniform setting for all well-structured
transition systems, including branching ones, and we
further apply it to several VAS extensions: we
derive optimal upper bounds for coverability in
branching and alternating VAS, matching the
previously known results from the literature.}
}
@inproceedings{MFNS-async19,
address = {Hirosaki, Japan},
month = may,
publisher = {{IEEE} Computer Society},
editor = {Marly Roncken and Andrey Mokhov},
acronym = {{ASYNC}'19},
booktitle = {{P}roceedings of the 25th {IEEE} {I}nternational {S}ymposium on {A}synchronous {C}ircuits and {S}ystems ({ASYNC}'19)},
author = {J{\"u}rgen Maier and
Matthias F{\"u}gger and
Thomas Nowak and
Ulrich Schmid},
title = {Transistor-Level Analysis of Dynamic Delay Models},
pages = {76-85},
year = {2019},
doi = {10.1109/ASYNC.2019.00019},
abstract = {Delay estimation is a crucial task in digital circuit design as it provides the possibility to assure the desired functionality, but also prevents undesired behavior very early. For this purpose elaborate delay models like the Degradation Delay Model (DDM) and the Involution Delay Model (IDM) have been proposed in the past, which facilitate accurate dynamic timing analysis: Both use delay functions that determine the delay of the current input transition based on the time difference T to the previous output one. Currently, however, extensive analog simulations are necessary to determine the (parameters of the) delay function, which is a very time-consuming and cumbersome task and thus limits the applicability of these models. In this paper, we therefore thoroughly investigate the characterization procedures of a CMOS inverter on the transistor level in order to derive analytical expressions for the delay functions. Based on reasonably simple transistor models we identify three operation regions, each described by a different estimation function. Using simulations with two independent technologies, we show that our predictions are not only accurate but also reasonably robust w.r.t. variations. Our results furthermore indicate that the exponential fitting proposed for DDM is actually only partially valid, while our analytic approach can be applied on the whole range. Even the more complex IDM is predicted reasonably accurate.}
}
@inproceedings{BBR-fossacs19,
address = {Prague, Czech Republic},
month = apr,
year = 2019,
volume = {11425},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Boja{\'n}czyk, Mikolaj and Simpson, Alex},
acronym = {{FoSSaCS}'19},
booktitle = {{P}roceedings of the 22nd {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'19)},
author = {Benedikt Bollig and Patricia Bouyer and Fabian Reiter},
title = {Identifiers in Registers - Describing Network Algorithms with Logic},
pages = {115-132},
url = {https://arxiv.org/abs/1811.08197},
pdf = {https://arxiv.org/pdf/1811.08197.pdf},
doi = {10.1007/978-3-030-17127-8},
abstract = {We propose a formal model of distributed computing based on register automata
that captures a broad class of synchronous network algorithms. The local memory
of each process is represented by a finite-state controller and a fixed number
of registers, each of which can store the unique identifier of some process in
the network. To underline the naturalness of our model, we show that it has the
same expressive power as a certain extension of first-order logic on graphs
whose nodes are equipped with a total order. Said extension lets us define new
functions on the set of nodes by means of a so-called partial fixpoint
operator. In spirit, our result bears close resemblance to a classical theorem
of descriptive complexity theory that characterizes the complexity class PSPACE
in terms of partial fixpoint logic (a proper superclass of the logic we
consider here).}
}
@inproceedings{JS-lics19,
address = {Vancouver, Canada},
month = jun,
publisher = {{IEEE} Press},
editor = {Bouyer, Patricia},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 34th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'19)},
author = {Jan{\v c}ar, Petr and Schmitz, Sylvain},
title = {Bisimulation Equivalence of First-Order Grammars is
{ACKERMANN}-Complete},
pages = {1-12},
year = 2019,
doi = {10.1109/LICS.2019.8785848},
url = {https://arxiv.org/abs/1901.07170},
abstract = {Checking whether two pushdown automata with
restricted silent actions are weakly bisimilar was
shown decidable by S{\'e}nizergues (1998, 2005). We
provide the first known complexity upper bound for
this famous problem, in the equivalent setting of
first-order grammars. This ACKERMANN upper bound is
optimal, and we also show that strong bisimilarity
is primitive-recursive when the number of states of
the automata is fixed.}
}
@proceedings{JSC-pn20,
title = {{P}roceedings of the 41st {C}onference on {P}etri {N}ets ({PN}'20)},
booktitle = {{P}roceedings of the 41st {C}onference on {P}etri {N}ets ({PN}'20)},
acronym = {{PN}'20},
editor = {Chatain, Thomas and Janicki, Ryszard and Sidorova, Natalia},
publisher = {Springer},
year = 2020,
month = june,
address = {Paris, France},
url = {https://www.springer.com/gp/book/9783030518301}
}
@article{JMS-deds20,
publisher = {Springer},
journal = {Discrete Event Dynamic Systems: Theory and Applications},
author = {Lo{\"i}g Jezequel and Agnes Madalinski and Stefan Schwoon},
title = {{Distributed computation of vector clocks in Petri net unfoldings for test selection}},
volume = {30},
number = {3},
pages = {441-464},
year = {2020}
}
@article{AMP-nc20,
publisher = {Springer},
journal = {Natural Computing},
author = {Pablo Arrighi and Simon Martiel and Simon Perdrix},
title = {{Reversible causal graph dynamics: invertibility, block representation, vertex-preservation}},
volume = {19},
number = {1},
pages = {157-178},
doi = {10.1007/s11047-019-09768-0},
year = {2020},
pdf = {https://hal.archives-ouvertes.fr/hal-02400095},
url = {https://hal.archives-ouvertes.fr/hal-02400095}
}
@inproceedings{HB-types2020,
address = {Turin, Italy},
year = 2021,
volume = {188},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Ugo de Liguoro and Stefano Berardi and Thorsten Altenkirch},
acronym = {{TYPES}'20},
booktitle = {{P}roceedings of the 26th {I}nternational {C}onference on {T}ypes for {P}roofs and {P}rograms
({TYPES}'20)},
author = {Gabriel Hondet and Fr{\'e}d{\'e}ric Blanqui},
title = {{Encoding of Predicate Subtyping with Proof Irrelevance in the $\Lambda \Pi$-Calculus Modulo Theory}},
pages = {6:1--6:18},
url = {https://drops.dagstuhl.de/opus/volltexte/2021/13885/},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2021/13885/},
doi = {10.4230/LIPIcs.TYPES.2020.6}
}
@inproceedings{BKMMMP-ecai20,
address = {Santiago de Compostela, Spain},
month = sep,
optvolume = {??},
optseries = {Frontiers in Artificial Intelligence and Applications},
publisher = {{IOS} Press},
editor = {Lang, J{\'e}r{\^o}me and De Giacomo, Giuseppe and Barro and Sen{\'e}n Barro and O'Sullivan, Barry},
acronym = {{ECAI}'20},
booktitle = {{P}roceedings of the 24th {E}uropean {C}onference on
{A}rtificial {I}ntelligence ({ECAI}'20)},
author = {Patricia Bouyer and Orna Kupferman and Nicolas Markey and Bastien Maubert and Aniello Murano and Giuseppe Perelli},
title = {{Reasoning About Quality and Fuzziness of Strategic Behaviours}},
pages = {2887-2888},
year = 2020,
pdf = {https://ebooks.iospress.nl/publication/55232},
url = {https://ebooks.iospress.nl/publication/55232},
doi = {10.3233/FAIA200437}
}
@techreport{JFA-arxiv20,
author = {Jawher Jerray and
Laurent Fribourg and
{\'E}tienne Andr{\'e}},
institution = {Computing Research Repository},
month = june,
number = {2006.09993},
type = {Research Report},
title = {{Guaranteed phase synchronization of hybrid oscillators using symbolic Euler's method: The Brusselator and biped examples}},
year = {2020},
url = {https://arxiv.org/abs/2006.09993},
pdf = {https://arxiv.org/abs/2006.09993}
}
@techreport{JFA-arxiv20bis,
author = {Jawher Jerray and
Laurent Fribourg and
{\'E}tienne Andr{\'e}},
institution = {Computing Research Repository},
month = july,
number = {2007.13644},
type = {Research Report},
title = {{Robust optimal control using dynamic programming and guaranteed Euler's method}},
year = {2020},
url = {https://arxiv.org/abs/2007.13644},
pdf = {https://arxiv.org/abs/2007.13644}
}
@techreport{JF-arxiv20,
author = {Jawher Jerray and Laurent Fribourg},
institution = {Computing Research Repository},
month = december,
number = {2012.09310},
type = {Research Report},
title = {{Generation of bounded invariants via stroboscopic set-valued maps: Application to the stability analysis of parametric time-periodic systems}},
year = {2020},
url = {https://arxiv.org/abs/2012.09310},
pdf = {https://arxiv.org/abs/2012.09310}
}
@techreport{Lopez-arxiv20,
author = {Aliaume Lopez},
institution = {Computing Research Repository},
month = july,
number = {2007.07879},
type = {Research Report},
title = {{Preservation Theorems Through the Lens of Topology}},
year = {2020},
url = {https://arxiv.org/abs/2007.07879},
pdf = {https://arxiv.org/abs/2007.07879}
}
@inproceedings{Boltenhagen-bpm20,
address = {Sevilla, Spain},
month = sep,
volume = 397,
series = {Lecture Notes in Business Information Processing},
publisher = {Springer},
editor = {Adela Del-Rio-Ortega and Henrik Leopold and Flavia Maria Santoro},
acronym = {{BPM}'20},
booktitle = {{B}usiness {P}rocess {M}anagement {W}orkshops ({BPM}'20), Revised Selected Papers},
author = {Mohammadreza Fani Sani and Mathilde Boltenhagen and Wil M.P. van der Aalst},
title = {Prototype Selection using Clustering and Conformance Metrics for Process Discovery},
pages = {281-294},
year = {2020},
doi = {https://doi.org/10.1007/978-3-030-66498-5_21},
pdf = {https://link.springer.com/chapter/10.1007%2F978-3-030-66498-5_21},
url = {https://link.springer.com/chapter/10.1007%2F978-3-030-66498-5_21}
}
@article{BCC-is20,
publisher = {Elsevier Science Publishers},
journal = {Information Systems},
author = {Mathilde Boltenhagen and Thomas Chatain and Josep Carmona},
title = {Model-based trace variant analysis of event logs},
year = 2020,
doi = {https://doi.org/10.1016/j.is.2020.101675},
url = {https://www.sciencedirect.com/science/article/abs/pii/S0306437920301307?via%3Dihub},
note = {To appear}
}
@inproceedings{BCH-icpm20,
address = {Padua, Italy},
month = oct,
publisher = {SPRINGER},
acronym = {{ICPM} 2020},
booktitle = {{Process Mining Workshops (ICPM'20)}},
author = {Mathilde Boltenhagen and Benjamin Chetioui and Laurine Huber},
title = {{Cost-Based Classification of Log Traces Using Machine-Learning}},
pages = {136-148},
year = {2020},
doi = {https://doi.org/10.1007/978-3-030-72693-5_11},
pdf = {https://link.springer.com/chapter/10.1007%2F978-3-030-72693-5_11},
url = {https://link.springer.com/chapter/10.1007%2F978-3-030-72693-5_11}
}
@inproceedings{BM-lfmtp2020,
address = {Paris, France},
month = june,
year = 2020,
publisher = {ACM Press},
editor = {Claudio Sacerdoti Coen and Alwen Tiu},
acronym = {{LFMTP}'20},
booktitle = {Proceedings of the 15th {I}nternational {W}orkshop on {L}ogical {F}rameworks and
{M}eta-{L}anguages: {T}heory and {P}ractice ({LFMTP}'20)},
author = {Bruno Barras and Valentin Maestracci},
title = {{Implementation of Two Layers Type Theory in Dedukti and Application to Cubical Type Theory}},
pages = {54--67},
url = {https://arxiv.org/abs/2101.03810v1},
pdf = {https://arxiv.org/abs/2101.03810v1},
doi = {10.4204/EPTCS.332.4}
}
@inproceedings{Finkel-vpthcvs2020,
address = {Dublin, Ireland},
month = april,
year = 2020,
publisher = {Electronic Proceedings in Theoretical Computer Science},
editor = {Laurent Fribourg and Matthias Heizmann},
acronym = {{VPT/HCVS@ETAPS}'20},
booktitle = {Proceedings of 8th {I}nternational {W}orkshop on {V}erification and
{P}rogram {T}ransformation and 7th {W}orkshop on {H}orn {C}lauses for {V}erification and {S}ynthesis
({VPT/HCVS@ETAPS 2020})},
author = {Alain Finkel},
title = {{From Well Structured Transition Systems to Program Verification}},
pages = {44--49},
url = {https://arxiv.org/abs/2008.02929v1},
pdf = {https://arxiv.org/abs/2008.02929v1},
doi = {10.4204/EPTCS.320.3}
}
@inproceedings{LeRoux-cie2020,
address = {Fisciano, Italy},
month = june,
year = 2020,
volume = 12098,
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
editor = {Marcella Anselmo and Gianluca Della Vedova and Florin Manea and Arno Pauly },
acronym = {{CiE}'20},
booktitle = {{P}roceedings of the 16th {C}onference on {C}omputability in {E}urope ({CiE 2020})},
author = {Le Roux, St{\'e}phane},
title = {{Time-Aware Uniformization of Winning Strategies}},
pages = {193-204},
url = {https://link.springer.com/chapter/10.1007%2F978-3-030-51466-2_17},
pdf = {https://link.springer.com/chapter/10.1007%2F978-3-030-51466-2_17},
doi = {https://doi.org/10.1007/978-3-030-51466-2_17}
}
@article{BCC-comp21,
publisher = {Springer},
journal = {Computing},
author = {Mathilde Boltenhagen and Thomas Chatain and Josep Carmona},
title = {Optimized {SAT} encoding of conformance checking artefacts},
volume = {103},
number = {1},
pages = {29-50},
year = 2021,
doi = {10.1007/s00607-020-00831-8},
url = {https://doi.org/10.1007/s00607-020-00831-8}
}
@article{BCC-is21,
publisher = {Elsevier Science Publishers},
journal = {Information Systems},
author = {Mathilde Boltenhagen and Thomas Chatain and Josep Carmona},
title = {Anti-alignments—Measuring the precision of process models and event logs},
volume = {98},
year = 2021,
doi = {https://doi.org/10.1016/j.is.2020.101708},
url = {https://doi.org/10.1016/j.is.2020.101708},
note = {To appear}
}
@inproceedings{BDJKM-csl21,
address = {online},
month = may,
publisher = {{IEEE} Press},
editor = {Alina Oprea and Thorsten Holz},
acronym = {{S\&P}'21},
booktitle = {{P}roceedings of the 42nd IEEE Symposium on Security and Privacy
({S\&P}'21)},
author = {Baelde, David and Delaune, St{\'e}phanie and Jacomme, Charlie and
Koutsos, Adrien and Moreau, Sol{\`e}ne},
title = {An {I}nteractive {P}rover for {P}rotocol {V}erification in the {C}omputational {M}odel},
year = {2021},
pdf = {https://hal.archives-ouvertes.fr/hal-03172119},
url = {https://hal.archives-ouvertes.fr/hal-03172119},
note = {To appear}
}
@phdthesis{baelde-hdr2021,
author = {Baelde, David},
title = {Contributions to the {V}erification of {C}ryptographic {P}rotocols},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {M{\'e}moire d'habilitation},
year = 2021,
month = feb,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Baelde-Hab2021.pdf},
url = {http://www.lsv.fr/~baelde/hdr/index.html}
}
@article{BLRPR-ic21,
author = {Bruy{\`e}re, V{\'e}ronique and Le Roux, St{\'e}phane and Pauly, Arno
and Raskin, Jean{-}Fran{\c{c}}ois},
title = {On the existence of weak subgame perfect equilibria},
volume = {276},
year = 2021,
doi = {https://doi.org/10.1016/j.ic.2020.104553},
url = {https://www.sciencedirect.com/science/article/pii/S0890540120300419?via%3Dihub}
}
@article{BBFLMR-fac21,
publisher = {Springer},
journal = {Formal Aspects of Computing},
author = {Bacci, Giovanni and
Bouyer, Patricia and
Fahrenberg, Uli and
Larsen, Kim and
Markey, Nicolas and
Reynier, Pierre{-}Alain},
title = {Optimal and robust controller synthesis using energy timed automata
with uncertainty},
volume = {33},
pages = {3--25},
year = 2021,
doi = {10.1007/s00165-020-00521-4},
url = {https://link.springer.com/article/10.1007/s00165-020-00521-4}
}
@article{DFM-jlc21,
publisher = {Oxford University Press},
journal = {Journal of Logic and Computation},
author = {Demri, St{\'e}phane and Fervari, Raul and Mansutti, Alessio},
title = {Internal proof calculi for modal logics with separating conjunction},
year = 2021,
note = {Accepted for publication to the Special issue of JLC on
External and Internal Calculi for Non Classical Logics.},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DFM-jlc21.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DFM-jlc21.pdf}
}
@article{DLM-jlc21,
publisher = {ACM Press},
journal = {ACM Transactions on Computational Logic},
author = {Demri, St{\'e}phane and {\'E}tienne Lozes and Mansutti, Alessio},
title = {The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic},
year = 2021,
note = {To appear},
url = {http://arxiv.org/abs/1810.05410},
pdf = {http://arxiv.org/abs/1810.05410}
}
@phdthesis{thire-phd2020,
author = {Thir{\'e}, Fran{\c{c}}ois},
title = {{Meta-theory of Cumulative Types Systems and their embeddings to the $\Lambda \Pi$-calculus modulo theory}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2020,
month = dec,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/thire-phd20.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/thire-phd20.pdf}
}
@inproceedings{GH-stacs21,
address = {Saarbr{\"u}cken, Germany},
month = mar,
volume = {187},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Markus Bl{\"a}ser and Benjamin Monmege},
acronym = {{STACS}'21},
booktitle = {{P}roceedings of the 38th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'21)},
author = {G{\"o}ller, Stefan and Hilaire, Mathieu},
title = {{Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete}},
year = {2021},
doi = {10.4230/LIPIcs.STACS.2021.36},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2021/13681/pdf/LIPIcs-STACS-2021-36.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13681}
}
@article{GMG-fi20,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {Gastin, Paul and Manuel, Amaldev and Govind, R.},
title = {{Reversible Regular Languages: Logical and Algebraic Characterisations}},
year = {2020},
note = {To appear}
}
@phdthesis{fortin-phd2020,
author = {Fortin, Marie},
title = {{Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2020,
month = nov,
url = {https://tel.archives-ouvertes.fr/tel-03079438},
pdf = {https://tel.archives-ouvertes.fr/tel-03079438/document}
}
@phdthesis{Mansutti-phd2020,
author = {Mansutti, Alessio},
title = {{Reasoning with Separation Logics: Complexity, Expressive Power, Proof Systems}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2020,
month = dec,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/mansutti-phd20.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/mansutti-phd20.pdf}
}
@phdthesis{Genestier-phd2020,
author = {Genestier, Guillaume},
title = {{Dependently-Typed Termination and Embedding of Extensional Universe-Polymorphic Type Theory
using Rewriting}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2020,
month = dec,
opturl = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/genestier-phd20.pdf},
optpdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/genestier-phd20.pdf}
}
@article{FHK-deds20,
publisher = {Springer},
journal = {Discrete Event Dynamic Systems: Theory and Applications},
author = {Alain Finkel and Serge Haddad and Igor Khmelnitsky},
title = {{Commodification of accelerations for the Karp and Miller Construction}},
doi = {10.1007/s10626-020-00331-z},
year = {2020},
url = {https://link.springer.com/article/10.1007/s10626-020-00331-z}
}
@article{BHL-deds20,
publisher = {Springer},
journal = {Discrete Event Dynamic Systems: Theory and Applications},
author = {Nathalie Bertrand and Serge Haddad and Engel Lefaucheux},
title = {{Diagnosis and Degradation Control for Probabilistic Systems}},
volume = {30},
pages = {695–723},
doi = {10.1007/s10626-020-00320-2},
year = {2020},
url = {https://link.springer.com/article/10.1007/s10626-020-00320-2}
}
@article{FG-mscs20,
publisher = {Cambridge University Press},
journal = {Mathematical Structures in Computer Science},
author = {Finkel, Alain and Goubault{-}Larrecq, Jean},
title = {{Forward analysis for WSTS, part I: completions}},
volume = {30},
number = {7},
pages = {752-832},
doi = {10.1017/S0960129520000195},
year = {2020},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FG-mscs2020.pdf},
url = {http://dx.doi.org/10.1017/S0960129520000195}
}
@article{FP-lmcs20,
journal = {Logical Methods in Computer Science},
author = {Finkel, Alain and Praveen, M.},
title = {{Verification of Flat FIFO Systems}},
volume = {20},
number = {4},
doi = {10.23638/LMCS-16(4:4)2020},
year = {2020},
month = oct,
url = {https://lmcs.episciences.org/6839}
}
@proceedings{GLB-fossacs20,
title = {{P}roceedings of the 23rd {C}onference on {F}oundations of {S}oftware {S}cience and {C}omputation {S}tructures
({FoSSaCS}'20)},
booktitle = {{P}roceedings of the 23rd {C}onference on {F}oundations of {S}oftware {S}cience and {C}omputation
{S}tructures ({FoSSaCS}'20)},
acronym = {{FoSSaCS}'20},
editor = {Goubault{-}Larrecq, Jean and K{\"{o}}nig, Barbara},
publisher = {Springer},
year = 2020,
month = april,
address = {Dublin, Ireland},
url = {https://link.springer.com/book/10.1007/978-3-030-45231-5}
}
@techreport{KY-arxiv20,
author = {Khmelnitsky, Igor and
Neider, Daniel and
Roy, Rajarshi and
Barbot, Beno{\^{\i}}t and
Bollig, Benedikt and
Finkel, Alain and
Haddad, Serge and
Leucker, Martin and
Ye, Lina },
institution = {Computing Research Repository},
month = sep,
number = {2009.10610},
type = {Research Report},
title = {Property-Directed Verification of Recurrent Neural Networks},
year = {2020},
url = {https://arxiv.org/abs/2009.10610},
pdf = {https://arxiv.org/pdf/2009.10610.pdf}
}
@article{BJO-tcs20,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Blanqui, Fr{\'{e}}d{\'{e}}ric and
Jouannaud, Jean{-}Pierre and
Okada, Mitsuhiro},
title = {Corrigendum to {\em {I}nductive-data-type systems} [Theoret. Comput. Sci.
272 {(1-2)} {(2002)} 41-68]},
volume = {817},
pages = {81--82},
doi = {10.1016/j.tcs.2018.01.010},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2018.01.010}
}
@techreport{DD-arxiv20,
author = {D{\'{\i}}az{-}Caro, Alejandro and Dowek, Gilles},
institution = {Computing Research Repository},
month = jul,
number = {2002.03762v3},
type = {Research Report},
title = {Extensional proofs in a propositional logic modulo isomorphisms},
year = {2020},
url = {https://arxiv.org/abs/2002.03762},
pdf = {https://arxiv.org/pdf/2002.03762v3.pdf}
}
@article{DDR-biosys19,
publisher = {Elsevier Science Publishers},
journal = {Biosystems},
author = {D{\'{\i}}az{-}Caro, Alejandro and Dowek, Gilles and Rinaldi, Juan Pablo},
title = {Two linearities for quantum computing in the lambda calculus},
volume = {186},
doi = {10.1016/j.biosystems.2019.104012},
year = {2019},
url = {10.1016/j.biosystems.2019.104012}
}
@inproceedings{DM-csl21,
address = {Ljubljana, Slovenia},
month = jan,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Baier, Christel and Goubault{-}Larrecq, Jean},
acronym = {{CSL}'21},
booktitle = {{P}roceedings of the 29th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'21)},
author = {Dinis, Bruno and Miquey, {\'E}tienne},
title = {Realizability with stateful computations for nonstandard analysis},
pages = {19:1-19:23},
year = {2021},
doi = {10.4230/LIPIcs.CSL.2021.19},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2021/13453/},
url = {https://drops.dagstuhl.de/opus/volltexte/2021/13453/}
}
@inproceedings{Lopez-csl21,
address = {Ljubljana, Slovenia},
month = jan,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Baier, Christel and Goubault{-}Larrecq, Jean},
acronym = {{CSL}'21},
booktitle = {{P}roceedings of the 29th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'21)},
author = {Aliaume Lopez},
title = {Preservation {T}heorems {T}hrough the {L}ens of {T}opology},
pages = {32:1-32:17},
year = {2021},
doi = {10.4230/LIPIcs.CSL.2021.32},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2021/13466/},
url = {https://drops.dagstuhl.de/opus/volltexte/2021/13466/}
}
@inproceedings{Schnoebelen-csl21,
address = {Ljubljana, Slovenia},
month = jan,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Baier, Christel and Goubault{-}Larrecq, Jean},
acronym = {{CSL}'21},
booktitle = {{P}roceedings of the 29th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'21)},
author = {{\relax Ph}ilippe Schnoebelen},
title = {On flat lossy channel machines},
pages = {37:1-37:22},
year = {2021},
doi = {10.4230/LIPIcs.CSL.2021.37},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2021/13471/},
url = {https://drops.dagstuhl.de/opus/volltexte/2021/13471/}
}
@article{PKCH-natcommun20,
publisher = {Nature Research},
journal = {Nature Communications},
author = {Lo{\"i}c Paulev{\'e} and Juraj Kolc{\'a}k and Thomas Chatain and Stefan Haar},
title = {Reconciling qualitative, abstract, and scalable modeling of biological networks},
volume = {11},
number = {4256},
month = aug,
doi = {10.1038/s41467-020-18112-5},
year = {2020},
url = {https://www.nature.com/articles/s41467-020-18112-5}
}
@inproceedings{HPS-cmsb20,
address = {held online},
month = sep,
volume = {12314},
series = {Lecture Notes in Bioinformatics},
publisher = {Springer-Verlag},
editor = {Alessandro Abate and Tatjana Petrov and Verena Wolf},
acronym = {{CMSB}'20},
booktitle = {{P}roceedings of the 18th
{C}onference on
{C}omputational {M}ethods in {S}ystem {B}iology
({CMSB}'20)},
author = {Stefan Haar and Lo{\"i}c Paulev{\'e} and Stefan Schwoon},
title = {{Drawing the Line: Basin Boundaries in Safe Petri Nets}},
pages = {321-336},
year = {2020},
doi = {10.1007/978-3-030-60327-4\_17}
}
@inproceedings{CJS-ccs20,
address = {Orlando, USA},
month = nov,
publisher = {ACM Press},
editor = {Jonathan Katz and Giovanni Vigna},
acronym = {{CCS}'20},
booktitle = {{P}roceedings of the 27th {ACM} {C}onference
on {C}omputer and {C}ommunications {S}ecurity
({CCS}'20)},
author = {Hubert Comon and Charlie Jacomme and Guillaume Scerri},
title = {Oracle simulation: a technique for protocol composition with long term shared secrets},
pages = {1427-1444},
year = {2020},
doi = {10.1145/3372297.3417229}
}
@inproceedings{BRS-csl21,
address = {Ljubljana, Slovenia},
month = jan,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Baier, Christel and Goubault{-}Larrecq, Jean},
acronym = {{CSL}'21},
booktitle = {{P}roceedings of the 29th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'21)},
author = {Benedikt Bollig and Fedor Ryabinin and Arnaud Sangnier},
title = {Reachability in Distributed Memory Automata},
pages = {13:1-13:16},
year = {2021},
doi = {10.4230/LIPIcs.CSL.2021.13},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2021/13447/},
url = {https://drops.dagstuhl.de/opus/volltexte/2021/13447/}
}
@inproceedings{HHSY-fsttcs20,
address = {Goa, India},
month = dec,
volume = {182},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Nitin Saxena and Sunil Simon},
acronym = {{FSTTCS}'20},
booktitle = {{P}roceedings of the 40th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'20)},
author = {Stefan Haar and Serge Haddad and Stefan Schwoon and Lina Ye},
title = {Active Prediction for Discrete Event Systems},
pages = {48:1--48:16},
year = {2020},
doi = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.48},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/13289/pdf/LIPIcs-FSTTCS-2020-48.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13289}
}
@inproceedings{BBM-fsttcs20,
address = {Goa, India},
month = dec,
volume = {182},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Nitin Saxena and Sunil Simon},
acronym = {{FSTTCS}'20},
booktitle = {{P}roceedings of the 40th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'20)},
author = {Nathalie Bertrand and Patricia Bouyer and Anirban Majumdar},
title = {Synthesizing safe coalition strategies},
pages = {39:1--39:17},
year = {2020},
doi = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.39},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/13280/pdf/LIPIcs-FSTTCS-2020-39.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13280}
}
@inproceedings{BBRRV-fsttcs20,
address = {Goa, India},
month = dec,
volume = {182},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Nitin Saxena and Sunil Simon},
acronym = {{FSTTCS}'20},
booktitle = {{P}roceedings of the 40th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'20)},
author = {Paul Gastin and Sayan Mukherjee and B Srivathsan},
title = {Reachability for updatable timed automata made faster and more effective},
pages = {47:1--47:17},
year = {2020},
doi = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.47},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/13288/pdf/LIPIcs-FSTTCS-2020-47.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13288}
}
@inproceedings{AG-fsttcs20,
address = {Goa, India},
month = dec,
volume = {182},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Nitin Saxena and Sunil Simon},
acronym = {{FSTTCS}'20},
booktitle = {{P}roceedings of the 40th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'20)},
author = {C. Aiswarya and Paul Gastin},
title = {Weighted Tiling Systems for Graphs: Evaluation Complexity},
year = {2020},
doi = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.34},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/13275/pdf/LIPIcs-FSTTCS-2020-34.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13275}
}
@techreport{DLM-arxiv20,
author = {St{\'e}phane Demri and {\'E}tienne Lozes and Alessio Mansutti},
institution = {Computing Research Repository},
month = feb,
note = {63~pages},
number = {2006.05156v2},
type = {Research Report},
title = {A {C}omplete {A}xiomatisation for {Q}uantifier-{F}ree {S}eparation {L}ogic},
year = {2021},
url = {https://arxiv.org/abs/2006.05156},
pdf = {https://arxiv.org/pdf/2006.05156v2.pdf}
}
@inproceedings{ADL-aaai20,
month = feb,
publisher = {AAAI Press},
editor = {Rossi, Francesca and Conitzer, Vincent and Sha, Fei},
acronym = {{AAAI}'20},
booktitle = {{P}roceedings of the 34th {AAAI} {C}onference on {A}rtificial
{I}ntelligence ({AAAI}'20)},
author = {Alechina, Natasha and Demri, St{\'e}phane and Logan, Brian},
title = {Parameterised Resource-Bounded ATL},
pages = {7040--7046},
year = {2020},
doi = {https://doi.org/10.1609/aaai.v34i05.6189},
url = {https://aaai.org/ojs/index.php/AAAI/article/view/6189}
}
@inproceedings{BBRRV-gandalf20,
address = {Brussels, Belgium},
month = sep,
volume = {326},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Bresolin, Davide and Raskin, Jean-Fran\c{c}ois},
acronym = {{GandALF}'20},
booktitle = {{P}roceedings of the 11th {I}nternational {S}ymposium
on {G}ames, {A}utomata, {L}ogics, and {F}ormal {V}erification
({GandALF}'20)},
author = {Bouyer, Patricia and Brihaye, Thomas and Randour, Mickael and Rivi{\`e}re, C{\'e}dric and Vandenhove, Pierre},
title = {Decisiveness of Stochastic Systems and its Application to Hybrid Models},
pages = {149?165},
year = {2020},
doi = {10.4204/EPTCS.326.10},
pdf = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2020.10.pdf},
url = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2020.10}
}
@inproceedings{BBBFS-gandalf20,
address = {Brussels, Belgium},
month = sep,
volume = {326},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Bresolin, Davide and Raskin, Jean-Fran\c{c}ois},
acronym = {{GandALF}'20},
booktitle = {{P}roceedings of the 11th {I}nternational {S}ymposium
on {G}ames, {A}utomata, {L}ogics, and {F}ormal {V}erification
({GandALF}'20)},
author = {B{\'e}atrice B{\'e}rard and
Benedikt Bollig and
Patricia Bouyer and
Matthias F{\"u}gger and
Nathalie Sznajder},
title = {Synthesis in Presence of Dynamic Links},
pages = {33?49},
year = {2020},
doi = {10.4204/EPTCS.326.3},
pdf = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2020.3.pdf},
url = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2020.3}
}
@inproceedings{DH-atpn20,
address = {Vienna, Austria},
month = sep,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = { Nathalie Bertrand and Nils Jansen},
acronym = {{FORMATS}'20},
booktitle = {{P}roceedings of the 18th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'20)},
author = {Susanna Donatelli and Serge Haddad},
title = {Guarded Autonomous Transitions Increase Conciseness and Expressiveness of Timed Automata},
pages = {215--230},
year = {2020},
url = {https://link.springer.com/chapter/10.1007%2F978-3-030-57628-8_13}
}
@inproceedings{DFHKNS-disc20,
address = {Freiburg, Germany},
month = oct,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Hagit Attiya},
acronym = {{DISC}'20},
booktitle = {{P}roceedings of the 34th {I}nternational
{S}ymposium on {D}istributed {C}omputing
({DISC}'20)},
author = {Da{-}Jung Cho and
Matthias F{\"{u}}gger and
Corbin Hopper and
Manish Kushwaha and
Thomas Nowak and
Quentin Soubeyran},
title = {Distributed Computation with Continual Population Growth},
pages = {7:1--7:17},
year = {2020},
doi = {https://doi.org/10.4230/LIPIcs.DISC.2020.7},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/13085/pdf/LIPIcs-DISC-2020-7.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13085}
}
@article{BFG-lmcs20,
journal = {Logical Methods in Computer Science},
author = {Michael Blondin and Alain Finkel and Jean Goubault{-}Larrecq},
title = {{Forward Analysis for WSTS, Part {III:} Karp-Miller Trees}},
volume = {16},
number = {2},
doi = {10.23638/LMCS-16(2:13)2020},
year = {2020},
url = {https://lmcs.episciences.org/6591}
}
@article{DGN-ic20,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Dave, Vrunda and Gastin, Paul and Krishna, Shankara Narayanan},
title = {Regular Transducer Expressions for Regular Transformations},
year = {2020},
url = {https://doi.org/10.1016/j.ic.2020.104655},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DGK20-IC-final.pdf}
}
@inproceedings{DFG-mfcs20,
address = {Prague, Czech Republic},
month = aug,
volume = {170},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Javier Esparza and Dan Kr{\'a}l},
acronym = {{MFCS}'20},
booktitle = {{P}roceedings of the 43rd
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'20)},
author = {Dou{\'e}neau-Tabot, Ga{\"e}tan and Filiot, Emmanuel and Gastin, Paul},
title = {Register transducers are marble transducers},
pages = {29:1--29:14},
year = 2020,
doi = {https://doi.org/10.4230/LIPIcs.MFCS.2020.29},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/12697/pdf/LIPIcs-MFCS-2020-29.pdf},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12697/}
}
@inproceedings{BLORV-concur20,
address = {Vienna, Austria},
month = sep,
volume = {171},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Igor Konnov and Laura Kovacs},
acronym = {{CONCUR}'20},
booktitle = {{P}roceedings of the 31st
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'20)},
author = {Bouyer, Patricia and Le Roux, St{\'e}phane and Oualhadj, Youssouf and Randour, Mickael and Vandenhove, Pierre},
title = {Games Where You Can Play Optimally with Arena-Independent Finite Memory},
pages = {24:1--24:22},
year = 2020,
doi = {10.4230/LIPIcs.CONCUR.2020.24},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12836}
}
@inproceedings{AGSW-concur20,
address = {Vienna, Austria},
month = sep,
volume = {171},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Igor Konnov and Laura Kovacs},
acronym = {{CONCUR}'20},
booktitle = {{P}roceedings of the 31st
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'20)},
author = {Bharat Adsul and Paul Gastin and Saptarshi Sarkar and Pascal Weil},
title = {Wreath/cascade products and related decomposition results for the concurrent setting of {M}azurkiewicz traces},
pages = {19:1--19:17},
year = 2020,
doi = {10.4230/LIPIcs.CONCUR.2020.19},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12831}
}
@inproceedings{BDM-concur20,
address = {Vienna, Austria},
month = sep,
volume = {171},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Igor Konnov and Laura Kovacs},
acronym = {{CONCUR}'20},
booktitle = {{P}roceedings of the 31st
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'20)},
author = {Benedikt Bollig and Alain Finkel and Amrita Suresh},
title = {Bounded Reachability Problems are Decidable in {FIFO} Machines},
pages = {49:1--49:17},
year = 2020,
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12861}
}
@article{BFG-jcss20,
publisher = {Elsevier Science Publishers},
journal = {Journal of Computer and System Sciences},
author = {Benedikt Bollig and Marie Fortin and Paul Gastin},
title = {Communicating Finite-State Machines, First-Order Logic, and Star-Free Propositional Dynamic Logic},
pages = {22-53},
doi = {10.1016/j.jcss.2020.06.006},
year = {2020},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFG20-JCSS.pdf},
abstract = {Message sequence charts (MSCs) naturally arise as executions of communicating
finite-state machines (CFMs), in which finite-state processes exchange
messages through unbounded FIFO channels. We study the first-order logic of
MSCs, featuring Lamport's happened-before relation. To this end, we introduce a star-free
version of propositional dynamic logic (PDL) with loop and converse. Our main
results state that (i) every first-order sentence can be transformed into an
equivalent star-free PDL sentence (and conversely), and (ii) every star-free
PDL sentence can be translated into an equivalent CFM. This answers an open
question and settles the exact relation between CFMs and fragments of monadic
second-order logic. As a byproduct, we show that first-order logic over MSCs
has the three-variable property.}
}
@inproceedings{BDM-csf20,
address = {Boston, MA, USA},
month = jul,
publisher = {{IEEE} Computer Society Press},
editor = {Jia, Limin and K{\"u}sters, Ralf},
acronym = {{CSF}'19},
booktitle = {{P}roceedings of the
33rd {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'20)},
author = {David Baelde and St{\'e}phanie Delaune and Sol{\`e}ne Moreau},
title = {A Method for Proving Unlinkability of Stateful Protocols},
pages = {169--183},
year = 2020,
url = {https://hal.archives-ouvertes.fr/hal-02459984/},
abstract = {The rise of contactless and wireless devices such as mobile phones and RFID chips justifies significant concerns over privacy, and calls for communication protocols that ensure some form of unlinkability. Formally specifying this property is difficult and context-dependent, and analysing it is very complex; as is common with security protocols, several incorrect unlinkability claims can be found in the literature. Formal verification is therefore desirable, but current techniques are not sufficient to directly analyse unlinkability. In [Hirschi et al., SP'19], two conditions have been identified that imply unlinkability and can be automatically verified. This work, however, only considers a restricted class of protocols. We adapt their formal definition as well as their proof method to the common setting of RFID authentication protocols, where readers access a central database of authorised users. Moreover, we also consider protocols where readers may update their database, and tags may also carry a mutable state. We propose sufficient conditions to ensure unlinkability, find new attacks, and obtain new proofs of unlinkability using Tamarin to establish our sufficient conditions.}
}
@article{JGL-topa2020,
publisher = {Elsevier Science Publishers},
journal = {Topology and its Applications},
author = {Goubault{-}Larrecq, Jean},
title = {{Some Topological Properties of Spaces of Lipschitz Continuous Maps on Quasi-Metric Spaces}},
volume = {282},
year = 2020,
doi = {10.1016/j.topol.2020.107281},
url = {https://doi.org/10.1016/j.topol.2020.107281}
}
@mastersthesis{m2-Doueneau,
author = {Ga{\"e}tan Dou{\'e}neau-Tabot},
title = {{Register Models for Pebble Transducers and Applications to Optimization}},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2019},
month = sep
}
@mastersthesis{m2-Grienenberger,
author = {Emilie Grienenberger},
title = {{Concept alignment in Logipedia - Alignement of logical connectives between HOL Light and Dedukti}},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2019},
month = sep
}
@mastersthesis{m2-Lopez,
author = {Aliaume Lopez},
title = {Th{\'e}or{\`e}mes de pr{\'e}servation},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2019},
month = sep
}
@mastersthesis{m2-Suresh,
author = {Amrita Suresh},
title = {{Termination, boundedness and reachability for input-bounded FIFO Machines}},
school = {{M}aster {P}arisien de {R}echerche en
{I}nformatique, Paris, France},
type = {Rapport de {M}aster},
year = {2019},
month = sep
}
@phdthesis{jaziri-phd2019,
author = {Samy Jaziri},
title = {{Automata on Timed Structures}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2019,
month = sep,
url = {https://tel.archives-ouvertes.fr/tel-02384274},
pdf = {https://tel.archives-ouvertes.fr/tel-02384274/document}
}
@phdthesis{bury-phd2019,
author = {Guillaume Bury},
title = {{Integrating rewriting, tableau and superposition into SMT}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2019,
month = may,
url = {https://tel.archives-ouvertes.fr/tel-02612985},
pdf = {https://tel.archives-ouvertes.fr/tel-02612985/document}
}
@phdthesis{mandon-phd2019,
author = {Hugues Mandon},
title = {{Algorithms for Cell Reprogramming Strategies in Boolean Networks}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2019,
month = dec,
url = {https://tel.archives-ouvertes.fr/tel-02412717},
pdf = {https://hal.archives-ouvertes.fr/tel-02412717/document}
}
@phdthesis{lick-phd2019,
author = {Anthony Lick},
title = {{XPath-like Query Logics: Proof Systems and Real-World Applicability}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2019,
month = jul,
url = {https://tel.archives-ouvertes.fr/tel-02276423},
pdf = {https://tel.archives-ouvertes.fr/tel-02276423/document}
}
@phdthesis{saoud-phd2019,
author = {Adnane Saoud},
title = {{Compositional and Efficient Controller Synthesis for Cyber-Physical Systems}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2019,
month = oct,
url = {https://tel.archives-ouvertes.fr/tel-02317723},
pdf = {https://tel.archives-ouvertes.fr/tel-02317723/document}
}
@phdthesis{koutsos-phd2019,
author = {Adrien Koutsos},
title = {Preuves symboliques de propri{\'e}t{\'e}s d'indistinguabilit{\'e} calculatoire},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2019,
month = sep,
url = {https://tel.archives-ouvertes.fr/tel-02317745},
pdf = {https://tel.archives-ouvertes.fr/tel-02317745/document}
}
@phdthesis{gonzalez-phd2019,
author = {Gonz{\'a}lez, Mauricio},
title = {{Stochastic Games on Graphs with Applications to Smart-Grids Optimization}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2019,
month = nov,
url = {http://www.theses.fr/2019SACLN064},
pdf = {http://www.lsv.fr/~gonzalez/phd/Thesis_Gonzalez_V2_2.pdf}
}
@article{LRP-dga20,
publisher = {Springer},
journal = {Dynamic Games and Applications},
author = {Le Roux, St{\'e}phane and Pauly, Arno},
title = {A Semi-Potential for Finite and Infinite Games in Extensive Form},
volume = {10},
number = {1},
pages = {120-144},
year = 2020,
doi = {10.1007/s13235-019-00301-7},
url = {https://doi.org/10.1007/s13235-019-00301-7}
}
@inproceedings{AVLRM-sac20,
address = {Brno, Czech Republic},
month = mar,
publisher = {ACM Press},
editor = {Chih{-}Cheng Hung and Tom{\'{a}}s Cern{\'{y}} and Dongwan Shin and Alessio Bechini},
acronym = {{SAC}'20},
booktitle = {{P}roceedings of the 35th {ACM/SIGAPP} {S}ymposium on {A}pplied {C}omputing ({SAC}'20)},
author = {Nikolaos Alexopoulos and Emmanouil Vasilomanolakis and St{\'e}phane {Le Roux} and Steven Rowe and Max M{\"u}hlh{\"a}user},
title = {{TRIDEnT}: Towards a Decentralized Threat Indicator Marketplace},
pages = {332-341},
year = {2020},
doi = {10.1145/3341105.3374020},
url = {https://doi.org/10.1145/3341105.3374020}
}
@inproceedings{ZSGF-ecc19,
address = {Naples, Italy},
month = jun,
publisher = {{IEEE} Press},
acronym = {{ECC}'19},
booktitle = {{P}roceedings of the 18th {E}uropean {C}ontrol {C}onference ({ECC}'19)},
author = {Daniele Zonetti and Adnane Saoud and Antoine Girard and Laurent Fribourg},
title = {A symbolic approach to voltage stability and power sharing in time-varying{DC} microgrids},
pages = {903-909},
year = {2019},
doi = {10.23919/ECC.2019.8796095},
url = {https://doi.org/10.23919/ECC.2019.8796095}
}
@inproceedings{CF-cyphy19,
address = {New York City, NY, USA},
month = oct,
editor = {Roger D. Chamberlain and Martin Grimheden and Walid Taha},
volume = {11971},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
noeditor = {},
acronym = {{CyPhy/WESE}'19},
booktitle = {9th International Workshop on Cyber Physical Systems ({CyPhy}'19) and 15th International Workshop on Model-Based Design ({WESE}'19), Revised Selected Papers},
author = {Adrien {Le Co{\"{e}}nt} and Laurent Fribourg},
title = {Guaranteed Optimal Reachability Control of Reaction-Diffusion Equations Using One-Sided Lipschitz Constants and Model Reduction},
pages = {181-202},
year = {2019},
doi = {10.1007/978-3-030-41131-2_9},
url = {https://doi.org/10.1007/978-3-030-41131-2_9}
}
@inproceedings{DFKN-dsd19,
address = {Kallithea, Greece},
month = aug,
publisher = {{IEEE} Press},
noeditor = {},
acronym = {{DSD}'19},
booktitle = {{P}roceedings of the 22nd {E}uromicro {C}onference on {D}igital {S}ystem {D}esign ({DSD}'19)},
author = {Jean{-}Luc Danger and Laurent Fribourg and Ulrich K{\"u}hne and Maha Naceur},
title = {LAOCO{\"O}N: {A} Run-Time Monitoring and Verification Approach for Hardware Trojan Detection},
pages = {269-276},
year = {2019},
doi = {10.1109/DSD.2019.00047},
url = {https://doi.org/10.1109/DSD.2019.00047}
}
@inproceedings{CF-cdc19,
address = {Nice, France},
month = dec,
publisher = {{IEEE} Control System Society},
noeditor = {},
acronym = {{CDC}'19},
booktitle = {{P}roceedings of the 58th {IEEE} {C}onference on
{D}ecision and {C}ontrol ({CDC}'19)},
author = {Adrien {Le Co{\"e}nt} and Laurent Fribourg},
title = {Guaranteed Control of Sampled Switched Systems using Semi-Lagrangian Schemes and One-Sided Lipschitz Constants},
pages = {599-604},
year = {2019},
doi = {10.1109/CDC40024.2019.9029376},
pdf = {https://arxiv.org/pdf/1903.05882.pdf},
url = {https://doi.org/10.1109/CDC40024.2019.9029376}
}
@inproceedings{ACFJL-acsd19,
address = {Aachen, Germany},
month = jun,
publisher = {{IEEE} Computer Society Press},
editor = {J{\"o}rg Keller and Wojciech Penczek},
acronym = {{ACSD}'19},
booktitle = {{P}roceedings of the 19th {I}nternational
{C}onference on {A}pplication of {C}oncurrency
to {S}ystem {D}esign
({ACSD}'19)},
author = {{\'E}tienne Andr{\'e} and Emmanuel Coquard and Laurent Fribourg and Jawher Jerray and David Lesens},
title = {Parametric Schedulability Analysis of a Launcher Flight Control System Under Reactivity Constraints},
pages = {13-22},
year = {2019},
doi = {10.1109/ACSD.2019.00006},
url = {https://doi.org/10.1109/ACSD.2019.00006}
}
@proceedings{CG-fsttcs2019,
address = {Bombay, India},
month = dec,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Arkadev Chattopadhyay and Paul Gastin},
acronym = {{FSTTCS}'19},
booktitle = {{P}roceedings of the 39th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'19)},
title = {{P}roceedings of the 39th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'19)},
author = {Arkadev Chattopadhyay and Paul Gastin},
year = {2019},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-131-3}
}
@article{CFLS-ppet20,
author = {Sergiu Carpov and Caroline Fontaine and Damien Ligier and Renaud Sirdey},
title = {{Illuminating the Dark or how to recover what should not be seen in FE-based classifiers}},
pages = {1-35},
year = {2020},
month = may,
volume = {2020},
issue = {2},
doi = {10.2478/popets-2020-0015},
url = {https://content.sciendo.com/view/journals/popets/2020/2/article-p5.xml}
}
@inproceedings{BCC-bpm19,
address = {Vienna, Austria},
month = sep,
volume = 362,
series = {Lecture Notes in Business Information Processing},
publisher = {Springer},
editor = {Chiara Di Francescomarino and Remco M. Dijkman and Uwe Zdun},
acronym = {{BPM}'19},
booktitle = {{B}usiness {P}rocess {M}anagement {W}orkshops ({BPM}'19), Revised Selected Papers},
author = {Mathilde Boltenhagen and Thomas Chatain and Josep Carmona},
title = {Encoding Conformance Checking Artefacts in {SAT}},
pages = {160-171},
year = {2019},
doi = {10.1007/978-3-030-37453-2_14},
pdf = {https://hal.inria.fr/hal-02419980/document},
url = {https://doi.org/10.1007/978-3-030-37453-2_14}
}
@article{ACCD-tpnomc19,
publisher = {Springer},
journal = {Transactions on Petri Nets and Other Models of Concurrency},
author = {Wil M. P. van der Aalst and
Josep Carmona and
Thomas Chatain and
Boudewijn F. van Dongen},
title = {A Tour in Process Mining: From Practice to Algorithmic Challenges},
pages = {1-35},
year = {2019},
volume = {14},
doi = {10.1007/978-3-662-60651-3_1},
url = {https://doi.org/10.1007/978-3-662-60651-3_1}
}
@proceedings{DH-pn2019,
author = {Susanna Donatelli and Stefan Haar},
editor = {Susanna Donatelli and Stefan Haar},
title = {Proceedings of the 40th International Conference on Application and Theory of Petri Nets and Concurrency ({PETRI NETS}'19)},
booktitle = {Proceedings of the 40th International Conference on Application and Theory of Petri Nets and Concurrency ({Petri Nets}'19)},
month = jun,
series = {Lecture Notes in Computer Science},
volume = {11522},
publisher = {Springer},
year = {2019},
address = {Aachen, Germany},
url = {https://doi.org/10.1007/978-3-030-21571-2},
doi = {10.1007/978-3-030-21571-2}
}
@inproceedings{OMFS-patmos19,
address = {Rhodes, Greece},
month = jul,
publisher = {{IEEE} Press},
acronym = {{PATMOS}'19},
booktitle = {{P}roceedings of the 29th {I}nternational {S}ymposium on {P}ower and {T}iming {M}odeling, {O}ptimization
and {S}imulation ({PATMOS}'19)},
author = {Daniel {\"O}hlinger and J{\"u}rgen Maier and Matthias F{\"u}gger and Ulrich Schmid},
title = {The Involution Tool for Accurate Digital Timingand Power Analysis},
pages = {1-8},
year = {2019},
doi = {10.1109/PATMOS.2019.8862165},
url = {https://doi.org/10.1109/PATMOS.2019.8862165}
}
@article{FNNS-tcad19,
publisher = {{IEEE} Circuits and Systems Society},
journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits
and Systems},
author = {Matthias F{\"u}gger and Robert Najvirt and Thomas Nowak and Ulrich Schmid},
title = {A faithful binary circuit model},
doi = {10.1109/TCAD.2019.2937748},
year = {2019},
url = {https://ieeexplore.ieee.org/document/8818370}
}
@article{BFLM-tcsi20,
publisher = {{IEEE} Press},
journal = {IEEE Transactions on Circuits and Systems I},
author = {Johannes Bund and Matthias F{\"u}gger and Christoph Lenzen and Moti Medina},
title = {Synchronizer-free Digital Link Controller},
volume = {67},
number = {10},
pages = {3562-3573},
year = {2020},
doi = {10.1109/TCSI.2020.2989552},
url = {https://ieeexplore.ieee.org/document/9085899}
}
@incollection{FKN-AiSB2020,
publisher = {Springer},
booktitle = {Advances in Synthetic Biology},
editor = {Vijai Singh},
author = {Matthias F{\"u}gger and Manish Kushwaha and Thomas Nowak},
title = {Digital Circuit Design for Biological and Silicon Computers},
year = 2020,
note = {To appear}
}
@article{FNW-dapplmath20,
publisher = {Elsevier Science Publishers},
journal = {Discrete Applied Mathematics},
author = {Matthias F{\"u}gger and Thomas Nowak and Kyrill Winkler},
title = {On the radius of nonsplit graphs and information dissemination in dynamic networks},
volume = {282},
pages = {257-264},
year = {2020},
doi = {10.1016/j.dam.2020.02.013},
url = {http://www.sciencedirect.com/science/article/pii/S0166218X20300809}
}
@inproceedings{BFLMR-async20,
address = {Publication only},
month = may,
publisher = {{IEEE} Computer Society},
editor = {Andreas Steininger and Matheus T. Moreira},
acronym = {{ASYNC}'20},
booktitle = {{P}roceedings of the 26th {IEEE} {I}nternational {S}ymposium on {A}synchronous {C}ircuits and {S}ystems ({ASYNC}'20)},
author = {Johannes Bund and Matthias F{\"u}gger and Christoph Lenzen and Moti Medina and Will Rosenbaum},
title = {{PALS: Plesiochronous and Locally Synchronous Systems}},
year = {2020},
pdf = {https://arxiv.org/pdf/2003.05542.pdf}
}
@article{ABF-qip20,
publisher = {Springer},
journal = {Quantum Information Processing},
author = {Pablo Arrighi and C{\'{e}}dric B{\'{e}}ny and Terry Farrelly},
title = {A quantum cellular automaton for one-dimensional {QED}},
volume = {19},
number = {88},
year = {2020},
url = {https://arxiv.org/abs/1903.07007},
doi = {10.1007/s11128-019-2555-4}
}
@article{MA-qip20,
publisher = {Springer},
journal = {Quantum Information Processing},
author = {Giuseppe Di Molfetta and Pablo Arrighi},
title = {A quantum walk with both a continuous-time limit and a continuous-spacetime limit},
volume = {19},
number = {47},
year = {2020},
url = {https://arxiv.org/abs/1906.04483},
doi = {10.1007/s11128-019-2549-2}
}
@inproceedings{B-atva19,
address = {Taipei, Taiwan},
month = oct,
volume = {11781},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Yu{-}Fang Chen and Chih{-}Hong Cheng and Javier Esparza},
acronym = {{ATVA}'19},
booktitle = {{P}roceedings of the 17th {I}nternational
{S}ymposium on {A}utomated {T}echnology
for {V}erification and {A}nalysis
({ATVA}'19)},
author = {Patricia Bouyer},
title = {{A Note on Game Theory and Verification (Invited Talk)}},
pages = {3-22},
doi = {10.1007/978-3-030-31784-3_1},
year = 2019
}
@inproceedings{B-time19,
address = {M{\'{a}}laga, Spain},
month = oct,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Johann Gamper and Sophie Pinchinat and Guido Sciavicco},
acronym = {{TIME}'19},
booktitle = {{P}roceedings of the 26th {I}nternational {S}ymposium on
{T}emporal {R}epresentation and {R}easoning
({TIME}'19)},
author = {Patricia Bouyer},
title = {{On the Computation of Nash Equilibria in Games on Graphs (Invited Talk)}},
pages = {3:1-3:3},
doi = {10.4230/LIPIcs.TIME.2019.3},
year = 2019
}
@inproceedings{HK-atpn20,
address = {Paris, France},
month = jun,
volume = {12152},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ryszard Janicki and Natalia Sidorova and Thomas Chatain},
acronym = {{PETRI~NETS}'20},
booktitle = {{P}roceedings of the 41st
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'20)},
author = {Serge Haddad and Igor Khmelnitsky},
title = {{D}ynamic {R}ecursive {P}etri {N}ets},
pages = {345-366},
doi = {10.1007/978-3-030-51831-8\_17},
year = 2020,
url = {https://hal.inria.fr/hal-02511321}
}
@article{BFNS-mscs20,
publisher = {Cambridge University Press},
journal = {Mathematical Structures in Computer Science},
author = {David Baelde and Amy P. Felty and Gopalan Nadathur and Alexis Saurin},
title = {A special issue on structural proof theory, automated reasoning and
computation in celebration of Dale Miller's 60th birthday},
volume = {29},
number = {8},
pages = {1007--1008},
year = 2020,
doi = {10.1017/S0960129519000136},
abstract = {The genesis of this special issue was in a meeting that took place at Université Paris Diderot on December 15 and 16, 2016. Dale Miller, Professor at École polytechnique, had turned 60 a few days earlier. In a career spanning over three decades and in work conducted in collaboration with several students and colleagues, Dale had had a significant influence in an area that can be described as structural proof theory and its application to computation and reasoning. In recognition of this fact, several of his collaborators thought it appropriate to celebrate the occasion by organizing a symposium on topics broadly connected to his areas of interest and achievements. The meeting was a success in several senses: it was attended by over 35 people, there were 15 technical presentations describing new results, and, quite gratifyingly, we managed to spring the event as a complete surprise to Dale.}
}
@article{LRP-ic20,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Le Roux, St{\'e}phane and Pauly, Arno},
title = {Equilibria in multi-player multi-outcome infinite sequential games},
volume = {276},
year = 2021,
doi = {https://doi.org/10.1016/j.ic.2020.104557},
url = {https://www.sciencedirect.com/science/article/pii/S0890540120300456?via%3Dihub}
}
@article{BGHLR-ic20,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Brihaye, Thomas and Geeraerts, Gilles and Hallet, Marion and Le Roux, St{\'e}phane},
title = {On the termination of dynamics in sequential games},
volume = {272},
year = 2020,
doi = {10.1016/j.ic.2019.104505}
}
@inproceedings{Blanqui-fscd20,
address = {Paris, France},
month = jun,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Zena Ariola},
acronym = {{FSCD}'20},
booktitle = {{P}roceedings of the 5th International Conference on
Formal Structures for Computation and Deduction ({FSCD}'20)},
author = {Blanqui, Fr{\'e}d{\'e}ric},
title = {Type safety of rewriting rules in dependent types},
doi = {10.4230/LIPIcs.FSCD.2020.13},
year = 2020,
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/12335/},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12335/}
}
@inproceedings{Genestier-fscd20,
address = {Paris, France},
month = jun,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Zena Ariola},
acronym = {{FSCD}'20},
booktitle = {{P}roceedings of the 5th International Conference on
Formal Structures for Computation and Deduction ({FSCD}'20)},
author = {Genestier, Guillaume},
title = {Encoding {A}gda Programs using Rewriting},
doi = {10.4230/LIPIcs.FSCD.2020.31},
year = 2020,
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/12353/},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12353/}
}
@inproceedings{HB-fscd20,
address = {Paris, France},
month = jun,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Zena Ariola},
acronym = {{FSCD}'20},
booktitle = {{P}roceedings of the 5th International Conference on
Formal Structures for Computation and Deduction ({FSCD}'20)},
author = {Hondet, Gabriel and Blanqui, Fr{\'e}d{\'e}ric},
title = {The new rewriting engine of {D}edukti ({S}ystem {D}escription)},
pages = {35:1-35:16},
doi = {10.4230/LIPIcs.FSCD.2020.35},
year = 2020,
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/12357/},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12357/}
}
@article{JLDJ-compj20,
publisher = {Oxford University Press},
journal = {The Computer Journal},
author = {Jiang, Ying and Liu, Jian and Dowek, Gilles and Ji, Kailiang},
title = {Towards Combining Model Checking and Proof Checking},
volume = {62},
number = {9},
pages = {1365--1402},
year = 2020,
doi = {10.1093/comjnl/bxy112},
pdf = {https://hal.inria.fr/hal-01970274/file/sctl_paper.pdf}
}
@article{BBCDHH-jar20,
publisher = {Springer},
journal = {Journal of Automated Reasoning},
author = {Burel, Guillaume and Bury, Guillaume and Cauderlier, Raphaël and Delahaye, David and Halmagrand, Pierre and Hermant, Olivier},
title = {First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice},
volume = {64},
pages = {1001-1050},
year = 2020,
doi = {10.1007/s10817-019-09533-z},
pdf = {https://hal.archives-ouvertes.fr/hal-02305831/file/dmt-in-atp.pdf},
url = {https://hal.archives-ouvertes.fr/hal-02305831}
}
@inproceedings{BDFM-lics20,
address = {Saarbrucken, Germany},
month = jul,
publisher = {{IEEE} Press},
editor = {Kobayashi, Naoki},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 35th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'20)},
author = {Bednarczyk, Bartosz and Demri, St{\'e}phane and Fervari, Ra{\'u}l and Mansutti, Alessio},
title = {Modal Logics with Composition on Finite Forests: Expressivity and Complexity},
pages = {167--180},
year = 2020,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDFM-lics2020.pdf},
doi = {https://dl.acm.org/doi/10.1145/3373718.3394787}
}
@inproceedings{HM-lics20,
address = {Saarbrucken, Germany},
month = jul,
publisher = {{IEEE} Press},
editor = {Kobayashi, Naoki},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 35th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'20)},
author = {Herbelin, Hugo and Miquey, {\'E}tienne},
title = {A calculus of expandable stores. {C}ontinuation-and-environment-passing style translations},
pages = {564-577},
year = 2020,
optpdf = {},
url = {https://dl.acm.org/doi/10.1145/3373718.3394792},
optdoi = {}
}
@inproceedings{JKB-lics20,
address = {Saarbrucken, Germany},
month = jul,
publisher = {{IEEE} Press},
editor = {Kobayashi, Naoki},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 35th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'20)},
author = {Jacomme, Charlie and Kremer, Steve and Barthe, Gilles},
title = {Universal equivalence and majority on probabilistic programs over finite fields},
pages = {155-166},
year = 2020,
optpdf = {},
url = {https://dl.acm.org/doi/10.1145/3373718.3394746},
optdoi = {}
}
@inproceedings{BDM-ijcai20,
month = jul,
publisher = {IJCAI organization},
editor = {Bessi{\`e}re, Christian},
acronym = {{IJCAI}'20},
booktitle = {{P}roceedings of the 29th {I}nternational {J}oint
{C}onference on {A}rtificial {I}ntelligence
({IJCAI}'20)},
author = {Bednarczyk, Bartosz and Demri, St{\'e}phane and Mansutti, Alessio},
title = {A Framework for Reasoning about Dynamic Axioms in Description Logics},
optpages = {},
year = 2020,
optpdf = {},
url = {https://www.ijcai.org/Proceedings/2020/233},
optdoi = {}
}
@inproceedings{BD-ecai20,
address = {Santiago de Compostela, Spain},
month = sep,
optvolume = {??},
optseries = {Frontiers in Artificial Intelligence and Applications},
publisher = {{IOS} Press},
editor = {Lang, J{\'e}r{\^o}me and De Giacomo, Giuseppe and Barro and Sen{\'e}n Barro and O'Sullivan, Barry},
acronym = {{ECAI}'20},
booktitle = {{P}roceedings of the 24th {E}uropean {C}onference on
{A}rtificial {I}ntelligence ({ECAI}'20)},
author = {Belardinelli, Francesco and Demri, St{\'e}phane},
title = {Reasoning with a Bounded Number of Resources in ATL+},
pages = {624-631},
year = 2020,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BD-ecai2020.pdf},
url = {http://ebooks.iospress.nl/publication/54942},
doi = {10.3233/FAIA200147}
}
@inproceedings{DH-lata2020,
address = {Milan, Italy},
month = mar,
volume = {12038},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Alberto Leporati and
Carlos Mart{\'{\i}}n{-}Vide and
Dana Shapira and
Claudio Zandron},
acronym = {{LATA}'20},
booktitle = {{P}roceedings of the 14th {I}nternational {C}onference on {L}anguage
and {A}utomata {T}heory and {A}pplications ({LATA}'20)},
author = {Susanna Donatelli and Serge Haddad},
title = {Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models},
pages = {170-183},
year = 2020
}
@incollection{GHKNS-til2020,
volume = 53,
series = {Trends In Logic},
publisher = {Springer},
booktitle = {Well-Quasi Orders in Computation, Logic, Language and Reasoning},
editor = {Schuster, Peter M. and Seisenberger, Monika and Weiermann, Andreas},
author = {Jean Goubault{-}Larrecq and Simon Halfon and P. Karandikar and K. {Narayan Kumar} and {\relax Ph}ilippe Schnoebelen},
title = {The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings},
pages = {55-105},
year = 2020,
doi = {10.1007/978-3-030-30229-0_3}
}
@incollection{DSS-til2020,
volume = 53,
series = {Trends In Logic},
publisher = {Springer},
booktitle = {Well-Quasi Orders in Computation, Logic, Language and Reasoning},
editor = {Schuster, Peter M. and Seisenberger, Monika and Weiermann, Andreas},
author = {D{\v{z}}amonja, Mirna and Schmitz, Sylvain and Schnoebelen, {\relax Ph}ilippe},
title = {On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders},
pages = {2-54},
year = 2020,
doi = {10.1007/978-3-030-30229-0_2}
}
@article{LPSS-lmcs2020,
journal = {Logical Methods in Computer Science},
author = {J{\'e}r{\^o}me Leroux and M. Praveen and Gr{\'e}goire Sutre and Schnoebelen, {\relax Ph}ilippe},
title = {On Functions Weakly Computable by Pushdown {Petri} Nets and Related Systems},
volume = {15},
number = {4},
year = 2019,
doi = {10.23638/LMCS-15(4:15)2019},
pdf = {https://arxiv.org/pdf/1904.04090.pdf}
}
@article{JGL-tp2020,
publisher = {Auburn University},
journal = {Topology Proceedings},
author = {Goubault{-}Larrecq, Jean},
title = {$\Pi^0_2$ Subsets of Domain-Complete Spaces and Countably Correlated Spaces},
volume = {58},
pages = {13-22},
year = 2020,
note = {E-published on March 24, 2020.},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-tp2020.pdf}
}
@inproceedings{FHK-msr2019,
address = {Angers, France},
month = nov,
futureseries = {Journal Europ{\'e}en des Syst{\`e}mes Automatis{\'e}s},
publisher = {HAL},
editor = {Beno{\^i}t Delahaye and S{\'e}bastien Lahaye and Mehdi Lhommeau},
acronym = {{MSR}'19},
booktitle = {{A}ctes du 12{\`e}me {C}olloque sur la
{M}od{\'e}lisation des {S}yst{\`e}mes
{R}{\'e}actifs
({MSR}'19)},
author = {Alain Finkel and Serge Haddad and Igor Khmelnitsky},
title = {{R{\'e}ification des acc{\'e}l{\'e}rations pour la construction de Karp et Miller}},
year = 2019,
pdf = {https://hal.archives-ouvertes.fr/hal-02431913/file/MSR19_paper_17.pdf},
url = {https://hal.archives-ouvertes.fr/hal-02431913}
}
@inproceedings{KDHKSY-tacas2020,
address = {Dublin, Ireland},
month = apr,
volume = {12078},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Armin Biere and David Parker},
acronym = {{TACAS}'20},
booktitle = {{P}roceedings of the 26th {I}nternational
{C}onference on {T}ools and {A}lgorithms for
{C}onstruction and {A}nalysis of {S}ystems
({TACAS}'20)},
author = {Juraj Kolc{\'a}k and J{\'e}r{'e}my Dubut and Ichiro Hasuo and Shin-Ya Katsumata and David Sprunger and Akihisa Yamada},
title = {Relational Differential Dynamic Logic},
pages = {191--208},
doi = {10.1007/978-3-030-45190-5_11},
year = 2020,
url = {https://doi.org/10.1007/978-3-030-45190-5_11}
}
@inproceedings{AGKR-tacas2020,
address = {Dublin, Ireland},
month = apr,
volume = {12078},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Armin Biere and David Parker},
acronym = {{TACAS}'20},
booktitle = {{P}roceedings of the 26th {I}nternational
{C}onference on {T}ools and {A}lgorithms for
{C}onstruction and {A}nalysis of {S}ystems
({TACAS}'20)},
author = {Akshay, S. and Gastin, Paul and Krishna, Shankara Narayanan and Roychoudhary, Sparsa},
title = {Revisiting Underapproximate Reachability for Multipushdown Systems},
pages = {387--404},
doi = {10.1007/978-3-030-45190-5_21},
year = 2020,
pdf = {https://arxiv.org/pdf/2002.05950.pdf},
url = {https://link.springer.com/chapter/10.1007/978-3-030-45190-5_21},
longurl = {https://arxiv.org/abs/2002.05950}
}
@inproceedings{Mansutti-fossacs20,
address = {Dublin, Ireland},
month = apr,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Barbara K{\"o}nig and Jean Goubault-Larrecq},
acronym = {{FoSSaCS}'20},
booktitle = {{P}roceedings of the 23rd {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'20)},
author = {Alessio Mansutti},
title = {An auxiliary logic on trees: on the {T}ower-hardness of
logics featuring reachability and submodel reasoning},
pages = {462--481},
doi = {10.1007/978-3-030-45231-5_24},
year = 2020
}
@inproceedings{FHK-fossacs2020,
address = {Dublin, Ireland},
month = apr,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Barbara K{\"o}nig and Jean Goubault-Larrecq},
acronym = {{FoSSaCS}'20},
booktitle = {{P}roceedings of the 23rd {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'20)},
author = {Alain Finkel and Serge Haddad and Igor Khmelnitsky},
title = {Minimal coverability tree construction made complete and efficient},
pages = {237--256},
doi = {10.1007/978-3-030-45231-5_13},
year = 2020
}
@inproceedings{BBLS-fossacs2020,
address = {Dublin, Ireland},
month = apr,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Barbara K{\"o}nig and Jean Goubault-Larrecq},
acronym = {{FoSSaCS}'20},
booktitle = {{P}roceedings of the 23rd {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'20)},
author = {B{\'e}atrice B{\'e}rard and Benedikt Bollig and Mathieu Lehaut and Nathalie Sznajder},
title = {Parameterized Synthesis for Fragments of First-Order Logic over Data Words},
pages = {97--118},
doi = {10.1007/978-3-030-45231-5_6},
year = 2020
}
@inproceedings{BD-stacs2020,
address = {Montpellier, France},
month = mar,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Bl{\"a}ser, Markus and Paul, Christophe},
acronym = {{STACS}'20},
booktitle = {{P}roceedings of the 37th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'20)},
author = {Berwanger, Dietmar and Doyen, Laurent},
title = {Observation and Distinction. Representing Information in Infinite Games},
pages = {48:1--48:17},
doi = {10.4230/LIPIcs.STACS.2020.48},
year = 2020
}
This file was generated by bibtex2html 1.98.