Download full bibliography (as BibTex): PaVeS publications

Our previous work in the field of parametrized synthesis and verification: previous work

[2023] [2022] [2021] [2020] [2019] [2018]

2023

  • Raskin, M.: Protocols with constant local storage and unreliable communication Theoretical Computer Science. 940, 269–282 (2023)
    URL: Link
    Keywords: journal
    URLBibTeXEndNote
  • Becker, R., Casteigts, A., Crescenzi, P., Kodric, B., Renken, M., Raskin, M., Zamaraev, V.: Giant Components in Random Temporal Graphs In: Megow, N. and Smith, A.D. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta, Georgia, {USA}. pp. 29:1–29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
    URL: Link
    Preprint: Link
    Keywords: conference
    URLBibTeXEndNote
  • Guttenberg, R., Raskin, M.A., Esparza, J.: Geometry of Reachability Sets of Vector Addition Systems In: Pérez, G.A. and Raskin, J.-F. (eds.) 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium. pp. 6:1–6:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Couillard, E., Czerner, P., Esparza, J., Majumdar, R.: Making sf IP=sf PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms In: Enea, C. and Lal, A. (eds.) Computer Aided Verification - 35th International Conference, CAV 2023, Paris, France, July 17-22, 2023, Proceedings, Part III. pp. 437–458. Springer (2023)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Czerner, P., Esparza, J., Leroux, J.: Lower bounds on the state complexity of population protocols Distributed Comput. 36, 209–218 (2023)
    URL: Link
    Keywords: journal
    URLBibTeXEndNote
  • Konnov, I., Lazic, M., Stoilkovska, I., Widder, J.: Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker Log. Methods Comput. Sci. 19, (2023)
    URL: Link
    Keywords: journal
    URLBibTeXEndNote

2022

  • Balasubramanian, A.R., Guillou, L., Weil{-}Kennedy, C.: Parameterized Analysis of Reconfigurable Broadcast Networks In: Bouyer, P. and Schr{{ö}}der, L. (eds.) Foundations of Software Science and Computation Structures - 25th International Conference, {FOSSACS} 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2022, Munich, Germany, April 2-7, 2022, Proceedings. pp. 61–80. Springer (2022)
    URL: Link
    Keywords: parameterizedverification
    URLBibTeXEndNote
  • Casteigts, A., Raskin, M., Renken, M., Zamaraev, V.: Sharp Thresholds in Random Simple Temporal Graphs 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). pp. 319–326 (2022)
    URL: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Czerner, P.: Leaderless Population Protocols Decide Double-exponential Thresholds CoRR. abs/2204.02115, (2022)
    URL: Link
    Keywords: informal
    URLBibTeXEndNote
  • Esparza, J., Raskin, M., Welzel, C.: Regular Model Checking Upside-Down: An Invariant-Based Approach (2022)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Balasubramanian, A.R.: Coefficient Synthesis for Threshold Automata In: Lin, A.W., Zetzsche, G., and Potapov, I. (eds.) Reachability Problems - 16th International Conference, {RP} 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings. pp. 125–139. Springer (2022)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Esparza, J., Raskin, M., Welzel, C.: Regular Model Checking Upside-Down: An Invariant-Based Approach Presented at the (2022)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Bertrand, N., Gramoli, V., Konnov, I., Lazic, M., Tholoniat, P., Widder, J.: Brief Announcement: Holistic Verification of Blockchain Consensus {PODC}. pp. 424–426. {ACM} (2022)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Helfrich, M., Ceska, M., Kretínský, J., Marticek, S.: Abstraction-Based Segmental Simulation of Chemical Reaction Networks In: Petre, I. and Paun, A. (eds.) Computational Methods in Systems Biology. pp. 41–60. Springer International Publishing (2022)
    Keywords: conference
    AbstractBibTeXEndNote
  • Bertrand, N., Gramoli, V., Konnov, I., Lazic, M., Tholoniat, P., Widder, J.: Holistic Verification of Blockchain Consensus In: Scheideler, C. (ed.) 36th International Symposium on Distributed Computing (DISC 2022). pp. 10:1–10:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
    URL: Link
    Keywords: conferenece
    URLBibTeXEndNote
  • Esparza, J., Kret\’ınský, J., Raskin, J.-F., Sickert, S.: From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata International Journal on Software Tools for Technology Transfer. 24, 635–659 (2022)
    URL: Link
    Keywords: journal
    URLBibTeXEndNote
  • Balasubramanian, A.R.: {Complexity of Coverability in Depth-Bounded Processes} In: Klin, B., Lasota, S., and Muscholl, A. (eds.) 33rd International Conference on Concurrency Theory (CONCUR 2022). pp. 17:1–17:19. Schloss Dagstuhl -- Leibniz-Zentrum f{ü}r Informatik, Dagstuhl, Germany (2022)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Czerner, P., Guttenberg, R., Helfrich, M., Esparza, J.: Fast and Succinct Population Protocols for Presburger Arithmetic In: Aspnes, J. and Michail, O. (eds.) 1st Symposium on Algorithmic Foundations of Dynamic Networks, {SAND} 2022, March 28-30, 2022, Virtual Conference. pp. 11:1–11:17. Schloss Dagstuhl - Leibniz-Zentrum f{{ü}}r Informatik (2022)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote

