Download full bibliography (as BibTex): PaVeS publications

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


2020

  • Irène Durand, B.C., Raskin, M.: On defining linear orders by automata. Moscow Journal of Combinatorics and Number Theory. (2020)
    automata expressivepower myown
    BibTeX EndNote URL
  • 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)
    gametheory myown safety

    URL: Link
    Abstract BibTeX EndNote URL
  • 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)
    myown populationprotocols succinct synthesis

    URL: Link
    Abstract BibTeX EndNote URL
  • Blondin, M., Raskin, M.A.: The Complexity of Reachability in Affine Vector Addition Systems with States. Logic in Computer Science (2020)
    affinevass complexity myown reachability

    URL: Link
    Abstract BibTeX EndNote URL

2019

  • Blondin, M., Esparza, J., Jaax, S.: Expressive Power of Broadcast Consensus Protocols. In: Fokkink, W. and van Glabbeek, R. (eds.) The 30th International Conference on Concurrency Theory Amsterdam, the Netherlands, August 26-31, 2019 (2019)
    broadcast complexity protocols,
    BibTeX EndNote URL
  • Jaax, S., Kiefer, S.: On Semigroups of Two-Dimensional Upper-Triangular Integer Matrices. CoRR. abs/1905.05114, (2019)
    groups matrix reachability, semi

    URL: Link
    BibTeX EndNote URL
  • 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)
    immediateobservation populationprotocols

    URL: Link
    BibTeX EndNote URL
  • Blondin, M., Esparza, J., Jaax, S.: Expressive Power of Oblivious Consensus Protocols, http://arxiv.org/abs/1902.01668, (2019)
    broadcast population protocols protocols,

    (cite arxiv:1902.01668)

    URL: Link
    Abstract BibTeX EndNote URL
  • 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)
    expectedterminationtime petrinets

    URL: Link
    BibTeX EndNote URL
  • Raskin, M., Welzel, C.: Working with first-order proofs and provers. European Lisp Symposium (2019)
    automatedtheoremprovers firstorderlogic interactiveproofsystems

    URL: Link
    BibTeX EndNote URL
  • Raskin, M.: Population protocols with unreliable communication. CoRR. abs/1902.10041, (2019)
    broadcastprotocols faulttolerance populationprotocols

    URL: Link
    BibTeX EndNote URL
  • Esparza, J.: Coffee and Cigarettes. In: Reisig, W. and Rozenberg, G. (eds.) Carl Adam Petri: Ideas, Personality, Impact. pp. 97-103. Springer (2019)
    petrinets

    URL: Link
    BibTeX EndNote URL
  • Luttenberger, M., Meyer, P.J., Sickert, S.: Practical Synthesis of Reactive Systems from LTL Specifications via Parity Games. CoRR. abs/1903.12576, (2019)
    synthesis

    (To appear at Acta Informatica)

    URL: Link
    BibTeX EndNote URL
  • 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. p. 245--266. Springer (2019)
    distributedalgorithms myown parameterizedverification

    URL: Link
    BibTeX EndNote URL
  • Blondin, M., Esparza, J., Genest, B., Helfrich, M., Jaax, S.: Succinct Population Protocols for Presburger Arithmetic, http://arxiv.org/abs/1910.04600, (2019)
    distributedalgorithms populationprotocols

    URL: Link
    Abstract BibTeX EndNote URL
  • 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)
    distributedalgorithms myown parametrizedverification randomizedconsensus

    URL: Link
    BibTeX EndNote URL
  • Goubault, É., 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)
    myown

    URL: Link
    BibTeX EndNote URL
  • Goubault, E., Lazic, M., Ledent, J., Rajsbaum, S.: A dynamic epistemic logic analysis of the equality negation task. CoRR. abs/1909.03263, (2019)
    myown

    (To appear at DaLi 2019)

    URL: Link
    BibTeX EndNote URL
  • 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. p. 537--563. Springer International Publishing (2019)
    cryptography myown protocols security

    URL: Link
    BibTeX EndNote URL
  • 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)
    gametheory myown safetyconditions verification

    URL: Link
    BibTeX EndNote URL

2018

  • Bertrand, N., Konnov, I., Lazic, M., Widder, J.: Verification of Randomized Distributed Algorithms under Round-Rigid Adversaries. HAL. hal-01925533, (2018)
    ParametrizedVerification distributedalgorithms

    (To appear at CONCUR 2019)

    URL: Link
    BibTeX EndNote URL
  • 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)
    ExpectedTerminationTime PerformanceAnalysis PopulationProtocols

    URL: Link
    Abstract BibTeX EndNote URL
  • 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)
    ImmediateObservation ParametrizedVerification PopulationProtocols

    URL: Link
    Abstract BibTeX EndNote URL