Marijana Lazić

I graduated in June 2019, and since then I work as a postdoc at TU Munich with Javier Esparza. Check out my new web page here.

 

Address:
Marijana Lazić
Technische Universität Wien
Institut für Logic and Computation 192/4
Favoritenstraße 9–11
1040 Wien
Austria

Room: HA 03 05 (how to get there)
Phone: +43 (1) 58801 – 740 077
Email: ta.etysrofnull@cizal
Web: http://forsyte.at/~lazic/

© Sara Meister

Research Interests

  • Formal methods, Parameterized Model Checking, Verification and Synthesis of Fault Tolerant Distributed Algorithms, Knowledge and Topology in Distributed Computing

 

Current Position

 

Research Visits

  • Oct. 2016—Dec. 2016: Prakash Panangaden and Vijay D’Silva, Simons Institute for the Theory of Computing, University of California, Berkeley
  • Jun. 2017—Jul. 2017 and Nov. 2017—Dec. 2017: Yoram Moses, Technion, Israel Institute of Technology, Haifa, Israel

 

Publications

2018
[6] Verification of Randomized Distributed Algorithms under Round-Rigid Adversaries
Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder
HAL, volume hal-01925533, Nov 2018.
[bibtex] [pdf]
[5] Communication-Closed Layers as Paradigm for Distributed Systems: A Manifesto
Cezara Dragoi, Marijana Lazic, Josef Widder
Sinteza, pages 131-138, 2018.
[bibtex] [pdf]
2017
[4] Synthesis of Distributed Algorithms with Parameterized Threshold Guards
Marijana Lazic, Igor Konnov, Josef Widder, Roderick Bloem
OPODIS, volume 95 of LIPIcs, pages 32:1-32:20, 2017.
[bibtex] [pdf]
[3] A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
Igor V. Konnov, Marijana Lazic, Helmut Veith, Josef Widder
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017, pages 719-734, 2017.
Note: A pre-print including the proofs is available at http://arxiv.org/abs/1608.05327
[bibtex] [pdf]
[2] Para^2: Parameterized Path Reduction, Acceleration, and SMT for Reachability in Threshold-Guarded Distributed Algorithms
Igor Konnov, Marijana Lazic, Helmut Veith, Josef Widder
Formal Methods in System Design, volume 51, number 2, pages 270-307, 2017, Springer.
[bibtex] [pdf]
2016
[1] A Short Counterexample Property for Safety and Liveness Verification of Fault-Tolerant Distributed Algorithms
Igor Konnov, Marijana Lazic, Helmut Veith, Josef Widder
arXiv/CoRR, volume 1608.05327, 2016.
Note: (accepted to POPL 2017)
[bibtex] [pdf]

 

Master thesis & Previous publications

Latest News

Helmut Veith Stipend

The first recipient of the Helmut Veith Stipend for excellent female master’s students in computer science will be presented on March 14 at the following event: "More female students in computer science. Who cares?" Panel discussion with renowned scientists about diversity in STEM Studies March 14, 5:30pm, TU Wien The Helmut Veith Stipend is dedicated […]

Continue reading

WAIT 2016 in Vienna

The third WAIT workshop on induction is held between 17-18 November at the TU Wien. Details are available on the workshop page.

Continue reading

Two papers at POPL’17

Two papers co-authored by researchers from our group have been accepted for POPL’17: “Coming to Terms with Quantified Reasoning” by Simon Robillard, Andrei Voronkov, and Laura Kovacs; and “A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms” by Igor Konnov, Marijana Lazic, Helmut Veith, and Josef Widder

Continue reading

Helmut Veith Stipend

Outstanding female students in the field of computer science who pursue (or plan to pursue) one of the master‘s programs in Computer Science at TU Wien taught in English are invited to apply for the Helmut Veith Stipend

Continue reading

Full news archive