2021

  • Bertrand, N., Konnov, I., Lazi{{{\’c}}}, M., Widder, J.: Verification of randomized consensus algorithms under round-rigid adversaries International Journal on Software Tools for Technology Transfer. (2021)
    URL: Link
    Keywords: journal
    AbstractURLBibTeXEndNote
  • Kupferman, O., Sickert, S.: Certifying Inexpressibility Accepted at FoSSaCS’21. (2021)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Blondin, M., Haase, C., Mazowiecki, F., Raskin, M.: Affine Extensions of Integer Vector Addition Systems with States Logical Methods in Computer Science. Volume 17, Issue 3, (2021)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Blondin, M., Raskin, M.: The Complexity of Reachability in Affine Vector Addition Systems with States Logical Methods in Computer Science. Volume 17, Issue 3, (2021)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Raskin, M.: Population Protocols with Unreliable Communication Algorithms for Sensor Systems. pp. 140–154. Springer International Publishing (2021)
    URL: Link
    Keywords: journal
    URLBibTeXEndNote
  • Czerner, P., Guttenberg, R., Helfrich, M., Esparza, J.: Decision Power of Weak Asynchronous Models of Distributed Computing In: Miller, A., Censor{-}Hillel, K., and Korhonen, J.H. (eds.) {PODC} ’21: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021. pp. 115–125. {ACM} (2021)
    Keywords: conference
    BibTeXEndNote
  • Balasubramanian, A.R., Thejaswini, K.S.: {Adaptive Synchronisation of Pushdown Automata} In: Haddad, S. and Varacca, D. (eds.) 32nd International Conference on Concurrency Theory (CONCUR 2021). pp. 17:1–17:15. Schloss Dagstuhl -- Leibniz-Zentrum f{ü}r Informatik, Dagstuhl, Germany (2021)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Czerner, P., Esparza, J.: Lower Bounds on the State Complexity of Population Protocols In: Miller, A., Censor{-}Hillel, K., and Korhonen, J.H. (eds.) {PODC} ’21: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021. pp. 45–54. {ACM} (2021)
    Keywords: conference
    BibTeXEndNote
  • Balasubramanian, A.R., Weil-Kennedy, C.: Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent, http://arxiv.org/abs/2109.08315, (2021)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Bertrand, N., Lazi{{{\’c}}}, M., Widder, J.: A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries In: Henglein, F., Shoham, S., and Vizel, Y. (eds.) Verification, Model Checking, and Abstract Interpretation. pp. 219–239. Springer International Publishing (2021)
    URL: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Esparza, J., Jaax, S., Raskin, M.A., Weil-Kennedy, C.: The Complexity of Verifying Population Protocols. Distributed Computing. (2021)
    Preprint: Link
    Keywords: journal
    AbstractBibTeXEndNote
  • Meyer, P.K.J.: Constraint-based Analysis of Distributed Systems, (2021)
    Keywords: thesis
    AbstractBibTeXEndNote
  • Balasubramanian, A.R.: {Complexity of Coverability in Bounded Path Broadcast Networks} In: Boja{ń}czy, M. and Chekuri, C. (eds.) 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021). pp. 35:1–35:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2021)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • {van Ditmarsch}, H., Goubault, Éric, Lazić, M., Ledent, J., Rajsbaum, S.: A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks Journal of Logical and Algebraic Methods in Programming. 100662 (2021)
    URL: Link
    Preprint: Link
    Keywords: journal
    AbstractURLBibTeXEndNote
  • Balasubramanian, A.R., Thejaswini, K.S.: Adaptive Synchronisation of Pushdown Automata, https://arxiv.org/abs/2102.06897, (2021)
    URL: Link
    Keywords: informal
    AbstractURLBibTeXEndNote
  • Czerner, P., Jaax, S.: Running Time Analysis of Broadcast Consensus Protocols In: Kiefer, S. and Tasson, C. (eds.) Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings. pp. 164–183. Springer (2021)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Esparza, J., Raskin, M., Welzel, C.: Computing Parameterized Invariants of Parameterized Petri Nets, (2021)
    Preprint: Link
    Keywords: informal
    BibTeXEndNote
  • Balasubramanian, A.R., Esparza, J., Raskin, M.A.: Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy In: Kiefer, S. and Tasson, C. (eds.) Foundations of Software Science and Computation Structures - 24th International Conference. pp. 42–61. Springer (2021)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Esparza, J., Raskin, M., Welzel, C.: Abduction of trap invariants in parameterized systems (2021)
    URL: Link
    Preprint: Link
    Keywords: verification
    AbstractURLBibTeXEndNote
  • Balasubramanian, A.R., Lang, T., Ramanayake, R.: Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. Accepted at LICS’21. (2021)
    URL: Link
    Preprint: Link
    Keywords: conference
    URLBibTeXEndNote
  • Balasubramanian, A.: Parameterized verification of coverability in infinite state broadcast networks Information and Computation. 278, 104592 (2021)
    URL: Link
    Keywords: journal
    URLBibTeXEndNote

