About Me
I am a postdoc at the Chair for Foundations of Software Reliability and Theoretical Computer Science at TU Munich, working in the group of Javier Esparza, within the ERCsupported project PaVeS, since June 2019.
Previously, I was a PhD student in the Doctoral College LogiCS, and a project assistant in the FORSYTE group at TU Wien, supervised by Josef Widder and Igor Konnov.
Research Interest
Formal methods, Parameterized Model Checking, Verification and Synthesis of Fault Tolerant Distributed Algorithms, Knowledge and Topology in Distributed Computing
Education

PhD in Computer Science, TU Wien, June 2019
Supervisors: Josef Widder and Igor Konnov
Topic: Reduction Techniques for Parameterized Model Checking and Synthesis of FaultTolerant Distributed Algorithms [pdf]

MSc in Mathematics, University of Novi Sad, September 2012
Supervisor: Rozalija Madaras
Topic: Power Structures and Multialgebras [pdf] (in Serbian)

Bachelor in Mathematics, University of Novi Sad, September 2011
Publications
 Balasubramanian A.R., J. Esparza, M. Lazić: Complexity of Verification and Synthesis of Threshold Automata, accepted to ATVA 2020
 I. Konnov, M. Lazić, I. Stoilkovska, J. Widder: Tutorial: Parameterized Verification with Byzantine Model Checker [pdf], in: Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2020), pages 189207, 2020.
 É. Goubault, M. Lazić, J. Ledent, S. Rajsbaum: A dynamic epistemic logic analysis of the equality negation task [pdf], in: Dynamic Logic. New Trends and Applications  Second International Workshop, DaLí, pages 5370, 2019.
 É. Goubault, M. Lazić, J. Ledent, S. Rajsbaum: Waitfree Solvability of Equality Negation Tasks [pdf], in: 33rd International Symposium on Distributed Computing (DISC 2019), vol. 146 of LIPIcs, pages 21:121:16, 2019.
 N. Bertrand, I. Konnov, M. Lazić, J. Widder: Verification of Randomized Distributed Algorithms under RoundRigid Adversaries [pdf] [preprint+proofs], in: 30th International Conference on Concurrency Theory (CONCUR 2019), volume 140 of LIPIcs, pages 33:133:15, 2019.
 I. Berkovits, M. Lazić, G. Losa, O. Padon, S. Shoham: Verification of ThresholdBased Distributed Algorithms by Decomposition to Decidable Logics [pdf+proofs] [doi], in: Computer Aided Verification (CAV) 2019. Lecture Notes in Computer Science, vol. 11562, pages 245266, 2019.
 C. Drăgoi, M. Lazić, J. Widder: CommunicationClosed Layers as Paradigm for Distributed Systems: A Manifesto [pdf], in: Sinteza, pages 131138, 2018.
 M. Lazić, I. Konnov, J. Widder, R. Bloem: Synthesis of Distributed Algorithms with Parameterized Threshold Guards [pdf], OPODIS, vol. 95 of LIPIcs, pages 32:132:20, 2017.
 I. Konnov, M. Lazić, H. Veith, J. Widder: Para^2: Parameterized Path Reduction, Acceleration, and SMT for Reachability in ThresholdGuarded Distributed Algorithms [pdf], in: Formal Methods in System Design, Springer, 2017.
 I. Konnov, M. Lazić, H. Veith, J. Widder: A Short Counterexample Property for Safety and Liveness Verification of Faulttolerant Distributed Algorithms [pdf] [preprint+proofs] in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 1820, 2017, pages 719734, 2017.
 E. Aichinger, M. Lazić, N. Mudrinski, Finite generation of congruence preserving functions [pdf] [doi], in: Monatshefte für Mathematik, volume 181, pages 35–62, 2016.