FR / EN

Publications (since 2012)

    2022
  • M Blondin, F Mazowiecki, P Offtermatt.
    "Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations".
    34th International Conference on Computer Aided Verification (CAV),
    468–489, 2022.

    DOI : 10.1007/978-3-031-13188-2_23
  • M Blondin, J Esparza.
    "Separators in Continuous Petri Nets".
    25th International Conference on Foundations of Software Science and Computation Structure (FoSSaCS),
    2022.

    DOI : 10.1007/978-3-030-99253-8_5
  • M Blondin, F Mazowiecki, P Offtermatt.
    "The complexity of soundness in workflow nets".
    37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
    20:1–20:13, 2022.

    DOI : 10.1145/3531130.3533341
    • 2021
  • K Landry, A Teodocio, M Lafond, O Tremblay-Savard.
    "Novel Phylogenetic Network Distances Based on Cherry Picking".
    International Conference on Algorithms for Computational Biology (AlCoB),
    2021.
  • M Blondin, C Haase, P Offtermatt.
    "Directed Reachability for Infinite-State Systems".
    27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS),
    2021.

    DOI : 10.1007/978-3-030-72013-1_1
  • J Czyzowicz, K Georgiou, R Killick, E Kranakis, D Krizanc, M Lafond, L Narayanan, J Opatrny, S Shende.
    "Time-energy tradeoffs for evacuation by two robots in the wireless model".
    Theoretical Computer Science,
    852, 61–72, 2021.

    DOI : 10.1016/j.tcs.2020.11.014
  • M Blondin, T Leys, F Mazowiecki, P Oftermatt, GA Pérez.
    "Continuous One-Counter Automata".
    36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
    2021.
  • M Blondin, J Esparza, S Jaax, PJ Meyer.
    "Towards Efficient Verification of Population Protocols".
    Formal Methods in System Design (FMSD),
    2021.

    DOI : 10.1007/s10703-021-00367-3
  • D Schaller, M Lafond, P Stadler, N Wieseke, M Hellmuth.
    "Indirect Identification of Horizontal Gene Transfer".
    Journal of Mathematical Biology,
    2021.
  • Y Anselmetti, N El-Mabrouk, M Lafond, A Ouangraoua.
    "Gene Tree and Species Tree Reconciliation with Endosymbiotic Gene Transfer".
    International Conference on Intelligent Systems for Molecular Biology (ISMB),
    2021.
  • M Lafond, B Zhu, P Zou.
    "The tandem duplication distance is NP-hard".
    SIAM Journal on Discrete Mathematics,
    2021.
  • A Chateau, T Davot, M Lafond.
    "Efficient Assembly Consensus Algorithms for Divergent Contig Sets".
    19th Asia Pacific Bioinformatics Conference (APBC),
    2021.
  • P Charbit, G Hahn, M Kaminski, M Lafond, N Lichiardopol, R Naserasr, B Seamone, R Sherkati.
    "Edge clique covers in graphs with independence number two".
    Journal of Graph Theory,
    2021.

    DOI : https://doi.org/10.1002/jgt.22657
  • M Blondin, M Englert, A Finkel, S Göller, C Haase, R Lazić, P McKenzie, P Totzke.
    "The Reachability Problem for Two-Dimensional Vector Addition Systems with States".
    Journal of the ACM (JACM),
    68 (5), 34:1–34:43, 2021.

    DOI : https://doi.org/10.1145/3464794 (pdf preview)
  • M Blondin, C Haase, F Mazowiecki, M Raskin.
    "Affine Extensions of Integer Vector Addition Systems with States".
    Logical Methods in Computer Science (LMCS),
    17 (3), 2021.

    DOI : 10.46298/lmcs-17(3:1)2021
  • M Blondin, M Raskin.
    "The Complexity of Reachability in Affine Vector Addition Systems with States".
    Logical Methods in Computer Science (LMCS),
    17 (3), 2021.

    DOI : 10.46298/lmcs-17(3:3)2021
    • 2020
  • A Mane, M Lafond, P Cipriano Feijão, C Chauve.
    "The distance and median problems in the single-cut-or-join model with single-gene duplications".
    Algorithms for Molecular Biology,
    15 (1), 8, 2020.

    DOI : 10.1186/s13015-020-00169-y
  • M Blondin, J Esparza, M Helfrich, A Kučera, PJ Meyer.
    "Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling".
    32nd International Conference on Computer-Aided Verification (CAV),
    2020.

    DOI : 10.1007/978-3-030-53291-8_20
  • M Lafond, B Zhu, P Zou.
    "The Tandem Duplication Distance is NP-hard".
    37th Symposium on Theoretical Aspects of Computer Science (STACS),
    2020.

    DOI : 10.4230/LIPIcs.STACS.2020.15
  • M Blondin, J Esparza, B Genest, M Helfrich, S Jaax.
    "Succinct Population Protocols for Presburger Arithmetic".
    37th Symposium on Theoretical Aspects of Computer Science (STACS),
    2020.

    DOI : 10.4230/LIPIcs.STACS.2020.40
  • G Cordasco, L Gargano, M Lafond, L Narayanan, A Rescigno, U Vaccaro, K Wu.
    "Whom to befriend to influence people".
    Theoretical Computer Science,
    810, 26–42, 2020.

    DOI : 10.1016/j.tcs.2018.05.030
  • S Dobrev, E Kranakis, D Krizanc, M Lafond, J Manuch, L Narayanan, J Opatrny, L Stacho.
    "Weak Coverage of a Rectangular Barrier".
    Algorithmica,
    82 (4), 721–746, 2020.

    DOI : 10.1007/s00453-019-00611-7
  • S Krings, M Leuschel, J Schmidt, D Schneider, M Frappier.
    "Translating Alloy and extensions to classical B".
    Science of Computer Programming,
    188, 0167–6423, 2020.

    DOI : 10.1016/j.scico.2019.102378
  • L Nganyewou Tidjon, M Frappier, A Mammar.
    "Intrusion Detection Using ASTDs".
    34th International Conference on Advanced Information Networking and Applications (AINA),
    1397–1411, 2020.

    DOI : 10.1007/978-3-030-44041-1_118
  • M Blondin, A Finkel, J Goubault-Larrecq.
    "Forward Analysis for WSTS, Part III: Karp-Miller Trees".
    Logical Methods in Computer Science (LMCS),
    16 (2), 2020.

    DOI : 10.23638/LMCS-16(2:13)2020
  • M Lafond, B Zhu, P Zou.
    "Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms".
    31st Annual Symposium on Combinatorial Pattern Matching (CPM),
    161, 22:1–22:15, 2020.

    DOI : 10.4230/LIPIcs.CPM.2020.22
  • M Blondin, M Raskin.
    "The Complexity of Reachability in Affine Vector Addition Systems with States".
    35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
    2020.

    DOI : 10.1145/3373718.3394741 (pdf preview)
  • A Mammar, M Frappier, SJ Tueno Fotso, R Laleau.
    "A formal refinement-based analysis of the hybrid ERTMS/ETCS level 3 standard".
    International Journal on Software Tools for Technology Transfer (STTT),
    2 (3), 333–347, 2020.

    DOI : 10.1007/s10009-019-00543-1
  • D de Azevedo Oliveira, M Frappier.
    "Verifying SGAC Access Control Policies: A Comparison of ProB, Alloy and Z3".
    7th International Conference on Rigorous State-Based Methods (ABZ),
    223—229, 2020.

    DOI : 10.1007/978-3-030-48077-6_15
  • A Mammar, M Frappier, R Laleau.
    "An Event-B Model of an Automotive Adaptive Exterior Light System".
    7th International Conference on Rigorous State-Based Methods (ABZ),
    351—366, 2020.

    DOI : 10.1007/978-3-030-48077-6_28
  • A Mammar, M Frappier.
    "Modeling of a Speed Control System Using Event-B".
    7th International Conference on Rigorous State-Based Methods (ABZ),
    367—381, 2020.

    DOI : 10.1007/978-3-030-48077-6_29
  • M Blondin.
    "The ABCs of Petri net reachability relaxations. ACM SIGLOG News: verification".
    ACM SIGLOG News: verification column,
    7 (3), 2020.

    DOI : 10.1145/3436980.3436984
  • M Lafond.
    "Even Better Fixed-Parameter Algorithms for Bicluster Editing".
    26th International Conference on Computing and Combinatorics (COCOON),
    2020.

    DOI : 10.1007/978-3-030-58150-3_47
  • N Lütkenhaus, A Marwah, D Touchette.
    "Erasable Bit Commitment From Temporary Quantum Trust".
    IEEE Journal on Selected Areas in Information Theory,
    1 (2), 536–554, 2020.

    DOI : 10.1109/jsait.2020.3017054
  • G Cordonnier, M Lafond.
    "Comparing copy-number profiles under multi-copy amplifications and deletions".
    BMC genomics,
    2020.

    DOI : https://doi.org/10.1186/s12864-020-6611-3
  • M Delabre, N El-Mabrouk, KT Huber, M Lafond, V Moulton, E Noutahi, M Sautie Castellanos.
    "Evolution through segmental duplications and losses: a Super-Reconciliation approach".
    Algorithms for Molecular Biology,
    2020.

    DOI : https://doi.org/10.1186/s13015-020-00171-4
  • M Lafond, M Hellmuth.
    "Reconstruction of time-consistent species trees".
    Algorithms for Molecular Biology,
    2020.

    DOI : https://doi.org/10.1186/s13015-020-00175-0
  • S Jeffrey Tueno Fotso, M Frappier, R Laleau, A Mammar.
    "Modeling the hybrid ERTMS/ETCS level 3 standard using a formal requirements engineering approach".
    International Journal on Software Tools for Technology Transfer (STTT),
    22 (3), 349—363, 2020.

    DOI : 10.1007/s10009-019-00542-2
    • 2019
  • M Lafond, C Scornavacca.
    "On the Weighted Quartet Consensus problem".
    Theoretical Computer Science,
    769, 1–17, 2019.

    DOI : 10.1016/j.tcs.2018.10.005
  • M Blondin, J Esparza, S Jaax.
    "Expressive Power of Broadcast Consensus Protocols".
    30th International Conference on Concurrency Theory (CONCUR),
    2019.

    DOI : 10.4230/LIPIcs.CONCUR.2019.23 (pdf preview)
  • A Ehresmann, M Lafond, L Narayanan, J Opatrny.
    "Distributed Pattern Formation in a Ring".
    26th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
    2019.

    DOI : 10.1007/978-3-030-24922-9_15
  • J Czyzowicz, K Georgiou, R Killick, E Kranakis, D Krizanc, M Lafond, L Narayanan, J Opatrny, SM Shende.
    "Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model".
    26th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
    2019.

    DOI : 10.1007/978-3-030-24922-9_13_15
  • R Dondi, M Lafond.
    "On the Tractability of Covering a Graph with 2-Clubs".
    22nd International Symposium on Fundamentals of Computation Theory (FCT),
    2019.

    DOI : 10.1007/978-3-030-25027-0_17
  • J Czyzowicz, K Georgiou, R Killick, E Kranakis, D Krizanc, M Lafond, L Narayanan, J Opatrny, SM Shende.
    "Energy Consumption of Group Search on a Line".
    46th International Colloquium on Automata, Languages, and Programming, (ICALP),
    2019.

    DOI : 10.4230/LIPIcs.ICALP.2019.137
  • M Lafond, N El-Mabrouk, KT Huber, V Moulton.
    "The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics".
    Theoretical Computer Science,
    760, 15–34, 2019.

    DOI : 10.1016/j.tcs.2018.08.006
  • R Dondi, M Lafond, C Scornavacca.
    "Reconciling multiple genes trees via segmental duplications and losses".
    Algorithms for Molecular Biology,
    14 (1), 7:1–7:19, 2019.

    DOI : 10.1186/s13015-019-0139-6
  • MA Brunet, M Brunelle, J Lucier, V Delcourt, M Levesque, F Grenier, S Samandi, S Leblanc, J Aguilar, P Dufour, J Jacques, I Fournier, A Ouangraoua, MS Scott, F Boisvert, X Roucou.
    "OpenProt: a more comprehensive guide to explore eukaryotic coding potential and proteomes".
    Nucleic Acids Research,
    47, D403–D410, 2019.

    DOI : 10.1093/nar/gky936
  • S Jammali, J Aguilar, E Kuitche, A Ouangraoua.
    "SplicedFamAlign: CDS-to-gene spliced alignment and identification of transcript orthology groups".
    BMC Bioinformatics,
    20-S (3), 37–D52, 2019.

    DOI : https://doi.org/10.1186/s12859-019-2647-2
  • A Anshu, N Goud Boddu, D Touchette.
    "Quantum Log-Approximate-Rank Conjecture is also False".
    60th Annual IEEE Symposium on Foundations of Computer Science (FOCS),
    2019.
  • G Brassard, A Nayak, A Tapp, D Touchette, F Unger.
    "Noisy Interactive Quantum Communication".
    SIAM Journal on Computing,
    48 (4), 1147–1195, 2019.

    DOI : 10.1137/16M109867X
  • N Luhmann, M Lafond, A Thévenin, A Ouangraoua, R Wittler, C Chauve.
    "The SCJ Small Parsimony Problem for Weighted Gene Adjacencies".
    IEEE/ACM Transactions on Computational Biology and Bioinformatics,
    16 (4), 1364–1373, 2019.

    DOI : 10.1109/TCBB.2017.2661761
    • 2018
  • D Touchette, B Lovitz, N Lütkenhaus.
    "Practical quantum appointment scheduling".
    Physical Review A,
    97 (4), 21, 2018.

    DOI : 10.1103/PhysRevA.97.042320
  • M Blondin, J Esparza, S Jaax.
    "Peregrine: A Tool for the Analysis of Population Protocols".
    30th International Conference on Computer Aided Verification (CAV),
    604–611, 2018.

    DOI : 10.1007/978-3-319-96145-3_34 (pdf preview)
  • M Blondin, J Esparza, A Kučera.
    "Automatic Analysis of Expected Termination Time for Population Protocols".
    29th International Conference on Concurrency Theory (CONCUR),
    33:1–33:16, 2018.

    DOI : 10.4230/LIPIcs.CONCUR.2018.33 (pdf preview)
  • M Blondin, C Haase, F Mazowiecki.
    "Affine Extensions of Integer Vector Addition Systems with States".
    29th International Conference on Concurrency Theory (CONCUR),
    14:1–14:17, 2018.

    DOI : 10.4230/LIPIcs.CONCUR.2018.14 (pdf preview)
  • M Blondin, J Esparza, S Jaax, A Kučera.
    "Black Ninjas in the Dark: Formal Analysis of Population Protocols".
    33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
    1–10, 2018.

    DOI : 10.1145/3209108.3209110 (pdf preview)
  • M Blondin, A Finkel, P McKenzie.
    "Handling infinitely branching well-structured transition systems".
    Information and Computation,
    258, 28–49, 2018.

    DOI : 10.1016/j.ic.2017.11.001 (pdf preview)
  • D Leung, A Nayak, A Shayeghi, D Touchette, P Yao, N Yu.
    "Capacity approaching coding for low noise interactive quantum communication".
    50th Annual ACM SIGACT Symposium on Theory of Computing (STOC),
    339–352, 2018.

    DOI : 10.1145/3188745.3188908
  • L Nganyewou Tidjon, M Frappier, M Leuschel, A Mammar.
    "Extended Algebraic State-Transition Diagrams".
    23rd International Conference on Engineering of Complex Computer Systems (ICECCS),
    146—155, 2018.

    DOI : 10.1109/ICECCS2018.2018.00023
  • M Braverman, A Garg, Y Kun Ko, J Mao, D Touchette.
    "Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness".
    SIAM Journal on Computing,
    47 (6), 2277–2314, 2018.

    DOI : 10.1137/16M1061400
  • S Jeffrey Tueno Fotso, M Frappier, R Laleau, A Mammar, M Leuschel.
    "Formalisation of SysML/KAOS Goal Assignments with B System Component Decompositions".
    14th International Conference on Integrated Formal Methods (IFM),
    377—397, 2018.

    DOI : 10.1007/978-3-319-98938-9_22
  • S Jeffrey Tueno Fotso, M Frappier, R Laleau, A Mammar.
    "Back Propagating B System Updates on SysML/KAOS Domain Models".
    23rd International Conference on Engineering of Complex Computer Systems (ICECCS),
    160—169, 2018.

    DOI : 10.1109/ICECCS2018.2018.00025
  • A Mammar, M Frappier, S Jeffrey Tueno Fotso, R Laleau.
    "An Event-B Model of the Hybrid ERTMS/ETCS Level 3 Standard".
    6th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ),
    353—366, 2018.

    DOI : 10.1007/978-3-319-91271-4_24
  • S Jeffrey Tueno Fotso, M Frappier, R Laleau, A Mammar.
    "Modeling the Hybrid ERTMS/ETCS Level 3 Standard Using a Formal Requirements Engineering Approach".
    6th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ),
    262—276, 2018.

    DOI : 10.1007/978-3-319-91271-4_18
  • S Krings, J Schmidt, C Brings, M Frappier, M Leuschel.
    "A Translation from Alloy to B".
    6th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ),
    71—86, 2018.

    DOI : 10.1007/978-3-319-91271-4_6
  • S Jeffrey Tueno Fotso, A Mammar, R Laleau, M Frappier.
    "Event-B Expression and Verification of Translation Rules Between SysML/KAOS Domain Models and B System Specifications".
    6th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ),
    55—70, 2018.

    DOI : 10.1007/978-3-319-91271-4_5
  • R Chane-Yack-Fa, M Frappier, A Mammar, A Finkel.
    "Parameterized verification of monotone information systems".
    Formal Aspects of Computing,
    30 (3-4), 463—489, 2018.

    DOI : 10.1007/s00165-018-0460-8
  • M Blondin, J Esparza, S Jaax.
    "Large Flocks of Small Birds: On the Minimal Size of Population Protocols".
    35th Symposium on Theoretical Aspects of Computer Science (STACS),
    16:1–16:14, 2018.

    DOI : 10.4230/LIPIcs.STACS.2018.16 (pdf preview)
  • J Séhi Glouzon, A Ouangraoua.
    "aliFreeFold: an alignment-free approach to predict secondary structure from homologous RNA sequences".
    Bioinformatics,
    34 (13), i70—i78, 2018.

    DOI : 10.1093/bioinformatics/bty234
  • M Lafond, C Scornavacca.
    "On the Weighted Quartet Consensus Problem".
    Theoretical computer science,
    2018.

    DOI : 10.1016/j.tcs.2018.10.005 (pdf preview)
  • M Delabre, N El-Mabrouk, K Huber, M Lafond, V Moulton, E Noutahi, M Sautie Castellanos.
    "Reconstructing the history of syntenies through Super-Reconciliation".
    16th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG),
    2018.
  • M Lafond, MM Meghdari, D Sankoff.
    "Accurate prediction of orthologs in the presence of divergence after duplication".
    Bioinformatics,
    34 (13), i366-i375, 2018.

    DOI : 10.1093/bioinformatics/bty242 (pdf preview)
  • R Dondi, M Lafond, C Scornavacca.
    "Reconciling Multiple Genes Trees via Segmental Duplications and Losses".
    18th International Workshop on Algorithms in Bioinformatics (WABI),
    2018.

    DOI : 10.4230/LIPIcs.WABI.2018.5 (pdf preview)
  • M Lafond, N El-Mabrouk, KT Huber, V Moulton.
    "The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics".
    Theoretical Computer Science,
    2018.

    DOI : 10.1016/j.tcs.2018.08.006 (pdf preview)
  • M Lafond.
    "The complexity of speedrunning video games".
    The Ninth International Conference on Fun with Algorithms (FUN),
    100, 2018.

    DOI : 10.4230/LIPIcs.FUN.2018.27 (pdf preview)
  • G Cordasco, L Gargano, M Lafond, L Narayanan, AA Rescigno, U Vaccaro, K Wu.
    "Whom to befriend to influence people".
    Theoretical Computer Science,
    2018.

    DOI : 10.1016/j.tcs.2018.05.030
  • D Krizanc, M Lafond, L Narayanan, J Opatrny, S Shende.
    "Satisfying Neighbor Preferences on a Circle".
    Latin American Symposium on Theoretical Informatics (LATIN),
    727-740, 2018.

    DOI : 10.1007/978-3-319-77404-6_53 (pdf preview)
    • 2017
  • E Kuitche, M Lafond, A Ouangraoua.
    "Reconstructing protein and gene phylogenies using reconciliation and soft-clustering".
    Journal of bioinformatics and computational biology,
    15 (6), 2017.

    DOI : 10.1142/S0219720017400078 (pdf preview)
  • P Gambette, L Van Iersel, M Jones, M Lafond, F Pardi, C Scornavacca.
    "Rearrangement moves on rooted phylogenetic networks".
    PLoS computational biology,
    13 (8), 2017.

    DOI : 10.1371/journal.pcbi.1005611
  • S Dobrev, M Lafond, L Narayanan, J Opatrny.
    "Optimal local buffer management for information gathering with adversarial traffic".
    29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
    265-274, 2017.

    DOI : 10.1145/3087556.3087577 (pdf preview)
  • C Chauve, M Jones, M Lafond, C Scornavacca, M Weller.
    "Constructing a consensus phylogeny from a leaf-removal distance".
    International Symposium on String Processing and Information Retrieval (SPIRE),
    129-143, 2017.

    DOI : 10.1007/978-3-319-67428-5_12 (pdf preview)
  • M Blondin, A Finkel, P McKenzie.
    "Well Behaved Transition Systems".
    Logical Methods in Computer Science (LMCS),
    13 (3), 2017.

    DOI : 10.23638/LMCS-13(3:24)2017 (pdf preview)
  • R Dondi, M Lafond, N El-Mabrouk.
    "Approximating the correction of weighted and unweighted orthology and paralogy relations".
    Algorithms for Molecular Biology,
    12 (1), 4, 2017.

    DOI : 10.1186/s13015-017-0096-x (pdf preview)
  • M Blondin, A Finkel, J Goubault-Larrecq.
    "Forward Analysis for WSTS, Part III: Karp-Miller Trees".
    37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS),
    16:1–16:15, 2017.

    DOI : 10.4230/LIPIcs.FSTTCS.2017.16 (pdf preview)
  • M Blondin, A Finkel, C Haase, S Haddad.
    "The Logical View on Continuous Petri Nets".
    ACM Transactions on Computational Logic (TOCL),
    18 (3), 24:1–24:28, 2017.

    DOI : 10.1145/3105908 (pdf preview)
  • S Dobrev, E Kranakis, D Krizanc, M Lafond, J Manuch, L Narayanan, J Opatrny, S Shende, L Stacho.
    "Weak coverage of a rectangular barrier".
    International Conference on Algorithms and Complexity (CIAC),
    196-208, 2017.

    DOI : 10.1007/978-3-319-57586-5_17 (pdf preview)
  • N Luhmann, M Lafond, A Thevenin, A Ouangraoua, R Wittler, C Chauve.
    "The SCJ small parsimony problem for weighted gene adjacencies".
    IEEE/ACM transactions on computational biology and bioinformatics,
    2017.

    DOI : 10.1109/TCBB.2017.2661761
  • M Lafond, C Chauve, N El-Mabrouk.
    "Gene tree construction and correction using supertree and reconciliation".
    IEEE/ACM transactions on computational biology and bioinformatics,
    2017.

    DOI : 10.1109/TCBB.2017.2720581 (pdf preview)
  • A Anshu, D Touchette, P Yao, N Yu.
    "Exponential separation of quantum communication and classical information".
    49th Annual ACM SIGACT Symposium on Theory of Computing (STOC),
    277–288, 2017.

    DOI : 10.1145/3055399.3055401
  • M Lafond, C Scornavacca.
    "On the Weighted Quartet Consensus Problem".
    28th Annual Symposium on Combinatorial Pattern Matching (CPM),
    78, 28:1–28:18, 2017.

    DOI : 10.4230/LIPIcs.CPM.2017.28
  • M Laurière, D Touchette.
    "The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting".
    8th Innovations in Theoretical Computer Science Conference (ITCS),
    47:1–47:1, 2017.

    DOI : 10.4230/LIPIcs.ITCS.2017.47
  • M Blondin, J Esparza, S Jaax, PJ Meyer.
    "Towards Efficient Verification of Population Protocols".
    36th ACM Symposium on Principles of Distributed Computing (PODC),
    423–430, 2017.

    DOI : 10.1145/3087801.3087816 (pdf preview)
  • M Blondin, C Haase.
    "Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States".
    32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
    1–12, 2017.

    DOI : 10.1109/LICS.2017.8005068 (pdf preview)
  • A Nayak, D Touchette.
    "Augmented Index and Quantum Streaming Algorithms for DYCK(2)".
    32nd Computational Complexity Conference (CCC),
    23:1–23:21, 2017.

    DOI : 10.4230/LIPIcs.CCC.2017.23
  • H Kenfack Ngankam, H Pigot, M Frappier, C Helena Souza Oliveira, S Giroux.
    "Formal Specification for Ambient Assisted Living Scenarios".
    11th International Conference on Ubiquitous Computing and Ambient Intelligence (UCAmI),
    508—519, 2017.

    DOI : 10.1007/978-3-319-67585-5_51
  • S Tueno, R Laleau, A Mammar, M Frappier.
    "Towards Using Ontologies for Domain Modeling within the SysML/KAOS Approach".
    IEEE 25th International Requirements Engineering Conference Workshops (RE),
    1—5, 2017.

    DOI : 10.1109/REW.2017.22
  • N Huynh, M Frappier, A Mammar, R Laleau.
    "Verification of SGAC Access Control Policies Using Alloy and ProB".
    18th IEEE International Symposium on High Assurance Systems Engineering (HASE),
    120—123, 2017.

    DOI : 10.1109/HASE.2017.24
  • M Lafond.
    "On strongly chordal graphs that are not leaf powers".
    International Workshop on Graph-Theoretic Concepts in Computer Science (WG),
    386-398, 2017.

    DOI : 10.1007/978-3-319-68705-6_29 (pdf preview)
  • N El-Mabrouk, A Ouangraoua.
    "A General Framework for Gene Tree Correction Based on Duplication-Loss Reconciliation".
    17th International Workshop on Algorithms in Bioinformatics (WABI),
    8:1—8:14, 2017.

    DOI : 10.4230/LIPIcs.WABI.2017.8
  • S Jammali, E Kuitche, A Rachati, F Bélanger, M Scott, A Ouangraoua.
    "Aligning coding sequences with frameshift extension penalties".
    Algorithms for Molecular Biology,
    12 (1), 10:1—10:18, 2017.

    DOI : 10.1186/s13015-017-0101-4
    • 2016
  • N Huynh, M Frappier, H Pooda, A Mammar, R Laleau.
    "SGAC: A patient-centered access control method".
    Tenth IEEE International Conference on Research Challenges in Information Science (RCIS),
    1—12, 2016.

    DOI : 10.1109/RCIS.2016.7549286
  • E Noutahi, M Semeria, M Lafond, J Seguin, B Boussau, L Guéguen, N El-Mabrouk, E Tannier.
    "Efficient gene tree correction guided by genome evolution".
    PLoS One,
    11 (8), 2016.

    DOI : 10.1371/journal.pone.0159559
  • N Huynh, M Frappier, A Mammar, R Laleau, J Desharnais.
    "A formal validation of the RBAC ANSI 2012 standard using B".
    Science of Computer Programming,
    131, 76—93, 2016.

    DOI : 10.1016/j.scico.2016.04.011
  • N Luhmann, A Thévenin, A Ouangraoua, R Wittler, C Chauve.
    "The SCJ Small Parsimony Problem for Weighted Gene Adjacencies".
    12th International Symposium on Bioinformatics Research and Applications (ISBRA),
    200—210, 2016.

    DOI : 10.1007/978-3-319-38782-6_17
  • M Berta, M Christandl, D Touchette.
    "Smooth Entropy Bounds on One-Shot Quantum State Redistribution".
    IEEE Transactions on Information Theory,
    62 (3), 1425–1439, 2016.

    DOI : 10.1109/TIT.2016.2516006
  • T Fayolle, M Frappier, F Gervais, R Laleau.
    "Modelling a Hemodialysis Machine Using Algebraic State-Transition Diagrams and B-like Methods".
    5th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ),
    394—408, 2016.

    DOI : 10.1007/978-3-319-33600-8_33
  • M Lafond, R Dondi, N El-Mabrouk.
    "The link between orthology relations and gene trees: a correction perspective".
    Algorithms for Molecular Biology,
    11 (1), 4, 2016.

    DOI : 10.1186/s13015-016-0067-7 (pdf preview)
  • M Blondin, A Finkel, C Haase, S Haddad.
    "Approaching the Coverability Problem Continuously".
    22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS),
    480–496, 2016.

    DOI : 10.1007/978-3-662-49674-9_28 (pdf preview)
  • M Lafond, E Noutahi, N El-Mabrouk.
    "Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost".
    27th Annual Symposium on Combinatorial Pattern Matching (CPM),
    54, 2016.

    DOI : 10.4230/LIPIcs.CPM.2016.14 (pdf preview)
  • M Blondin, A Krebs, P McKenzie.
    "The complexity of intersecting finite automata having few final states".
    Computational Complexity,
    25 (4), 775–814, 2016.

    DOI : 10.1007/s00037-014-0089-9 (pdf preview)
  • R Dondi, N El-Mabrouk, M Lafond.
    "Correction of weighted orthology and paralogy relations-complexity and algorithmic results".
    International Workshop on Algorithms in Bioinformatics (WABI),
    121-136, 2016.

    DOI : 10.1007/978-3-319-43681-4_10 (pdf preview)
  • M Lafond.
    "Algorithmes de construction et correction d'arbres de gènes par la réconciliation".
    PhD thesis (in French), University of Montreal,
    2016.
    (pdf preview)
  • M Lafond, L Narayanan, K Wu.
    "Whom to befriend to influence people".
    International Colloquium on Structural Information and Communication Complexity (SIROCCO),
    340-357, 2016.

    DOI : 10.1007/978-3-319-48314-6_22
    • 2015
  • M Braverman, A Garg, Y Kun-Ko, J Mao, D Touchette.
    "Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness".
    IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS),
    773–791, 2015.

    DOI : 10.1109/FOCS.2015.53
  • P Lavoie-Mongrain, M Belcaid, A Ouangraoua, A Bergeron, G Poisson.
    "Reconstructing the history of a WD40 beta-propeller tandem repeat using a phylogenetically informed algorithm".
    PeerJ Computer Science,
    1, e6, 2015.

    DOI : 10.7717/peerj-cs.6
  • M Lafond, B Seamone.
    "Hamiltonian chordal graphs are not cycle extendable".
    SIAM Journal on Discrete Mathematics,
    29 (2), 877-887, 2015.

    DOI : 10.1137/13094551X
  • A Mammar, M Frappier.
    "Proof-based verification approaches for dynamic properties: application to the information system domain".
    Formal Aspects of Computing,
    27 (2), 335—374, 2015.

    DOI : 10.1007/s00165-014-0323-x
  • M Lafond, A Ouangraoua, N El-Mabrouk.
    "Reconstructing a SuperGeneTree minimizing reconciliation".
    BMC bioinformatics,
    16 (14), S4, 2015.
  • D Touchette.
    "Quantum Information Complexity".
    47th Annual ACM on Symposium on Theory of Computing (STOC),
    317–326, 2015.

    DOI : 10.1145/2746539.2746613
  • M Blondin, A Finkel, S Göller, C Haase, P McKenzie.
    "Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete".
    30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
    32–43, 2015.

    DOI : 10.1109/LICS.2015.14 (pdf preview)
  • M Lafond, N El-Mabrouk.
    "Orthology relation and gene tree correction: complexity results".
    International Workshop on Algorithms in Bioinformatics (WABI),
    66-79, 2015.
  • T Fayolle, M Frappier, R Laleau, F Gervais.
    "Formal refinement of extended state machines".
    17th International Workshop on Refinement (Refine@FM),
    1—16, 2015.

    DOI : 10.4204/EPTCS.209.1
  • A Savary, M Frappier, M Leuschel, J Lanet.
    "Model-Based Robustness Testing in Event-B Using Mutation".
    13th International Conference on Software Engineering and Formal Methods (SEFM),
    132—147, 2015.

    DOI : 10.1007/978-3-319-22969-0_10
    • 2014
  • M Lafond, N El-Mabrouk.
    "Orthology and paralogy constraints: satisfiability and consistency".
    BMC genomics,
    15 (6), S12, 2014.

    DOI : 10.1186/1471-2164-15-S6-S12 (pdf preview)
  • G Brassard, A Nayak, A Tapp, D Touchette, Falk Unger.
    "Noisy Interactive Quantum Communication".
    55th IEEE Annual Symposium on Foundations of Computer Science (FOCS),
    296–305, 2014.

    DOI : 10.1109/FOCS.2014.39
  • M Beaudry, D Dubé, M Dubé, M Latendresse, P Tesson.
    "Conservative groupoids recognize only regular languages".
    Information and Computation,
    239, 13–28, 2014.

    DOI : 10.1016/j.ic.2014.08.005
  • A Ouangraoua, M Raffinot.
    "On the Identification of Conflicting Contiguities in Ancestral Genome Reconstruction".
    Journal of Computational Biology,
    21 (1), 64—79, 2014.

    DOI : 10.1089/cmb.2013.0086
  • M Frappier, F Gervais, R Laleau, J Milhau.
    "Refinement patterns for ASTDs".
    Formal Aspects of Computing,
    26 (5), 919—941, 2014.

    DOI : 10.1007/s00165-013-0286-3
  • F Diagne, A Mammar, M Frappier.
    "A Tool for Verifying Dynamic Properties in B".
    12th International Conference on Software Engineering and Formal Methods (SEFM),
    290—295, 2014.

    DOI : 10.1007/978-3-319-10431-7_23
  • M Lafond, C Chauve, R Dondi, N El-Mabrouk.
    "Polytomy refinement for the correction of dubious duplications in gene trees".
    Bioinformatics,
    30 (17), i519-i526, 2014.

    DOI : 10.1093/bioinformatics/btu463 (pdf preview)
  • B Fraikin, M Frappier, R St.-Denis.
    "Supervisory control theory with Alloy".
    Science of Computer Programming,
    94, 217—237, 2014.

    DOI : 10.1016/j.scico.2014.04.016
  • N Huynh, M Frappier, A Mammar, R Laleau, J Desharnais.
    "Validating the RBAC ANSI 2012 Standard Using B".
    4th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ),
    255—270, 2014.

    DOI : 10.1007/978-3-662-43652-3_22
  • M Blondin, A Finkel, P McKenzie.
    "Handling Infinitely Branching WSTS".
    41st International Colloquium on Automata, Languages, and Programming (ICALP),
    13–25, 2014.

    DOI : 10.1007/978-3-662-43951-7_2 (pdf preview)
  • A Mammar, M Frappier.
    "Verifying the Precedence Property Pattern Using the B Method".
    15th International IEEE Symposium on High-Assurance Systems Engineering (HASE),
    229—233, 2014.

    DOI : 10.1109/HASE.2014.40
    • 2013
  • M Lafond, M Semeria, KM Swenson, E Tannier, N El-Mabrouk.
    "Gene tree correction guided by orthology".
    BMC bioinformatics,
    14 (15), S5, 2013.
  • A Savary, M Frappier, J Lanet.
    "Detecting Vulnerabilities in Java-Card Bytecode Verifiers Using Model-Based Testing".
    10th International Conference on Integrated Formal Methods (IFM),
    223—237, 2013.

    DOI : 10.1007/978-3-642-38613-8_16
  • M Lafond, KM Swenson, N El-Mabrouk.
    "Error detection and correction of gene trees".
    Models and algorithms for genome evolution,
    261-285, 2013.
  • M Frappier, U Glässer, S Khurshid, R Laleau, S Reeves.
    "Abstract State Machines, Alloy, B and Z Selected papers from ABZ 2010".
    Science of Computer Programming,
    78 (3), 270—271, 2013.

    DOI : 10.1016/j.scico.2011.03.004
  • E Aïmeur, M Lafond.
    "The scourge of internet personal data collection".
    Eighth International Conference on Availability, Reliability and Security (ARES),
    821-828, 2013.
    • 2012
  • M Lafond, P Brosseau, E Aïmeur.
    "Privacy invasion in business environments".
    Tenth Annual International Conference on Privacy, Security and Trust (PST),
    221-224, 2012.
  • M Lafond, KM Swenson, N El-Mabrouk.
    "An optimal reconciliation algorithm for gene trees with polytomies".
    International Workshop on Algorithms in Bioinformatics,
    106-122, 2012.

    DOI : 10.1007/978-3-642-33122-0_9 (pdf preview)
  • B Fraikin, M Frappier, R St.-Denis.
    "Modeling the Supervisory Control Theory with Alloy".
    Third International Conference on Abstract State Machines, Alloy, B, VDM, and Z (ABZ),
    94—107, 2012.

    DOI : 10.1007/978-3-642-30885-7_7
  • A Mammar, M Frappier, R Chane-Yack-Fa.
    "Proving the Absence Property Pattern Using the B Method".
    14th International IEEE Symposium on High-Assurance Systems Engineering (HASE),
    167—170, 2012.

    DOI : 10.1109/HASE.2012.26
  • A Ouangraoua, K M. Swenson, A Bergeron.
    "On the Comparison of Sets of Alternative Transcripts".
    8th International Symposium on Bioinformatics Research and Applications (ISBRA),
    201—212, 2012.

    DOI : 10.1007/978-3-642-30191-9_19
  • A Ouangraoua, M Raffinot.
    "Faster and Simpler Minimal Conflicting Set Identification - (Extended Abstract)".
    23rd Annual Symposium on Combinatorial Pattern Matching (CPM),
    41—55, 2012.

    DOI : 10.1007/978-3-642-31265-6_4
  • A Thomas, A Ouangraoua, J Varré.
    "Genome Halving by Block Interchange".
    International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS),
    58—65, 2012.
  • H Ferrier-Belhaouari, P Konopacki, R Laleau, M Frappier.
    "A Design by Contract Approach to Verify Access Control Policies".
    17th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS),
    263—272, 2012.

    DOI : 10.1109/ICECCS.2012.4
  • M Frappier, A Mammar.
    "An Assertions-Based Approach to Verifying the Absence Property Pattern".
    23rd IEEE International Symposium on Software Reliability Engineering (ISSRE),
    361—370, 2012.

    DOI : 10.1109/ISSRE.2012.11
  • J Allali, C Saule, C Chauve, Y D'Aubenton-Carafa, A Denise, C Drevet, P Ferraro, D Gautheret, C Herrbach, F Leclerc, A de Monte, A Ouangraoua, M Sagot, M Termier, C Thermes, H Touzet.
    "BRASERO: A Resource for Benchmarking RNA Secondary Structure Comparison Algorithms".
    Advances in Bioinformatics,
    2012, 893048:1—893048:5, 2012.

    DOI : 10.1155/2012/893048
  • M Blondin, P McKenzie.
    "The Complexity of Intersecting Finite Automata Having Few Final States".
    7th International Computer Science Symposium in Russia (CSR),
    31–42, 2012.

    DOI : 10.1007/978-3-642-30642-6_4 (pdf preview)
  • J Milhau, F Gervais, R Laleau, M Frappier.
    "Refinement patterns for ASTD".
    ACM SIGSOFT Software Engineering Notes,
    37 (4), 1—8, 2012.

    DOI : 10.1145/2237796.2237818
  • A Thomas, A Ouangraoua, J Varré.
    "Tandem Halving Problems by DCJ".
    12th International Workshop Algorithms in Bioinformatics (WABI),
    417—429, 2012.

    DOI : 10.1007/978-3-642-33122-0_33