2020

  • Luttenberger, M., Meyer, P.J., Sickert, S.: Practical synthesis of reactive systems from LTL specifications via parity games. Acta Inf. 57, 3–36 (2020)
    URL: Link
    Preprint: Link
    Keywords: journal
    AbstractURLBibTeXEndNote
  • Raskin, M., Weil-Kennedy, C.: Efficient Restrictions of Immediate Observation Petri Nets Reachability Problems (2020)
    Preprint: Link
    Keywords: conference
    AbstractBibTeXEndNote
  • Esparza, J., Reiter, F.: A Classification of Weak Asynchronous Models of Distributed Computing In: Konnov, I. and Kov{á}cs, L. (eds.) 31st International Conference on Concurrency Theory (CONCUR 2020). pp. 10:1–10:16. Schloss Dagstuhl--Leibniz-Zentrum f{ü}r Informatik, Dagstuhl, Germany (2020)
    URL: Link
    Preprint: Link
    Keywords: distributedalgorithms
    AbstractURLBibTeXEndNote
  • Bozga, M., Esparza, J., Iosif, R., Sifakis, J., Welzel, C.: Structural Invariants for the Verification of Systems with Parameterized Architectures In: Biere, A. and Parker, D. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, {TACAS} 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Part {I}. pp. 228–246. Springer (2020)
    URL: Link
    Preprint: Link
    Keywords: verification
    AbstractURLBibTeXEndNote
  • Konnov, I., Lazic, M., Stoilkovska, I., Widder, J.: Tutorial: Parameterized Verification with Byzantine Model Checker In: Gotsman, A. and Sokolova, A. (eds.) FORTE. pp. 189–207. Springer (2020)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Esparza, J., Kret\’ınský, J., Sickert, S.: A Unified Translation of Linear Temporal Logic to ω-Automata J. ACM. 67, (2020)
    URL: Link
    Keywords: journal
    AbstractURLBibTeXEndNote
  • Casteigts, A., Raskin, M., Renken, M., Zamaraev, V.: Sharp Thresholds in Random Simple Temporal Graphs. CoRR. abs/2011.03738, (2020)
    URL: Link
    Preprint: Link
    Keywords: temporalgraphs
    URLBibTeXEndNote
  • D’Antoni, L., Helfrich, M., Kret{\’{\i}}nsk{{{\’y}}}, J., Ramneantu, E., Weininger, M.: Automata Tutor v3 In: Lahiri, S.K. and Wang, C. (eds.) Computer Aided Verification - 32nd International Conference, {CAV} 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part {II}. pp. 3–14. Springer (2020)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Jaax, S.: Population Protocols: Expressiveness, Succinctness and Automatic Verification., http://mediatum.ub.tum.de/doc/1538836/1538836.pdf, (2020)
    URL: Link
    Keywords: thesis
    URLBibTeXEndNote
  • Blondin, M., Esparza, J., Helfrich, M., Kucera, A., Meyer, P.J.: Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling In: Lahiri, S.K. and Wang, C. (eds.) Computer Aided Verification - 32nd International Conference, {CAV} 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part {II}. pp. 372–397. Springer (2020)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Esparza, J., Helfrich, M., Jaax, S., Meyer, P.J.: Peregrine 2.0: Explaining Correctness of Population Protocols Through Stage Graphs In: Hung, D.V. and Sokolsky, O. (eds.) Automated Technology for Verification and Analysis - 18th International Symposium, {ATVA} 2020, Hanoi, Vietnam, October 19-23, 2020, Proceedings. pp. 550–556. Springer (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    URLBibTeXEndNote
  • Raskin, M.: Constructive expressive power of population protocols, (2020)
    Preprint: Link
    Keywords: preprint
    AbstractBibTeXEndNote
  • Balasubramanian, A.R.: {Parameterized Complexity of Safety of Threshold Automata} In: Saxena, N. and Simon, S. (eds.) 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). pp. 37:1–37:15. Schloss Dagstuhl--Leibniz-Zentrum f{ü}r Informatik, Dagstuhl, Germany (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    URLBibTeXEndNote
  • Balasubramanian, A.R., Esparza, J., Lazic, M.: Complexity of Verification and Synthesis of Threshold Automata. CoRR. abs/2007.06248, (2020)
    Preprint: Link
    Keywords: informal
    AbstractBibTeXEndNote
  • Balasubramanian, A.R., Walukiewicz, I.: Characterizing Consensus in the Heard-Of Model In: Konnov, I. and Kov{á}cs, L. (eds.) 31st International Conference on Concurrency Theory (CONCUR 2020). pp. 9:1–9:18. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Blondin, M., Raskin, M.A.: The Complexity of Reachability in Affine Vector Addition Systems with States. In: Hermanns, H., Zhang, L., Kobayashi, N., and Miller, D. (eds.) LICS. pp. 224–236. ACM (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Blondin, M., Esparza, J., Genest, B., Helfrich, M., Jaax, S.: Succinct Population Protocols for Presburger Arithmetic. In: Paul, C. and Bläser, M. (eds.) STACS. pp. 40:1–40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Seidl, H., Müller, C., Finkbeiner, B.: How to Win First-Order Safety Games. In: Beyer, D. and Zufferey, D. (eds.) VMCAI. pp. 426–448. Springer (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Durand, I., Courcelle, B., Raskin, M.: On defining linear orders by automata Moscow Journal of Combinatorics and Number Theory. 9, 253–291 (2020)
    URL: Link
    Preprint: Link
    Keywords: journal
    AbstractURLBibTeXEndNote
  • D’Antoni, L., Helfrich, M., Kretinsky, J., Ramneantu, E., Weininger, M.: Automata Tutor v3. In: Lahiri, S.K. and Wang, C. (eds.) CAV (2). pp. 3–14. Springer (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Courcelle, B., Durand, I., Raskin, M.: A unified algorithm for colouring graphs of bounded clique-width. (2020)
    Preprint: Link
    Keywords: preprint
    AbstractBibTeXEndNote
  • Blondin, M., Esparza, J., Helfrich, M., Kucera, A., Meyer, P.J.: Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. In: Lahiri, S.K. and Wang, C. (eds.) CAV (2). pp. 372–397. Springer (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Jaax, S., Kiefer, S.: On Affine Reachability Problems In: Esparza, J. and Kr{{á}}l’, D. (eds.) MFCS. pp. 48:1–48:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Blondin, M., Esparza, J., Genest, B., Helfrich, M., Jaax, S.: Succinct Population Protocols for Presburger Arithmetic In: Paul, C. and Bläser, M. (eds.) 37th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2020, March 10-13, 2020, Montpellier, France. pp. 40:1–40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
    URL: Link
    Keywords: conference
    URLBibTeXEndNote
  • Sickert, S., Esparza, J.: An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. pp. 831–844. Association for Computing Machinery, Saarbr{ü}cken, Germany (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Balasubramanian, A.R.: Complexity of controlled bad sequences over finite sets of Nd. In: Hermanns, H., Zhang, L., Kobayashi, N., and Miller, D. (eds.) LICS. pp. 130–140. ACM (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Raskin, M., Weil-Kennedy, C., Esparza, J.: Flatness and Complexity of Immediate Observation Petri Nets 31st International Conference on Concurrency Theory (CONCUR 2020). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote

2019

  • Esparza, J.: Coffee and Cigarettes. In: Reisig, W. and Rozenberg, G. (eds.) Carl Adam Petri: Ideas, Personality, Impact. pp. 97–103. Springer (2019)
    URL: Link
    Keywords: other
    AbstractURLBibTeXEndNote
  • Esparza, J., Raskin, M., Weil-Kennedy, C.: Parameterized Analysis of Immediate Observation Petri Nets. In: Donatelli, S. and Haar, S. (eds.) Petri Nets. pp. 365–385. Springer (2019)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Jaax, S., Kiefer, S.: On Semigroups of Two-Dimensional Upper-Triangular Integer Matrices. CoRR. abs/1905.05114, (2019)
    Preprint: Link
    Keywords: informal
    BibTeXEndNote
  • Blondin, M., Esparza, J., Jaax, S.: Expressive Power of Oblivious Consensus Protocols, http://arxiv.org/abs/1902.01668, (2019)
    URL: Link
    Keywords: informal
    AbstractURLBibTeXEndNote
  • Meyer, P.J., Esparza, J., Offtermatt, P.: Computing the Expected Execution Time of Probabilistic Workflow Nets. In: Vojnar, T. and Zhang, L. (eds.) TACAS (2). pp. 154–171. Springer (2019)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Raskin, M., Welzel, C.: Working with first-order proofs and provers. European Lisp Symposium (2019)
    URL: Link
    Preprint: Link
    Keywords: talk
    URLBibTeXEndNote
  • Raskin, M.: Population protocols with unreliable communication. CoRR. abs/1902.10041, (2019)
    Preprint: Link
    Keywords: informal
    BibTeXEndNote
  • Hansen, K.A., Raskin, M.: A Stay-in-a-Set Game without a Stationary Equilibrium Electronic Proceedings in Theoretical Computer Science. 305, 83–90 (2019)
    URL: Link
    Preprint: Link
    Keywords: conference
    URLBibTeXEndNote
  • Blondin, M., Esparza, J., Jaax, S.: Expressive Power of Broadcast Consensus Protocols In: Fokkink, W. and van Glabbeek, R. (eds.) 30th International Conference on Concurrency Theory (CONCUR 2019). pp. 31:1–31:16. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Berkovits, I., Lazic, M., Losa, G., Padon, O., Shoham, S.: Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics In: Dillig, I. and Tasiran, S. (eds.) Computer Aided Verification - 31st International Conference, {CAV} 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part {II}. pp. 245–266. Springer (2019)
    URL: Link
    Preprint: Link
    Keywords: parameterizedverification
    AbstractURLBibTeXEndNote
  • Bertrand, N., Konnov, I., Lazic, M., Widder, J.: Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries. In: Fokkink, W. and van Glabbeek, R. (eds.) CONCUR. pp. 33:1–33:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
    URL: Link
    Preprint: Link
    Keywords: randomizedconsensus
    AbstractURLBibTeXEndNote
  • Goubault, Éric, Lazic, M., Ledent, J., Rajsbaum, S.: Wait-Free Solvability of Equality Negation Tasks. In: Suomela, J. (ed.) DISC. pp. 21:1–21:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Raskin, M., Simkin, M.: Perfectly Secure Oblivious {RAM} with Sublinear Bandwidth Overhead In: Galbraith, S.D. and Moriai, S. (eds.) Lecture Notes in Computer Science. pp. 537–563. Springer International Publishing (2019)
    URL: Link
    Preprint: Link
    Keywords: journal
    URLBibTeXEndNote
  • Goubault, Éric, Lazic, M., Ledent, J., Rajsbaum, S.: A Dynamic Epistemic Logic Analysis of the Equality Negation Task. In: Barbosa, L.S. and Baltag, A. (eds.) DaLí. pp. 53–70. Springer (2019)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Blondin, M., Haase, C., Mazowiecki, F., Raskin, M.: Affine Extensions of Integer Vector Addition Systems with States (2019)
    Preprint: Link
    Keywords: informal
    AbstractBibTeXEndNote

2018

  • Blondin, M., Esparza, J., Kucera, A.: Automatic Analysis of Expected Termination Time for Population Protocols. In: Schewe, S. and Zhang, L. (eds.) 29th International Conference on Concurrency Theory (CONCUR 2018). pp. 33:1–33:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote
  • Esparza, J., Ganty, P., Majumdar, R., Weil-Kennedy, C.: Verification of Immediate Observation Population Protocols. In: Schewe, S. and Zhang, L. (eds.) 29th International Conference on Concurrency Theory (CONCUR 2018). pp. 31:1–31:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)
    URL: Link
    Preprint: Link
    Keywords: conference
    AbstractURLBibTeXEndNote